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: Hamiltonian cycle</title> <meta name="description" content="Search results for: Hamiltonian cycle"> <meta name="keywords" content="Hamiltonian cycle"> <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="Hamiltonian cycle" 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="Hamiltonian cycle"> <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> 2096</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: Hamiltonian cycle</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2096</span> A Further Study on the 4-Ordered Property of Some Chordal Ring Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shin-Shin%20Kao">Shin-Shin Kao</a>, <a href="https://publications.waset.org/abstracts/search?q=Hsiu-Chunj%20Pan"> Hsiu-Chunj Pan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Given a graph G. A cycle of G is a sequence of vertices of G such that the first and the last vertices are the same. A hamiltonian cycle of G is a cycle containing all vertices of G. The graph G is k-ordered (resp. k-ordered hamiltonian) if for any sequence of k distinct vertices of G, there exists a cycle (resp. hamiltonian cycle) in G containing these k vertices in the specified order. Obviously, any cycle in a graph is 1-ordered, 2-ordered and 3-ordered. Thus the study of any graph being k-ordered (resp. k-ordered hamiltonian) always starts with k = 4. Most studies about this topic work on graphs with no real applications. To our knowledge, the chordal ring families were the first one utilized as the underlying topology in interconnection networks and shown to be 4-ordered [1]. Furthermore, based on computer experimental results in [1], it was conjectured that some of them are 4-ordered hamiltonian. In this paper, we intend to give some possible directions in proving the conjecture. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hamiltonian%20cycle" title="Hamiltonian cycle">Hamiltonian cycle</a>, <a href="https://publications.waset.org/abstracts/search?q=4-ordered" title=" 4-ordered"> 4-ordered</a>, <a href="https://publications.waset.org/abstracts/search?q=Chordal%20rings" title=" Chordal rings"> Chordal rings</a>, <a href="https://publications.waset.org/abstracts/search?q=3-regular" title=" 3-regular"> 3-regular</a> </p> <a href="https://publications.waset.org/abstracts/13946/a-further-study-on-the-4-ordered-property-of-some-chordal-ring-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13946.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">434</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">2095</span> Hamiltonian Paths and Cycles Passing through Prescribed Edges in the Balanced Hypercubes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dongqin%20Cheng">Dongqin Cheng</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The n-dimensional balanced hypercube BHn (n ≥ 1) has been proved to be a bipartite graph. Let P be a set of edges whose induced subgraph consists of pairwise vertex-disjoint paths. For any two vertices u, v from different partite sets of V (BHn). In this paper, we prove that if |P| ≤ 2n − 2 and the subgraph induced by P has neither u nor v as internal vertices, or both of u and v as end-vertices, then BHn contains a Hamiltonian path joining u and v passing through P. As a corollary, if |P| ≤ 2n−1, then the BHn contains a Hamiltonian cycle passing through P. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=interconnection%20network" title="interconnection network">interconnection network</a>, <a href="https://publications.waset.org/abstracts/search?q=balanced%20hypercube" title=" balanced hypercube"> balanced hypercube</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamiltonian%20cycle" title=" Hamiltonian cycle"> Hamiltonian cycle</a>, <a href="https://publications.waset.org/abstracts/search?q=prescribed%20edges" title=" prescribed edges"> prescribed edges</a> </p> <a href="https://publications.waset.org/abstracts/75134/hamiltonian-paths-and-cycles-passing-through-prescribed-edges-in-the-balanced-hypercubes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/75134.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">205</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2094</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">2093</span> Constructing Orthogonal De Bruijn and Kautz Sequences and Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yaw-Ling%20Lin">Yaw-Ling Lin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A de Bruijn graph of order k is a graph whose vertices representing all length-k sequences with edges joining pairs of vertices whose sequences have maximum possible overlap (length k−1). Every Hamiltonian cycle of this graph defines a distinct, minimum length de Bruijn sequence containing all k-mers exactly once. A Kautz sequence is the minimal generating sequence so as the sequence of minimal length that produces all possible length-k sequences with the restriction that every two consecutive alphabets in the sequences must be different. A collection of de Bruijn/Kautz sequences are orthogonal if any two sequences are of maximally differ in sequence composition; that is, the maximum length of their common substring is k. In this paper, we discuss how such a collection of (maximal) orthogonal de Bruijn/Kautz sequences can be made and use the algorithm to build up a web application service for the synthesized DNA and other related biomolecular sequences. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=biomolecular%20sequence%20synthesis" title="biomolecular sequence synthesis">biomolecular sequence synthesis</a>, <a href="https://publications.waset.org/abstracts/search?q=de%20Bruijn%20sequences" title=" de Bruijn sequences"> de Bruijn sequences</a>, <a href="https://publications.waset.org/abstracts/search?q=Eulerian%20cycle" title=" Eulerian cycle"> Eulerian cycle</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamiltonian%20cycle" title=" Hamiltonian cycle"> Hamiltonian cycle</a>, <a href="https://publications.waset.org/abstracts/search?q=Kautz%20sequences" title=" Kautz sequences"> Kautz sequences</a>, <a href="https://publications.waset.org/abstracts/search?q=orthogonal%20sequences" title=" orthogonal sequences"> orthogonal sequences</a> </p> <a href="https://publications.waset.org/abstracts/121912/constructing-orthogonal-de-bruijn-and-kautz-sequences-and-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/121912.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">167</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">2092</span> Quantum Dynamics for General Time-Dependent Three Coupled Oscillators</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Salah%20Menouar">Salah Menouar</a>, <a href="https://publications.waset.org/abstracts/search?q=Sara%20Hassoul"> Sara Hassoul</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The dynamic of time-dependent three coupled oscillators is studied through an approach based on decoupling of them using the unitary transformation method. From a first unitary transformation, the Hamiltonian of the complicated original system is transformed to an equal but a simple one associated with the three coupled oscillators of which masses are unity. Finally, we diagonalize the matrix representation of the transformed hamiltonian by using a unitary matrix. The diagonalized Hamiltonian is just the same as the Hamiltonian of three simple oscillators. Through these procedures, the coupled oscillatory subsystems are completely decoupled. From this uncouplement, we can develop complete dynamics of the whole system in an easy way by just examining each oscillator independently. Such a development of the mechanical theory can be done regardless of the complication of the parameters' variations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=schr%C3%B6dinger%20equation" title="schrödinger equation">schrödinger equation</a>, <a href="https://publications.waset.org/abstracts/search?q=hamiltonian" title=" hamiltonian"> hamiltonian</a>, <a href="https://publications.waset.org/abstracts/search?q=time-dependent%20three%20coupled%20oscillators" title=" time-dependent three coupled oscillators"> time-dependent three coupled oscillators</a>, <a href="https://publications.waset.org/abstracts/search?q=unitary%20transformation" title=" unitary transformation"> unitary transformation</a> </p> <a href="https://publications.waset.org/abstracts/157908/quantum-dynamics-for-general-time-dependent-three-coupled-oscillators" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/157908.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">98</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">2091</span> A Variant of a Double Structure-Preserving QR Algorithm for Symmetric and Hamiltonian Matrices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Salam">Ahmed Salam</a>, <a href="https://publications.waset.org/abstracts/search?q=Haithem%20Benkahla"> Haithem Benkahla</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, an efficient backward-stable algorithm for computing eigenvalues and vectors of a symmetric and Hamiltonian matrix has been proposed. The method preserves the symmetric and Hamiltonian structures of the original matrix, during the whole process. In this paper, we revisit the method. We derive a way for implementing the reduction of the matrix to the appropriate condensed form. Then, we construct a novel version of the implicit QR-algorithm for computing the eigenvalues and vectors. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=block%20implicit%20QR%20algorithm" title="block implicit QR algorithm">block implicit QR algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=preservation%20of%20a%20double%20structure" title=" preservation of a double structure"> preservation of a double structure</a>, <a href="https://publications.waset.org/abstracts/search?q=QR%20algorithm" title=" QR algorithm"> QR algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20and%20Hamiltonian%20structures" title=" symmetric and Hamiltonian structures"> symmetric and Hamiltonian structures</a> </p> <a href="https://publications.waset.org/abstracts/61018/a-variant-of-a-double-structure-preserving-qr-algorithm-for-symmetric-and-hamiltonian-matrices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/61018.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">409</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">2090</span> Lyapunov Type Inequalities for Fractional Impulsive Hamiltonian Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kazem%20Ghanbari">Kazem Ghanbari</a>, <a href="https://publications.waset.org/abstracts/search?q=Yousef%20Gholami"> Yousef Gholami</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with study about fractional order impulsive Hamiltonian systems and fractional impulsive Sturm-Liouville type problems derived from these systems. The main purpose of this paper devotes to obtain so called Lyapunov type inequalities for mentioned problems. Also, in view point on applicability of obtained inequalities, some qualitative properties such as stability, disconjugacy, nonexistence and oscillatory behaviour of fractional Hamiltonian systems and fractional Sturm-Liouville type problems under impulsive conditions will be derived. At the end, we want to point out that for studying fractional order Hamiltonian systems, we will apply recently introduced fractional Conformable operators. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fractional%20derivatives%20and%20integrals" title="fractional derivatives and integrals">fractional derivatives and integrals</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamiltonian%20system" title=" Hamiltonian system"> Hamiltonian system</a>, <a href="https://publications.waset.org/abstracts/search?q=Lyapunov-type%20inequalities" title=" Lyapunov-type inequalities"> Lyapunov-type inequalities</a>, <a href="https://publications.waset.org/abstracts/search?q=stability" title=" stability"> stability</a>, <a href="https://publications.waset.org/abstracts/search?q=disconjugacy" title=" disconjugacy"> disconjugacy</a> </p> <a href="https://publications.waset.org/abstracts/48806/lyapunov-type-inequalities-for-fractional-impulsive-hamiltonian-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48806.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">356</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">2089</span> The Structure of Invariant Manifolds after a Supercritical Hamiltonian Hopf Bifurcation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Matthaios%20Katsanikas">Matthaios Katsanikas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We study the structure of the invariant manifolds of complex unstable periodic orbits of a family of periodic orbits, in a 3D autonomous Hamiltonian system of galactic type, after a transition of this family from stability to complex instability (Hamiltonian Hopf bifurcation). We consider the case of a supercritical Hamiltonian Hopf bifurcation. The invariant manifolds of complex unstable periodic orbits have two kinds of structures. The first kind is represented by a disk confined structure on the 4D space of section. The second kind is represented by a complicated central tube structure that is associated with an extended network of tube structures, strips and flat structures of sheet type on the 4D space of section. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamical%20systems" title="dynamical systems">dynamical systems</a>, <a href="https://publications.waset.org/abstracts/search?q=galactic%20dynamics" title=" galactic dynamics"> galactic dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=chaos" title=" chaos"> chaos</a>, <a href="https://publications.waset.org/abstracts/search?q=phase%20space" title=" phase space"> phase space</a> </p> <a href="https://publications.waset.org/abstracts/125080/the-structure-of-invariant-manifolds-after-a-supercritical-hamiltonian-hopf-bifurcation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/125080.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">139</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">2088</span> Study of the Ambiguity of Effective Hamiltonian for the Fundamental Degenerate States V3 of the Molecule 12CD4</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ouardi%20Okkacha">Ouardi Okkacha</a>, <a href="https://publications.waset.org/abstracts/search?q=Kaarour%20Abedlkrim"> Kaarour Abedlkrim</a>, <a href="https://publications.waset.org/abstracts/search?q=Meskine%20Mohamed"> Meskine Mohamed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The effective Hamiltonians are widely used in molecular spectroscopy for the interpretation of the vibration-rotation spectra. Their construction is an ambiguous procedure due to the existence of unitary transformations that change the effective Hamiltonian but do not change its eigenvalues. As a consequence of this ambiguity, it may happen that some parameters of effective Hamiltonians cannot be recovered from experimental data in a unique way. The type of admissible transformations which keeps the operator form of the effective Hamiltonian unaltered and the number of empirically determinable parameters strongly depend on the symmetry type of a molecule (asymmetric top, spherical top, and so on) and on the degeneracy of the vibrational state. In this work, we report the study of the ambiguity of effective Hamiltonian for the fundamental degenerate states v3 of the Molecule 12CD4. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=12CD4" title="12CD4">12CD4</a>, <a href="https://publications.waset.org/abstracts/search?q=high-resolution%20infrared%20spectra" title=" high-resolution infrared spectra"> high-resolution infrared spectra</a>, <a href="https://publications.waset.org/abstracts/search?q=tetrahedral%20tensorial%20formalism" title=" tetrahedral tensorial formalism"> tetrahedral tensorial formalism</a>, <a href="https://publications.waset.org/abstracts/search?q=vibrational%20states" title=" vibrational states"> vibrational states</a>, <a href="https://publications.waset.org/abstracts/search?q=rovibrational%20line%20position%20analysis" title=" rovibrational line position analysis"> rovibrational line position analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=XTDS" title=" XTDS"> XTDS</a>, <a href="https://publications.waset.org/abstracts/search?q=SPVIEW" title=" SPVIEW"> SPVIEW</a> </p> <a href="https://publications.waset.org/abstracts/19399/study-of-the-ambiguity-of-effective-hamiltonian-for-the-fundamental-degenerate-states-v3-of-the-molecule-12cd4" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19399.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">415</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">2087</span> Quantum Mechanics Approach for Ruin Probability</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmet%20Kaya">Ahmet Kaya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Incoming cash flows and outgoing claims play an important role to determine how is companies’ profit or loss. In this matter, ruin probability provides to describe vulnerability of the companies against ruin. Quantum mechanism is one of the significant approaches to model ruin probability as stochastically. Using the Hamiltonian method, we have performed formalisation of quantum mechanics < x|e-ᵗᴴ|x' > and obtained the transition probability of 2x2 and 3x3 matrix as traditional and eigenvector basis where A is a ruin operator and H|x' > is a Schroedinger equation. This operator A and Schroedinger equation are defined by a Hamiltonian matrix H. As a result, probability of not to be in ruin can be simulated and calculated as stochastically. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ruin%20probability" title="ruin probability">ruin probability</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20mechanics" title=" quantum mechanics"> quantum mechanics</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamiltonian%20technique" title=" Hamiltonian technique"> Hamiltonian technique</a>, <a href="https://publications.waset.org/abstracts/search?q=operator%20approach" title=" operator approach"> operator approach</a> </p> <a href="https://publications.waset.org/abstracts/53562/quantum-mechanics-approach-for-ruin-probability" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/53562.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">2086</span> On Chvátal’s Conjecture for the Hamiltonicity of 1-Tough 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=Shin-Shin%20Kao">Shin-Shin Kao</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuan-Kang%20Shih"> Yuan-Kang Shih</a>, <a href="https://publications.waset.org/abstracts/search?q=Hsun%20Su"> Hsun Su</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we show that the conjecture of Chv tal, which states that any 1-tough graph is either a Hamiltonian graph or its complement contains a specific graph denoted by F, does not hold in general. More precisely, it is true only for graphs with six or seven vertices, and is false for graphs with eight or more vertices. A theorem is derived as a correction for the conjecture. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=complement" title="complement">complement</a>, <a href="https://publications.waset.org/abstracts/search?q=degree%20sum" title=" degree sum"> degree sum</a>, <a href="https://publications.waset.org/abstracts/search?q=hamiltonian" title=" hamiltonian"> hamiltonian</a>, <a href="https://publications.waset.org/abstracts/search?q=tough" title=" tough"> tough</a> </p> <a href="https://publications.waset.org/abstracts/78455/on-chvatals-conjecture-for-the-hamiltonicity-of-1-tough-graphs-and-their-complements" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/78455.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">289</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2085</span> A Lagrangian Hamiltonian Computational Method for Hyper-Elastic Structural Dynamics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hosein%20Falahaty">Hosein Falahaty</a>, <a href="https://publications.waset.org/abstracts/search?q=Hitoshi%20Gotoh"> Hitoshi Gotoh</a>, <a href="https://publications.waset.org/abstracts/search?q=Abbas%20Khayyer"> Abbas Khayyer</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Performance of a Hamiltonian based particle method in simulation of nonlinear structural dynamics is subjected to investigation in terms of stability and accuracy. The governing equation of motion is derived based on Hamilton's principle of least action, while the deformation gradient is obtained according to Weighted Least Square method. The hyper-elasticity models of Saint Venant-Kirchhoff and a compressible version similar to Mooney- Rivlin are engaged for the calculation of second Piola-Kirchhoff stress tensor, respectively. Stability along with accuracy of numerical model is verified by reproducing critical stress fields in static and dynamic responses. As the results, although performance of Hamiltonian based model is evaluated as being acceptable in dealing with intense extensional stress fields, however kinds of instabilities reveal in the case of violent collision which can be most likely attributed to zero energy singular modes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hamilton%27s%20principle%20of%20least%20action" title="Hamilton's principle of least action">Hamilton's principle of least action</a>, <a href="https://publications.waset.org/abstracts/search?q=particle-based%20method" title=" particle-based method"> particle-based method</a>, <a href="https://publications.waset.org/abstracts/search?q=hyper-elasticity" title=" hyper-elasticity"> hyper-elasticity</a>, <a href="https://publications.waset.org/abstracts/search?q=analysis%20of%20stability" title=" analysis of stability"> analysis of stability</a> </p> <a href="https://publications.waset.org/abstracts/50921/a-lagrangian-hamiltonian-computational-method-for-hyper-elastic-structural-dynamics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50921.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">2084</span> Theoretical Analysis of Photoassisted Field Emission near the Metal Surface Using Transfer Hamiltonian Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rosangliana%20Chawngthu">Rosangliana Chawngthu</a>, <a href="https://publications.waset.org/abstracts/search?q=Ramkumar%20K.%20Thapa"> Ramkumar K. Thapa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A model calculation of photoassisted field emission current (PFEC) by using transfer Hamiltonian method will be present here. When the photon energy is incident on the surface of the metals, such that the energy of a photon is usually less than the work function of the metal under investigation. The incident radiation photo excites the electrons to a final state which lies below the vacuum level; the electrons are confined within the metal surface. A strong static electric field is then applied to the surface of the metal which causes the photoexcited electrons to tunnel through the surface potential barrier into the vacuum region and constitutes the considerable current called photoassisted field emission current. The incident radiation is usually a laser beam, causes the transition of electrons from the initial state to the final state and the matrix element for this transition will be written. For the calculation of PFEC, transfer Hamiltonian method is used. The initial state wavefunction is calculated by using Kronig-Penney potential model. The effect of the matrix element will also be studied. An appropriate dielectric model for the surface region of the metal will be used for the evaluation of vector potential. FORTRAN programme is used for the calculation of PFEC. The results will be checked with experimental data and the theoretical results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=photoassisted%20field%20emission" title="photoassisted field emission">photoassisted field emission</a>, <a href="https://publications.waset.org/abstracts/search?q=transfer%20Hamiltonian" title=" transfer Hamiltonian"> transfer Hamiltonian</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20potential" title=" vector potential"> vector potential</a>, <a href="https://publications.waset.org/abstracts/search?q=wavefunction" title=" wavefunction"> wavefunction</a> </p> <a href="https://publications.waset.org/abstracts/78831/theoretical-analysis-of-photoassisted-field-emission-near-the-metal-surface-using-transfer-hamiltonian-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/78831.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">226</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">2083</span> Detailed Quantum Circuit Design and Evaluation of Grover's Algorithm for the Bounded Degree Traveling Salesman Problem Using the Q# Language</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wenjun%20Hou">Wenjun Hou</a>, <a href="https://publications.waset.org/abstracts/search?q=Marek%20Perkowski"> Marek Perkowski</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Traveling Salesman problem is famous in computing and graph theory. In short, it asks for the Hamiltonian cycle of the least total weight in a given graph with N nodes. All variations on this problem, such as those with K-bounded-degree nodes, are classified as NP-complete in classical computing. Although several papers propose theoretical high-level designs of quantum algorithms for the Traveling Salesman Problem, no quantum circuit implementation of these algorithms has been created up to our best knowledge. In contrast to previous papers, the goal of this paper is not to optimize some abstract complexity measures based on the number of oracle iterations, but to be able to evaluate the real circuit and time costs of the quantum computer. Using the emerging quantum programming language Q# developed by Microsoft, which runs quantum circuits in a quantum computer simulation, an implementation of the bounded-degree problem and its respective quantum circuit were created. To apply Grover’s algorithm to this problem, a quantum oracle was designed, evaluating the cost of a particular set of edges in the graph as well as its validity as a Hamiltonian cycle. Repeating the Grover algorithm with an oracle that finds successively lower cost each time allows to transform the decision problem to an optimization problem, finding the minimum cost of Hamiltonian cycles. N log₂ K qubits are put into an equiprobablistic superposition by applying the Hadamard gate on each qubit. Within these N log₂ K qubits, the method uses an encoding in which every node is mapped to a set of its encoded edges. The oracle consists of several blocks of circuits: a custom-written edge weight adder, node index calculator, uniqueness checker, and comparator, which were all created using only quantum Toffoli gates, including its special forms, which are Feynman and Pauli X. The oracle begins by using the edge encodings specified by the qubits to calculate each node that this path visits and adding up the edge weights along the way. Next, the oracle uses the calculated nodes from the previous step and check that all the nodes are unique. Finally, the oracle checks that the calculated cost is less than the previously-calculated cost. By performing the oracle an optimal number of times, a correct answer can be generated with very high probability. The oracle of the Grover Algorithm is modified using the recalculated minimum cost value, and this procedure is repeated until the cost cannot be further reduced. This algorithm and circuit design have been verified, using several datasets, to generate correct outputs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20computing" title="quantum computing">quantum computing</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20circuit%20optimization" title=" quantum circuit optimization"> quantum circuit optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20algorithms" title=" quantum algorithms"> quantum algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20quantum%20algorithms" title=" hybrid quantum algorithms"> hybrid quantum algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20programming" title=" quantum programming"> quantum programming</a>, <a href="https://publications.waset.org/abstracts/search?q=Grover%E2%80%99s%20algorithm" title=" Grover’s algorithm"> Grover’s algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=traveling%20salesman%20problem" title=" traveling salesman problem"> traveling salesman problem</a>, <a href="https://publications.waset.org/abstracts/search?q=bounded-degree%20TSP" title=" bounded-degree TSP"> bounded-degree TSP</a>, <a href="https://publications.waset.org/abstracts/search?q=minimal%20cost" title=" minimal cost"> minimal cost</a>, <a href="https://publications.waset.org/abstracts/search?q=Q%23%20language" title=" Q# language"> Q# language</a> </p> <a href="https://publications.waset.org/abstracts/111077/detailed-quantum-circuit-design-and-evaluation-of-grovers-algorithm-for-the-bounded-degree-traveling-salesman-problem-using-the-q-language" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/111077.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">190</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">2082</span> Reliability-Based Life-Cycle Cost Model for Engineering Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Reza%20Lotfalian">Reza Lotfalian</a>, <a href="https://publications.waset.org/abstracts/search?q=Sudarshan%20Martins"> Sudarshan Martins</a>, <a href="https://publications.waset.org/abstracts/search?q=Peter%20Radziszewski"> Peter Radziszewski</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The effect of reliability on life-cycle cost, including initial and maintenance cost of a system is studied. The failure probability of a component is used to calculate the average maintenance cost during the operation cycle of the component. The standard deviation of the life-cycle cost is also calculated as an error measure for the average life-cycle cost. As a numerical example, the model is used to study the average life cycle cost of an electric motor. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=initial%20cost" title="initial cost">initial cost</a>, <a href="https://publications.waset.org/abstracts/search?q=life-cycle%20cost" title=" life-cycle cost"> life-cycle cost</a>, <a href="https://publications.waset.org/abstracts/search?q=maintenance%20cost" title=" maintenance cost"> maintenance cost</a>, <a href="https://publications.waset.org/abstracts/search?q=reliability" title=" reliability"> reliability</a> </p> <a href="https://publications.waset.org/abstracts/11947/reliability-based-life-cycle-cost-model-for-engineering-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/11947.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">605</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">2081</span> Quantum Mechanism Approach for Non-Ruin Probability and Comparison of Path Integral Method and Stochastic Simulations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmet%20Kaya">Ahmet Kaya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quantum mechanism is one of the most important approaches to calculating non-ruin probability. We apply standard Dirac notation to model given Hamiltonians. By using the traditional method and eigenvector basis, non-ruin probability is found for several examples. Also, non-ruin probability is calculated for two different Hamiltonian by using the tensor product. Finally, the path integral method is applied to the examples and comparison is made for stochastic simulations and path integral calculation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20physics" title="quantum physics">quantum physics</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamiltonian%20system" title=" Hamiltonian system"> Hamiltonian system</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20integral" title=" path integral"> path integral</a>, <a href="https://publications.waset.org/abstracts/search?q=tensor%20product" title=" tensor product"> tensor product</a>, <a href="https://publications.waset.org/abstracts/search?q=ruin%20probability" title=" ruin probability"> ruin probability</a> </p> <a href="https://publications.waset.org/abstracts/56920/quantum-mechanism-approach-for-non-ruin-probability-and-comparison-of-path-integral-method-and-stochastic-simulations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/56920.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">334</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">2080</span> Applying Different Working Fluids in a Combined Power and Ejector Refrigeration Cycle with Low Temperature Heat Sources </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Samad%20Jafarmadar">Samad Jafarmadar</a>, <a href="https://publications.waset.org/abstracts/search?q=Amin%20Habibzadeh"> Amin Habibzadeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A power and cooling cycle, which combines the organic Rankine cycle and the ejector refrigeration cycle supplied by waste heat energy sources, is discussed in this paper. 13 working fluids including wet, dry, and isentropic fluids are studied in order to find their performances on the combined cycle. Various operating conditions’ effects on the proposed cycle are examined by fixing power/refrigeration ratio. According to the results, dry and isentropic fluids have better performance compared with wet fluids. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=combined%20power%20and%20refrigeration%20cycle" title="combined power and refrigeration cycle">combined power and refrigeration cycle</a>, <a href="https://publications.waset.org/abstracts/search?q=low%20temperature%20heat%20sources" title=" low temperature heat sources"> low temperature heat sources</a>, <a href="https://publications.waset.org/abstracts/search?q=organic%20rankine%20cycle" title=" organic rankine cycle"> organic rankine cycle</a>, <a href="https://publications.waset.org/abstracts/search?q=working%20fluids" title=" working fluids"> working fluids</a> </p> <a href="https://publications.waset.org/abstracts/74101/applying-different-working-fluids-in-a-combined-power-and-ejector-refrigeration-cycle-with-low-temperature-heat-sources" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/74101.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">270</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">2079</span> Hamiltonian Related Properties with and without Faults of the Dual-Cube Interconnection Network and Their Variations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shih-Yan%20Chen">Shih-Yan Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Shin-Shin%20Kao"> Shin-Shin Kao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a thorough review about dual-cubes, DCn, the related studies and their variations are given. DCn was introduced to be a network which retains the pleasing properties of hypercube Qn but has a much smaller diameter. In fact, it is so constructed that the number of vertices of DCn is equal to the number of vertices of Q2n +1. However, each vertex in DCn is adjacent to n + 1 neighbors and so DCn has (n + 1) × 2^2n edges in total, which is roughly half the number of edges of Q2n+1. In addition, the diameter of any DCn is 2n +2, which is of the same order of that of Q2n+1. For selfcompleteness, basic definitions, construction rules and symbols are provided. We chronicle the results, where eleven significant theorems are presented, and include some open problems at the end. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dual-cubes" title="dual-cubes">dual-cubes</a>, <a href="https://publications.waset.org/abstracts/search?q=dual-cube%20extensive%20networks" title=" dual-cube extensive networks"> dual-cube extensive networks</a>, <a href="https://publications.waset.org/abstracts/search?q=dual-cube-like%20networks" title=" dual-cube-like networks"> dual-cube-like networks</a>, <a href="https://publications.waset.org/abstracts/search?q=hypercubes" title=" hypercubes"> hypercubes</a>, <a href="https://publications.waset.org/abstracts/search?q=fault-tolerant%20hamiltonian%20property" title=" fault-tolerant hamiltonian property"> fault-tolerant hamiltonian property</a> </p> <a href="https://publications.waset.org/abstracts/39202/hamiltonian-related-properties-with-and-without-faults-of-the-dual-cube-interconnection-network-and-their-variations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39202.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">470</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">2078</span> 1D Klein-Gordon Equation in an Infinite Square Well with PT Symmetry Boundary Conditions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Suleiman%20Bashir%20Adamu">Suleiman Bashir Adamu</a>, <a href="https://publications.waset.org/abstracts/search?q=Lawan%20Sani%20Taura"> Lawan Sani Taura</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We study the role of boundary conditions via -symmetric quantum mechanics, where denotes parity operator and denotes time reversal operator. Using the one-dimensional Schrödinger Hamiltonian for a free particle in an infinite square well, we introduce symmetric boundary conditions. We find solutions of the 1D Klein-Gordon equation for a free particle in an infinite square well with Hermitian boundary and symmetry boundary conditions, where in both cases the energy eigenvalues and eigenfunction, respectively, are obtained. <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=Eigenfunction" title=" Eigenfunction"> Eigenfunction</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamiltonian" title=" Hamiltonian"> Hamiltonian</a>, <a href="https://publications.waset.org/abstracts/search?q=Klein-%20Gordon%20equation" title=" Klein- Gordon equation"> Klein- Gordon equation</a>, <a href="https://publications.waset.org/abstracts/search?q=PT-symmetric%20quantum%20mechanics" title=" PT-symmetric quantum mechanics"> PT-symmetric quantum mechanics</a> </p> <a href="https://publications.waset.org/abstracts/50876/1d-klein-gordon-equation-in-an-infinite-square-well-with-pt-symmetry-boundary-conditions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50876.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">2077</span> Analysis of the Result for the Accelerated Life Cycle Test of the Motor for Washing Machine by Using Acceleration Factor</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Youn-Sung%20Kim">Youn-Sung Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Jin-Ho%20Jo"> Jin-Ho Jo</a>, <a href="https://publications.waset.org/abstracts/search?q=Mi-Sung%20Kim"> Mi-Sung Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Jae-Kun%20Lee"> Jae-Kun Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Accelerated life cycle test is applied to various products or components in order to reduce the time of life cycle test in industry. It must be considered for many test conditions according to the product characteristics for the test and the selection of acceleration parameter is especially very important. We have carried out the general life cycle test and the accelerated life cycle test by applying the acceleration factor (AF) considering the characteristics of brushless DC (BLDC) motor for washing machine. The final purpose of this study is to verify the validity by analyzing the results of the general life cycle test and the accelerated life cycle test. It will make it possible to reduce the life test time through the reasonable accelerated life cycle test. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=accelerated%20life%20cycle%20test" title="accelerated life cycle test">accelerated life cycle test</a>, <a href="https://publications.waset.org/abstracts/search?q=reliability%20test" title=" reliability test"> reliability test</a>, <a href="https://publications.waset.org/abstracts/search?q=motor%20for%20washing%20machine" title=" motor for washing machine"> motor for washing machine</a>, <a href="https://publications.waset.org/abstracts/search?q=brushless%20dc%20motor%20test" title=" brushless dc motor test"> brushless dc motor test</a> </p> <a href="https://publications.waset.org/abstracts/68978/analysis-of-the-result-for-the-accelerated-life-cycle-test-of-the-motor-for-washing-machine-by-using-acceleration-factor" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/68978.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">611</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">2076</span> Monte Carlo Simulation of Magnetic Properties in Bit Patterned Media</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=O.%20D.%20Arbel%C3%A1ez-Echeverri">O. D. Arbeláez-Echeverri</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Restrepo-Parra"> E. Restrepo-Parra</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20C.%20Riano-Rojas"> J. C. Riano-Rojas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A two dimensional geometric model of Bit Patterned Media is proposed, the model is based on the crystal structure of the materials commonly used to produce the nano islands in bit patterned materials and the possible defects that may arise from the interaction between the nano islands and the matrix material. The dynamic magnetic properties of the material are then computed using time aware integration methods for the multi spin Hamiltonian. The Hamiltonian takes into account both the spatial and topological disorder of the sample as well as the high perpendicular anisotropy that is pursued when building bit patterned media. The main finding of the research was the possibility of replicating the results of previous experiments on similar materials and the ability of computing the switching field distribution given the geometry of the material and the parameters required by the model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nanostructures" title="nanostructures">nanostructures</a>, <a href="https://publications.waset.org/abstracts/search?q=Monte%20Carlo" title=" Monte Carlo"> Monte Carlo</a>, <a href="https://publications.waset.org/abstracts/search?q=pattern%20media" title=" pattern media"> pattern media</a>, <a href="https://publications.waset.org/abstracts/search?q=magnetic%20properties" title=" magnetic properties"> magnetic properties</a> </p> <a href="https://publications.waset.org/abstracts/29242/monte-carlo-simulation-of-magnetic-properties-in-bit-patterned-media" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29242.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">503</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2075</span> Mapping Tunnelling Parameters for Global Optimization in Big Data via Dye Laser Simulation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sahil%20Imtiyaz">Sahil Imtiyaz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the biggest challenges has emerged from the ever-expanding, dynamic, and instantaneously changing space-Big Data; and to find a data point and inherit wisdom to this space is a hard task. In this paper, we reduce the space of big data in Hamiltonian formalism that is in concordance with Ising Model. For this formulation, we simulate the system using dye laser in FORTRAN and analyse the dynamics of the data point in energy well of rhodium atom. After mapping the photon intensity and pulse width with energy and potential we concluded that as we increase the energy there is also increase in probability of tunnelling up to some point and then it starts decreasing and then shows a randomizing behaviour. It is due to decoherence with the environment and hence there is a loss of ‘quantumness’. This interprets the efficiency parameter and the extent of quantum evolution. The results are strongly encouraging in favour of the use of ‘Topological Property’ as a source of information instead of the qubit. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=big%20data" title="big data">big data</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20evolution" title=" quantum evolution"> quantum evolution</a>, <a href="https://publications.waset.org/abstracts/search?q=hamiltonian" title=" hamiltonian"> hamiltonian</a>, <a href="https://publications.waset.org/abstracts/search?q=dye%20laser" title=" dye laser"> dye laser</a>, <a href="https://publications.waset.org/abstracts/search?q=fermionic%20computations" title=" fermionic computations"> fermionic computations</a> </p> <a href="https://publications.waset.org/abstracts/89927/mapping-tunnelling-parameters-for-global-optimization-in-big-data-via-dye-laser-simulation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89927.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">194</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">2074</span> The Effect of Catastrophic Losses on Insurance Cycle: Case of Croatia</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Drago%20Jakov%C4%8Devi%C4%87">Drago Jakovčević</a>, <a href="https://publications.waset.org/abstracts/search?q=Maja%20Mihelja%20%C5%BDaja"> Maja Mihelja Žaja</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper provides an analysis of the insurance cycle in the Republic of Croatia and whether they are affected by catastrophic losses on a global level. In general, it is considered that insurance cycles are particularly pronounced in periods of financial crisis, but are also affected by the growing number of catastrophic losses. They cause the change of insurance cycle and premium growth and intensification and narrowing of the coverage conditions, so these variables move in the same direction and these phenomena point to a new cycle. The main goal of this paper is to determine the existence of insurance cycle in the Republic of Croatia and investigate whether catastrophic losses have an influence on insurance cycles. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=catastrophic%20loss" title="catastrophic loss">catastrophic loss</a>, <a href="https://publications.waset.org/abstracts/search?q=insurance%20cycle" title=" insurance cycle"> insurance cycle</a>, <a href="https://publications.waset.org/abstracts/search?q=premium" title=" premium"> premium</a>, <a href="https://publications.waset.org/abstracts/search?q=Republic%20of%20Croatia" title=" Republic of Croatia"> Republic of Croatia</a> </p> <a href="https://publications.waset.org/abstracts/7784/the-effect-of-catastrophic-losses-on-insurance-cycle-case-of-croatia" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7784.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">353</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">2073</span> Cascaded Transcritical/Supercritical CO2 Cycles and Organic Rankine Cycles to Recover Low-Temperature Waste Heat and LNG Cold Energy Simultaneously</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Haoshui%20Yu">Haoshui Yu</a>, <a href="https://publications.waset.org/abstracts/search?q=Donghoi%20Kim"> Donghoi Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Truls%20Gundersen"> Truls Gundersen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Low-temperature waste heat is abundant in the process industries, and large amounts of Liquefied Natural Gas (LNG) cold energy are discarded without being recovered properly in LNG terminals. Power generation is an effective way to utilize low-temperature waste heat and LNG cold energy simultaneously. Organic Rankine Cycles (ORCs) and CO<sub>2</sub> power cycles are promising technologies to convert low-temperature waste heat and LNG cold energy into electricity. If waste heat and LNG cold energy are utilized simultaneously in one system, the performance may outperform separate systems utilizing low-temperature waste heat and LNG cold energy, respectively. Low-temperature waste heat acts as the heat source and LNG regasification acts as the heat sink in the combined system. Due to the large temperature difference between the heat source and the heat sink, cascaded power cycle configurations are proposed in this paper. Cascaded power cycles can improve the energy efficiency of the system considerably. The cycle operating at a higher temperature to recover waste heat is called top cycle and the cycle operating at a lower temperature to utilize LNG cold energy is called bottom cycle in this study. The top cycle condensation heat is used as the heat source in the bottom cycle. The top cycle can be an ORC, transcritical CO<sub>2</sub> (tCO<sub>2</sub>) cycle or supercritical CO<sub>2</sub> (sCO<sub>2</sub>) cycle, while the bottom cycle only can be an ORC due to the low-temperature range of the bottom cycle. However, the thermodynamic path of the tCO<sub>2</sub> cycle and sCO<sub>2</sub> cycle are different from that of an ORC. The tCO<sub>2</sub> cycle and the sCO<sub>2</sub> cycle perform better than an ORC for sensible waste heat recovery due to a better temperature match with the waste heat source. Different combinations of the tCO<sub>2</sub> cycle, sCO<sub>2</sub> cycle and ORC are compared to screen the best configurations of the cascaded power cycles. The influence of the working fluid and the operating conditions are also investigated in this study. Each configuration is modeled and optimized in Aspen HYSYS. The results show that cascaded tCO<sub>2</sub>/ORC performs better compared with cascaded ORC/ORC and cascaded sCO<sub>2</sub>/ORC for the case study. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=LNG%20cold%20energy" title="LNG cold energy">LNG cold energy</a>, <a href="https://publications.waset.org/abstracts/search?q=low-temperature%20waste%20heat" title=" low-temperature waste heat"> low-temperature waste heat</a>, <a href="https://publications.waset.org/abstracts/search?q=organic%20Rankine%20cycle" title=" organic Rankine cycle"> organic Rankine cycle</a>, <a href="https://publications.waset.org/abstracts/search?q=supercritical%20CO%E2%82%82%20cycle" title=" supercritical CO₂ cycle"> supercritical CO₂ cycle</a>, <a href="https://publications.waset.org/abstracts/search?q=transcritical%20CO%E2%82%82%20cycle" title=" transcritical CO₂ cycle"> transcritical CO₂ cycle</a> </p> <a href="https://publications.waset.org/abstracts/86899/cascaded-transcriticalsupercritical-co2-cycles-and-organic-rankine-cycles-to-recover-low-temperature-waste-heat-and-lng-cold-energy-simultaneously" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/86899.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">260</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">2072</span> A Study on the Accelerated Life Cycle Test Method of the Motor for Home Appliances by Using Acceleration Factor </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Youn-Sung%20Kim">Youn-Sung Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Mi-Sung%20Kim"> Mi-Sung Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Jae-Kun%20Lee"> Jae-Kun Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with the accelerated life cycle test method of the motor for home appliances that demand high reliability. Life Cycle of parts in home appliances also should be 10 years because life cycle of the home appliances such as washing machine, refrigerator, TV is at least 10 years. In case of washing machine, the life cycle test method of motor is advanced for 3000 cycle test (1cycle = 2hours). However, 3000 cycle test incurs loss for the time and cost. Objectives of this study are to reduce the life cycle test time and the number of test samples, which could be realized by using acceleration factor for the test time and reduction factor for the number of sample. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=accelerated%20life%20cycle%20test" title="accelerated life cycle test">accelerated life cycle test</a>, <a href="https://publications.waset.org/abstracts/search?q=motor%20reliability%20test" title=" motor reliability test"> motor reliability test</a>, <a href="https://publications.waset.org/abstracts/search?q=motor%20for%20washing%20machine" title=" motor for washing machine"> motor for washing machine</a>, <a href="https://publications.waset.org/abstracts/search?q=BLDC%20motor" title=" BLDC motor"> BLDC motor</a> </p> <a href="https://publications.waset.org/abstracts/46400/a-study-on-the-accelerated-life-cycle-test-method-of-the-motor-for-home-appliances-by-using-acceleration-factor" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46400.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">635</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">2071</span> On the Basis Number and the Minimum Cycle Bases of the Wreath Product of Paths with Wheels</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20M.%20M.%20Jaradat">M. M. M. Jaradat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For a given graph G, the set Ԑ of all subsets of E(G) forms an |E(G)| dimensional vector space over Z2 with vector addition X⊕Y = (X\Y ) [ (Y \X) and scalar multiplication 1.X = X and 0.X = Ø for all X, Yϵ Ԑ. The cycle space, C(G), of a graph G is the vector subspace of (E; ⊕; .) spanned by the cycles of G. Traditionally there have been two notions of minimality among bases of C(G). First, a basis B of G is called a d-fold if each edge of G occurs in at most d cycles of the basis B. The basis number, b(G), of G is the least non-negative integer d such that C(G) has a d-fold basis; a required basis of C(G) is a basis for which each edge of G belongs to at most b(G) elements of B. Second, a basis B is called a minimum cycle basis (MCB) if its total length Σ BϵB |B| is minimum among all bases of C(G). The lexicographic product GρH has the vertex set V (GρH) = V (G) x V (H) and the edge set E(GρH) = {(u1, v1)(u2, v2)|u1 = u2 and v1 v2 ϵ E(H); or u1u2 ϵ E(G) and there is α ϵ Aut(H) such that α (v1) = v2}. In this work, a construction of a minimum cycle basis for the wreath product of wheels with paths is presented. Also, the length of the longest cycle of a minimum cycle basis is determined. Moreover, the basis number for the wreath product of the same is investigated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cycle%20space" title="cycle space">cycle space</a>, <a href="https://publications.waset.org/abstracts/search?q=minimum%20cycle%20basis" title=" minimum cycle basis"> minimum cycle basis</a>, <a href="https://publications.waset.org/abstracts/search?q=basis%20number" title=" basis number"> basis number</a>, <a href="https://publications.waset.org/abstracts/search?q=wreath%20product" title=" wreath product"> wreath product</a> </p> <a href="https://publications.waset.org/abstracts/2144/on-the-basis-number-and-the-minimum-cycle-bases-of-the-wreath-product-of-paths-with-wheels" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2144.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">280</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2070</span> Comparative Exergy Analysis of Ammonia-Water Rankine Cycles and Kalina Cycle</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kyoung%20Hoon%20Kim">Kyoung Hoon Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a comparative exergy analysis of ammonia-water Rankine cycles with and without regeneration and Kalina cycle for recovery of low-temperature heat source. Special attention is paid to the effect of system parameters such as ammonia mass fraction and turbine inlet pressure on the exergetical performance of the systems. Results show that maximum exergy efficiency can be obtained in the regenerative Rankine cycle for high turbine inlet pressures. However, Kalina cycle shows better exergy efficiency for low turbine inlet pressures, and the optimum ammonia mass fractions of Kalina cycle are lower than Rankine cycles. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ammonia-water" title="ammonia-water">ammonia-water</a>, <a href="https://publications.waset.org/abstracts/search?q=Rankine%20cycle" title=" Rankine cycle"> Rankine cycle</a>, <a href="https://publications.waset.org/abstracts/search?q=Kalina%20cycle" title=" Kalina cycle"> Kalina cycle</a>, <a href="https://publications.waset.org/abstracts/search?q=exergy" title=" exergy"> exergy</a>, <a href="https://publications.waset.org/abstracts/search?q=exergy%20destruction" title=" exergy destruction"> exergy destruction</a>, <a href="https://publications.waset.org/abstracts/search?q=low-temperature%20heat%20source" title=" low-temperature heat source"> low-temperature heat source</a> </p> <a href="https://publications.waset.org/abstracts/97344/comparative-exergy-analysis-of-ammonia-water-rankine-cycles-and-kalina-cycle" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/97344.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">163</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">2069</span> Optimization of Supercritical CO2 Power Cycle for Waste Heat Recovery from Gas Turbine with Respect to Cooling Condition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Young%20Min%20Kim">Young Min Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Jeong%20Lak%20Sohn"> Jeong Lak Sohn</a>, <a href="https://publications.waset.org/abstracts/search?q=Eui%20Soo%20Yoon"> Eui Soo Yoon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study describes the optimization of supercritical carbon dioxide (S-CO2) power cycle for recovering waste heat from a gas turbine. An S-CO2 cycle that recovers heat from small industrial and aeroderivative gas turbines can outperform a steam-bottoming cycle despite its simplicity and compactness. In using S-CO2 power cycles for waste heat recovery, a split cycle was studied to maximize the net output power by incorporating the utilization efficiency of the waste heat (lowering the temperature of the exhaust gas through the heater) along with the thermal efficiency of the cycle (minimizing the temperature difference for the heat transfer, exergy loss). The cooling condition of the S-CO2 WHR system has a great impact on the performance and the optimum low pressure of the system. Furthermore, the optimum high pressure of the S-CO2 WHR systems for the maximum power from the given heat sources is dependent on the temperature of the waste heat source. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=exergy%20loss" title="exergy loss">exergy loss</a>, <a href="https://publications.waset.org/abstracts/search?q=gas%20turbine" title=" gas turbine"> gas turbine</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=supercritical%20CO2%20power%20cycle" title=" supercritical CO2 power cycle"> supercritical CO2 power cycle</a>, <a href="https://publications.waset.org/abstracts/search?q=split%20cycle" title=" split cycle"> split cycle</a>, <a href="https://publications.waset.org/abstracts/search?q=waste%20heat%20recovery" title=" waste heat recovery"> waste heat recovery</a> </p> <a href="https://publications.waset.org/abstracts/59112/optimization-of-supercritical-co2-power-cycle-for-waste-heat-recovery-from-gas-turbine-with-respect-to-cooling-condition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59112.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">349</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2068</span> Thermodynamic Optimization of an R744 Based Transcritical Refrigeration System with Dedicated Mechanical Subcooling Cycle</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mihir%20Mouchum%20Hazarika">Mihir Mouchum Hazarika</a>, <a href="https://publications.waset.org/abstracts/search?q=Maddali%20Ramgopal"> Maddali Ramgopal</a>, <a href="https://publications.waset.org/abstracts/search?q=Souvik%20Bhattacharyya"> Souvik Bhattacharyya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The thermodynamic analysis shows that the performance of the R744 based transcritical refrigeration cycle drops drastically for higher ambient temperatures. This is due to the peculiar s-shape of the isotherm in the supercritical region. However, subcooling of the refrigerant at the gas cooler exit enhances the performance of the R744 based system. The present study is carried out to analyze the R744 based transcritical system with dedicated mechanical subcooling cycle. Based on this proposed cycle, the thermodynamic analysis is performed, and optimum operating parameters are determined. The amount of subcooling and the pressure ratio in the subcooling cycle are the parameters which are needed to be optimized to extract the maximum COP from this proposed cycle. It is expected that this study will be helpful in implementing the dedicated subcooling cycle with R744 based transcritical system to improve the performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimization" title="optimization">optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=R744" title=" R744"> R744</a>, <a href="https://publications.waset.org/abstracts/search?q=subcooling" title=" subcooling"> subcooling</a>, <a href="https://publications.waset.org/abstracts/search?q=transcritical" title=" transcritical"> transcritical</a> </p> <a href="https://publications.waset.org/abstracts/65947/thermodynamic-optimization-of-an-r744-based-transcritical-refrigeration-system-with-dedicated-mechanical-subcooling-cycle" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/65947.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">306</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2067</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> <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=Hamiltonian%20cycle&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Hamiltonian%20cycle&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Hamiltonian%20cycle&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Hamiltonian%20cycle&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Hamiltonian%20cycle&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Hamiltonian%20cycle&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Hamiltonian%20cycle&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Hamiltonian%20cycle&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Hamiltonian%20cycle&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=Hamiltonian%20cycle&page=69">69</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Hamiltonian%20cycle&page=70">70</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Hamiltonian%20cycle&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>