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: connected domination number</title> <meta name="description" content="Search results for: connected domination number"> <meta name="keywords" content="connected domination number"> <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="connected domination number" 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="connected domination number"> <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> 11398</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: connected domination number</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">11398</span> Domination Parameters of Middle Graphs: Connected and Outer-Connected Perspectives</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Behnaz%20Pahlousay">Behnaz Pahlousay</a>, <a href="https://publications.waset.org/abstracts/search?q=Farshad%20Kazemnejad"> Farshad Kazemnejad</a>, <a href="https://publications.waset.org/abstracts/search?q=Elisa%20Palezzato"> Elisa Palezzato</a>, <a href="https://publications.waset.org/abstracts/search?q=Michele%20Torielli"> Michele Torielli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we study the notions of connected domination number and of outer-connected domination number for middle graphs. Indeed, we obtain tight bounds for these numbers in terms of the order of the middle graph M(G). We also compute the outer-connected domination number of some families of graphs such as star graphs, cycle graphs, wheel graphs, complete graphs, complete bipartite graphs and some operation on graphs, explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the outer-connected domination number of middle graphs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=connected%20domination%20number" title="connected domination number">connected domination number</a>, <a href="https://publications.waset.org/abstracts/search?q=outer-connected%20dom-%20ination%20number" title=" outer-connected dom- ination number"> outer-connected dom- ination number</a>, <a href="https://publications.waset.org/abstracts/search?q=domination%20number" title=" domination number"> domination number</a>, <a href="https://publications.waset.org/abstracts/search?q=middle%20graph" title=" middle graph"> middle graph</a>, <a href="https://publications.waset.org/abstracts/search?q=nordhaus-%20gaddum-like%20relation." title=" nordhaus- gaddum-like relation."> nordhaus- gaddum-like relation.</a> </p> <a href="https://publications.waset.org/abstracts/189196/domination-parameters-of-middle-graphs-connected-and-outer-connected-perspectives" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/189196.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">38</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">11397</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">11396</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">11395</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">11394</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">11393</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">11392</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">11391</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">11390</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">11389</span> Towards an Adornian Critical Theory of the Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dominic%20Roulx">Dominic Roulx</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Many scholars have in the past decade emphasized the relevance of Adorno’s criticism of the rationalized domination of nature (Naturbeherrschung) for thinking the environmental crisis. Beyond the intersubjective critical models of thinkers such as Habermas and Honneth, Adorno’s critical theory has the benefit, according to them, of disclosing the entwinement of social and natural domination in a critically productive way. The author will be arguing in this paper that Adorno’s model of critical theory displays a theoretical framework that is both original and relevant for thinking the ins and outs of the currentenvironmental crisis. To do so, he first construe Adorno’s understanding of the historical domination of nature and argue that Adorno’s method for its criticizing is immanent critique. He puts emphasis on how his understanding of the domination of nature implicitly implies an account of thedialectical relationship between reason and nature. In doing so, he presents a naturalistic understanding of his idea of the primacy of the object. Second, regarding Adorno’s concept of nature, he discusses what he sees as the shortcomings of many commentators’ understanding of the concept of nature in Adorno. He contends that they tend to fall short of Adorno’s concept of nature in failing to make sense of its thoroughly negative signification, thereby falling into an uncritical and fetichized comprehension of “nature. Third, he discusses the prospect for a possible “reconciliation” (Versöhnung) of nature with society. Highlighting how the domination of nature proves to produce the necessary conditions for its own overcoming, he contends that reconciliation with nature relies mainly on the subject’s capacity for critical self-reflection. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=german%20philosophy" title="german philosophy">german philosophy</a>, <a href="https://publications.waset.org/abstracts/search?q=adorno" title=" adorno"> adorno</a>, <a href="https://publications.waset.org/abstracts/search?q=nature" title=" nature"> nature</a>, <a href="https://publications.waset.org/abstracts/search?q=environmental%20crisis" title=" environmental crisis"> environmental crisis</a> </p> <a href="https://publications.waset.org/abstracts/154918/towards-an-adornian-critical-theory-of-the-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/154918.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">97</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">11388</span> Negation of Insinuation Rule on the Ideas of Imam Khomeini (RA)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seyed%20Jafar%20Hosseini">Seyed Jafar Hosseini</a>, <a href="https://publications.waset.org/abstracts/search?q=Rahim%20Vakilzadeh"> Rahim Vakilzadeh</a>, <a href="https://publications.waset.org/abstracts/search?q=Hassan%20Movassagi"> Hassan Movassagi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> ‘Negation of insinuation’ or ‘negation of dominance’ Rule is considered as one of the most important principles governing the policies and external relations of Islamic and religious countries. The stable and influential role which this rule puts on the behavior and policies of the Islamic religion and foreign policies of Islamic countries shows the importance of the presented topic. Among Islamic scholars, Imam Khomeini (RA) has been paid most attention to this rule on governing issues. In the present study, we are going to investigate the nature and dimensions of Negation of insinuation rule in Imam Khomeini's ideas with an analytical and descriptive method. The obtained results show that Negation of insinuation rule is an effective and main guidance in Imam's thoughts and behavior. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=negation%20of%20insinuation%20Rule" title="negation of insinuation Rule">negation of insinuation Rule</a>, <a href="https://publications.waset.org/abstracts/search?q=Imam%20Khomeini%20%28RA%29" title=" Imam Khomeini (RA)"> Imam Khomeini (RA)</a>, <a href="https://publications.waset.org/abstracts/search?q=cultural%20domination" title=" cultural domination"> cultural domination</a>, <a href="https://publications.waset.org/abstracts/search?q=political%20domination" title=" political domination"> political domination</a>, <a href="https://publications.waset.org/abstracts/search?q=economic%20domination" title=" economic domination"> economic domination</a> </p> <a href="https://publications.waset.org/abstracts/64580/negation-of-insinuation-rule-on-the-ideas-of-imam-khomeini-ra" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/64580.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">318</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">11387</span> Grid-Connected Photovoltaic System: System Overview and Sizing Principles</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Najiya%20Omar">Najiya Omar</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamed%20Aly"> Hamed Aly</a>, <a href="https://publications.waset.org/abstracts/search?q=Timothy%20Little"> Timothy Little</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The optimal size of a photovoltaic (PV) array is considered a critical factor in designing an efficient PV system due to the dependence of the PV cell performance on temperature. A high temperature can lead to voltage losses of solar panels, whereas a low temperature can cause voltage overproduction. There are two possible scenarios of the inverter’s operation in which they are associated with the erroneous calculations of the number of PV panels: 1) If the number of the panels is scant and the temperature is high, the minimum voltage required to operate the inverter will not be reached. As a result, the inverter will shut down. 2) Comparably, if the number of panels is excessive and the temperature is low, the produced voltage will be more than the maximum limit of the inverter which can cause the inverter to get disconnected or even damaged. This article aims to assess theoretical and practical methodologies to calculate size and determine the topology of a PV array. The results are validated by applying an experimental evaluation for a 100 kW Grid-connected PV system for a location in Halifax, Nova Scotia and achieving a satisfactory system performance compared to the previous work done. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=sizing%20PV%20panels" title="sizing PV panels">sizing PV panels</a>, <a href="https://publications.waset.org/abstracts/search?q=theoretical%20and%20practical%20methodologies" title=" theoretical and practical methodologies"> theoretical and practical methodologies</a>, <a href="https://publications.waset.org/abstracts/search?q=topology%20of%20PV%20array" title=" topology of PV array"> topology of PV array</a>, <a href="https://publications.waset.org/abstracts/search?q=grid-connected%20PV" title=" grid-connected PV"> grid-connected PV</a> </p> <a href="https://publications.waset.org/abstracts/130722/grid-connected-photovoltaic-system-system-overview-and-sizing-principles" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/130722.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">365</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">11386</span> Design and Implementation of Grid-Connected Photovoltaic Inverter</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=B.%20H.%20Lee">B. H. Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, a grid-connected photovoltaic (PV) inverter is adopted in various places like as home, factory, because grid-connected PV inverter can reduce total power consumption by supplying electricity from PV array. In this paper, design and implementation of a 300 W grid-connected PV inverter are described. It is implemented with TI Piccolo DSP core and operated at 100 kHz switching frequency in order to reduce harmonic contents. The maximum operating input voltage is up to 45 V. The characteristics of the designed system that include maximum power point tracking (MPPT), single operation and battery charging are verified by simulation and experimental results. <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=grid-connected" title=" grid-connected"> grid-connected</a>, <a href="https://publications.waset.org/abstracts/search?q=implementation" title=" implementation"> implementation</a>, <a href="https://publications.waset.org/abstracts/search?q=photovoltaic" title=" photovoltaic"> photovoltaic</a> </p> <a href="https://publications.waset.org/abstracts/87902/design-and-implementation-of-grid-connected-photovoltaic-inverter" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/87902.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">420</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">11385</span> Definition of Quality Indicators for Damascus Rose Oil (Rosa damascena) Flora of Morocco</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Serebryanaya%20Fatima">Serebryanaya Fatima</a>, <a href="https://publications.waset.org/abstracts/search?q=Essaih%20Hind"> Essaih Hind</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Rosa damascena (Rosa damascena Mill.) is an interesting medicinal plant; it is famous in different countries and has medicinal use in many cultures. The main groups of pharmacological actions of rose oil are connected with anti-inflammatory, antifungal activity, also antioxidant and antibacterial, and antiparasitic properties. We have prepared the quality indicators analysis of the Damascus rose oil. An iodine number, acid number, and oil peroxide number were determined. The following indicators of the quality of rose oil have been studied. The determination was carried out according to the pharmacopoeic methods of analysis of essential oils, the definition of peroxide number (1,971%), iodine number (3,365%), and acid number (0,0526%). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rosa%20damascene" title="Rosa damascene">Rosa damascene</a>, <a href="https://publications.waset.org/abstracts/search?q=Rosa%20damascena%20Mill." title=" Rosa damascena Mill."> Rosa damascena Mill.</a>, <a href="https://publications.waset.org/abstracts/search?q=iodine%20number" title=" iodine number"> iodine number</a>, <a href="https://publications.waset.org/abstracts/search?q=acid%20number" title=" acid number"> acid number</a>, <a href="https://publications.waset.org/abstracts/search?q=oil%20peroxide%20number" title=" oil peroxide number"> oil peroxide number</a> </p> <a href="https://publications.waset.org/abstracts/159900/definition-of-quality-indicators-for-damascus-rose-oil-rosa-damascena-flora-of-morocco" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/159900.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">87</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">11384</span> Language and Political Manipulation: A Critical Analysis of Okediran's Tenants of the House</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Moses%20Joseph">Moses Joseph</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Language is a veritable tool in the hands of politicians. They use it to shape social realities; create new meanings and ultimately to acquire, exercise and sustain power in the society. Language and politics both share a symbiotic relationship. The former is the medium through which members of the society communicate and cohabitate while the later is used to gain and exercise power in the society. Language therefore is the epicenter of every human activity and politicians explore, deploy and manipulate it to advance their personal interests. This paper examines the ideological use of language in Okediran’s Tenants of the House. The study further shows that language is used as an instrument of political domination and manipulation through the display of emotiveness. The study concludes that politicians do not innocently use language but deliberately employ them to foreground their ideological position. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=language" title="language">language</a>, <a href="https://publications.waset.org/abstracts/search?q=ideology" title=" ideology"> ideology</a>, <a href="https://publications.waset.org/abstracts/search?q=political%20domination" title=" political domination"> political domination</a>, <a href="https://publications.waset.org/abstracts/search?q=manipulation" title=" manipulation"> manipulation</a> </p> <a href="https://publications.waset.org/abstracts/75474/language-and-political-manipulation-a-critical-analysis-of-okedirans-tenants-of-the-house" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/75474.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">11383</span> Antenna for Energy Harvesting in Wireless Connected Objects</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nizar%20Sakli">Nizar Sakli</a>, <a href="https://publications.waset.org/abstracts/search?q=Chayma%20Bahar"> Chayma Bahar</a>, <a href="https://publications.waset.org/abstracts/search?q=Chokri%20Baccouch"> Chokri Baccouch</a>, <a href="https://publications.waset.org/abstracts/search?q=Hedi%20Sakli"> Hedi Sakli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> If connected objects multiply, they are becoming a challenge in more than one way. In particular by their consumption and their supply of electricity. A large part of the new generations of connected objects will only be able to develop if it is possible to make them entirely autonomous in terms of energy. Some manufacturers are therefore developing products capable of recovering energy from their environment. Vital solutions in certain contexts, such as the medical industry. Energy recovery from the environment is a reliable solution to solve the problem of powering wireless connected objects. This paper presents and study a optically transparent solar patch antenna in frequency band of 2.4 GHz for connected objects in the future standard 5G for energy harvesting and RF transmission. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=antenna" title="antenna">antenna</a>, <a href="https://publications.waset.org/abstracts/search?q=IoT" title=" IoT"> IoT</a>, <a href="https://publications.waset.org/abstracts/search?q=solar%20cell" title=" solar cell"> solar cell</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20communications" title=" wireless communications"> wireless communications</a> </p> <a href="https://publications.waset.org/abstracts/129453/antenna-for-energy-harvesting-in-wireless-connected-objects" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/129453.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">168</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">11382</span> Under the Veneer of Words Lies Power: Foucauldian Analysis of Oleanna</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Diba%20Arjmandi">Diba Arjmandi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The notion of power and gender domination is one of the inseparable aspects of themes in postmodern literature. The reason of its importance has been discussed frequently since the rise of Michel Foucault and his vantage point toward the circulation of power and the transgression of forces. The language and society act as the basic grounds for the study, as all human beings are bound to the set of rules and norms which shape them in the acceptable way in the macrocosm. How different genders in different positions behave and show reactions to the provocation of social forces and superiority of one another, is of great interest to writers and literary critics. Mamet’s works are noticeable for their controversial but timely themes which illustrate the human conflict with the community and greed for power. Many critics like Christopher Bigsby and Harold Bloom have been discussing Mamet and his ideas during recent years. This paper is the study of Oleanna, Mamet’s masterpiece about teacher-student relationship and the circulation of power between a man and woman. He shows the very breakable boundaries in domination of a gender and the downfall of speech as the consequence of transgression and freedom. The failure of the language the teacher uses and the abuses of his own words by a student who seeks superiority and knowledge are the main subjects of discussion. Supported by the ideas of Foucault, the language Mamet uses to represent his characters becomes the fundamental element of this survey. As a result, language becomes both the means of achievement and also downfall. <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=foucault" title=" foucault"> foucault</a>, <a href="https://publications.waset.org/abstracts/search?q=language" title=" language"> language</a>, <a href="https://publications.waset.org/abstracts/search?q=mamet" title=" mamet"> mamet</a>, <a href="https://publications.waset.org/abstracts/search?q=oleanna" title=" oleanna"> oleanna</a>, <a href="https://publications.waset.org/abstracts/search?q=power" title=" power"> power</a>, <a href="https://publications.waset.org/abstracts/search?q=transgression" title=" transgression"> transgression</a> </p> <a href="https://publications.waset.org/abstracts/24942/under-the-veneer-of-words-lies-power-foucauldian-analysis-of-oleanna" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24942.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">485</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">11381</span> Identity Crisis and Class Difference in Charles Dickens' 'Great Expectations'</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ramin%20Barati">Ramin Barati</a>, <a href="https://publications.waset.org/abstracts/search?q=Atefeh%20Salemi"> Atefeh Salemi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In Victorian era, the society had been surrounded by extreme class ranking in order to identify the people of the classes and to intensify power relationships due to the growth of industry in Charles Dickens's (1812-1870) Great Expectations (2003) in which he illustrates the clash and dichotomy in the 19th century London. The classes in Victorian period have socially divided the population into two parts, the lower and the upper class of the community. In such a panopticon society, the major character Pip was the best example of the working class who was under the domination of violence, malice, and abuse of Miss Havisham as a member of the ruling class in order to take revenge on her failures. The conflict and disunity represented in vindictiveness and the sense of revenge applied by Miss Havisham against his victim Pip, made him experience alienation and eventually suffer from identity crisis. This paper considers New Historicism based on the theories of the French critic Michel Foucault (1926-1984). The social concept, panopticism, was called after the panopticon society, basically elaborated by Foucault in his book Discipline and Punish (1975) and he considers the panopticon as a sign of punitive community of surveillance. This paper evaluates the problems of a dual society to show that the people of the lower class are under the domination of capitalist society. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=class" title="class">class</a>, <a href="https://publications.waset.org/abstracts/search?q=identity%20crisis" title=" identity crisis"> identity crisis</a>, <a href="https://publications.waset.org/abstracts/search?q=violence" title=" violence"> violence</a>, <a href="https://publications.waset.org/abstracts/search?q=panoptic%20society" title=" panoptic society"> panoptic society</a>, <a href="https://publications.waset.org/abstracts/search?q=domination" title=" domination"> domination</a> </p> <a href="https://publications.waset.org/abstracts/97813/identity-crisis-and-class-difference-in-charles-dickens-great-expectations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/97813.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">239</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">11380</span> Some New Bounds for a Real Power of the Normalized Laplacian Eigenvalues</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ay%C5%9Fe%20Dilek%20Maden">Ayşe Dilek Maden</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For a given a simple connected graph, we present some new bounds via a new approach for a special topological index given by the sum of the real number power of the non-zero normalized Laplacian eigenvalues. To use this approach presents an advantage not only to derive old and new bounds on this topic but also gives an idea how some previous results in similar area can be developed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=degree%20Kirchhoff%20index" title="degree Kirchhoff index">degree Kirchhoff index</a>, <a href="https://publications.waset.org/abstracts/search?q=normalized%20Laplacian%20eigenvalue" title=" normalized Laplacian eigenvalue"> normalized Laplacian eigenvalue</a>, <a href="https://publications.waset.org/abstracts/search?q=spanning%20tree" title=" spanning tree"> spanning tree</a>, <a href="https://publications.waset.org/abstracts/search?q=simple%20connected%20graph" title=" simple connected graph"> simple connected graph</a> </p> <a href="https://publications.waset.org/abstracts/13999/some-new-bounds-for-a-real-power-of-the-normalized-laplacian-eigenvalues" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13999.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">366</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">11379</span> Permanent Magnet Generator – One Phase Regime Operation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pawel%20Pistelok">Pawel Pistelok</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The article presents the concept of an electromagnetic circuit of a 3-phase surface-mounted permanent magnet generator designed for a single phase operation. A cross section of electromagnetic circuit and a field-circuit model of generator used for computations are shown. The paper presents comparative analysis of simulation results obtained for two different versions of generator regarding construction of armature winding. In the first version of generator the voltages generated in each of three winding phases have different rms values (different number of turns in each of phases), three winding phases are connected in series and one phase load is connected to the two output terminals of generator. The second version of generator is very similar, i.e. three winding phases are connected in series and one phase load is powered by generator, but in this version the voltages generated in each of winding phases have exactly the same rms values (the same number of turns in each of phases). The time waveforms of voltages, currents and electromagnetic torques in the airgaps of two machine versions for rated power are shown. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=permanent%20magnet%20generator" title="permanent magnet generator">permanent magnet generator</a>, <a href="https://publications.waset.org/abstracts/search?q=permanent%20magnets" title=" permanent magnets"> permanent magnets</a>, <a href="https://publications.waset.org/abstracts/search?q=synchronous%20generator" title=" synchronous generator"> synchronous generator</a>, <a href="https://publications.waset.org/abstracts/search?q=vibration" title=" vibration"> vibration</a>, <a href="https://publications.waset.org/abstracts/search?q=course%20of%20torque" title=" course of torque"> course of torque</a>, <a href="https://publications.waset.org/abstracts/search?q=single%20phase%20work" title=" single phase work"> single phase work</a>, <a href="https://publications.waset.org/abstracts/search?q=unsymmetrical%20operation%20point" title=" unsymmetrical operation point"> unsymmetrical operation point</a>, <a href="https://publications.waset.org/abstracts/search?q=serial%20connection%20of%20winding%20phase" title=" serial connection of winding phase"> serial connection of winding phase</a> </p> <a href="https://publications.waset.org/abstracts/29809/permanent-magnet-generator-one-phase-regime-operation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29809.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">695</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">11378</span> A Comparative Study of Series-Connected Two-Motor Drive Fed by a Single Inverter</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Djahbar">A. Djahbar</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Bounadja"> E. Bounadja</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Zegaoui"> A. Zegaoui</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Allouache"> H. Allouache</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, vector control of a series-connected two-machine drive system fed by a single inverter (CSI/VSI) is presented. The two stator windings of both machines are connected in series while the rotors may be connected to different loads, are called series-connected two-machine drive. Appropriate phase transposition is introduced while connecting the series stator winding to obtain decoupled control the two-machines. The dynamic decoupling of each machine from the group is obtained using the vector control algorithm. The independent control is demonstrated by analyzing the characteristics of torque and speed of each machine obtained via simulation under vector control scheme. The viability of the control techniques is proved using analytically and simulation approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=drives" title="drives">drives</a>, <a href="https://publications.waset.org/abstracts/search?q=inverter" title=" inverter"> inverter</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-phase%20induction%20machine" title=" multi-phase induction machine"> multi-phase induction machine</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20control" title=" vector control"> vector control</a> </p> <a href="https://publications.waset.org/abstracts/42943/a-comparative-study-of-series-connected-two-motor-drive-fed-by-a-single-inverter" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42943.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">11377</span> Performance Assessment of PV Based Grid Connected Solar Plant with Varying Load Conditions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kusum%20Tharani">Kusum Tharani</a>, <a href="https://publications.waset.org/abstracts/search?q=Ratna%20Dahiya"> Ratna Dahiya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper aims to analyze the power flow of a grid connected 100-kW Photovoltaic(PV) array connected to a 25-kV grid via a DC-DC boost converter and a three-phase three-level Voltage Source Converter (VSC). Maximum Power Point Tracking (MPPT) is implemented in the boost converter bymeans of a Simulink model using the 'Perturb & Observe' technique. First, related papers and technological reports were extensively studied and analyzed. Accordingly, the system is tested under various loading conditions. Power flow analysis is done using the Newton-Raphson method in Matlab environment. Finally, the system is subject to Single Line to Ground Fault and Three Phase short circuit. The results are simulated under the grid-connected operating model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=grid%20connected%20PV%20Array" title="grid connected PV Array">grid connected PV Array</a>, <a href="https://publications.waset.org/abstracts/search?q=Newton-Raphson%20Method" title=" Newton-Raphson Method"> Newton-Raphson Method</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20flow%20analysis" title=" power flow analysis"> power flow analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=three%20phase%20fault" title=" three phase fault"> three phase fault</a> </p> <a href="https://publications.waset.org/abstracts/19879/performance-assessment-of-pv-based-grid-connected-solar-plant-with-varying-load-conditions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19879.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">553</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">11376</span> VANETs: Security Challenges and Future Directions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jared%20Oluoch">Jared Oluoch</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Connected vehicles are equipped with wireless sensors that aid in Vehicle to Vehicle (V2V) and Vehicle to Infrastructure (V2I) communication. These vehicles will in the near future provide road safety, improve transport efficiency, and reduce traffic congestion. One of the challenges for connected vehicles is how to ensure that information sent across the network is secure. If security of the network is not guaranteed, several attacks can occur, thereby compromising the robustness, reliability, and efficiency of the network. This paper discusses existing security mechanisms and unique properties of connected vehicles. The methodology employed in this work is exploratory. The paper reviews existing security solutions for connected vehicles. More concretely, it discusses various cryptographic mechanisms available, and suggests areas of improvement. The study proposes a combination of symmetric key encryption and public key cryptography to improve security. The study further proposes message aggregation as a technique to overcome message redundancy. This paper offers a comprehensive overview of connected vehicles technology, its applications, its security mechanisms, open challenges, and potential areas of future research. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=VANET" title="VANET">VANET</a>, <a href="https://publications.waset.org/abstracts/search?q=connected%20vehicles" title=" connected vehicles"> connected vehicles</a>, <a href="https://publications.waset.org/abstracts/search?q=802.11p" title=" 802.11p"> 802.11p</a>, <a href="https://publications.waset.org/abstracts/search?q=WAVE" title=" WAVE"> WAVE</a>, <a href="https://publications.waset.org/abstracts/search?q=DSRC" title=" DSRC"> DSRC</a>, <a href="https://publications.waset.org/abstracts/search?q=trust" title=" trust"> trust</a>, <a href="https://publications.waset.org/abstracts/search?q=security" title=" security"> security</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a> </p> <a href="https://publications.waset.org/abstracts/38091/vanets-security-challenges-and-future-directions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/38091.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">312</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">11375</span> Automatic Number Plate Recognition System Based on Deep Learning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=T.%20Damak">T. Damak</a>, <a href="https://publications.waset.org/abstracts/search?q=O.%20Kriaa"> O. Kriaa</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Baccar"> A. Baccar</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20A.%20Ben%20Ayed"> M. A. Ben Ayed</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Masmoudi"> N. Masmoudi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the last few years, Automatic Number Plate Recognition (ANPR) systems have become widely used in the safety, the security, and the commercial aspects. Forethought, several methods and techniques are computing to achieve the better levels in terms of accuracy and real time execution. This paper proposed a computer vision algorithm of Number Plate Localization (NPL) and Characters Segmentation (CS). In addition, it proposed an improved method in Optical Character Recognition (OCR) based on Deep Learning (DL) techniques. In order to identify the number of detected plate after NPL and CS steps, the Convolutional Neural Network (CNN) algorithm is proposed. A DL model is developed using four convolution layers, two layers of Maxpooling, and six layers of fully connected. The model was trained by number image database on the Jetson TX2 NVIDIA target. The accuracy result has achieved 95.84%. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ANPR" title="ANPR">ANPR</a>, <a href="https://publications.waset.org/abstracts/search?q=CS" title=" CS"> CS</a>, <a href="https://publications.waset.org/abstracts/search?q=CNN" title=" CNN"> CNN</a>, <a href="https://publications.waset.org/abstracts/search?q=deep%20learning" title=" deep learning"> deep learning</a>, <a href="https://publications.waset.org/abstracts/search?q=NPL" title=" NPL"> NPL</a> </p> <a href="https://publications.waset.org/abstracts/108706/automatic-number-plate-recognition-system-based-on-deep-learning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/108706.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">306</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">11374</span> Single Phase Fluid Flow in Series of Microchannel Connected via Converging-Diverging Section with or without Throat</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abhishek%20Kumar%20Chandra">Abhishek Kumar Chandra</a>, <a href="https://publications.waset.org/abstracts/search?q=Kaushal%20Kishor"> Kaushal Kishor</a>, <a href="https://publications.waset.org/abstracts/search?q=Wasim%20Khan"> Wasim Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Dhananjay%20Singh"> Dhananjay Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20S.%20Alam"> M. S. Alam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Single phase fluid flow through series of uniform microchannels connected via transition section (converging-diverging section with or without throat) was analytically and numerically studied to characterize the flow within the channel and in the transition sections. Three sets of microchannels of diameters 100, 184, and 249 μm were considered for investigation. Each set contains 10 numbers of microchannels of length 20 mm, connected to each other in series via transition sections. Transition section consists of either converging-diverging section with throat or without throat. The effect of non-uniformity in microchannels on pressure drop was determined by passing water/air through the set of channels for Reynolds number 50 to 1000. Compressibility and rarefaction effects in transition sections were also tested analytically and numerically for air flow. The analytical and numerical results show that these configurations can be used in enhancement of transport processes. However, converging-diverging section without throat shows superior performance over with throat configuration. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=contraction-expansion%20flow" title="contraction-expansion flow">contraction-expansion flow</a>, <a href="https://publications.waset.org/abstracts/search?q=integrated%20microchannel" title=" integrated microchannel"> integrated microchannel</a>, <a href="https://publications.waset.org/abstracts/search?q=microchannel%20network" title=" microchannel network"> microchannel network</a>, <a href="https://publications.waset.org/abstracts/search?q=single%20phase%20flow" title=" single phase flow"> single phase flow</a> </p> <a href="https://publications.waset.org/abstracts/75976/single-phase-fluid-flow-in-series-of-microchannel-connected-via-converging-diverging-section-with-or-without-throat" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/75976.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">280</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">11373</span> Implementation of a Novel Modified Multilevel Inverter Topology for Grid Connected PV System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dhivya%20Balakrishnan">Dhivya Balakrishnan</a>, <a href="https://publications.waset.org/abstracts/search?q=Dhamodharan%20Shanmugam"> Dhamodharan Shanmugam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Multilevel converters offer high power capability, associated with lower output harmonics and lower commutation losses. Their main disadvantage is their complexity requiring a great number of power devices and passive components, and a rather complex control circuitry. This paper proposes a single-phase seven-level inverter for grid connected PV systems, With a novel pulse width-modulated (PWM) control scheme. Three reference signals that are identical to each other with an offset that is equivalent to the amplitude of the triangular carrier signal were used to generate the PWM signals. The inverter is capable of producing seven levels of output-voltage levels from the dc supply voltage. This paper proposes a new multilevel inverter topology using an H-bridge output stage with two bidirectional auxiliary switches. The new topology produces a significant reduction in the number of power devices and capacitors required to implement a multilevel output using the asymmetric cascade configuration. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=asymmetric%20cascade%20configuration" title="asymmetric cascade configuration">asymmetric cascade configuration</a>, <a href="https://publications.waset.org/abstracts/search?q=H-Bridge" title=" H-Bridge"> H-Bridge</a>, <a href="https://publications.waset.org/abstracts/search?q=multilevel%20inverter" title=" multilevel inverter"> multilevel inverter</a>, <a href="https://publications.waset.org/abstracts/search?q=Pulse%20Width%20Modulation%20%28PWM%29" title=" Pulse Width Modulation (PWM)"> Pulse Width Modulation (PWM)</a> </p> <a href="https://publications.waset.org/abstracts/1763/implementation-of-a-novel-modified-multilevel-inverter-topology-for-grid-connected-pv-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1763.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">357</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">11372</span> Optimal Number of Reconfigurable Robots in a Transport System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mari%20Chaikovskaia">Mari Chaikovskaia</a>, <a href="https://publications.waset.org/abstracts/search?q=Jean-Philippe%20Gayon"> Jean-Philippe Gayon</a>, <a href="https://publications.waset.org/abstracts/search?q=Alain%20Quilliot"> Alain Quilliot</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We consider a fleet of elementary robots that can be connected in different ways to transport loads of different types. For instance, a single robot can transport a small load, and the association of two robots can either transport a large load or two small loads. We seek to determine the optimal number of robots to transport a set of loads in a given time interval, with or without reconfiguration. We show that the problem with reconfiguration is strongly NP-hard by a reduction to the bin-packing problem. Then, we study a special case with unit capacities and derive simple formulas for the minimum number of robots, up to 3 types of loads. For this special case, we compare the minimum number of robots with or without reconfiguration and show that the gain is limited in absolute value but may be significant for small fleets. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fleet%20sizing" title="fleet sizing">fleet sizing</a>, <a href="https://publications.waset.org/abstracts/search?q=reconfigurability" title=" reconfigurability"> reconfigurability</a>, <a href="https://publications.waset.org/abstracts/search?q=robots" title=" robots"> robots</a>, <a href="https://publications.waset.org/abstracts/search?q=transportation" title=" transportation"> transportation</a> </p> <a href="https://publications.waset.org/abstracts/160116/optimal-number-of-reconfigurable-robots-in-a-transport-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/160116.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">86</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">11371</span> Trends in Research Regarding International Student Connectedness, A Systematic Review</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zilola%20Kozimova">Zilola Kozimova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Humans are highly social creatures, and our social surroundings create a large part of our daily experiences. Feeling connected and belonging at school have been studied a lot, especially in the period up to college. The need to feel connected becomes even more vital when people choose to study abroad. The number of published research in the field has increased recently, creating sufficient studies for a systematic literature review. The current study was conducted to find out existing trends and central themes in the field regarding international student connectedness. Using PRISMA 2020 and Shariff et al.’s work as the guidelines, I conducted a systematic literature review of studies regarding international student connectedness in higher education. Three steps of inclusion/exclusion criteria were used to determine the final studies to be included. The results show an increasing trend in the field as the number of related studies drastically rose after 2017. the results showed that there are three phases in the research regarding the connectedness of international students: a rejection period, a sudden increase of interest in the topic, and merging as an essential part of the mental well-being of international students. There is also a change in the themes regarding the topic, as there is a rise in the number of research published regarding international students’ mental health in recent years, connectedness being a sub-topic. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=international%20students" title="international students">international students</a>, <a href="https://publications.waset.org/abstracts/search?q=connectedness" title=" connectedness"> connectedness</a>, <a href="https://publications.waset.org/abstracts/search?q=mental%20well-being%20of%20international%20students" title=" mental well-being of international students"> mental well-being of international students</a>, <a href="https://publications.waset.org/abstracts/search?q=trends" title=" trends"> trends</a>, <a href="https://publications.waset.org/abstracts/search?q=higher%20education" title=" higher education"> higher education</a> </p> <a href="https://publications.waset.org/abstracts/164638/trends-in-research-regarding-international-student-connectedness-a-systematic-review" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/164638.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">119</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">11370</span> Grid-Connected Inverter Experimental Simulation and Droop Control Implementation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nur%20Aisyah%20Jalalludin">Nur Aisyah Jalalludin</a>, <a href="https://publications.waset.org/abstracts/search?q=Arwindra%20Rizqiawan"> Arwindra Rizqiawan</a>, <a href="https://publications.waset.org/abstracts/search?q=Goro%20Fujita"> Goro Fujita</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, we aim to demonstrate a microgrid system experimental simulation for an easy understanding of a large-scale microgrid system. This model is required for industrial training and learning environments. However, in order to create an exact representation of a microgrid system, the laboratory-scale system must fulfill the requirements of a grid-connected inverter, in which power values are assigned to the system to cope with the intermittent output from renewable energy sources. Aside from that, during changes in load capacity, the grid-connected system must be able to supply power from the utility grid side and microgrid side in a balanced manner. Therefore, droop control is installed in the inverter’s control board to maintain equal power sharing in both sides. This power control in a stand-alone condition and droop control in a grid-connected condition must be implemented in order to maintain a stabilized system. Based on the experimental results, power control and droop control can both be applied in the system by comparing the experimental and reference values. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=droop%20control" title="droop control">droop control</a>, <a href="https://publications.waset.org/abstracts/search?q=droop%20characteristic" title=" droop characteristic"> droop characteristic</a>, <a href="https://publications.waset.org/abstracts/search?q=grid-connected%20inverter" title=" grid-connected inverter"> grid-connected inverter</a>, <a href="https://publications.waset.org/abstracts/search?q=microgrid" title=" microgrid"> microgrid</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20control" title=" power control"> power control</a> </p> <a href="https://publications.waset.org/abstracts/18456/grid-connected-inverter-experimental-simulation-and-droop-control-implementation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18456.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">886</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">11369</span> Optimization Design of Single Phase Inverter Connected to the Grid</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Linda%20Hassaine">Linda Hassaine</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdelhamid%20Mraoui"> Abdelhamid Mraoui</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Rida%20Bengourina"> Mohamed Rida Bengourina</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In grid-connected photovoltaic systems, significant improvements can be carried out in the design and implementation of inverters: reduction of harmonic distortion, elimination of the DC component injected into the grid and the proposed control. This paper proposes a control strategy based on PWM switching patterns for an inverter for the photovoltaic system connected to the grid in order to control the injected current. The current injected must be sinusoidal with reduced harmonic distortion. An additional filter is designed to reduce high-order harmonics on the output side. This strategy exhibits the advantages: Simplicity, reduction of harmonics, the size of the line filter, reduction of the memory requirements and power calculation for the control. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=control" title="control">control</a>, <a href="https://publications.waset.org/abstracts/search?q=inverters" title=" inverters"> inverters</a>, <a href="https://publications.waset.org/abstracts/search?q=LCL%20filter" title=" LCL filter"> LCL filter</a>, <a href="https://publications.waset.org/abstracts/search?q=grid-connected%20photovoltaic%20system" title=" grid-connected photovoltaic system"> grid-connected photovoltaic system</a> </p> <a href="https://publications.waset.org/abstracts/73542/optimization-design-of-single-phase-inverter-connected-to-the-grid" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/73542.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">325</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=connected%20domination%20number&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=connected%20domination%20number&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=connected%20domination%20number&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=connected%20domination%20number&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=connected%20domination%20number&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=connected%20domination%20number&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=connected%20domination%20number&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=connected%20domination%20number&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=connected%20domination%20number&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=connected%20domination%20number&page=379">379</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=connected%20domination%20number&page=380">380</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=connected%20domination%20number&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>