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: vertex degrees</title> <meta name="description" content="Search results for: vertex degrees"> <meta name="keywords" content="vertex degrees"> <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="vertex degrees" 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="vertex degrees"> <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> 856</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: vertex degrees</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">856</span> The K-Distance Neighborhood 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=Soner%20Nandappa%20D.">Soner Nandappa D.</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Mohammed%20Naji"> Ahmed Mohammed Naji</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In a graph G = (V, E), the distance from a vertex v to a vertex u is the length of shortest v to u path. The eccentricity e(v) of v is the distance to a farthest vertex from v. The diameter diam(G) is the maximum eccentricity. The k-distance neighborhood of v, for 0 ≤ k ≤ e(v), is Nk(v) = {u ϵ V (G) : d(v, u) = k}. In this paper, we introduce a new distance degree based topological polynomial of a graph G is called a k- distance neighborhood polynomial, denoted Nk(G, x). It is a polynomial with the coefficient of the term k, for 0 ≤ k ≤ e(v), is the sum of the cardinalities of Nk(v) for every v ϵ V (G). Some properties of k- distance neighborhood polynomials are obtained. Exact formulas of the k- distance neighborhood polynomial for some well-known graphs, Cartesian product and join of graphs are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=vertex%20degrees" title="vertex degrees">vertex degrees</a>, <a href="https://publications.waset.org/abstracts/search?q=distance%20in%20graphs" title=" distance in graphs"> distance in graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20operation" title=" graph operation"> graph operation</a>, <a href="https://publications.waset.org/abstracts/search?q=Nk-polynomials" title=" Nk-polynomials"> Nk-polynomials</a> </p> <a href="https://publications.waset.org/abstracts/52946/the-k-distance-neighborhood-polynomial-of-a-graph" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52946.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">549</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">855</span> The Vertex Degree Distance of One Vertex Union of the Cycle and the Star</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ying%20Wang">Ying Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Haiyan%20Xie"> Haiyan Xie</a>, <a href="https://publications.waset.org/abstracts/search?q=Aoming%20Zhang"> Aoming Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The degree distance of a graph is a graph invariant that is more sensitive than the Wiener index. In this paper, we calculate the vertex degree distances of one vertex union of the cycle and the star, and the degree distance of one vertex union of the cycle and the star. These results lay a foundation for further study on the extreme value of the vertex degree distances, and the distribution of the vertices with the extreme value in one vertex union of the cycle and the star. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=degree%20distance" title="degree distance">degree distance</a>, <a href="https://publications.waset.org/abstracts/search?q=vertex-degree-distance" title=" vertex-degree-distance"> vertex-degree-distance</a>, <a href="https://publications.waset.org/abstracts/search?q=one%20vertex%20union%20of%20a%20cycle%20and%20a%20star" title=" one vertex union of a cycle and a star"> one vertex union of a cycle and a star</a>, <a href="https://publications.waset.org/abstracts/search?q=graph" title=" graph"> graph</a> </p> <a href="https://publications.waset.org/abstracts/127232/the-vertex-degree-distance-of-one-vertex-union-of-the-cycle-and-the-star" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/127232.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">154</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">854</span> Bounds on the Laplacian Vertex PI Energy</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ezgi%20Kaya">Ezgi Kaya</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Dilek%20Maden"> A. Dilek Maden</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A topological index is a number related to graph which is invariant under graph isomorphism. In theoretical chemistry, molecular structure descriptors (also called topological indices) are used for modeling physicochemical, pharmacologic, toxicologic, biological and other properties of chemical compounds. Let G be a graph with n vertices and m edges. For a given edge uv, the quantity nu(e) denotes the number of vertices closer to u than v, the quantity nv(e) is defined analogously. The vertex PI index defined as the sum of the nu(e) and nv(e). Here the sum is taken over all edges of G. The energy of a graph is defined as the sum of the eigenvalues of adjacency matrix of G and the Laplacian energy of a graph is defined as the sum of the absolute value of difference of laplacian eigenvalues and average degree of G. In theoretical chemistry, the π-electron energy of a conjugated carbon molecule, computed using the Hückel theory, coincides with the energy. Hence results on graph energy assume special significance. The Laplacian matrix of a graph G weighted by the vertex PI weighting is the Laplacian vertex PI matrix and the Laplacian vertex PI eigenvalues of a connected graph G are the eigenvalues of its Laplacian vertex PI matrix. In this study, Laplacian vertex PI energy of a graph is defined of G. We also give some bounds for the Laplacian vertex PI energy of graphs in terms of vertex PI index, the sum of the squares of entries in the Laplacian vertex PI matrix and the absolute value of the determinant of the Laplacian vertex PI matrix. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=energy" title="energy">energy</a>, <a href="https://publications.waset.org/abstracts/search?q=Laplacian%20energy" title=" Laplacian energy"> Laplacian energy</a>, <a href="https://publications.waset.org/abstracts/search?q=laplacian%20vertex%20PI%20eigenvalues" title=" laplacian vertex PI eigenvalues"> laplacian vertex PI eigenvalues</a>, <a href="https://publications.waset.org/abstracts/search?q=Laplacian%20vertex%20PI%20energy" title=" Laplacian vertex PI energy"> Laplacian vertex PI energy</a>, <a href="https://publications.waset.org/abstracts/search?q=vertex%20PI%20index" title=" vertex PI index"> vertex PI index</a> </p> <a href="https://publications.waset.org/abstracts/73194/bounds-on-the-laplacian-vertex-pi-energy" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/73194.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">245</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">853</span> Nullity of t-Tupple Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Khidir%20R.%20Sharaf">Khidir R. Sharaf</a>, <a href="https://publications.waset.org/abstracts/search?q=Didar%20A.%20Ali"> Didar A. Ali</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The nullity η (G) of a graph is the occurrence of zero as an eigenvalue in its spectra. A zero-sum weighting of a graph G is real valued function, say f from vertices of G to the set of real numbers, provided that for each vertex of G the summation of the weights f (w) over all neighborhood w of v is zero for each v in G.A high zero-sum weighting of G is one that uses maximum number of non-zero independent variables. If G is graph with an end vertex, and if H is an induced sub-graph of G obtained by deleting this vertex together with the vertex adjacent to it, then, η(G)= η(H). In this paper, a high zero-sum weighting technique and the end vertex procedure are applied to evaluate the nullity of t-tupple and generalized t-tupple graphs are derived and determined for some special types of graphs. Also, we introduce and prove some important results about the t-tupple coalescence, Cartesian and Kronecker products of nut graphs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph%20theory" title="graph theory">graph theory</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20spectra" title=" graph spectra"> graph spectra</a>, <a href="https://publications.waset.org/abstracts/search?q=nullity%20of%20graphs" title=" nullity of graphs"> nullity of graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=statistic" title=" statistic"> statistic</a> </p> <a href="https://publications.waset.org/abstracts/4759/nullity-of-t-tupple-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4759.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">852</span> Normalized Laplacian Eigenvalues of Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shaowei%20Sun">Shaowei Sun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let G be a graph with vertex set V(G)={v_1,v_2,...,v_n} and edge set E(G). For any vertex v belong to V(G), let d_v denote the degree of v. The normalized Laplacian matrix of the graph G is the matrix where the non-diagonal (i,j)-th entry is -1/(d_id_j) when vertex i is adjacent to vertex j and 0 when they are not adjacent, and the diagonal (i,i)-th entry is the di. In this paper, we discuss some bounds on the largest and the second smallest normalized Laplacian eigenvalue of trees and graphs. As following, we found some new bounds on the second smallest normalized Laplacian eigenvalue of tree T in terms of graph parameters. Moreover, we use Sage to give some conjectures on the second largest and the third smallest normalized eigenvalues of graph. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph" title="graph">graph</a>, <a href="https://publications.waset.org/abstracts/search?q=normalized%20Laplacian%20eigenvalues" title=" normalized Laplacian eigenvalues"> normalized Laplacian eigenvalues</a>, <a href="https://publications.waset.org/abstracts/search?q=normalized%20Laplacian%20matrix" title=" normalized Laplacian matrix"> normalized Laplacian matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=tree" title=" tree"> tree</a> </p> <a href="https://publications.waset.org/abstracts/41326/normalized-laplacian-eigenvalues-of-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41326.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">328</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">851</span> GPU-Accelerated Triangle Mesh Simplification Using Parallel Vertex Removal</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thomas%20Odaker">Thomas Odaker</a>, <a href="https://publications.waset.org/abstracts/search?q=Dieter%20Kranzlmueller"> Dieter Kranzlmueller</a>, <a href="https://publications.waset.org/abstracts/search?q=Jens%20Volkert"> Jens Volkert</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present an approach to triangle mesh simplification designed to be executed on the GPU. We use a quadric error metric to calculate an error value for each vertex of the mesh and order all vertices based on this value. This step is followed by the parallel removal of a number of vertices with the lowest calculated error values. To allow for the parallel removal of multiple vertices we use a set of per-vertex boundaries that prevent mesh foldovers even when simplification operations are performed on neighbouring vertices. We execute multiple iterations of the calculation of the vertex errors, ordering of the error values and removal of vertices until either a desired number of vertices remains in the mesh or a minimum error value is reached. This parallel approach is used to speed up the simplification process while maintaining mesh topology and avoiding foldovers at every step of the simplification. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computer%20graphics" title="computer graphics">computer graphics</a>, <a href="https://publications.waset.org/abstracts/search?q=half%20edge%20collapse" title=" half edge collapse"> half edge collapse</a>, <a href="https://publications.waset.org/abstracts/search?q=mesh%20simplification" title=" mesh simplification"> mesh simplification</a>, <a href="https://publications.waset.org/abstracts/search?q=precomputed%20simplification" title=" precomputed simplification"> precomputed simplification</a>, <a href="https://publications.waset.org/abstracts/search?q=topology%20preserving" title=" topology preserving"> topology preserving</a> </p> <a href="https://publications.waset.org/abstracts/36600/gpu-accelerated-triangle-mesh-simplification-using-parallel-vertex-removal" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36600.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">367</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">850</span> Improvement a Lower Bound of Energy for Some Family of Graphs, Related to Determinant of Adjacency Matrix</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Saieed%20%20Akbari">Saieed Akbari</a>, <a href="https://publications.waset.org/abstracts/search?q=Yousef%20Bagheri"> Yousef Bagheri</a>, <a href="https://publications.waset.org/abstracts/search?q=Amir%20Hossein%20Ghodrati"> Amir Hossein Ghodrati</a>, <a href="https://publications.waset.org/abstracts/search?q=Sima%20Saadat%20Akhtar"> Sima Saadat Akhtar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let G be a simple graph with the vertex set V (G) and with the adjacency matrix A (G). The energy E (G) of G is defined to be the sum of the absolute values of all eigenvalues of A (G). Also let n and m be number of edges and vertices of the graph respectively. A regular graph is a graph where each vertex has the same number of neighbours. Given a graph G, its line graph L(G) is a graph such that each vertex of L(G) represents an edge of G; and two vertices of L(G) are adjacent if and only if their corresponding edges share a common endpoint in G. In this paper we show that for every regular graphs and also for every line graphs such that (G) 3 we have, E(G) 2nm + n 1. Also at the other part of the paper we prove that 2 (G) E(G) for an arbitrary graph G. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=eigenvalues" title="eigenvalues">eigenvalues</a>, <a href="https://publications.waset.org/abstracts/search?q=energy" title=" energy"> energy</a>, <a href="https://publications.waset.org/abstracts/search?q=line%20graphs" title=" line graphs"> line graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=matching%20number" title=" matching number"> matching number</a> </p> <a href="https://publications.waset.org/abstracts/99652/improvement-a-lower-bound-of-energy-for-some-family-of-graphs-related-to-determinant-of-adjacency-matrix" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/99652.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">849</span> Passive Control of Elliptic Jet by Using Triangular and Truncated Tabs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Saif%20Akram">Saif Akram</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Rathakrishnan"> E. Rathakrishnan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The mixing promoting efficiency of two identical sharp and truncated vertex triangular tabs offering geometrical blockage of 2.5% each, placed at the exit of a Mach 1.5 elliptic nozzle was studied experimentally. The effectiveness of both the tabs in enhancing the mixing of jets with the ambient air are determined by measuring the Pitot pressure along the jet axis and the jet spread in both the minor and major axes of the elliptic nozzle, covering marginally overexpanded to moderately underexpanded levels at the nozzle exit. The results reveal that both the tabs enhance mixing characteristics of the uncontrolled elliptic jet when placed at minor axis. A core length reduction of 67% is achieved at NPR 3 which is the overexpanded state. Similarly, the core length is reduced by about 67%, 50% and 57% at NPRs of 4, 5 and 6 (underexpanded states) respectively. However, unlike the considerable increment in mixing promoting efficiency by the use of truncated vertex tabs for axisymmetric jets, the effect is not much pronounced for the case of supersonic elliptic jets. The CPD plots for both the cases almost overlap, especially when tabs are placed at minor axis, at all the pressure conditions. While, when the tabs are used at major axis, in the case of overexpanded condition, the sharp vertex triangular tabs act as a better mixing enhancer for the supersonic elliptic jets. For the jet controlled with truncated vertex triangular tabs, the core length reductions are of the same order as those for the sharp vertex triangular tabs. The jet mixing is hardly influenced by the tip effect in case of supersonic elliptic jet. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=elliptic%20jet" title="elliptic jet">elliptic jet</a>, <a href="https://publications.waset.org/abstracts/search?q=tabs" title=" tabs"> tabs</a>, <a href="https://publications.waset.org/abstracts/search?q=truncated" title=" truncated"> truncated</a>, <a href="https://publications.waset.org/abstracts/search?q=triangular" title=" triangular"> triangular</a> </p> <a href="https://publications.waset.org/abstracts/38593/passive-control-of-elliptic-jet-by-using-triangular-and-truncated-tabs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/38593.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">383</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">848</span> Undirected Endo-Cayley Digraphs of Cyclic Groups of Order Primes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chanon%20Promsakon">Chanon Promsakon</a>, <a href="https://publications.waset.org/abstracts/search?q=Sayan%20Panma"> Sayan Panma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let S be a finite semigroup, A a subset of S and f an endomorphism on S. The endo-Cayley digraph of a semigroup S corresponding to a connecting set A and an endomorphism f, denoted by endo − Cayf (S, A) is a digraph whose vertex set is S and a vertex u is adjacent to a vertex v if and only if v = f(u)a for some a ∈ A. A digraph D is called undirected if any edge uv in D, there exists an edge vu in D. We consider the undirectedness of an endo-Cayley of a cyclic group of order prime, Zp. In this work, we investigate conditions for connecting sets and endomorphisms to make endo-Cayley digraphs of cyclic groups of order primes be undirected. Moreover, we give some conditions for an undirected endo-Cayley of cycle group of any order. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=endo-Cayley%20graph" title="endo-Cayley graph">endo-Cayley graph</a>, <a href="https://publications.waset.org/abstracts/search?q=undirected%20digraphs" title=" undirected digraphs"> undirected digraphs</a>, <a href="https://publications.waset.org/abstracts/search?q=cyclic%20groups" title=" cyclic groups"> cyclic groups</a>, <a href="https://publications.waset.org/abstracts/search?q=endomorphism" title=" endomorphism"> endomorphism</a> </p> <a href="https://publications.waset.org/abstracts/5030/undirected-endo-cayley-digraphs-of-cyclic-groups-of-order-primes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5030.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">350</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">847</span> Identifying Coloring in Graphs with Twins</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Souad%20Slimani">Souad Slimani</a>, <a href="https://publications.waset.org/abstracts/search?q=Sylvain%20Gravier"> Sylvain Gravier</a>, <a href="https://publications.waset.org/abstracts/search?q=Simon%20Schmidt"> Simon Schmidt</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, several vertex identifying notions were introduced (identifying coloring, lid-coloring,...); these notions were inspired by identifying codes. All of them, as well as original identifying code, is based on separating two vertices according to some conditions on their closed neighborhood. Therefore, twins can not be identified. So most of known results focus on twin-free graph. Here, we show how twins can modify optimal value of vertex-identifying parameters for identifying coloring and locally identifying coloring. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=identifying%20coloring" title="identifying coloring">identifying coloring</a>, <a href="https://publications.waset.org/abstracts/search?q=locally%20identifying%20coloring" title=" locally identifying coloring"> locally identifying coloring</a>, <a href="https://publications.waset.org/abstracts/search?q=twins" title=" twins"> twins</a>, <a href="https://publications.waset.org/abstracts/search?q=separating" title=" separating"> separating</a> </p> <a href="https://publications.waset.org/abstracts/121497/identifying-coloring-in-graphs-with-twins" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/121497.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">148</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">846</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">845</span> Exploring Counting Methods for the Vertices of Certain Polyhedra with Uncertainties</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sammani%20Danwawu%20Abdullahi">Sammani Danwawu Abdullahi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Vertex Enumeration Algorithms explore the methods and procedures of generating the vertices of general polyhedra formed by system of equations or inequalities. These problems of enumerating the extreme points (vertices) of general polyhedra are shown to be NP-Hard. This lead to exploring how to count the vertices of general polyhedra without listing them. This is also shown to be #P-Complete. Some fully polynomial randomized approximation schemes (fpras) of counting the vertices of some special classes of polyhedra associated with Down-Sets, Independent Sets, 2-Knapsack problems and 2 x n transportation problems are presented together with some discovered open problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=counting%20with%20uncertainties" title="counting with uncertainties">counting with uncertainties</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20programming" title=" mathematical programming"> mathematical programming</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=vertex%20enumeration" title=" vertex enumeration"> vertex enumeration</a> </p> <a href="https://publications.waset.org/abstracts/38580/exploring-counting-methods-for-the-vertices-of-certain-polyhedra-with-uncertainties" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/38580.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">844</span> Total Chromatic Number of Δ-Claw-Free 3-Degenerated Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wongsakorn%20Charoenpanitseri">Wongsakorn Charoenpanitseri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The total chromatic number χ"(G) of a graph G is the minimum number of colors needed to color the elements (vertices and edges) of G such that no incident or adjacent pair of elements receive the same color Let G be a graph with maximum degree Δ(G). Considering a total coloring of G and focusing on a vertex with maximum degree. A vertex with maximum degree needs a color and all Δ(G) edges incident to this vertex need more Δ(G) + 1 distinct colors. To color all vertices and all edges of G, it requires at least Δ(G) + 1 colors. That is, χ"(G) is at least Δ(G) + 1. However, no one can find a graph G with the total chromatic number which is greater than Δ(G) + 2. The Total Coloring Conjecture states that for every graph G, χ"(G) is at most Δ(G) + 2. In this paper, we prove that the Total Coloring Conjectur for a Δ-claw-free 3-degenerated graph. That is, we prove that the total chromatic number of every Δ-claw-free 3-degenerated graph is at most Δ(G) + 2. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=total%20colorings" title="total colorings">total colorings</a>, <a href="https://publications.waset.org/abstracts/search?q=the%20total%20chromatic%20number" title=" the total chromatic number"> the total chromatic number</a>, <a href="https://publications.waset.org/abstracts/search?q=3-degenerated" title=" 3-degenerated"> 3-degenerated</a>, <a href="https://publications.waset.org/abstracts/search?q=CLAW-FREE" title=" CLAW-FREE"> CLAW-FREE</a> </p> <a href="https://publications.waset.org/abstracts/86060/total-chromatic-number-of-d-claw-free-3-degenerated-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/86060.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">843</span> Deciding Graph Non-Hamiltonicity via a Closure Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=E.%20R.%20Swart">E. R. Swart</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20J.%20Gismondi"> S. J. Gismondi</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20R.%20Swart"> N. R. Swart</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20E.%20Bell"> C. E. Bell</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present an heuristic algorithm that decides graph non-Hamiltonicity. All graphs are directed, each undirected edge regarded as a pair of counter directed arcs. Each of the n! Hamilton cycles in a complete graph on n+1 vertices is mapped to an n-permutation matrix P where p(u,i)=1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n+1. We first create exclusion set E by noting all arcs (u, v) not in G, sufficient to code precisely all cycles excluded from G i.e. cycles not in G use at least one arc not in G. Members are pairs of components of P, {p(u,i),p(v,i+1)}, i=1, n-1. A doubly stochastic-like relaxed LP formulation of the Hamilton cycle decision problem is constructed. Each {p(u,i),p(v,i+1)} in E is coded as variable q(u,i,v,i+1)=0 i.e. shrinks the feasible region. We then implement the Weak Closure Algorithm (WCA) that tests necessary conditions of a matching, together with Boolean closure to decide 0/1 variable assignments. Each {p(u,i),p(v,j)} not in E is tested for membership in E, and if possible, added to E (q(u,i,v,j)=0) to iteratively maximize |E|. If the WCA constructs E to be maximal, the set of all {p(u,i),p(v,j)}, then G is decided non-Hamiltonian. Only non-Hamiltonian G share this maximal property. Ten non-Hamiltonian graphs (10 through 104 vertices) and 2000 randomized 31 vertex non-Hamiltonian graphs are tested and correctly decided non-Hamiltonian. For Hamiltonian G, the complement of E covers a matching, perhaps useful in searching for cycles. We also present an example where the WCA fails. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hamilton%20cycle%20decision%20problem" title="Hamilton cycle decision problem">Hamilton cycle decision problem</a>, <a href="https://publications.waset.org/abstracts/search?q=computational%20complexity%20theory" title=" computational complexity theory"> computational complexity theory</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20theory" title=" graph theory"> graph theory</a>, <a href="https://publications.waset.org/abstracts/search?q=theoretical%20computer%20science" title=" theoretical computer science"> theoretical computer science</a> </p> <a href="https://publications.waset.org/abstracts/6023/deciding-graph-non-hamiltonicity-via-a-closure-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6023.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">842</span> A Deep Explanation for the Formation of Force as a Foundational Law of Physics by Incorporating Unknown Degrees of Freedom into Space</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohsen%20Farshad">Mohsen Farshad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Information and force definition has been intertwined with the concept of entropy for many years. The displacement information of degrees of freedom with Brownian motions at a given temperature in space emerges as an entropic force between species. Here, we use this concept of entropy to understand the underlying physics behind the formation of attractive and repulsive forces by imagining that space is filled with free Brownian degrees of freedom. We incorporate the radius of bodies and the distance between them into entropic force relation systematically. Using this modified gravitational entropic force, we derive the attractive entropic force between bodies without considering their spin. We further hypothesize a possible mechanism for the formation of the repulsive force between two bodies. We visually elaborate that the repulsive entropic force will be manifested through the rotation of degrees of freedom around the spinning particles. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=entropy" title="entropy">entropy</a>, <a href="https://publications.waset.org/abstracts/search?q=information" title=" information"> information</a>, <a href="https://publications.waset.org/abstracts/search?q=force" title=" force"> force</a>, <a href="https://publications.waset.org/abstracts/search?q=Brownian%20Motions" title=" Brownian Motions"> Brownian Motions</a> </p> <a href="https://publications.waset.org/abstracts/150175/a-deep-explanation-for-the-formation-of-force-as-a-foundational-law-of-physics-by-incorporating-unknown-degrees-of-freedom-into-space" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/150175.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">76</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">841</span> Bioarm, a Prothesis without Surgery</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=J.%20Sagouis">J. Sagouis</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Chamel"> A. Chamel</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Carre"> E. Carre</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20Casasreales"> C. Casasreales</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20Rudnik"> G. Rudnik</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Cerdan"> M. Cerdan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Robotics provides answers to amputees. The most expensive solutions surgically connect the prosthesis to nerve endings. There are also several types of non-invasive technologies that recover nerve messages passing through the muscles. After analyzing these messages, myoelectric prostheses perform the desired movement. The main goal is to avoid all surgeries, which can be heavy and offer cheaper alternatives. For an amputee, we use valid muscles to recover the electrical signal involved in a muscle movement. EMG sensors placed on the muscle allows us to measure a potential difference, which our program transforms into control for a robotic arm with two degrees of freedom. We have shown the feasibility of non-invasive prostheses with two degrees of freedom. Signal analysis and an increase in degrees of freedom is still being improved. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=prosthesis" title="prosthesis">prosthesis</a>, <a href="https://publications.waset.org/abstracts/search?q=electromyography%20%28EMG%29" title=" electromyography (EMG)"> electromyography (EMG)</a>, <a href="https://publications.waset.org/abstracts/search?q=robotic%20arm" title=" robotic arm"> robotic arm</a>, <a href="https://publications.waset.org/abstracts/search?q=nerve%20message" title=" nerve message"> nerve message</a> </p> <a href="https://publications.waset.org/abstracts/15441/bioarm-a-prothesis-without-surgery" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15441.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">249</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">840</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">839</span> Quantization of Damped Systems Based on the Doubling of Degrees of Freedom</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Khaled%20I.%20Nawafleh">Khaled I. Nawafleh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, it provide the canonical approach for studying dissipated oscillators based on the doubling of degrees of freedom. Clearly, expressions for Lagrangians of the elementary modes of the system are given, which ends with the familiar classical equations of motion for the dissipative oscillator. The equation for one variable is the time reversed of the motion of the second variable. it discuss in detail the extended Bateman Lagrangian specifically for a dual extended damped oscillator time-dependent. A Hamilton-Jacobi analysis showing the equivalence with the Lagrangian approach is also obtained. For that purpose, the techniques of separation of variables were applied, and the quantization process was achieved. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=doubling%20of%20degrees%20of%20freedom" title="doubling of degrees of freedom">doubling of degrees of freedom</a>, <a href="https://publications.waset.org/abstracts/search?q=dissipated%20harmonic%20oscillator" title=" dissipated harmonic oscillator"> dissipated harmonic oscillator</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamilton-Jacobi" title=" Hamilton-Jacobi"> Hamilton-Jacobi</a>, <a href="https://publications.waset.org/abstracts/search?q=time-dependent%20lagrangians" title=" time-dependent lagrangians"> time-dependent lagrangians</a>, <a href="https://publications.waset.org/abstracts/search?q=quantization" title=" quantization"> quantization</a> </p> <a href="https://publications.waset.org/abstracts/171405/quantization-of-damped-systems-based-on-the-doubling-of-degrees-of-freedom" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/171405.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">68</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">838</span> Life Expansion: Visual Autobiography, Identity, Representation and the Degrees of Fictionalization of the Self on Instagram</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pablo%20De%20Macedo%20Silveira%20Vallejos">Pablo De Macedo Silveira Vallejos</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This article aims to observe autobiographical and visual narrative practices among users on Instagram. In this way, the work proposes to reflect on how image resources are used to develop edited representations of the self in that social network. The research aims to explore the uses of editing and the degrees of fictionalization present on Instagram. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=autobiography" title="autobiography">autobiography</a>, <a href="https://publications.waset.org/abstracts/search?q=visual%20narratives" title=" visual narratives"> visual narratives</a>, <a href="https://publications.waset.org/abstracts/search?q=representation" title=" representation"> representation</a>, <a href="https://publications.waset.org/abstracts/search?q=fiction" title=" fiction"> fiction</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20media" title=" social media"> social media</a> </p> <a href="https://publications.waset.org/abstracts/172749/life-expansion-visual-autobiography-identity-representation-and-the-degrees-of-fictionalization-of-the-self-on-instagram" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/172749.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">74</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">837</span> Independence and Path Independence on Cayley Digraphs of Left Groups and Right Groups</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nuttawoot%20Nupo">Nuttawoot Nupo</a>, <a href="https://publications.waset.org/abstracts/search?q=Sayan%20Panma"> Sayan Panma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A semigroup S is said to be a left (right) zero semigroup if S satisfies the equation xy=x (xy=y) for all x,y in S. In addition, the semigroup S is called a left (right) group if S is isomorphic to the direct product of a group and a left (right) zero semigroup. The Cayley digraph Cay(S,A) of a semigroup S with a connection set A is defined to be a digraph with the vertex set S and the arc set E(Cay(S,A))={(x,xa) | x∈S, a∈A} where A is any subset of S. All sets in this research are assumed to be finite. Let D be a digraph together with a vertex set V and an arc set E. Let u and v be two different vertices in V and I a nonempty subset of V. The vertices u and v are said to be independent if (u,v)∉E and (v,u)∉E. The set I is called an independent set of D if any two different vertices in I are independent. The independence number of D is the maximum cardinality of an independent set of D. Moreover, the vertices u and v are said to be path independent if there is no dipath from u to v and there is no dipath from v to u. The set I is called a path independent set of D if any two different vertices in I are path independent. The path independence number of D is the maximum cardinality of a path independent set of D. In this research, we describe a lower bound and an upper bound of the independence number of Cayley digraphs of left groups and right groups. Some examples corresponding to those bounds are illustrated here. Furthermore, the exact value of the path independence number of Cayley digraphs of left groups and right groups are also presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cayley%20digraphs" title="Cayley digraphs">Cayley digraphs</a>, <a href="https://publications.waset.org/abstracts/search?q=independence%20number" title=" independence number"> independence number</a>, <a href="https://publications.waset.org/abstracts/search?q=left%20groups" title=" left groups"> left groups</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20independence%20number" title=" path independence number"> path independence number</a>, <a href="https://publications.waset.org/abstracts/search?q=right%20groups" title=" right groups"> right groups</a> </p> <a href="https://publications.waset.org/abstracts/59306/independence-and-path-independence-on-cayley-digraphs-of-left-groups-and-right-groups" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59306.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">233</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">836</span> Study Secondary Particle Production in Carbon Ion Beam Radiotherapy</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shaikah%20Alsubayae">Shaikah Alsubayae</a>, <a href="https://publications.waset.org/abstracts/search?q=Gianluigi%20Casse"> Gianluigi Casse</a>, <a href="https://publications.waset.org/abstracts/search?q=Carlos%20Chavez"> Carlos Chavez</a>, <a href="https://publications.waset.org/abstracts/search?q=Jon%20Taylor"> Jon Taylor</a>, <a href="https://publications.waset.org/abstracts/search?q=Alan%20Taylor"> Alan Taylor</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Alsulimane"> Mohammad Alsulimane</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Ensuring accurate radiotherapy with carbon therapy requires precise monitoring of radiation dose distribution within the patient's body. This monitoring is essential for targeted tumor treatment, minimizing harm to healthy tissues, and improving treatment effectiveness while lowering side effects. In our investigation, we employed a methodological approach to monitor secondary proton doses in carbon therapy using Monte Carlo simulations. Initially, Geant4 simulations were utilized to extract the initial positions of secondary particles formed during interactions between carbon ions and water. These particles included protons, gamma rays, alpha particles, neutrons, and tritons. Subsequently, we studied the relationship between the carbon ion beam and these secondary particles. Interaction Vertex Imaging (IVI) is valuable for monitoring dose distribution in carbon therapy. It provides details about the positions and amounts of secondary particles, particularly protons. The IVI method depends on charged particles produced during ion fragmentation to gather information about the range by reconstructing particle trajectories back to their point of origin, referred to as the vertex. In our simulations regarding carbon ion therapy, we observed a strong correlation between some secondary particles and the range of carbon ions. However, challenges arose due to the target's unique elongated geometry, which hindered the straightforward transmission of forward-generated protons. Consequently, the limited protons that emerged mostly originated from points close to the target entrance. The trajectories of fragments (protons) were approximated as straight lines, and a beam back-projection algorithm, using recorded interaction positions in Si detectors, was developed to reconstruct vertices. The analysis revealed a correlation between the reconstructed and actual positions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=radiotherapy" title="radiotherapy">radiotherapy</a>, <a href="https://publications.waset.org/abstracts/search?q=carbon%20therapy" title=" carbon therapy"> carbon therapy</a>, <a href="https://publications.waset.org/abstracts/search?q=monitoring%20of%20radiation%20dose" title=" monitoring of radiation dose"> monitoring of radiation dose</a>, <a href="https://publications.waset.org/abstracts/search?q=interaction%20vertex%20imaging" title=" interaction vertex imaging"> interaction vertex imaging</a> </p> <a href="https://publications.waset.org/abstracts/176567/study-secondary-particle-production-in-carbon-ion-beam-radiotherapy" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/176567.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">84</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">835</span> Standard Model-Like Higgs Decay into Displaced Heavy Neutrino Pairs in U(1)' Models</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=E.%20Accomando">E. Accomando</a>, <a href="https://publications.waset.org/abstracts/search?q=L.%20Delle%20Rose"> L. Delle Rose</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Moretti"> S. Moretti</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Olaiya"> E. Olaiya</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20Shepherd-Themistocleous"> C. Shepherd-Themistocleous</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Heavy sterile neutrinos are almost ubiquitous in the class of Beyond Standard Model scenarios aimed at addressing the puzzle that emerged from the discovery of neutrino flavour oscillations, hence the need to explain their masses. In particular, they are necessary in a U(1)’ enlarged Standard Model (SM). We show that these heavy neutrinos can be rather long-lived producing distinctive displaced vertices and tracks. Indeed, depending on the actual decay length, they can decay inside a Large Hadron Collider (LHC) detector far from the main interaction point and can be identified in the inner tracking system or the muon chambers, emulated here through the Compact Muon Solenoid (CMS) detector parameters. Among the possible production modes of such heavy neutrino, we focus on their pair production mechanism in the SM Higgs decay, eventually yielding displaced lepton signatures following the heavy neutrino decays into weak gauge bosons. By employing well-established triggers available for the CMS detector and using the data collected by the end of the LHC Run 2, these signatures would prove to be accessible with negligibly small background. Finally, we highlight the importance that the exploitation of new triggers, specifically, displaced tri-lepton ones, could have for this displaced vertex search. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=beyond%20the%20standard%20model" title="beyond the standard model">beyond the standard model</a>, <a href="https://publications.waset.org/abstracts/search?q=displaced%20vertex" title=" displaced vertex"> displaced vertex</a>, <a href="https://publications.waset.org/abstracts/search?q=Higgs%20physics" title=" Higgs physics"> Higgs physics</a>, <a href="https://publications.waset.org/abstracts/search?q=neutrino%20physics" title=" neutrino physics"> neutrino physics</a> </p> <a href="https://publications.waset.org/abstracts/102211/standard-model-like-higgs-decay-into-displaced-heavy-neutrino-pairs-in-u1-models" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/102211.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">145</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">834</span> Thermal Behaviors of the Strong Form Factors of Charmonium and Charmed Beauty Mesons from Three Point Sum Rules</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=E.%20Yaz%C4%B1c%C4%B1">E. Yazıcı</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Sundu"> H. Sundu</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Veli%20Veliev"> E. Veli Veliev</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In order to understand the nature of strong interactions and QCD vacuum, investigation of the meson coupling constants have an important role. The knowledge on the temperature dependence of the form factors is very important for the interpretation of heavy-ion collision experiments. Also, more accurate determination of these coupling constants plays a crucial role in understanding of the hadronic decays. With the increasing of CM energies of the experiments, researches on meson interactions have become one of the more interesting problems of hadronic physics. In this study, we analyze the temperature dependence of the strong form factor of the BcBcJ/ψ vertex using the three point QCD sum rules method. Here, we assume that with replacing the vacuum condensates and also the continuum threshold by their thermal version, the sum rules for the observables remain valid. In calculations, we take into account the additional operators, which appear in the Wilson expansion at finite temperature. We also investigated the momentum dependence of the form factor at T = 0, fit it into an analytic function, and extrapolate into the deep time-like region in order to obtain a strong coupling constant of the vertex. Our results are consistent with the results existing in the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=QCD%20sum%20rules" title="QCD sum rules">QCD sum rules</a>, <a href="https://publications.waset.org/abstracts/search?q=thermal%20QCD" title=" thermal QCD"> thermal QCD</a>, <a href="https://publications.waset.org/abstracts/search?q=heavy%20mesons" title=" heavy mesons"> heavy mesons</a>, <a href="https://publications.waset.org/abstracts/search?q=strong%20coupling%20constants" title=" strong coupling constants"> strong coupling constants</a> </p> <a href="https://publications.waset.org/abstracts/74337/thermal-behaviors-of-the-strong-form-factors-of-charmonium-and-charmed-beauty-mesons-from-three-point-sum-rules" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/74337.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">189</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">833</span> Application of Argumentation for Improving the Classification Accuracy in Inductive Concept Formation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vadim%20Vagin">Vadim Vagin</a>, <a href="https://publications.waset.org/abstracts/search?q=Marina%20Fomina"> Marina Fomina</a>, <a href="https://publications.waset.org/abstracts/search?q=Oleg%20Morosin"> Oleg Morosin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper contains the description of argumentation approach for the problem of inductive concept formation. It is proposed to use argumentation, based on defeasible reasoning with justification degrees, to improve the quality of classification models, obtained by generalization algorithms. The experiment’s results on both clear and noisy data are also presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=argumentation" title="argumentation">argumentation</a>, <a href="https://publications.waset.org/abstracts/search?q=justification%20degrees" title=" justification degrees"> justification degrees</a>, <a href="https://publications.waset.org/abstracts/search?q=inductive%20concept%20formation" title=" inductive concept formation"> inductive concept formation</a>, <a href="https://publications.waset.org/abstracts/search?q=noise" title=" noise"> noise</a>, <a href="https://publications.waset.org/abstracts/search?q=generalization" title=" generalization"> generalization</a> </p> <a href="https://publications.waset.org/abstracts/20881/application-of-argumentation-for-improving-the-classification-accuracy-in-inductive-concept-formation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20881.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">442</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">832</span> Current Account on Teaching Psychology and Career Psychology in Portuguese Higher Education</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sivia%20Amado%20Cordeiro">Sivia Amado Cordeiro</a>, <a href="https://publications.waset.org/abstracts/search?q=Bruna%20Rodrigues"> Bruna Rodrigues</a>, <a href="https://publications.waset.org/abstracts/search?q=Maria%20Do%20Ceu%20Taveira"> Maria Do Ceu Taveira</a>, <a href="https://publications.waset.org/abstracts/search?q=Catia%20Marques"> Catia Marques</a>, <a href="https://publications.waset.org/abstracts/search?q=Iris%20Oliveira"> Iris Oliveira</a>, <a href="https://publications.waset.org/abstracts/search?q=Ana%20Daniela%20Silva"> Ana Daniela Silva</a>, <a href="https://publications.waset.org/abstracts/search?q=Cristina%20Costa-Lobo"> Cristina Costa-Lobo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This work intends to analyse the teaching of Psychology in Portugal and, particularly, the teaching of Career Psychology, reflecting about the changes that have occurred to date. Were analysed the educational offerings of 31 Portuguese higher education institutions, 12 public and 19 private, who teach the course of Psychology. The three degrees of study were considered, namely, bachelors, masters and doctoral. The analysis of the data focused on the curricular plans of the different degrees of studies in Psychology made available online by higher education institutions. Through them, we identified the curricular units with themes related to the teaching of Career Psychology. The results show the existence of 89 higher psychology courses in Portugal, distributed throughout the three degrees of studies. Concerning to the teaching of Career Psychology there were registered 49 curricular units with themes dedicated to this area of knowledge. There were identified 16 curricular units in the bachelor’s degree, 31 in master’s degree, and two in doctoral degree. It was observed a reduction in the number of degrees in Psychology in the last nine years in Portugal. We discuss the current situation of Psychology teaching, particularly the teaching of Career Psychology. The aim is to stimulate reflection about future perspectives of Psychology teaching, and specifically, specialized training in Psychology of Career, in Portugal. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=career%20psychology" title="career psychology">career psychology</a>, <a href="https://publications.waset.org/abstracts/search?q=higher%20education" title=" higher education"> higher education</a>, <a href="https://publications.waset.org/abstracts/search?q=psychology" title=" psychology"> psychology</a>, <a href="https://publications.waset.org/abstracts/search?q=Portugal" title=" Portugal"> Portugal</a> </p> <a href="https://publications.waset.org/abstracts/72737/current-account-on-teaching-psychology-and-career-psychology-in-portuguese-higher-education" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72737.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">341</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">831</span> A Study of Secondary Particle Production from Carbon Ion Beam for Radiotherapy</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shaikah%20Alsubayae">Shaikah Alsubayae</a>, <a href="https://publications.waset.org/abstracts/search?q=Gianluigi%20Casse"> Gianluigi Casse</a>, <a href="https://publications.waset.org/abstracts/search?q=Carlos%20Chavez"> Carlos Chavez</a>, <a href="https://publications.waset.org/abstracts/search?q=Jon%20Taylor"> Jon Taylor</a>, <a href="https://publications.waset.org/abstracts/search?q=Alan%20Taylor"> Alan Taylor</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Alsulimane"> Mohammad Alsulimane</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Achieving precise radiotherapy through carbon therapy necessitates the accurate monitoring of radiation dose distribution within the patient's body. This process is pivotal for targeted tumor treatment, minimizing harm to healthy tissues, and enhancing overall treatment effectiveness while reducing the risk of side effects. In our investigation, we adopted a methodological approach to monitor secondary proton doses in carbon therapy using Monte Carlo (MC) simulations. Initially, Geant4 simulations were employed to extract the initial positions of secondary particles generated during interactions between carbon ions and water, including protons, gamma rays, alpha particles, neutrons, and tritons. Subsequently, we explored the relationship between the carbon ion beam and these secondary particles. Interaction vertex imaging (IVI) proves valuable for monitoring dose distribution during carbon therapy, providing information about secondary particle locations and abundances, particularly protons. The IVI method relies on charged particles produced during ion fragmentation to gather range information by reconstructing particle trajectories back to their point of origin, known as the vertex. In the context of carbon ion therapy, our simulation results indicated a strong correlation between some secondary particles and the range of carbon ions. However, challenges arose due to the unique elongated geometry of the target, hindering the straightforward transmission of forward-generated protons. Consequently, the limited protons that did emerge predominantly originated from points close to the target entrance. Fragment (protons) trajectories were approximated as straight lines, and a beam back-projection algorithm, utilizing interaction positions recorded in Si detectors, was developed to reconstruct vertices. The analysis revealed a correlation between the reconstructed and actual positions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=radiotherapy" title="radiotherapy">radiotherapy</a>, <a href="https://publications.waset.org/abstracts/search?q=carbon%20therapy" title=" carbon therapy"> carbon therapy</a>, <a href="https://publications.waset.org/abstracts/search?q=monitor%20secondary%20proton%20doses" title=" monitor secondary proton doses"> monitor secondary proton doses</a>, <a href="https://publications.waset.org/abstracts/search?q=interaction%20vertex%20imaging" title=" interaction vertex imaging"> interaction vertex imaging</a> </p> <a href="https://publications.waset.org/abstracts/176486/a-study-of-secondary-particle-production-from-carbon-ion-beam-for-radiotherapy" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/176486.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">78</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">830</span> Variable-Fidelity Surrogate Modelling with Kriging</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Selvakumar%20Ulaganathan">Selvakumar Ulaganathan</a>, <a href="https://publications.waset.org/abstracts/search?q=Ivo%20Couckuyt"> Ivo Couckuyt</a>, <a href="https://publications.waset.org/abstracts/search?q=Francesco%20Ferranti"> Francesco Ferranti</a>, <a href="https://publications.waset.org/abstracts/search?q=Tom%20Dhaene"> Tom Dhaene</a>, <a href="https://publications.waset.org/abstracts/search?q=Eric%20Laermans"> Eric Laermans</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Variable-fidelity surrogate modelling offers an efficient way to approximate function data available in multiple degrees of accuracy each with varying computational cost. In this paper, a Kriging-based variable-fidelity surrogate modelling approach is introduced to approximate such deterministic data. Initially, individual Kriging surrogate models, which are enhanced with gradient data of different degrees of accuracy, are constructed. Then these Gradient enhanced Kriging surrogate models are strategically coupled using a recursive CoKriging formulation to provide an accurate surrogate model for the highest fidelity data. While, intuitively, gradient data is useful to enhance the accuracy of surrogate models, the primary motivation behind this work is to investigate if it is also worthwhile incorporating gradient data of varying degrees of accuracy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kriging" title="Kriging">Kriging</a>, <a href="https://publications.waset.org/abstracts/search?q=CoKriging" title=" CoKriging"> CoKriging</a>, <a href="https://publications.waset.org/abstracts/search?q=Surrogate%20modelling" title=" Surrogate modelling"> Surrogate modelling</a>, <a href="https://publications.waset.org/abstracts/search?q=Variable-%20fidelity%20modelling" title=" Variable- fidelity modelling"> Variable- fidelity modelling</a>, <a href="https://publications.waset.org/abstracts/search?q=Gradients" title=" Gradients"> Gradients</a> </p> <a href="https://publications.waset.org/abstracts/19031/variable-fidelity-surrogate-modelling-with-kriging" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19031.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">558</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">829</span> The Perceptions of Students in Tourism and Hospitality in Relation to the Pursuit of Higher Degrees: A Case of Walter Sisulu University</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adelaide%20Rethabile%20Motshabi%20Pitso-Mbili">Adelaide Rethabile Motshabi Pitso-Mbili</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Higher education institutions (HEIs) are under pressure in producing PhD graduates so that they can position themselves higher in terms of rankings. However, hospitality and tourism higher degree enrolment numbers are very low within South African universities. Furthermore, hospitality and tourism students choose these fields of study because they want to travel, be social, and have fun. Students in higher education are anxious about their future after studies as they are particularly worried about the job conditions in the hospitality and tourism sector, the remuneration, and the status perceptions of many jobs in the sector. Hence, there is a need for a continuous increase in the level of education with the formation of professional aptitudes and personnel quality. In order to understand the reasons for low enrolments, this study aims to explore the perceptions of the final year in tourism and hospitality diploma students towards enrolling for higher degree qualifications after their graduation. This paper utilised a quantitative research method, and data was gathered through questionnaires. In addition, the Linkert scale design was used for questionnaires. The questionnaires were distributed to 137 hospitality and tourism students who are on their exit level at Walter Sisulu University. SPSS was used to analyse data. The findings revealed that students do not wish to continue studying for higher degrees as they believe higher degrees are not important for the industry. Furthermore, families already have financial expectations as they think one qualification is enough. In addition, some students mentioned that they would love to study further, but lack of funding is a problem since NSFAS only funds the first qualification. Thus, it is recommended that students are made aware of the benefits and opportunities available after obtaining higher degrees. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hospitality%20and%20tourism%20education" title="hospitality and tourism education">hospitality and tourism education</a>, <a href="https://publications.waset.org/abstracts/search?q=higher%20degrees" title=" higher degrees"> higher degrees</a>, <a href="https://publications.waset.org/abstracts/search?q=higher%20education" title=" higher education"> higher education</a>, <a href="https://publications.waset.org/abstracts/search?q=student%E2%80%99s%20perceptions" title=" student’s perceptions"> student’s perceptions</a>, <a href="https://publications.waset.org/abstracts/search?q=hospitality%20and%20tourism%20sector" title=" hospitality and tourism sector"> hospitality and tourism sector</a> </p> <a href="https://publications.waset.org/abstracts/151525/the-perceptions-of-students-in-tourism-and-hospitality-in-relation-to-the-pursuit-of-higher-degrees-a-case-of-walter-sisulu-university" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/151525.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">117</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">828</span> Experimental Investigation of Boundary Layer Instability and Transition on a Rotating Parabola in Axial Flow</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ali%20Kargar">Ali Kargar</a>, <a href="https://publications.waset.org/abstracts/search?q=Kamyar%20Mansour"> Kamyar Mansour</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper the boundary layer instability and transition on a rotating parabola which is sheathed shape on a rotating 30 degrees total apex angle cone have been study by smoke visualization. The rotating cone especially 30 degrees total apex angle is a well-established subject in some previous novel works and also in our previous works. But in this paper a stabilizing effect is detected by the bluntness of nose and also surface curvature. A parabola model which is satisfying those conditions (sheathed parabola of the 30 degrees cone) has been built and studied in the wind tunnel. The results are shown that the boundary layer transition occurs at higher rotational Reynolds number in comparison by the cone. The results are shown in the visualization pictures and also are compared graphically. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=transitional%20Reynolds%20number" title="transitional Reynolds number">transitional Reynolds number</a>, <a href="https://publications.waset.org/abstracts/search?q=wind%20tunnel" title=" wind tunnel"> wind tunnel</a>, <a href="https://publications.waset.org/abstracts/search?q=smoke%20visualization" title=" smoke visualization"> smoke visualization</a>, <a href="https://publications.waset.org/abstracts/search?q=rotating%20parabola" title=" rotating parabola"> rotating parabola</a> </p> <a href="https://publications.waset.org/abstracts/36194/experimental-investigation-of-boundary-layer-instability-and-transition-on-a-rotating-parabola-in-axial-flow" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36194.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">416</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">827</span> A Survey on How Faculty Perceive and Quest for Modes of Internationalization in a Private Higher Education Institution</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hanife%20Akar">Hanife Akar</a>, <a href="https://publications.waset.org/abstracts/search?q=Basak%20Calik"> Basak Calik</a>, <a href="https://publications.waset.org/abstracts/search?q=Gulcin%20Gulmez-Dag"> Gulcin Gulmez-Dag</a>, <a href="https://publications.waset.org/abstracts/search?q=Elanur%20Yilmaz"> Elanur Yilmaz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Internationalization in higher education (IHE) has been a longstanding issue in the Western World but its impact has travelled beyond its borders. As a developing country, universities in Turkey also have put into their agendas strategic plans for IHE to compete with global trends and benchmarked universities. The purpose of this study was to explore how faculty in a private university in Mid Anatolia would like see modes of internationalization in their institution through a survey design and understand their quest for internationalization. Findings indicate that participants (N=49) are internationalized in different ways, from holding international Ph.D. degrees to postdoctoral degrees, or being international faculty themselves. Participants’ visions seem to be affected by the type of programs they are in, and many consider being a part of an international joint program or having international students and faculty are an essential component in IHE. In addition to holding joints degrees, and exchange or international human sources, participants quest for more collaboration for R&D, more comparative research opportunities, and examine or develop curricula from a global perspective. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=faculty" title="faculty">faculty</a>, <a href="https://publications.waset.org/abstracts/search?q=higher%20education" title=" higher education"> higher education</a>, <a href="https://publications.waset.org/abstracts/search?q=internationalization" title=" internationalization"> internationalization</a>, <a href="https://publications.waset.org/abstracts/search?q=visions" title=" visions"> visions</a> </p> <a href="https://publications.waset.org/abstracts/70334/a-survey-on-how-faculty-perceive-and-quest-for-modes-of-internationalization-in-a-private-higher-education-institution" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/70334.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">246</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=vertex%20degrees&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=vertex%20degrees&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=vertex%20degrees&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=vertex%20degrees&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=vertex%20degrees&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=vertex%20degrees&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=vertex%20degrees&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=vertex%20degrees&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=vertex%20degrees&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=vertex%20degrees&page=28">28</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=vertex%20degrees&page=29">29</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=vertex%20degrees&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>