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: Path decomposition</title> <meta name="description" content="Search results for: Path decomposition"> <meta name="keywords" content="Path decomposition"> <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="Path decomposition" 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/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="Path decomposition"> <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: Path decomposition</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">856</span> Decomposition of Graphs into Induced Paths and Cycles</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=I.%20Sahul%20Hamid">I. Sahul Hamid</a>, <a href="https://publications.waset.org/search?q=Abraham%20V.%20M."> Abraham V. M.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>A decomposition of a graph G is a collection ψ of subgraphs H1,H2, . . . , Hr of G such that every edge of G belongs to exactly one Hi. If each Hi is either an induced path or an induced cycle in G, then ψ is called an induced path decomposition of G. The minimum cardinality of an induced path decomposition of G is called the induced path decomposition number of G and is denoted by πi(G). In this paper we initiate a study of this parameter.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Path%20decomposition" title="Path decomposition">Path decomposition</a>, <a href="https://publications.waset.org/search?q=Induced%20path%20decomposition" title=" Induced path decomposition"> Induced path decomposition</a>, <a href="https://publications.waset.org/search?q=Induced%20path%20decomposition%20number." title=" Induced path decomposition number."> Induced path decomposition number.</a> </p> <a href="https://publications.waset.org/3065/decomposition-of-graphs-into-induced-paths-and-cycles" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3065/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3065/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3065/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3065/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3065/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3065/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3065/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3065/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3065/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3065/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3065.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">2374</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">855</span> Induced Acyclic Path Decomposition in Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Abraham%20V.%20M.">Abraham V. M.</a>, <a href="https://publications.waset.org/search?q=I.%20Sahul%20Hamid"> I. Sahul Hamid</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A decomposition of a graph G is a collection ψ of graphs H1,H2, . . . , Hr of G such that every edge of G belongs to exactly one Hi. If each Hi is either an induced path in G, then ψ is called an induced acyclic path decomposition of G and if each Hi is a (induced) cycle in G then ψ is called a (induced) cycle decomposition of G. The minimum cardinality of an induced acyclic path decomposition of G is called the induced acyclic path decomposition number of G and is denoted by ¤Çia(G). Similarly the cyclic decomposition number ¤Çc(G) is defined. In this paper we begin an investigation of these parameters. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cycle%20decomposition" title="Cycle decomposition">Cycle decomposition</a>, <a href="https://publications.waset.org/search?q=Induced%20acyclic%20path%20decomposition" title=" Induced acyclic path decomposition"> Induced acyclic path decomposition</a>, <a href="https://publications.waset.org/search?q=Induced%20acyclic%20path%20decomposition%20number." title="Induced acyclic path decomposition number.">Induced acyclic path decomposition number.</a> </p> <a href="https://publications.waset.org/13/induced-acyclic-path-decomposition-in-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13.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">1575</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">854</span> Blind Channel Estimation Based on URV Decomposition Technique for Uplink of MC-CDMA</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Pradya%20Pornnimitkul">Pradya Pornnimitkul</a>, <a href="https://publications.waset.org/search?q=Suwich%20Kunaruttanapruk"> Suwich Kunaruttanapruk</a>, <a href="https://publications.waset.org/search?q=Bamrung%20Tau%20Sieskul"> Bamrung Tau Sieskul</a>, <a href="https://publications.waset.org/search?q=Somchai%20Jitapunkul"> Somchai Jitapunkul</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we investigate a blind channel estimation method for Multi-carrier CDMA systems that use a subspace decomposition technique. This technique exploits the orthogonality property between the noise subspace and the received user codes to obtain channel of each user. In the past we used Singular Value Decomposition (SVD) technique but SVD have most computational complexity so in this paper use a new algorithm called URV Decomposition, which serve as an intermediary between the QR decomposition and SVD, replaced in SVD technique to track the noise space of the received data. Because of the URV decomposition has almost the same estimation performance as the SVD, but has less computational complexity.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Channel%20estimation" title="Channel estimation">Channel estimation</a>, <a href="https://publications.waset.org/search?q=MC-CDMA" title=" MC-CDMA"> MC-CDMA</a>, <a href="https://publications.waset.org/search?q=SVD" title=" SVD"> SVD</a>, <a href="https://publications.waset.org/search?q=URV." title=" URV."> URV.</a> </p> <a href="https://publications.waset.org/14167/blind-channel-estimation-based-on-urv-decomposition-technique-for-uplink-of-mc-cdma" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14167/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14167/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14167/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14167/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14167/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14167/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14167/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14167/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14167/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14167/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14167.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">1780</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">853</span> The Same or Not the Same - On the Variety of Mechanisms of Path Dependence</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=J%C3%BCrgen%20Beyer">Jürgen Beyer</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In association with path dependence, researchers often talk of institutional “lock-in", thereby indicating that far-reaching path deviation or path departure are to be regarded as exceptional cases. This article submits the alleged general inclination for stability of path-dependent processes to a critical review. The different reasons for path dependence found in the literature indicate that different continuity-ensuring mechanisms are at work when people talk about path dependence (“increasing returns", complementarity, sequences etc.). As these mechanisms are susceptible to fundamental change in different ways and to different degrees, the path dependence concept alone is of only limited explanatory value. It is therefore indispensable to identify the underlying continuity-ensuring mechanism as well if a statement-s empirical value is to go beyond the trivial, always true “history matters". <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=path%20dependence" title="path dependence">path dependence</a>, <a href="https://publications.waset.org/search?q=increasing%20returns" title=" increasing returns"> increasing returns</a>, <a href="https://publications.waset.org/search?q=historicalinstitutionalism" title=" historicalinstitutionalism"> historicalinstitutionalism</a>, <a href="https://publications.waset.org/search?q=lock-in." title=" lock-in."> lock-in.</a> </p> <a href="https://publications.waset.org/7260/the-same-or-not-the-same-on-the-variety-of-mechanisms-of-path-dependence" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7260/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7260/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7260/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7260/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7260/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7260/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7260/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7260/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7260/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7260/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7260.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">1881</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">852</span> Generalized Morphological 3D Shape Decomposition Grayscale Interframe Interpolation Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Dragos%20Nicolae%20VIZIREANU">Dragos Nicolae VIZIREANU</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>One of the main image representations in Mathematical Morphology is the 3D Shape Decomposition Representation, useful for Image Compression and Representation,and Pattern Recognition. The 3D Morphological Shape Decomposition representation can be generalized a number of times,to extend the scope of its algebraic characteristics as much as possible. With these generalizations, the Morphological Shape Decomposition 's role to serve as an efficient image decomposition tool is extended to grayscale images.This work follows the above line, and further develops it. Anew evolutionary branch is added to the 3D Morphological Shape Decomposition's development, by the introduction of a 3D Multi Structuring Element Morphological Shape Decomposition, which permits 3D Morphological Shape Decomposition of 3D binary images (grayscale images) into "multiparameter" families of elements. At the beginning, 3D Morphological Shape Decomposition representations are based only on "1 parameter" families of elements for image decomposition.This paper addresses the gray scale inter frame interpolation by means of mathematical morphology. The new interframe interpolation method is based on generalized morphological 3D Shape Decomposition. This article will present the theoretical background of the morphological interframe interpolation, deduce the new representation and show some application examples.Computer simulations could illustrate results.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=3D%20shape%20decomposition%20representation" title="3D shape decomposition representation">3D shape decomposition representation</a>, <a href="https://publications.waset.org/search?q=mathematical%20morphology" title="mathematical morphology">mathematical morphology</a>, <a href="https://publications.waset.org/search?q=gray%20scale%20interframe%20interpolation" title=" gray scale interframe interpolation"> gray scale interframe interpolation</a> </p> <a href="https://publications.waset.org/2195/generalized-morphological-3d-shape-decomposition-grayscale-interframe-interpolation-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2195/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2195/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2195/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2195/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2195/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2195/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2195/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2195/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2195/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2195/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2195.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">1744</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">851</span> Using Multi-Thread Technology Realize Most Short-Path Parallel Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Chang-le%20Lu">Chang-le Lu</a>, <a href="https://publications.waset.org/search?q=Yong%20Chen"> Yong Chen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The shortest path question is in a graph theory model question, and it is applied in many fields. The most short-path question may divide into two kinds: Single sources most short-path, all apexes to most short-path. This article mainly introduces the problem of all apexes to most short-path, and gives a new parallel algorithm of all apexes to most short-path according to the Dijkstra algorithm. At last this paper realizes the parallel algorithms in the technology of C # multithreading. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Dijkstra%20algorithm" title="Dijkstra algorithm">Dijkstra algorithm</a>, <a href="https://publications.waset.org/search?q=parallel%20algorithms" title=" parallel algorithms"> parallel algorithms</a>, <a href="https://publications.waset.org/search?q=multi-thread%0Atechnology" title=" multi-thread technology"> multi-thread technology</a>, <a href="https://publications.waset.org/search?q=most%20short-path" title=" most short-path"> most short-path</a>, <a href="https://publications.waset.org/search?q=ratio." title=" ratio."> ratio.</a> </p> <a href="https://publications.waset.org/5208/using-multi-thread-technology-realize-most-short-path-parallel-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5208/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5208/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5208/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5208/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5208/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5208/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5208/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5208/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5208/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5208/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5208.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">2112</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">850</span> An UML Statechart Diagram-Based MM-Path Generation Approach for Object-Oriented Integration Testing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ruilian%20Zhao">Ruilian Zhao</a>, <a href="https://publications.waset.org/search?q=Ling%20Lin"> Ling Lin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>MM-Path, an acronym for Method/Message Path, describes the dynamic interactions between methods in object-oriented systems. This paper discusses the classifications of MM-Path, based on the characteristics of object-oriented software. We categorize it according to the generation reasons, the effect scope and the composition of MM-Path. A formalized representation of MM-Path is also proposed, which has considered the influence of state on response method sequences of messages. .Moreover, an automatic MM-Path generation approach based on UML Statechart diagram has been presented, and the difficulties in identifying and generating MM-Path can be solved. . As a result, it provides a solid foundation for further research on test cases generation based on MM-Path.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=MM-Path" title="MM-Path">MM-Path</a>, <a href="https://publications.waset.org/search?q=Message%20Sequence" title=" Message Sequence"> Message Sequence</a>, <a href="https://publications.waset.org/search?q=Object-Oriented%20Integration%20Testing" title=" Object-Oriented Integration Testing"> Object-Oriented Integration Testing</a>, <a href="https://publications.waset.org/search?q=Response%20Method%20Sequence" title=" Response Method Sequence"> Response Method Sequence</a>, <a href="https://publications.waset.org/search?q=UML%20Statechart%20Diagram." title=" UML Statechart Diagram."> UML Statechart Diagram.</a> </p> <a href="https://publications.waset.org/15821/an-uml-statechart-diagram-based-mm-path-generation-approach-for-object-oriented-integration-testing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15821/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15821/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15821/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15821/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15821/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15821/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15821/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15821/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15821/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15821/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15821.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">2612</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">849</span> N-Sun Decomposition of Complete Graphs and Complete Bipartite Graphs </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=R.%20Anitha">R. Anitha</a>, <a href="https://publications.waset.org/search?q=R.%20S.%20Lekshmi"> R. S. Lekshmi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Graph decompositions are vital in the study of combinatorial design theory. Given two graphs G and H, an H-decomposition of G is a partition of the edge set of G into disjoint isomorphic copies of H. An n-sun is a cycle Cn with an edge terminating in a vertex of degree one attached to each vertex. In this paper we have proved that the complete graph of order 2n, K2n can be decomposed into n-2 n-suns, a Hamilton cycle and a perfect matching, when n is even and for odd case, the decomposition is n-1 n-suns and a perfect matching. For an odd order complete graph K2n+1, delete the star subgraph K1, 2n and the resultant graph K2n is decomposed as in the case of even order. The method of building n-suns uses Walecki's construction for the Hamilton decomposition of complete graphs. A spanning tree decomposition of even order complete graphs is also discussed using the labeling scheme of n-sun decomposition. A complete bipartite graph Kn, n can be decomposed into n/2 n-suns when n/2 is even. When n/2 is odd, Kn, n can be decomposed into (n-2)/2 n-suns and a Hamilton cycle. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Hamilton%20cycle" title="Hamilton cycle">Hamilton cycle</a>, <a href="https://publications.waset.org/search?q=n-sun%20decomposition" title=" n-sun decomposition"> n-sun decomposition</a>, <a href="https://publications.waset.org/search?q=perfectmatching" title=" perfectmatching"> perfectmatching</a>, <a href="https://publications.waset.org/search?q=spanning%20tree." title=" spanning tree."> spanning tree.</a> </p> <a href="https://publications.waset.org/2421/n-sun-decomposition-of-complete-graphs-and-complete-bipartite-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2421/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2421/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2421/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2421/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2421/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2421/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2421/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2421/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2421/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2421/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2421.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">2262</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">848</span> Analysis of Catalytic Properties of Ni3Al Thin Foils for the Methanol and Hexane Decomposition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Michalska-Doma%C5%84ska">M. Michalska-Domańska</a>, <a href="https://publications.waset.org/search?q=P.%20J%C3%B3%C5%BAwik"> P. Jóźwik</a>, <a href="https://publications.waset.org/search?q=Z.%20Bojar"> Z. Bojar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Intermetallic Ni3Al – based alloys belong to a group of advanced materials characterized by good chemical and physical properties (such as structural stability, corrosion resistance) which offer advenced technological applications. The paper presents the study of catalytic properties of Ni3Al foils (thickness approximately 50 &m) in the methanol and hexane decomposition. The egzamined material posses microcrystalline structure without any additional catalysts on the surface. The better catalytic activity of Ni3Al foils with respect to quartz plates in both methanol and hexane decomposition was confirmed. On thin Ni3Al foils the methanol conversion reaches approximately 100% above 480 oC while the hexane conversion reaches approximately 100% (98,5%) at 500 oC. Deposit formed during the methanol decomposition is built up of carbon nanofibers decorated with metal-like nanoparticles. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=hexane%20decomposition" title="hexane decomposition">hexane decomposition</a>, <a href="https://publications.waset.org/search?q=methanol%20decomposition" title=" methanol decomposition"> methanol decomposition</a>, <a href="https://publications.waset.org/search?q=Ni3Al%20thin%20foils" title="Ni3Al thin foils">Ni3Al thin foils</a>, <a href="https://publications.waset.org/search?q=Ni%20nanoparticles" title=" Ni nanoparticles"> Ni nanoparticles</a> </p> <a href="https://publications.waset.org/7028/analysis-of-catalytic-properties-of-ni3al-thin-foils-for-the-methanol-and-hexane-decomposition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7028/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7028/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7028/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7028/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7028/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7028/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7028/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7028/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7028/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7028/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7028.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">1538</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">847</span> A Feasible Path Selection QoS Routing Algorithm with two Constraints in Packet Switched Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=P.S.Prakash">P.S.Prakash</a>, <a href="https://publications.waset.org/search?q=S.Selvan"> S.Selvan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Over the past several years, there has been a considerable amount of research within the field of Quality of Service (QoS) support for distributed multimedia systems. One of the key issues in providing end-to-end QoS guarantees in packet networks is determining a feasible path that satisfies a number of QoS constraints. The problem of finding a feasible path is NPComplete if number of constraints is more than two and cannot be exactly solved in polynomial time. We proposed Feasible Path Selection Algorithm (FPSA) that addresses issues with pertain to finding a feasible path subject to delay and cost constraints and it offers higher success rate in finding feasible paths. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=feasible%20path" title="feasible path">feasible path</a>, <a href="https://publications.waset.org/search?q=multiple%20constraints" title=" multiple constraints"> multiple constraints</a>, <a href="https://publications.waset.org/search?q=path%20selection" title=" path selection"> path selection</a>, <a href="https://publications.waset.org/search?q=QoS%20routing" title=" QoS routing"> QoS routing</a> </p> <a href="https://publications.waset.org/12781/a-feasible-path-selection-qos-routing-algorithm-with-two-constraints-in-packet-switched-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12781/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12781/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12781/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12781/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12781/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12781/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12781/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12781/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12781/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12781/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12781.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">1751</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">846</span> Optimizing Approach for Sifting Process to Solve a Common Type of Empirical Mode Decomposition Mode Mixing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Saad%20Al-Baddai">Saad Al-Baddai</a>, <a href="https://publications.waset.org/search?q=Karema%20Al-Subari"> Karema Al-Subari</a>, <a href="https://publications.waset.org/search?q=Elmar%20Lang"> Elmar Lang</a>, <a href="https://publications.waset.org/search?q=Bernd%20Ludwig"> Bernd Ludwig</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Empirical mode decomposition (EMD), a new data-driven of time-series decomposition, has the advantage of supposing that a time series is non-linear or non-stationary, as is implicitly achieved in Fourier decomposition. However, the EMD suffers of mode mixing problem in some cases. The aim of this paper is to present a solution for a common type of signals causing of EMD mode mixing problem, in case a signal suffers of an intermittency. By an artificial example, the solution shows superior performance in terms of cope EMD mode mixing problem comparing with the conventional EMD and Ensemble Empirical Mode decomposition (EEMD). Furthermore, the over-sifting problem is also completely avoided; and computation load is reduced roughly six times compared with EEMD, an ensemble number of 50. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Empirical%20mode%20decomposition" title="Empirical mode decomposition">Empirical mode decomposition</a>, <a href="https://publications.waset.org/search?q=mode%20mixing" title=" mode mixing"> mode mixing</a>, <a href="https://publications.waset.org/search?q=sifting%0D%0Aprocess" title=" sifting process"> sifting process</a>, <a href="https://publications.waset.org/search?q=over-sifting." title=" over-sifting."> over-sifting.</a> </p> <a href="https://publications.waset.org/10007433/optimizing-approach-for-sifting-process-to-solve-a-common-type-of-empirical-mode-decomposition-mode-mixing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10007433/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10007433/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10007433/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10007433/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10007433/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10007433/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10007433/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10007433/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10007433/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10007433/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10007433.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">992</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">845</span> N-Sun Decomposition of Complete, Complete Bipartite and Some Harary Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=R.%20Anitha">R. Anitha</a>, <a href="https://publications.waset.org/search?q=R.%20S.%20Lekshmi"> R. S. Lekshmi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Graph decompositions are vital in the study of combinatorial design theory. A decomposition of a graph G is a partition of its edge set. An n-sun graph is a cycle Cn with an edge terminating in a vertex of degree one attached to each vertex. In this paper, we define n-sun decomposition of some even order graphs with a perfect matching. We have proved that the complete graph K2n, complete bipartite graph K2n, 2n and the Harary graph H4, 2n have n-sun decompositions. A labeling scheme is used to construct the n-suns. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Decomposition" title="Decomposition">Decomposition</a>, <a href="https://publications.waset.org/search?q=Hamilton%20cycle" title=" Hamilton cycle"> Hamilton cycle</a>, <a href="https://publications.waset.org/search?q=n-sun%20graph" title=" n-sun graph"> n-sun graph</a>, <a href="https://publications.waset.org/search?q=perfect%20matching" title=" perfect matching"> perfect matching</a>, <a href="https://publications.waset.org/search?q=spanning%20tree." title=" spanning tree."> spanning tree.</a> </p> <a href="https://publications.waset.org/3193/n-sun-decomposition-of-complete-complete-bipartite-and-some-harary-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3193/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3193/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3193/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3193/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3193/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3193/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3193/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3193/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3193/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3193/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3193.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">2397</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">844</span> New Subband Adaptive IIR Filter Based On Polyphase Decomposition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Young-Seok%20Choi">Young-Seok Choi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>We present a subband adaptive infinite-impulse response (IIR) filtering method, which is based on a polyphase decomposition of IIR filter. Motivated by the fact that the polyphase structure has benefits in terms of convergence rate and stability, we introduce the polyphase decomposition to subband IIR filtering, i.e., in each subband high order IIR filter is decomposed into polyphase IIR filters with lower order. Computer simulations demonstrate that the proposed method has improved convergence rate over conventional IIR filters.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Subband%20adaptive%20filter" title="Subband adaptive filter">Subband adaptive filter</a>, <a href="https://publications.waset.org/search?q=IIR%20filtering.%20Polyphase%20decomposition." title=" IIR filtering. Polyphase decomposition."> IIR filtering. Polyphase decomposition.</a> </p> <a href="https://publications.waset.org/9999317/new-subband-adaptive-iir-filter-based-on-polyphase-decomposition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9999317/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9999317/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9999317/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9999317/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9999317/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9999317/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9999317/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9999317/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9999317/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9999317/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9999317.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">2497</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">843</span> A Novel Instantaneous Frequency Computation Approach for Empirical Mode Decomposition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Liming%20Zhang">Liming Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper introduces a new instantaneous frequency computation approach -Counting Instantaneous Frequency for a general class of signals called simple waves. The classsimple wave contains a wide range of continuous signals for which the concept instantaneous frequency has a perfect physical sense. The concept of -Counting Instantaneous Frequency also applies to all the discrete data. For all the simple wave signals and the discrete data, -Counting instantaneous frequency can be computed directly without signal decomposition process. The intrinsic mode functions obtained through empirical mode decomposition belongs to simple wave. So -Counting instantaneous frequency can be used together with empirical mode decomposition. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Instantaneous%20frequency" title="Instantaneous frequency">Instantaneous frequency</a>, <a href="https://publications.waset.org/search?q=empirical%20mode%20decomposition" title=" empirical mode decomposition"> empirical mode decomposition</a>, <a href="https://publications.waset.org/search?q=intrinsic%20mode%20function." title=" intrinsic mode function."> intrinsic mode function.</a> </p> <a href="https://publications.waset.org/14372/a-novel-instantaneous-frequency-computation-approach-for-empirical-mode-decomposition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14372/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14372/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14372/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14372/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14372/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14372/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14372/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14372/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14372/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14372/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14372.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">1575</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">842</span> Adaptive Fourier Decomposition Based Signal Instantaneous Frequency Computation Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Liming%20Zhang">Liming Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> There have been different approaches to compute the analytic instantaneous frequency with a variety of background reasoning and applicability in practice, as well as restrictions. This paper presents an adaptive Fourier decomposition and (α-counting) based instantaneous frequency computation approach. The adaptive Fourier decomposition is a recently proposed new signal decomposition approach. The instantaneous frequency can be computed through the so called mono-components decomposed by it. Due to the fast energy convergency, the highest frequency of the signal will be discarded by the adaptive Fourier decomposition, which represents the noise of the signal in most of the situation. A new instantaneous frequency definition for a large class of so-called simple waves is also proposed in this paper. Simple wave contains a wide range of signals for which the concept instantaneous frequency has a perfect physical sense. The α-counting instantaneous frequency can be used to compute the highest frequency for a signal. Combination of these two approaches one can obtain the IFs of the whole signal. An experiment is demonstrated the computation procedure with promising results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Adaptive%20Fourier%20decomposition" title="Adaptive Fourier decomposition">Adaptive Fourier decomposition</a>, <a href="https://publications.waset.org/search?q=Fourier%20series" title=" Fourier series"> Fourier series</a>, <a href="https://publications.waset.org/search?q=signal%20processing" title=" signal processing"> signal processing</a>, <a href="https://publications.waset.org/search?q=instantaneous%20frequency" title=" instantaneous frequency"> instantaneous frequency</a> </p> <a href="https://publications.waset.org/2536/adaptive-fourier-decomposition-based-signal-instantaneous-frequency-computation-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2536/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2536/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2536/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2536/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2536/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2536/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2536/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2536/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2536/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2536/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2536.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">2357</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">841</span> Blind Identification and Equalization of CDMA Signals Using the Levenvberg-Marquardt Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mohammed%20Boutalline">Mohammed Boutalline</a>, <a href="https://publications.waset.org/search?q=Imad%20Badi"> Imad Badi</a>, <a href="https://publications.waset.org/search?q=Belaid%20Bouikhalene"> Belaid Bouikhalene</a>, <a href="https://publications.waset.org/search?q=Said%20Safi"> Said Safi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper we describe the Levenvberg-Marquardt (LM) algorithm for identification and equalization of CDMA signals received by an antenna array in communication channels. The synthesis explains the digital separation and equalization of signals after propagation through multipath generating intersymbol interference (ISI). Exploiting discrete data transmitted and three diversities induced at the reception, the problem can be composed by the Block Component Decomposition (BCD) of a tensor of order 3 which is a new tensor decomposition generalizing the PARAFAC decomposition. We optimize the BCD decomposition by Levenvberg-Marquardt method gives encouraging results compared to classical alternating least squares algorithm (ALS). In the equalization part, we use the Minimum Mean Square Error (MMSE) to perform the presented method. The simulation results using the LM algorithm are important.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Identification%20and%20equalization" title="Identification and equalization">Identification and equalization</a>, <a href="https://publications.waset.org/search?q=communication%0D%0Achannel" title=" communication channel"> communication channel</a>, <a href="https://publications.waset.org/search?q=Levenvberg-Marquardt" title=" Levenvberg-Marquardt"> Levenvberg-Marquardt</a>, <a href="https://publications.waset.org/search?q=tensor%20decomposition" title=" tensor decomposition"> tensor decomposition</a> </p> <a href="https://publications.waset.org/10000338/blind-identification-and-equalization-of-cdma-signals-using-the-levenvberg-marquardt-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10000338/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10000338/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10000338/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10000338/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10000338/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10000338/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10000338/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10000338/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10000338/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10000338/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10000338.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">1823</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">840</span> A Reconfigurable Processing Element for Cholesky Decomposition and Matrix Inversion</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Aki%20Happonen">Aki Happonen</a>, <a href="https://publications.waset.org/search?q=Adrian%20Burian"> Adrian Burian</a>, <a href="https://publications.waset.org/search?q=Erwin%20Hemming"> Erwin Hemming</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fixed-point simulation results are used for the performance measure of inverting matrices by Cholesky decomposition. The fixed-point Cholesky decomposition algorithm is implemented using a fixed-point reconfigurable processing element. The reconfigurable processing element provides all mathematical operations required by Cholesky decomposition. The fixed-point word length analysis is based on simulations using different condition numbers and different matrix sizes. Simulation results show that 16 bits word length gives sufficient performance for small matrices with low condition number. Larger matrices and higher condition numbers require more dynamic range for a fixedpoint implementation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cholesky%20Decomposition" title="Cholesky Decomposition">Cholesky Decomposition</a>, <a href="https://publications.waset.org/search?q=Fixed-point" title=" Fixed-point"> Fixed-point</a>, <a href="https://publications.waset.org/search?q=Matrix%0Ainversion" title=" Matrix inversion"> Matrix inversion</a>, <a href="https://publications.waset.org/search?q=Reconfigurable%20processing." title=" Reconfigurable processing."> Reconfigurable processing.</a> </p> <a href="https://publications.waset.org/3614/a-reconfigurable-processing-element-for-cholesky-decomposition-and-matrix-inversion" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3614/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3614/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3614/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3614/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3614/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3614/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3614/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3614/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3614/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3614/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3614.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">1694</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">839</span> Module and Comodule Structures on Path Space</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Lili%20Chen">Lili Chen</a>, <a href="https://publications.waset.org/search?q=Chao%20Yuan"> Chao Yuan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> On path space <em>kQ</em>, there is a trivial <em>kQ<sup>a</sup></em>-module structure determined by the multiplication of path algebra <em>kQ<sup>a </sup></em>and a trivial <em>kQ<sup>c</sup></em>-comodule structure determined by the comultiplication of path coalgebra<em> kQ<sup>c</sup></em>. In this paper, on path space <em>kQ</em>, a nontrivial <em>kQ<sup>a</sup></em>-module structure is defined, and it is proved that this nontrivial left <em>kQ<sup>a</sup></em>-module structure is isomorphic to the dual module structure of trivial right <em>kQ<sup>c</sup></em>-comodule. Dually, on path space <em>kQ</em>, a nontrivial <em>kQ<sup>c</sup></em>-comodule structure is defined, and it is proved that this nontrivial right <em>kQ<sup>c</sup></em>-comodule structure is isomorphic to the dual comodule structure of trivial left <em>kQ<sup>a</sup></em>-module. Finally, the trivial and nontrivial module structures on path space are compared from the aspect of submodule, and the trivial and nontrivial comodule structures on path space are compared from the aspect of subcomodule. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Quiver" title="Quiver">Quiver</a>, <a href="https://publications.waset.org/search?q=path%20space" title=" path space"> path space</a>, <a href="https://publications.waset.org/search?q=module" title=" module"> module</a>, <a href="https://publications.waset.org/search?q=comodule" title=" comodule"> comodule</a>, <a href="https://publications.waset.org/search?q=dual." title=" dual."> dual.</a> </p> <a href="https://publications.waset.org/10005391/module-and-comodule-structures-on-path-space" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10005391/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10005391/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10005391/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10005391/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10005391/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10005391/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10005391/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10005391/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10005391/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10005391/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10005391.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">855</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">838</span> A Decomposition Method for the Bipartite Separability of Bell Diagonal States</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Wei-Chih%20Su">Wei-Chih Su</a>, <a href="https://publications.waset.org/search?q=Kuan-Peng%20Chen">Kuan-Peng Chen</a>, <a href="https://publications.waset.org/search?q=Ming-Chung%20Tsai">Ming-Chung Tsai</a>, <a href="https://publications.waset.org/search?q=Zheng-Yao%20Su">Zheng-Yao Su</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A new decomposition form is introduced in this report to establish a criterion for the bi-partite separability of Bell diagonal states. A such criterion takes a quadratic inequality of the coefficients of a given Bell diagonal states and can be derived via a simple algorithmic calculation of its invariants. In addition, the criterion can be extended to a quantum system of higher dimension. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=decomposition" title="decomposition">decomposition</a>, <a href="https://publications.waset.org/search?q=bipartite%20separability" title=" bipartite separability"> bipartite separability</a>, <a href="https://publications.waset.org/search?q=Bell%20diagonal%20states." title=" Bell diagonal states."> Bell diagonal states.</a> </p> <a href="https://publications.waset.org/1777/a-decomposition-method-for-the-bipartite-separability-of-bell-diagonal-states" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1777/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1777/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1777/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1777/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1777/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1777/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1777/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1777/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1777/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1777/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1777.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">1655</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">837</span> Algebraic Riccati Matrix Equation for Eigen- Decomposition of Special Structured Matrices; Applications in Structural Mechanics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mahdi%20Nouri">Mahdi Nouri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper Algebraic Riccati matrix equation is used for Eigen-decomposition of special structured matrices. This is achieved by similarity transformation and then using algebraic riccati matrix equation to triangulation of matrices. The process is decomposition of matrices into small and specially structured submatrices with low dimensions for fast and easy finding of Eigenpairs. Numerical and structural examples included showing the efficiency of present method.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Riccati" title="Riccati">Riccati</a>, <a href="https://publications.waset.org/search?q=matrix%20equation" title=" matrix equation"> matrix equation</a>, <a href="https://publications.waset.org/search?q=eigenvalue%20problem" title=" eigenvalue problem"> eigenvalue problem</a>, <a href="https://publications.waset.org/search?q=symmetric" title=" symmetric"> symmetric</a>, <a href="https://publications.waset.org/search?q=bisymmetric" title=" bisymmetric"> bisymmetric</a>, <a href="https://publications.waset.org/search?q=persymmetric" title=" persymmetric"> persymmetric</a>, <a href="https://publications.waset.org/search?q=decomposition" title=" decomposition"> decomposition</a>, <a href="https://publications.waset.org/search?q=canonical%0D%0Aforms" title=" canonical forms"> canonical forms</a>, <a href="https://publications.waset.org/search?q=Graphs%20theory" title=" Graphs theory"> Graphs theory</a>, <a href="https://publications.waset.org/search?q=adjacency%20and%20Laplacian%20matrices." title=" adjacency and Laplacian matrices."> adjacency and Laplacian matrices.</a> </p> <a href="https://publications.waset.org/17006/algebraic-riccati-matrix-equation-for-eigen-decomposition-of-special-structured-matrices-applications-in-structural-mechanics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/17006/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/17006/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/17006/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/17006/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/17006/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/17006/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/17006/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/17006/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/17006/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/17006/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/17006.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">1806</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">836</span> Laplace Adomian Decomposition Method Applied to a Two-Dimensional Viscous Flow with Shrinking Sheet</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20A.%20Koroma">M. A. Koroma</a>, <a href="https://publications.waset.org/search?q=S.%20Widatalla"> S. Widatalla</a>, <a href="https://publications.waset.org/search?q=A.%20F.%20Kamara"> A. F. Kamara</a>, <a href="https://publications.waset.org/search?q=C.%20Zhang"> C. Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Our aim in this piece of work is to demonstrate the power of the Laplace Adomian decomposition method (LADM) in approximating the solutions of nonlinear differential equations governing the two-dimensional viscous flow induced by a shrinking sheet. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Adomian%20polynomials" title="Adomian polynomials">Adomian polynomials</a>, <a href="https://publications.waset.org/search?q=Laplace%20Adomian%0D%0Adecomposition%20method" title=" Laplace Adomian decomposition method"> Laplace Adomian decomposition method</a>, <a href="https://publications.waset.org/search?q=Pad%C3%A9%20Approximant" title=" Padé Approximant"> Padé Approximant</a>, <a href="https://publications.waset.org/search?q=Shrinking%20sheet." title=" Shrinking sheet."> Shrinking sheet.</a> </p> <a href="https://publications.waset.org/11879/laplace-adomian-decomposition-method-applied-to-a-two-dimensional-viscous-flow-with-shrinking-sheet" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11879/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11879/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11879/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11879/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11879/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11879/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11879/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11879/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11879/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11879/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11879.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">2030</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">835</span> Geometric Data Structures and Their Selected Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Milo%C5%A1%20%C5%A0eda">Miloš Šeda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Finding the shortest path between two positions is a fundamental problem in transportation, routing, and communications applications. In robot motion planning, the robot should pass around the obstacles touching none of them, i.e. the goal is to find a collision-free path from a starting to a target position. This task has many specific formulations depending on the shape of obstacles, allowable directions of movements, knowledge of the scene, etc. Research of path planning has yielded many fundamentally different approaches to its solution, mainly based on various decomposition and roadmap methods. In this paper, we show a possible use of visibility graphs in point-to-point motion planning in the Euclidean plane and an alternative approach using Voronoi diagrams that decreases the probability of collisions with obstacles. The second application area, investigated here, is focused on problems of finding minimal networks connecting a set of given points in the plane using either only straight connections between pairs of points (minimum spanning tree) or allowing the addition of auxiliary points to the set to obtain shorter spanning networks (minimum Steiner tree). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=motion%20planning" title="motion planning">motion planning</a>, <a href="https://publications.waset.org/search?q=spanning%20tree" title=" spanning tree"> spanning tree</a>, <a href="https://publications.waset.org/search?q=Steiner%20tree" title=" Steiner tree"> Steiner tree</a>, <a href="https://publications.waset.org/search?q=Delaunay%20triangulation" title=" Delaunay triangulation"> Delaunay triangulation</a>, <a href="https://publications.waset.org/search?q=Voronoi%20diagram." title=" Voronoi diagram."> Voronoi diagram.</a> </p> <a href="https://publications.waset.org/8959/geometric-data-structures-and-their-selected-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8959/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8959/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8959/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8959/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8959/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8959/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8959/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8959/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8959/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8959/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8959.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">1520</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">834</span> A Review on Comparative Analysis of Path Planning and Collision Avoidance Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Divya%20Agarwal">Divya Agarwal</a>, <a href="https://publications.waset.org/search?q=Pushpendra%20S.%20Bharti"> Pushpendra S. Bharti</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Autonomous mobile robots (AMR) are expected as smart tools for operations in every automation industry. Path planning and obstacle avoidance is the backbone of AMR as robots have to reach their goal location avoiding obstacles while traversing through optimized path defined according to some criteria such as distance, time or energy. Path planning can be classified into global and local path planning where environmental information is known and unknown/partially known, respectively. A number of sensors are used for data collection. A number of algorithms such as artificial potential field (APF), rapidly exploring random trees (RRT), bidirectional RRT, Fuzzy approach, Purepursuit, A* algorithm, vector field histogram (VFH) and modified local path planning algorithm, etc. have been used in the last three decades for path planning and obstacle avoidance for AMR. This paper makes an attempt to review some of the path planning and obstacle avoidance algorithms used in the field of AMR. The review includes comparative analysis of simulation and mathematical computations of path planning and obstacle avoidance algorithms using MATLAB 2018a. From the review, it could be concluded that different algorithms may complete the same task (i.e. with a different set of instructions) in less or more time, space, effort, etc.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Autonomous%20mobile%20robots" title="Autonomous mobile robots">Autonomous mobile robots</a>, <a href="https://publications.waset.org/search?q=obstacle%20avoidance" title=" obstacle avoidance"> obstacle avoidance</a>, <a href="https://publications.waset.org/search?q=path%20planning" title=" path planning"> path planning</a>, <a href="https://publications.waset.org/search?q=and%20processing%20time." title=" and processing time."> and processing time.</a> </p> <a href="https://publications.waset.org/10009091/a-review-on-comparative-analysis-of-path-planning-and-collision-avoidance-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10009091/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10009091/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10009091/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10009091/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10009091/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10009091/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10009091/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10009091/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10009091/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10009091/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10009091.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">1694</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">833</span> ECG Analysis using Nature Inspired Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.Sankara%20Subramanian">A.Sankara Subramanian</a>, <a href="https://publications.waset.org/search?q=G.Gurusamy"> G.Gurusamy</a>, <a href="https://publications.waset.org/search?q=G.Selvakumar"> G.Selvakumar</a>, <a href="https://publications.waset.org/search?q=P.Gnanasekar"> P.Gnanasekar</a>, <a href="https://publications.waset.org/search?q=A.Nagappan"> A.Nagappan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an algorithm based on the wavelet decomposition, for feature extraction from the ECG signal and recognition of three types of Ventricular Arrhythmias using neural networks. A set of Discrete Wavelet Transform (DWT) coefficients, which contain the maximum information about the arrhythmias, is selected from the wavelet decomposition. After that a novel clustering algorithm based on nature inspired algorithm (Ant Colony Optimization) is developed for classifying arrhythmia types. The algorithm is applied on the ECG registrations from the MIT-BIH arrhythmia and malignant ventricular arrhythmia databases. We applied Daubechies 4 wavelet in our algorithm. The wavelet decomposition enabled us to perform the task efficiently and produced reliable results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Daubechies%204%20Wavelet" title="Daubechies 4 Wavelet">Daubechies 4 Wavelet</a>, <a href="https://publications.waset.org/search?q=ECG" title=" ECG"> ECG</a>, <a href="https://publications.waset.org/search?q=Nature%20inspired%0Aalgorithm" title=" Nature inspired algorithm"> Nature inspired algorithm</a>, <a href="https://publications.waset.org/search?q=Ventricular%20Arrhythmias" title=" Ventricular Arrhythmias"> Ventricular Arrhythmias</a>, <a href="https://publications.waset.org/search?q=Wavelet%20Decomposition." title=" Wavelet Decomposition."> Wavelet Decomposition.</a> </p> <a href="https://publications.waset.org/15617/ecg-analysis-using-nature-inspired-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15617/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15617/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15617/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15617/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15617/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15617/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15617/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15617/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15617/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15617/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15617.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">2310</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">832</span> The Problem of Using the Calculation of the Critical Path to Solver Instances of the Job Shop Scheduling Problem </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Marco%20Antonio%20Cruz-Ch%C3%A1vez">Marco Antonio Cruz-Chávez</a>, <a href="https://publications.waset.org/search?q=Juan%20Frausto-Sol%C3%ADs"> Juan Frausto-Solís</a>, <a href="https://publications.waset.org/search?q=Fernando%20Ramos-Quintana"> Fernando Ramos-Quintana</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>A procedure commonly used in Job Shop Scheduling Problem (JSSP) to evaluate the neighborhoods functions that use the non-deterministic algorithms is the calculation of the critical path in a digraph. This paper presents an experimental study of the cost of computation that exists when the calculation of the critical path in the solution for instances in which a JSSP of large size is involved. The results indicate that if the critical path is use in order to generate neighborhoods in the meta-heuristics that are used in JSSP, an elevated cost of computation exists in spite of the fact that the calculation of the critical path in any digraph is of polynomial complexity.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Job%20Shop" title="Job Shop">Job Shop</a>, <a href="https://publications.waset.org/search?q=CPM" title=" CPM"> CPM</a>, <a href="https://publications.waset.org/search?q=critical%20path" title=" critical path"> critical path</a>, <a href="https://publications.waset.org/search?q=neighborhood" title=" neighborhood"> neighborhood</a>, <a href="https://publications.waset.org/search?q=meta-heuristic." title=" meta-heuristic."> meta-heuristic.</a> </p> <a href="https://publications.waset.org/15077/the-problem-of-using-the-calculation-of-the-critical-path-to-solver-instances-of-the-job-shop-scheduling-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15077/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15077/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15077/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15077/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15077/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15077/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15077/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15077/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15077/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15077/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15077.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">2303</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">831</span> An Improved Transfer Logic of the Two-Path Algorithm for Acoustic Echo Cancellation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Chang%20Liu">Chang Liu</a>, <a href="https://publications.waset.org/search?q=Zishu%20He"> Zishu He</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Adaptive echo cancellers with two-path algorithm are applied to avoid the false adaptation during the double-talk situation. In the two-path algorithm, several transfer logic solutions have been proposed to control the filter update. This paper presents an improved transfer logic solution. It improves the convergence speed of the two-path algorithm, and allows the reduction of the memory elements and computational complexity. Results of simulations show the improved performance of the proposed solution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Acoustic%20echo%20cancellation" title="Acoustic echo cancellation">Acoustic echo cancellation</a>, <a href="https://publications.waset.org/search?q=Echo%20return%20lossenhancement%20%28ERLE%29" title=" Echo return lossenhancement (ERLE)"> Echo return lossenhancement (ERLE)</a>, <a href="https://publications.waset.org/search?q=Two-path%20algorithm" title=" Two-path algorithm"> Two-path algorithm</a>, <a href="https://publications.waset.org/search?q=Transfer%20logic" title=" Transfer logic"> Transfer logic</a> </p> <a href="https://publications.waset.org/11883/an-improved-transfer-logic-of-the-two-path-algorithm-for-acoustic-echo-cancellation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11883/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11883/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11883/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11883/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11883/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11883/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11883/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11883/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11883/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11883/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11883.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">1771</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">830</span> Three-Dimensional Off-Line Path Planning for Unmanned Aerial Vehicle Using Modified Particle Swarm Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Lana%20Dalawr%20Jalal">Lana Dalawr Jalal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper addresses the problem of offline path planning for Unmanned Aerial Vehicles (UAVs) in complex threedimensional environment with obstacles, which is modelled by 3D Cartesian grid system. Path planning for UAVs require the computational intelligence methods to move aerial vehicles along the flight path effectively to target while avoiding obstacles. In this paper Modified Particle Swarm Optimization (MPSO) algorithm is applied to generate the optimal collision free 3D flight path for UAV. The simulations results clearly demonstrate effectiveness of the proposed algorithm in guiding UAV to the final destination by providing optimal feasible path quickly and effectively. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Obstacle%20Avoidance" title="Obstacle Avoidance">Obstacle Avoidance</a>, <a href="https://publications.waset.org/search?q=Particle%20Swarm%20Optimization" title=" Particle Swarm Optimization"> Particle Swarm Optimization</a>, <a href="https://publications.waset.org/search?q=Three-Dimensional%20Path%20Planning%20Unmanned%20Aerial%20Vehicles." title=" Three-Dimensional Path Planning Unmanned Aerial Vehicles."> Three-Dimensional Path Planning Unmanned Aerial Vehicles.</a> </p> <a href="https://publications.waset.org/10002886/three-dimensional-off-line-path-planning-for-unmanned-aerial-vehicle-using-modified-particle-swarm-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10002886/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10002886/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10002886/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10002886/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10002886/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10002886/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10002886/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10002886/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10002886/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10002886/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10002886.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">2046</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">829</span> A Reconfigurable Processing Element Implementation for Matrix Inversion Using Cholesky Decomposition </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Aki%20Happonen">Aki Happonen</a>, <a href="https://publications.waset.org/search?q=Adrian%20Burian"> Adrian Burian</a>, <a href="https://publications.waset.org/search?q=Erwin%20Hemming"> Erwin Hemming</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fixed-point simulation results are used for the performance measure of inverting matrices using a reconfigurable processing element. Matrices are inverted using the Cholesky decomposition algorithm. The reconfigurable processing element is capable of all required mathematical operations. The fixed-point word length analysis is based on simulations of different condition numbers and different matrix sizes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cholesky%20Decomposition" title="Cholesky Decomposition">Cholesky Decomposition</a>, <a href="https://publications.waset.org/search?q=Fixed-point" title=" Fixed-point"> Fixed-point</a>, <a href="https://publications.waset.org/search?q=Matrixinversion" title=" Matrixinversion"> Matrixinversion</a>, <a href="https://publications.waset.org/search?q=Reconfigurable%20processing." title=" Reconfigurable processing."> Reconfigurable processing.</a> </p> <a href="https://publications.waset.org/6843/a-reconfigurable-processing-element-implementation-for-matrix-inversion-using-cholesky-decomposition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6843/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6843/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6843/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6843/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6843/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6843/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6843/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6843/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6843/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6843/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6843.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">1626</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">828</span> Linear Elasticity Problems Solved by Using the Fictitious Domain Method and Total - FETI Domain Decomposition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Lukas%20Mocek">Lukas Mocek</a>, <a href="https://publications.waset.org/search?q=Alexandros%20Markopoulos"> Alexandros Markopoulos</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The main goal of this paper is to show a possibility, how to solve numerically elliptic boundary value problems arising in 2D linear elasticity by using the fictitious domain method (FDM) and the Total-FETI domain decomposition method. We briefly mention the theoretical background of these methods and demonstrate their performance on a benchmark.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Linear%20elasticity" title="Linear elasticity">Linear elasticity</a>, <a href="https://publications.waset.org/search?q=fictitious%20domain%20method" title=" fictitious domain method"> fictitious domain method</a>, <a href="https://publications.waset.org/search?q=Total-FETI" title=" Total-FETI"> Total-FETI</a>, <a href="https://publications.waset.org/search?q=domain%20decomposition" title=" domain decomposition"> domain decomposition</a>, <a href="https://publications.waset.org/search?q=saddle-point%20system." title=" saddle-point system."> saddle-point system.</a> </p> <a href="https://publications.waset.org/4891/linear-elasticity-problems-solved-by-using-the-fictitious-domain-method-and-total-feti-domain-decomposition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4891/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4891/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4891/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4891/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4891/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4891/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4891/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4891/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4891/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4891/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4891.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">1581</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">827</span> Induced Graphoidal Covers in a Graph</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=K.%20Ratan%20Singh">K. Ratan Singh</a>, <a href="https://publications.waset.org/search?q=P.%20K.%20Das"> P. K. Das</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>An induced graphoidal cover of a graph G is a collection ψ of (not necessarily open) paths in G such that every path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ, every edge of G is in exactly one path in ψ and every member of ψ is an induced cycle or an induced path. The minimum cardinality of an induced graphoidal cover of G is called the induced graphoidal covering number of G and is denoted by ηi(G) or ηi. Here we find induced graphoidal cover for some classes of graphs.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Graphoidal%20cover" title="Graphoidal cover">Graphoidal cover</a>, <a href="https://publications.waset.org/search?q=Induced%20graphoidal%20cover" title=" Induced graphoidal cover"> Induced graphoidal cover</a>, <a href="https://publications.waset.org/search?q=Induced%20graphoidal%20covering%20number." title=" Induced graphoidal covering number."> Induced graphoidal covering number.</a> </p> <a href="https://publications.waset.org/10283/induced-graphoidal-covers-in-a-graph" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10283/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10283/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10283/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10283/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10283/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10283/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10283/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10283/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10283/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10283/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10283.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">1430</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/search?q=Path%20decomposition&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Path%20decomposition&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Path%20decomposition&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Path%20decomposition&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Path%20decomposition&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Path%20decomposition&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Path%20decomposition&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Path%20decomposition&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Path%20decomposition&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/search?q=Path%20decomposition&page=28">28</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Path%20decomposition&page=29">29</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Path%20decomposition&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>