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: Laplacian matrix</title> <meta name="description" content="Search results for: Laplacian matrix"> <meta name="keywords" content="Laplacian matrix"> <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="Laplacian matrix" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="Laplacian matrix"> <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> 2246</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: Laplacian matrix</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2246</span> The Second Smallest Eigenvalue of Complete Tripartite Hypergraph</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alfi%20Y.%20Zakiyyah">Alfi Y. Zakiyyah</a>, <a href="https://publications.waset.org/abstracts/search?q=Hanni%20Garminia"> Hanni Garminia</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Salman"> M. Salman</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20N.%20Irawati"> A. N. Irawati</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the terminology of the hypergraph, there is a relation with the terminology graph. In the theory of graph, the edges connected two vertices. In otherwise, in hypergraph, the edges can connect more than two vertices. There is representation matrix of a graph such as adjacency matrix, Laplacian matrix, and incidence matrix. The adjacency matrix is symmetry matrix so that all eigenvalues is real. This matrix is a nonnegative matrix. The all diagonal entry from adjacency matrix is zero so that the trace is zero. Another representation matrix of the graph is the Laplacian matrix. Laplacian matrix is symmetry matrix and semidefinite positive so that all eigenvalues are real and non-negative. According to the spectral study in the graph, some that result is generalized to hypergraph. A hypergraph can be represented by a matrix such as adjacency, incidence, and Laplacian matrix. Throughout for this term, we use Laplacian matrix to represent a complete tripartite hypergraph. The aim from this research is to determine second smallest eigenvalues from this matrix and find a relation this eigenvalue with the connectivity of that hypergraph. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=connectivity" title="connectivity">connectivity</a>, <a href="https://publications.waset.org/abstracts/search?q=graph" title=" graph"> graph</a>, <a href="https://publications.waset.org/abstracts/search?q=hypergraph" title=" hypergraph"> hypergraph</a>, <a href="https://publications.waset.org/abstracts/search?q=Laplacian%20matrix" title=" Laplacian matrix"> Laplacian matrix</a> </p> <a href="https://publications.waset.org/abstracts/34000/the-second-smallest-eigenvalue-of-complete-tripartite-hypergraph" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34000.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">488</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2245</span> Bounds on the Laplacian Vertex PI Energy</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ezgi%20Kaya">Ezgi Kaya</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Dilek%20Maden"> A. Dilek Maden</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A topological index is a number related to graph which is invariant under graph isomorphism. In theoretical chemistry, molecular structure descriptors (also called topological indices) are used for modeling physicochemical, pharmacologic, toxicologic, biological and other properties of chemical compounds. Let G be a graph with n vertices and m edges. For a given edge uv, the quantity nu(e) denotes the number of vertices closer to u than v, the quantity nv(e) is defined analogously. The vertex PI index defined as the sum of the nu(e) and nv(e). Here the sum is taken over all edges of G. The energy of a graph is defined as the sum of the eigenvalues of adjacency matrix of G and the Laplacian energy of a graph is defined as the sum of the absolute value of difference of laplacian eigenvalues and average degree of G. In theoretical chemistry, the π-electron energy of a conjugated carbon molecule, computed using the Hückel theory, coincides with the energy. Hence results on graph energy assume special significance. The Laplacian matrix of a graph G weighted by the vertex PI weighting is the Laplacian vertex PI matrix and the Laplacian vertex PI eigenvalues of a connected graph G are the eigenvalues of its Laplacian vertex PI matrix. In this study, Laplacian vertex PI energy of a graph is defined of G. We also give some bounds for the Laplacian vertex PI energy of graphs in terms of vertex PI index, the sum of the squares of entries in the Laplacian vertex PI matrix and the absolute value of the determinant of the Laplacian vertex PI matrix. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=energy" title="energy">energy</a>, <a href="https://publications.waset.org/abstracts/search?q=Laplacian%20energy" title=" Laplacian energy"> Laplacian energy</a>, <a href="https://publications.waset.org/abstracts/search?q=laplacian%20vertex%20PI%20eigenvalues" title=" laplacian vertex PI eigenvalues"> laplacian vertex PI eigenvalues</a>, <a href="https://publications.waset.org/abstracts/search?q=Laplacian%20vertex%20PI%20energy" title=" Laplacian vertex PI energy"> Laplacian vertex PI energy</a>, <a href="https://publications.waset.org/abstracts/search?q=vertex%20PI%20index" title=" vertex PI index"> vertex PI index</a> </p> <a href="https://publications.waset.org/abstracts/73194/bounds-on-the-laplacian-vertex-pi-energy" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/73194.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">245</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2244</span> Normalized Laplacian Eigenvalues of Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shaowei%20Sun">Shaowei Sun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let G be a graph with vertex set V(G)={v_1,v_2,...,v_n} and edge set E(G). For any vertex v belong to V(G), let d_v denote the degree of v. The normalized Laplacian matrix of the graph G is the matrix where the non-diagonal (i,j)-th entry is -1/(d_id_j) when vertex i is adjacent to vertex j and 0 when they are not adjacent, and the diagonal (i,i)-th entry is the di. In this paper, we discuss some bounds on the largest and the second smallest normalized Laplacian eigenvalue of trees and graphs. As following, we found some new bounds on the second smallest normalized Laplacian eigenvalue of tree T in terms of graph parameters. Moreover, we use Sage to give some conjectures on the second largest and the third smallest normalized eigenvalues of graph. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph" title="graph">graph</a>, <a href="https://publications.waset.org/abstracts/search?q=normalized%20Laplacian%20eigenvalues" title=" normalized Laplacian eigenvalues"> normalized Laplacian eigenvalues</a>, <a href="https://publications.waset.org/abstracts/search?q=normalized%20Laplacian%20matrix" title=" normalized Laplacian matrix"> normalized Laplacian matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=tree" title=" tree"> tree</a> </p> <a href="https://publications.waset.org/abstracts/41326/normalized-laplacian-eigenvalues-of-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41326.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">328</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2243</span> Extremal Laplacian Energy of Threshold Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seyed%20Ahmad%20Mojallal">Seyed Ahmad Mojallal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let G be a connected threshold graph of order n with m edges and trace T. In this talk we give a lower bound on Laplacian energy in terms of n, m, and T of G. From this we determine the threshold graphs with the first four minimal Laplacian energies. We also list the first 20 minimal Laplacian energies among threshold graphs. Let σ=σ(G) be the number of Laplacian eigenvalues greater than or equal to average degree of graph G. Using this concept, we obtain the threshold graphs with the largest and the second largest Laplacian energies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Laplacian%20eigenvalues" title="Laplacian eigenvalues">Laplacian eigenvalues</a>, <a href="https://publications.waset.org/abstracts/search?q=Laplacian%20energy" title=" Laplacian energy"> Laplacian energy</a>, <a href="https://publications.waset.org/abstracts/search?q=threshold%20graphs" title=" threshold graphs"> threshold graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=extremal%20graphs" title=" extremal graphs"> extremal graphs</a> </p> <a href="https://publications.waset.org/abstracts/41332/extremal-laplacian-energy-of-threshold-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41332.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">388</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2242</span> Vehicle to Vehicle Communication: Collision Avoidance Scenarios</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Emad">Ahmed Emad</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Salah"> Ahmed Salah</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdelrahman%20Magdy"> Abdelrahman Magdy</a>, <a href="https://publications.waset.org/abstracts/search?q=Omar%20Rashid"> Omar Rashid</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Adel"> Mohammed Adel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research paper discusses vehicle-to-vehicle technology as an important application of linear algebra. This communication technology represents an efficient and promising application to help to ensure the safety of the drivers by warning them when a crash possibility is close. The major link that combines our topic with linear algebra is the Laplacian matrix. Some main definitions used in the V2V were illustrated, such as VANET and its characteristics. The V2V technology could be applied in different applications with different traffic scenarios and various ways to warn car drivers. These scenarios were simulated programs such as MATLAB and Python to test how the V2V system would respond to the different scenarios and warn the car drivers exposed to the threat of collisions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=V2V%20communication" title="V2V communication">V2V communication</a>, <a href="https://publications.waset.org/abstracts/search?q=vehicle%20to%20vehicle%20scenarios" title=" vehicle to vehicle scenarios"> vehicle to vehicle scenarios</a>, <a href="https://publications.waset.org/abstracts/search?q=VANET" title=" VANET"> VANET</a>, <a href="https://publications.waset.org/abstracts/search?q=FCW" title=" FCW"> FCW</a>, <a href="https://publications.waset.org/abstracts/search?q=EEBL" title=" EEBL"> EEBL</a>, <a href="https://publications.waset.org/abstracts/search?q=IMA" title=" IMA"> IMA</a>, <a href="https://publications.waset.org/abstracts/search?q=Laplacian%20matrix" title=" Laplacian matrix"> Laplacian matrix</a> </p> <a href="https://publications.waset.org/abstracts/156914/vehicle-to-vehicle-communication-collision-avoidance-scenarios" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/156914.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">163</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2241</span> Kirchoff Type Equation Involving the p-Laplacian on the Sierpinski Gasket Using Nehari Manifold Technique</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abhilash%20Sahu">Abhilash Sahu</a>, <a href="https://publications.waset.org/abstracts/search?q=Amit%20Priyadarshi"> Amit Priyadarshi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we will discuss the existence of weak solutions of the Kirchhoff type boundary value problem on the Sierpinski gasket. Where S denotes the Sierpinski gasket in R² and S₀ is the intrinsic boundary of the Sierpinski gasket. M: R → R is a positive function and h: S × R → R is a suitable function which is a part of our main equation. ∆p denotes the p-Laplacian, where p > 1. First of all, we will define a weak solution for our problem and then we will show the existence of at least two solutions for the above problem under suitable conditions. There is no well-known concept of a generalized derivative of a function on a fractal domain. Recently, the notion of differential operators such as the Laplacian and the p-Laplacian on fractal domains has been defined. We recall the result first then we will address the above problem. In view of literature, Laplacian and p-Laplacian equations are studied extensively on regular domains (open connected domains) in contrast to fractal domains. In fractal domains, people have studied Laplacian equations more than p-Laplacian probably because in that case, the corresponding function space is reflexive and many minimax theorems which work for regular domains is applicable there which is not the case for the p-Laplacian. This motivates us to study equations involving p-Laplacian on the Sierpinski gasket. Problems on fractal domains lead to nonlinear models such as reaction-diffusion equations on fractals, problems on elastic fractal media and fluid flow through fractal regions etc. We have studied the above p-Laplacian equations on the Sierpinski gasket using fibering map technique on the Nehari manifold. Many authors have studied the Laplacian and p-Laplacian equations on regular domains using this Nehari manifold technique. In general Euler functional associated with such a problem is Frechet or Gateaux differentiable. So, a critical point becomes a solution to the problem. Also, the function space they consider is reflexive and hence we can extract a weakly convergent subsequence from a bounded sequence. But in our case neither the Euler functional is differentiable nor the function space is known to be reflexive. Overcoming these issues we are still able to prove the existence of at least two solutions of the given equation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Euler%20functional" title="Euler functional">Euler functional</a>, <a href="https://publications.waset.org/abstracts/search?q=p-Laplacian" title=" p-Laplacian"> p-Laplacian</a>, <a href="https://publications.waset.org/abstracts/search?q=p-energy" title=" p-energy"> p-energy</a>, <a href="https://publications.waset.org/abstracts/search?q=Sierpinski%20gasket" title=" Sierpinski gasket"> Sierpinski gasket</a>, <a href="https://publications.waset.org/abstracts/search?q=weak%20solution" title=" weak solution"> weak solution</a> </p> <a href="https://publications.waset.org/abstracts/89044/kirchoff-type-equation-involving-the-p-laplacian-on-the-sierpinski-gasket-using-nehari-manifold-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89044.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">234</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2240</span> Some New Bounds for a Real Power of the Normalized Laplacian Eigenvalues</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ay%C5%9Fe%20Dilek%20Maden">Ayşe Dilek Maden</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For a given a simple connected graph, we present some new bounds via a new approach for a special topological index given by the sum of the real number power of the non-zero normalized Laplacian eigenvalues. To use this approach presents an advantage not only to derive old and new bounds on this topic but also gives an idea how some previous results in similar area can be developed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=degree%20Kirchhoff%20index" title="degree Kirchhoff index">degree Kirchhoff index</a>, <a href="https://publications.waset.org/abstracts/search?q=normalized%20Laplacian%20eigenvalue" title=" normalized Laplacian eigenvalue"> normalized Laplacian eigenvalue</a>, <a href="https://publications.waset.org/abstracts/search?q=spanning%20tree" title=" spanning tree"> spanning tree</a>, <a href="https://publications.waset.org/abstracts/search?q=simple%20connected%20graph" title=" simple connected graph"> simple connected graph</a> </p> <a href="https://publications.waset.org/abstracts/13999/some-new-bounds-for-a-real-power-of-the-normalized-laplacian-eigenvalues" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13999.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">366</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2239</span> Normalized P-Laplacian: From Stochastic Game to Image Processing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abderrahim%20Elmoataz">Abderrahim Elmoataz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> More and more contemporary applications involve data in the form of functions defined on irregular and topologically complicated domains (images, meshs, points clouds, networks, etc). Such data are not organized as familiar digital signals and images sampled on regular lattices. However, they can be conveniently represented as graphs where each vertex represents measured data and each edge represents a relationship (connectivity or certain affinities or interaction) between two vertices. Processing and analyzing these types of data is a major challenge for both image and machine learning communities. Hence, it is very important to transfer to graphs and networks many of the mathematical tools which were initially developed on usual Euclidean spaces and proven to be efficient for many inverse problems and applications dealing with usual image and signal domains. Historically, the main tools for the study of graphs or networks come from combinatorial and graph theory. In recent years there has been an increasing interest in the investigation of one of the major mathematical tools for signal and image analysis, which are Partial Differential Equations (PDEs) variational methods on graphs. The normalized p-laplacian operator has been recently introduced to model a stochastic game called tug-of-war-game with noise. Part interest of this class of operators arises from the fact that it includes, as particular case, the infinity Laplacian, the mean curvature operator and the traditionnal Laplacian operators which was extensiveley used to models and to solve problems in image processing. The purpose of this paper is to introduce and to study a new class of normalized p-Laplacian on graphs. The introduction is based on the extension of p-harmonious function introduced in as discrete approximation for both infinity Laplacian and p-Laplacian equations. Finally, we propose to use these operators as a framework for solving many inverse problems in image processing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=normalized%20p-laplacian" title="normalized p-laplacian">normalized p-laplacian</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20processing" title=" image processing"> image processing</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20game" title=" stochastic game"> stochastic game</a>, <a href="https://publications.waset.org/abstracts/search?q=inverse%20problems" title=" inverse problems"> inverse problems</a> </p> <a href="https://publications.waset.org/abstracts/24175/normalized-p-laplacian-from-stochastic-game-to-image-processing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24175.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">512</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2238</span> Fundamental Solutions for Discrete Dynamical Systems Involving the Fractional Laplacian</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jorge%20Gonzalez%20Camus">Jorge Gonzalez Camus</a>, <a href="https://publications.waset.org/abstracts/search?q=Valentin%20Keyantuo"> Valentin Keyantuo</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahamadi%20Warma"> Mahamadi Warma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work, we obtain representation results for solutions of a time-fractional differential equation involving the discrete fractional Laplace operator in terms of generalized Wright functions. Such equations arise in the modeling of many physical systems, for example, chain processes in chemistry and radioactivity. The focus is on the linear problem of the simplified Moore - Gibson - Thompson equation, where the discrete fractional Laplacian and the Caputo fractional derivate of order on (0,2] are involved. As a particular case, we obtain the explicit solution for the discrete heat equation and discrete wave equation. Furthermore, we show the explicit solution for the equation involving the perturbed Laplacian by the identity operator. The main tool for obtaining the explicit solution are the Laplace and discrete Fourier transforms, and Stirling's formula. The methodology mainly is to apply both transforms in the equation, to find the inverse of each transform, and to prove that this solution is well defined, using Stirling´s formula. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=discrete%20fractional%20Laplacian" title="discrete fractional Laplacian">discrete fractional Laplacian</a>, <a href="https://publications.waset.org/abstracts/search?q=explicit%20representation%20of%20solutions" title=" explicit representation of solutions"> explicit representation of solutions</a>, <a href="https://publications.waset.org/abstracts/search?q=fractional%20heat%20and%20wave%20equations" title=" fractional heat and wave equations"> fractional heat and wave equations</a>, <a href="https://publications.waset.org/abstracts/search?q=fundamental" title=" fundamental"> fundamental</a> </p> <a href="https://publications.waset.org/abstracts/99922/fundamental-solutions-for-discrete-dynamical-systems-involving-the-fractional-laplacian" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/99922.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">209</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2237</span> Graph Similarity: Algebraic Model and Its Application to Nonuniform Signal Processing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nileshkumar%20Vishnav">Nileshkumar Vishnav</a>, <a href="https://publications.waset.org/abstracts/search?q=Aditya%20Tatu"> Aditya Tatu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A recent approach of representing graph signals and graph filters as polynomials is useful for graph signal processing. In this approach, the adjacency matrix plays pivotal role; instead of the more common approach involving graph-Laplacian. In this work, we follow the adjacency matrix based approach and corresponding algebraic signal model. We further expand the theory and introduce the concept of similarity of two graphs. The similarity of graphs is useful in that key properties (such as filter-response, algebra related to graph) get transferred from one graph to another. We demonstrate potential applications of the relation between two similar graphs, such as nonuniform filter design, DTMF detection and signal reconstruction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph%20signal%20processing" title="graph signal processing">graph signal processing</a>, <a href="https://publications.waset.org/abstracts/search?q=algebraic%20signal%20processing" title=" algebraic signal processing"> algebraic signal processing</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20similarity" title=" graph similarity"> graph similarity</a>, <a href="https://publications.waset.org/abstracts/search?q=isospectral%20graphs" title=" isospectral graphs"> isospectral graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=nonuniform%20signal%20processing" title=" nonuniform signal processing"> nonuniform signal processing</a> </p> <a href="https://publications.waset.org/abstracts/59404/graph-similarity-algebraic-model-and-its-application-to-nonuniform-signal-processing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59404.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">352</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2236</span> Electromyography Pattern Classification with Laplacian Eigenmaps in Human Running</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Elnaz%20Lashgari">Elnaz Lashgari</a>, <a href="https://publications.waset.org/abstracts/search?q=Emel%20Demircan"> Emel Demircan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Electromyography (EMG) is one of the most important interfaces between humans and robots for rehabilitation. Decoding this signal helps to recognize muscle activation and converts it into smooth motion for the robots. Detecting each muscle’s pattern during walking and running is vital for improving the quality of a patient’s life. In this study, EMG data from 10 muscles in 10 subjects at 4 different speeds were analyzed. EMG signals are nonlinear with high dimensionality. To deal with this challenge, we extracted some features in time-frequency domain and used manifold learning and Laplacian Eigenmaps algorithm to find the intrinsic features that represent data in low-dimensional space. We then used the Bayesian classifier to identify various patterns of EMG signals for different muscles across a range of running speeds. The best result for vastus medialis muscle corresponds to 97.87±0.69 for sensitivity and 88.37±0.79 for specificity with 97.07±0.29 accuracy using Bayesian classifier. The results of this study provide important insight into human movement and its application for robotics research. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=electromyography" title="electromyography">electromyography</a>, <a href="https://publications.waset.org/abstracts/search?q=manifold%20learning" title=" manifold learning"> manifold learning</a>, <a href="https://publications.waset.org/abstracts/search?q=ISOMAP" title=" ISOMAP"> ISOMAP</a>, <a href="https://publications.waset.org/abstracts/search?q=Laplacian%20Eigenmaps" title=" Laplacian Eigenmaps"> Laplacian Eigenmaps</a>, <a href="https://publications.waset.org/abstracts/search?q=locally%20linear%20embedding" title=" locally linear embedding"> locally linear embedding</a> </p> <a href="https://publications.waset.org/abstracts/61632/electromyography-pattern-classification-with-laplacian-eigenmaps-in-human-running" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/61632.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">361</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2235</span> Edge Detection in Low Contrast Images</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Koushlendra%20Kumar%20Singh">Koushlendra Kumar Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Manish%20Kumar%20Bajpai"> Manish Kumar Bajpai</a>, <a href="https://publications.waset.org/abstracts/search?q=Rajesh%20K.%20Pandey"> Rajesh K. Pandey</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The edges of low contrast images are not clearly distinguishable to the human eye. It is difficult to find the edges and boundaries in it. The present work encompasses a new approach for low contrast images. The Chebyshev polynomial based fractional order filter has been used for filtering operation on an image. The preprocessing has been performed by this filter on the input image. Laplacian of Gaussian method has been applied on preprocessed image for edge detection. The algorithm has been tested on two test images. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=low%20contrast%20image" title="low contrast image">low contrast image</a>, <a href="https://publications.waset.org/abstracts/search?q=fractional%20order%20differentiator" title="fractional order differentiator">fractional order differentiator</a>, <a href="https://publications.waset.org/abstracts/search?q=Laplacian%20of%20Gaussian%20%28LoG%29%20method" title="Laplacian of Gaussian (LoG) method">Laplacian of Gaussian (LoG) method</a>, <a href="https://publications.waset.org/abstracts/search?q=chebyshev%20polynomial" title=" chebyshev polynomial"> chebyshev polynomial</a> </p> <a href="https://publications.waset.org/abstracts/21264/edge-detection-in-low-contrast-images" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21264.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">635</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2234</span> Conditions on Expressing a Matrix as a Sum of α-Involutions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ric%20Joseph%20R.%20Murillo">Ric Joseph R. Murillo</a>, <a href="https://publications.waset.org/abstracts/search?q=Edna%20N.%20Gueco"> Edna N. Gueco</a>, <a href="https://publications.waset.org/abstracts/search?q=Dennis%20I.%20Merino"> Dennis I. Merino</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let F be C or R, where C and R are the set of complex numbers and real numbers, respectively, and n be a natural number. An n-by-n matrix A over the field F is called an α-involutory matrix or an α-involution if there exists an α in the field such that the square of the matrix is equal to αI, where I is the n-by-n identity matrix. If α is a complex number or a nonnegative real number, then an n-by-n matrix A over the field F can be written as a sum of n-by-n α-involutory matrices over the field F if and only if the trace of that matrix is an integral multiple of the square root of α. Meanwhile, if α is a negative real number, then a 2n-by-2n matrix A over R can be written as a sum of 2n-by-2n α-involutory matrices over R if and only the trace of the matrix is zero. Some other properties of α-involutory matrices are also determined <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=%CE%B1-involutory%20Matrices" title="α-involutory Matrices">α-involutory Matrices</a>, <a href="https://publications.waset.org/abstracts/search?q=sum%20of%20%CE%B1-involutory%20Matrices" title=" sum of α-involutory Matrices"> sum of α-involutory Matrices</a>, <a href="https://publications.waset.org/abstracts/search?q=Trace" title=" Trace"> Trace</a>, <a href="https://publications.waset.org/abstracts/search?q=Matrix%20Theory" title=" Matrix Theory"> Matrix Theory</a> </p> <a href="https://publications.waset.org/abstracts/95131/conditions-on-expressing-a-matrix-as-a-sum-of-a-involutions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/95131.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">198</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2233</span> Manufacturing and Characterization of Ni-Matrix Composite Reinforced with Ti3SiC2 and Ti2AlC; and Al-Matrix with Ti2SiC</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Hadji">M. Hadji</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Chiker"> N. Chiker</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.%20Hadji"> Y. Hadji</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Haddad"> A. Haddad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we report for the first time on the synthesis and characterization of novel MAX phases (Ti3SiC2, Ti2AlC) reinforced Ni-matrix and Ti2AlC reinforced Al-matrix. The stability of MAX phases in Al-matrix and Ni-matrix at a temperature of 985°C has been investigated. All the composites were cold pressed and sintered at a temperature of 985°C for 20min in H2 environment, except (Ni/Ti3SiC2) who was sintered at 1100°C for 1h.Microstructure analysis by scanning electron microscopy and phase analysis by X-Ray diffraction confirmed that there was minimal interfacial reaction between MAX particles and Ni, thus Al/MAX samples shown that MAX phases was totally decomposed at 985°C.The Addition of MAX enhanced the Al-matrix and Ni-matrix. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=MAX%20phase" title="MAX phase">MAX phase</a>, <a href="https://publications.waset.org/abstracts/search?q=microstructures" title=" microstructures"> microstructures</a>, <a href="https://publications.waset.org/abstracts/search?q=composites" title=" composites"> composites</a>, <a href="https://publications.waset.org/abstracts/search?q=hardness" title=" hardness"> hardness</a>, <a href="https://publications.waset.org/abstracts/search?q=SEM" title=" SEM"> SEM</a> </p> <a href="https://publications.waset.org/abstracts/40223/manufacturing-and-characterization-of-ni-matrix-composite-reinforced-with-ti3sic2-and-ti2alc-and-al-matrix-with-ti2sic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40223.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">347</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2232</span> Inverse Matrix in the Theory of Dynamical Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Renata%20Masarova">Renata Masarova</a>, <a href="https://publications.waset.org/abstracts/search?q=Bohuslava%20Juhasova"> Bohuslava Juhasova</a>, <a href="https://publications.waset.org/abstracts/search?q=Martin%20Juhas"> Martin Juhas</a>, <a href="https://publications.waset.org/abstracts/search?q=Zuzana%20Sutova"> Zuzana Sutova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In dynamic system theory a mathematical model is often used to describe their properties. In order to find a transfer matrix of a dynamic system we need to calculate an inverse matrix. The paper contains the fusion of the classical theory and the procedures used in the theory of automated control for calculating the inverse matrix. The final part of the paper models the given problem by the Matlab. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20system" title="dynamic system">dynamic system</a>, <a href="https://publications.waset.org/abstracts/search?q=transfer%20matrix" title=" transfer matrix"> transfer matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=inverse%20matrix" title=" inverse matrix"> inverse matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=modeling" title=" modeling "> modeling </a> </p> <a href="https://publications.waset.org/abstracts/22680/inverse-matrix-in-the-theory-of-dynamical-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22680.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">515</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2231</span> Existence and Concentration of Solutions for a Class of Elliptic Partial Differential Equations Involving p-Biharmonic Operator</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Debajyoti%20Choudhuri">Debajyoti Choudhuri</a>, <a href="https://publications.waset.org/abstracts/search?q=Ratan%20Kumar%20Giri"> Ratan Kumar Giri</a>, <a href="https://publications.waset.org/abstracts/search?q=Shesadev%20Pradhan"> Shesadev Pradhan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The perturbed nonlinear Schrodinger equation involving the p-biharmonic and the p-Laplacian operators involving a real valued parameter and a continuous real valued potential function defined over the N- dimensional Euclidean space has been considered. By the variational technique, an existence result pertaining to a nontrivial solution to this non-linear partial differential equation has been proposed. Further, by the Concentration lemma, the concentration of solutions to the same problem defined on the set consisting of those elements where the potential function vanishes as the real parameter approaches to infinity has been addressed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=p-Laplacian" title="p-Laplacian">p-Laplacian</a>, <a href="https://publications.waset.org/abstracts/search?q=p-biharmonic" title=" p-biharmonic"> p-biharmonic</a>, <a href="https://publications.waset.org/abstracts/search?q=elliptic%20PDEs" title=" elliptic PDEs"> elliptic PDEs</a>, <a href="https://publications.waset.org/abstracts/search?q=Concentration%20lemma" title=" Concentration lemma"> Concentration lemma</a>, <a href="https://publications.waset.org/abstracts/search?q=Sobolev%20space" title=" Sobolev space"> Sobolev space</a> </p> <a href="https://publications.waset.org/abstracts/58393/existence-and-concentration-of-solutions-for-a-class-of-elliptic-partial-differential-equations-involving-p-biharmonic-operator" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58393.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">234</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2230</span> Biologically Inspired Small Infrared Target Detection Using Local Contrast Mechanisms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tian%20Xia">Tian Xia</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuan%20Yan%20Tang"> Yuan Yan Tang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In order to obtain higher small target detection accuracy, this paper presents an effective algorithm inspired by the local contrast mechanism. The proposed method can enhance target signal and suppress background clutter simultaneously. In the first stage, a enhanced image is obtained using the proposed Weighted Laplacian of Gaussian. In the second stage, an adaptive threshold is adopted to segment the target. Experimental results on two changeling image sequences show that the proposed method can detect the bright and dark targets simultaneously, and is not sensitive to sea-sky line of the infrared image. So it is fit for IR small infrared target detection. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=small%20target%20detection" title="small target detection">small target detection</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20contrast" title=" local contrast"> local contrast</a>, <a href="https://publications.waset.org/abstracts/search?q=human%20vision%20system" title=" human vision system"> human vision system</a>, <a href="https://publications.waset.org/abstracts/search?q=Laplacian%20of%20Gaussian" title=" Laplacian of Gaussian"> Laplacian of Gaussian</a> </p> <a href="https://publications.waset.org/abstracts/19199/biologically-inspired-small-infrared-target-detection-using-local-contrast-mechanisms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19199.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">468</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2229</span> On the Application of Heuristics of the Traveling Salesman Problem for the Task of Restoring the DNA Matrix</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Boris%20Melnikov">Boris Melnikov</a>, <a href="https://publications.waset.org/abstracts/search?q=Dmitrii%20Chaikovskii"> Dmitrii Chaikovskii</a>, <a href="https://publications.waset.org/abstracts/search?q=Elena%20Melnikova"> Elena Melnikova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The traveling salesman problem (TSP) is a well-known optimization problem that seeks to find the shortest possible route that visits a set of points and returns to the starting point. In this paper, we apply some heuristics of the TSP for the task of restoring the DNA matrix. This restoration problem is often considered in biocybernetics. For it, we must recover the matrix of distances between DNA sequences if not all the elements of the matrix under consideration are known at the input. We consider the possibility of using this method in the testing of distance calculation algorithms between a pair of DNAs to restore the partially filled matrix. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimization%20problems" title="optimization problems">optimization problems</a>, <a href="https://publications.waset.org/abstracts/search?q=DNA%20matrix" title=" DNA matrix"> DNA matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=partially%20filled%20matrix" title=" partially filled matrix"> partially filled matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=traveling%20salesman%20problem" title=" traveling salesman problem"> traveling salesman problem</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic%20algorithms" title=" heuristic algorithms"> heuristic algorithms</a> </p> <a href="https://publications.waset.org/abstracts/172868/on-the-application-of-heuristics-of-the-traveling-salesman-problem-for-the-task-of-restoring-the-dna-matrix" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/172868.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">150</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2228</span> On Block Vandermonde Matrix Constructed from Matrix Polynomial Solvents</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Malika%20Yaici">Malika Yaici</a>, <a href="https://publications.waset.org/abstracts/search?q=Kamel%20Hariche"> Kamel Hariche</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In control engineering, systems described by matrix fractions are studied through properties of block roots, also called solvents. These solvents are usually dealt with in a block Vandermonde matrix form. Inverses and determinants of Vandermonde matrices and block Vandermonde matrices are used in solving problems of numerical analysis in many domains but require costly computations. Even though Vandermonde matrices are well known and method to compute inverse and determinants are many and, generally, based on interpolation techniques, methods to compute the inverse and determinant of a block Vandermonde matrix have not been well studied. In this paper, some properties of these matrices and iterative algorithms to compute the determinant and the inverse of a block Vandermonde matrix are given. These methods are deducted from the partitioned matrix inversion and determinant computing methods. Due to their great size, parallelization may be a solution to reduce the computations cost, so a parallelization of these algorithms is proposed and validated by a comparison using algorithmic complexity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=block%20vandermonde%20matrix" title="block vandermonde matrix">block vandermonde matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=solvents" title=" solvents"> solvents</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix%20polynomial" title=" matrix polynomial"> matrix polynomial</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix%20inverse" title=" matrix inverse"> matrix inverse</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix%20determinant" title=" matrix determinant"> matrix determinant</a>, <a href="https://publications.waset.org/abstracts/search?q=parallelization" title=" parallelization"> parallelization</a> </p> <a href="https://publications.waset.org/abstracts/89115/on-block-vandermonde-matrix-constructed-from-matrix-polynomial-solvents" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89115.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">239</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2227</span> On Direct Matrix Factored Inversion via Broyden's Updates</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adel%20Mohsen">Adel Mohsen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A direct method based on the good Broyden's updates for evaluating the inverse of a nonsingular square matrix of full rank and solving related system of linear algebraic equations is studied. For a matrix A of order n whose LU-decomposition is A = LU, the multiplication count is O (n3). This includes the evaluation of the LU-decompositions of the inverse, the lower triangular decomposition of A as well as a “reduced matrix inverse”. If an explicit value of the inverse is not needed the order reduces to O (n3/2) to compute to compute inv(U) and the reduced inverse. For a symmetric matrix only O (n3/3) operations are required to compute inv(L) and the reduced inverse. An example is presented to demonstrate the capability of using the reduced matrix inverse in treating ill-conditioned systems. Besides the simplicity of Broyden's update, the method provides a mean to exploit the possible sparsity in the matrix and to derive a suitable preconditioner. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Broyden%27s%20updates" title="Broyden's updates">Broyden's updates</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix%20inverse" title=" matrix inverse"> matrix inverse</a>, <a href="https://publications.waset.org/abstracts/search?q=inverse%20factorization" title=" inverse factorization"> inverse factorization</a>, <a href="https://publications.waset.org/abstracts/search?q=solution%20of%20linear%20algebraic%20equations" title=" solution of linear algebraic equations"> solution of linear algebraic equations</a>, <a href="https://publications.waset.org/abstracts/search?q=ill-conditioned%20matrices" title=" ill-conditioned matrices"> ill-conditioned matrices</a>, <a href="https://publications.waset.org/abstracts/search?q=preconditioning" title=" preconditioning"> preconditioning</a> </p> <a href="https://publications.waset.org/abstracts/22126/on-direct-matrix-factored-inversion-via-broydens-updates" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22126.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">479</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2226</span> A Review on Aluminium Metal Matric Composites</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=V.%20Singh">V. Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Singh"> S. Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20S.%20Garewal"> S. S. Garewal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Metal matrix composites with aluminum as the matrix material have been heralded as the next great development in advanced engineering materials. Aluminum metal matrix composites (AMMC) refer to the class of light weight high performance material systems. Properties of AMMCs can be tailored to the demands of different industrial applications by suitable combinations of matrix, reinforcement and processing route. AMMC finds its application in automotive, aerospace, defense, sports and structural areas. This paper presents an overview of AMMC material systems on aspects relating to processing, types and applications with case studies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=aluminum%20metal%20matrix%20composites" title="aluminum metal matrix composites">aluminum metal matrix composites</a>, <a href="https://publications.waset.org/abstracts/search?q=applications%20of%20aluminum%20metal%20matrix%20composites" title=" applications of aluminum metal matrix composites"> applications of aluminum metal matrix composites</a>, <a href="https://publications.waset.org/abstracts/search?q=lighting%20material%20processing%20of%20aluminum%20metal%20matrix%20composites" title=" lighting material processing of aluminum metal matrix composites"> lighting material processing of aluminum metal matrix composites</a> </p> <a href="https://publications.waset.org/abstracts/62849/a-review-on-aluminium-metal-matric-composites" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/62849.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">464</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2225</span> Numerical Simulation of Effect of Various Rib Configurations on Enhancing Heat Transfer of Matrix Cooling Channel</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seok%20Min%20Choi">Seok Min Choi</a>, <a href="https://publications.waset.org/abstracts/search?q=Minho%20Bang"> Minho Bang</a>, <a href="https://publications.waset.org/abstracts/search?q=Seuong%20Yun%20Kim"> Seuong Yun Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyungmin%20Lee"> Hyungmin Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Won-Gu%20Joo"> Won-Gu Joo</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyung%20Hee%20Cho"> Hyung Hee Cho</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The matrix cooling channel was used for gas turbine blade cooling passage. The matrix cooling structure is useful for the structure stability however the cooling performance of internal cooling channel was not enough for cooling. Therefore, we designed the rib configurations in the matrix cooling channel to enhance the cooling performance. The numerical simulation was conducted to analyze cooling performance of rib configured matrix cooling channel. Three different rib configurations were used which are vertical rib, angled rib and c-type rib. Three configurations were adopted in two positions of matrix cooling channel which is one fourth and three fourth of channel. The result shows that downstream rib has much higher cooling performance than upstream rib. Furthermore, the angled rib in the channel has much higher cooling performance than vertical rib. This is because; the angled rib improves the swirl effect of matrix cooling channel more effectively. The friction factor was increased with the installation of rib. However, the thermal performance was increased with the installation of rib in the matrix cooling channel. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=matrix%20cooling" title="matrix cooling">matrix cooling</a>, <a href="https://publications.waset.org/abstracts/search?q=rib" title=" rib"> rib</a>, <a href="https://publications.waset.org/abstracts/search?q=heat%20transfer" title=" heat transfer"> heat transfer</a>, <a href="https://publications.waset.org/abstracts/search?q=gas%20turbine" title=" gas turbine"> gas turbine</a> </p> <a href="https://publications.waset.org/abstracts/80524/numerical-simulation-of-effect-of-various-rib-configurations-on-enhancing-heat-transfer-of-matrix-cooling-channel" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80524.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">460</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2224</span> Parallel Computation of the Covariance-Matrix</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Claude%20Tadonki">Claude Tadonki</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We address the issues related to the computation of the covariance matrix. This matrix is likely to be ill conditioned following its canonical expression, thus consequently raises serious numerical issues. The underlying linear system, which therefore should be solved by means of iterative approaches, becomes computationally challenging. A huge number of iterations is expected in order to reach an acceptable level of convergence, necessary to meet the required accuracy of the computation. In addition, this linear system needs to be solved at each iteration following the general form of the covariance matrix. Putting all together, its comes that we need to compute as fast as possible the associated matrix-vector product. This is our purpose in the work, where we consider and discuss skillful formulations of the problem, then propose a parallel implementation of the matrix-vector product involved. Numerical and performance oriented discussions are provided based on experimental evaluations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=covariance-matrix" title="covariance-matrix">covariance-matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=multicore" title=" multicore"> multicore</a>, <a href="https://publications.waset.org/abstracts/search?q=numerical%20computing" title=" numerical computing"> numerical computing</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20computing" title=" parallel computing"> parallel computing</a> </p> <a href="https://publications.waset.org/abstracts/59579/parallel-computation-of-the-covariance-matrix" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59579.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">312</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2223</span> Texture Analysis of Grayscale Co-Occurrence Matrix on Mammographic Indexed Image</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Sushma">S. Sushma</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Balasubramanian"> S. Balasubramanian</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20C.%20Latha"> K. C. Latha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The mammographic image of breast cancer compressed and synthesized to get co-efficient values which will be converted (5x5) matrix to get ROI image where we get the highest value of effected region and with the same ideology the technique has been extended to differentiate between Calcification and normal cell image using mean value derived from 5x5 matrix values <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=texture%20analysis" title="texture analysis">texture analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=mammographic%20image" title=" mammographic image"> mammographic image</a>, <a href="https://publications.waset.org/abstracts/search?q=partitioned%20gray%20scale%20co-oocurance%20matrix" title=" partitioned gray scale co-oocurance matrix"> partitioned gray scale co-oocurance matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=co-efficient" title=" co-efficient "> co-efficient </a> </p> <a href="https://publications.waset.org/abstracts/17516/texture-analysis-of-grayscale-co-occurrence-matrix-on-mammographic-indexed-image" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17516.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">533</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2222</span> Redundancy Component Matrix and Structural Robustness</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Xinjian%20Kou">Xinjian Kou</a>, <a href="https://publications.waset.org/abstracts/search?q=Linlin%20Li"> Linlin Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Yongju%20Zhou"> Yongju Zhou</a>, <a href="https://publications.waset.org/abstracts/search?q=Jimian%20Song"> Jimian Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We introduce the redundancy matrix that expresses clearly the geometrical/topological configuration of the structure. With the matrix, the redundancy of the structure is resolved into redundant components and assigned to each member or rigid joint. The values of the diagonal elements in the matrix indicates the importance of the corresponding members or rigid joints, and the geometrically correlations can be shown with the non-diagonal elements. If a member or rigid joint failures, reassignment of the redundant components can be calculated with the recursive method given in the paper. By combining the indexes of reliability and redundancy components, we define an index concerning the structural robustness. To further explain the properties of the redundancy matrix, we cited several examples of statically indeterminate structures, including two trusses and a rigid frame. With the examples, some simple results and the properties of the matrix are discussed. The examples also illustrate that the redundancy matrix and the relevant concepts are valuable in structural safety analysis. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Structural%20Robustness" title="Structural Robustness">Structural Robustness</a>, <a href="https://publications.waset.org/abstracts/search?q=Structural%20Reliability" title=" Structural Reliability"> Structural Reliability</a>, <a href="https://publications.waset.org/abstracts/search?q=Redundancy%20Component" title=" Redundancy Component"> Redundancy Component</a>, <a href="https://publications.waset.org/abstracts/search?q=Redundancy%20Matrix" title=" Redundancy Matrix"> Redundancy Matrix</a> </p> <a href="https://publications.waset.org/abstracts/66420/redundancy-component-matrix-and-structural-robustness" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/66420.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">272</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2221</span> Multiple Images Stitching Based on Gradually Changing Matrix</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shangdong%20Zhu">Shangdong Zhu</a>, <a href="https://publications.waset.org/abstracts/search?q=Yunzhou%20Zhang"> Yunzhou Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Jie%20Zhang"> Jie Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Hang%20Hu"> Hang Hu</a>, <a href="https://publications.waset.org/abstracts/search?q=Yazhou%20Zhang"> Yazhou Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Image stitching is a very important branch in the field of computer vision, especially for panoramic map. In order to eliminate shape distortion, a novel stitching method is proposed based on gradually changing matrix when images are horizontal. For images captured horizontally, this paper assumes that there is only translational operation in image stitching. By analyzing each parameter of the homography matrix, the global homography matrix is gradually transferred to translation matrix so as to eliminate the effects of scaling, rotation, etc. in the image transformation. This paper adopts matrix approximation to get the minimum value of the energy function so that the shape distortion at those regions corresponding to the homography can be minimized. The proposed method can avoid multiple horizontal images stitching failure caused by accumulated shape distortion. At the same time, it can be combined with As-Projective-As-Possible algorithm to ensure precise alignment of overlapping area. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20stitching" title="image stitching">image stitching</a>, <a href="https://publications.waset.org/abstracts/search?q=gradually%20changing%20matrix" title=" gradually changing matrix"> gradually changing matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=horizontal%20direction" title=" horizontal direction"> horizontal direction</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix%20approximation" title=" matrix approximation"> matrix approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=homography%20matrix" title=" homography matrix"> homography matrix</a> </p> <a href="https://publications.waset.org/abstracts/85912/multiple-images-stitching-based-on-gradually-changing-matrix" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/85912.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">319</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2220</span> Matrix Method Posting</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Varong%20Pongsai">Varong Pongsai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The objective of this paper is introducing a new method of accounting posting which is called Matrix Method Posting. This method is based on the Matrix operation of pure Mathematics. Although, accounting field is classified as one of the social-science knowledge, many of accounting operations are placed by Mathematics sign and operation. Through the operation applying, it seems to be that the operations of Mathematics should be applied to accounting possibly. So, this paper tries to over-lap Mathematics logic to accounting logic smoothly. According to the context of discovery, deductive approach is employed to prove a simultaneously logical concept of both Mathematics and Accounting. The result proves that the Matrix can be placed to operate accounting perfectly, because Matrix and accounting logic also have a similarity concept which is balancing 2 sides during operations. Moreover, the Matrix posting also has a lot of benefit. It can help financial analyst calculating financial ratios comfortably. Furthermore, the matrix determinant which is a signature operation itself also helps auditors checking out the correction of clients’ recording. If the determinant is not equaled to 0, it will point out that the recording process of clients getting into the problem. Finally, the Matrix should be easily determining a concept of merger and consolidation far beyond the present day concept. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=matrix%20method%20posting" title="matrix method posting">matrix method posting</a>, <a href="https://publications.waset.org/abstracts/search?q=deductive%20approach" title=" deductive approach"> deductive approach</a>, <a href="https://publications.waset.org/abstracts/search?q=determinant" title=" determinant"> determinant</a>, <a href="https://publications.waset.org/abstracts/search?q=accounting%20application" title=" accounting application"> accounting application</a> </p> <a href="https://publications.waset.org/abstracts/31039/matrix-method-posting" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31039.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">367</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2219</span> Construction of Graph Signal Modulations via Graph Fourier Transform and Its Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Xianwei%20Zheng">Xianwei Zheng</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuan%20Yan%20Tang"> Yuan Yan Tang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Classical window Fourier transform has been widely used in signal processing, image processing, machine learning and pattern recognition. The related Gabor transform is powerful enough to capture the texture information of any given dataset. Recently, in the emerging field of graph signal processing, researchers devoting themselves to develop a graph signal processing theory to handle the so-called graph signals. Among the new developing theory, windowed graph Fourier transform has been constructed to establish a time-frequency analysis framework of graph signals. The windowed graph Fourier transform is defined by using the translation and modulation operators of graph signals, following the similar calculations in classical windowed Fourier transform. Specifically, the translation and modulation operators of graph signals are defined by using the Laplacian eigenvectors as follows. For a given graph signal, its translation is defined by a similar manner as its definition in classical signal processing. Specifically, the translation operator can be defined by using the Fourier atoms; the graph signal translation is defined similarly by using the Laplacian eigenvectors. The modulation of the graph can also be established by using the Laplacian eigenvectors. The windowed graph Fourier transform based on these two operators has been applied to obtain time-frequency representations of graph signals. Fundamentally, the modulation operator is defined similarly to the classical modulation by multiplying a graph signal with the entries in each Fourier atom. However, a single Laplacian eigenvector entry cannot play a similar role as the Fourier atom. This definition ignored the relationship between the translation and modulation operators. In this paper, a new definition of the modulation operator is proposed and thus another time-frequency framework for graph signal is constructed. Specifically, the relationship between the translation and modulation operations can be established by the Fourier transform. Specifically, for any signal, the Fourier transform of its translation is the modulation of its Fourier transform. Thus, the modulation of any signal can be defined as the inverse Fourier transform of the translation of its Fourier transform. Therefore, similarly, the graph modulation of any graph signal can be defined as the inverse graph Fourier transform of the translation of its graph Fourier. The novel definition of the graph modulation operator established a relationship of the translation and modulation operations. The new modulation operation and the original translation operation are applied to construct a new framework of graph signal time-frequency analysis. Furthermore, a windowed graph Fourier frame theory is developed. Necessary and sufficient conditions for constructing windowed graph Fourier frames, tight frames and dual frames are presented in this paper. The novel graph signal time-frequency analysis framework is applied to signals defined on well-known graphs, e.g. Minnesota road graph and random graphs. Experimental results show that the novel framework captures new features of graph signals. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph%20signals" title="graph signals">graph signals</a>, <a href="https://publications.waset.org/abstracts/search?q=windowed%20graph%20Fourier%20transform" title=" windowed graph Fourier transform"> windowed graph Fourier transform</a>, <a href="https://publications.waset.org/abstracts/search?q=windowed%20graph%20Fourier%20frames" title=" windowed graph Fourier frames"> windowed graph Fourier frames</a>, <a href="https://publications.waset.org/abstracts/search?q=vertex%20frequency%20analysis" title=" vertex frequency analysis"> vertex frequency analysis</a> </p> <a href="https://publications.waset.org/abstracts/63133/construction-of-graph-signal-modulations-via-graph-fourier-transform-and-its-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/63133.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">341</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2218</span> Effects of the Mass and Damping Matrix Model in the Non-Linear Seismic Response of Steel Frames</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alfredo%20Reyes-Salazar">Alfredo Reyes-Salazar</a>, <a href="https://publications.waset.org/abstracts/search?q=Mario%20D.%20Llanes-Tizoc"> Mario D. Llanes-Tizoc</a>, <a href="https://publications.waset.org/abstracts/search?q=Eden%20Bojorquez"> Eden Bojorquez</a>, <a href="https://publications.waset.org/abstracts/search?q=Federico%20Valenzuela-Beltran"> Federico Valenzuela-Beltran</a>, <a href="https://publications.waset.org/abstracts/search?q=Juan%20Bojorquez"> Juan Bojorquez</a>, <a href="https://publications.waset.org/abstracts/search?q=Jose%20R.%20Gaxiola-Camacho"> Jose R. Gaxiola-Camacho</a>, <a href="https://publications.waset.org/abstracts/search?q=Achintya%20Haldar"> Achintya Haldar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Seismic analysis of steel buildings is usually based on the use of the concentrated mass (ML) matrix and the Rayleigh damping matrix (C). Similarly, the initial stiffness matrix (KO) and the first two modes associated with lateral vibrations are commonly used to develop matrix C. The evaluation of the accuracy of these practices for the particular case of steel buildings with moment-resisting steel frames constitutes the main objective of this research. For this, the non-linear seismic responses of three models of steel frames, representing low-, medium- and high-rise steel buildings, are considered. Results indicate that if the ML matrix is used, shears and bending moments in columns are underestimated by up to 30% and 65%, respectively when compared to the corresponding results obtained with the consistent mass matrix (MC). It is also shown that if KO is used in C instead of the tangent stiffness matrix (Kt), axial loads in columns are underestimated by up to 80%. It is concluded that the consistent mass matrix should be used in the structural modelling of moment-resisting steel frames and that the tangent stiffness matrix should be used to develop the Rayleigh damping matrix. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=moment-resisting%20steel%20frames" title="moment-resisting steel frames">moment-resisting steel frames</a>, <a href="https://publications.waset.org/abstracts/search?q=consistent%20and%20concentrated%20mass%20matrices" title=" consistent and concentrated mass matrices"> consistent and concentrated mass matrices</a>, <a href="https://publications.waset.org/abstracts/search?q=non-linear%20seismic%20response" title=" non-linear seismic response"> non-linear seismic response</a>, <a href="https://publications.waset.org/abstracts/search?q=Rayleigh%20damping" title=" Rayleigh damping"> Rayleigh damping</a> </p> <a href="https://publications.waset.org/abstracts/153538/effects-of-the-mass-and-damping-matrix-model-in-the-non-linear-seismic-response-of-steel-frames" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/153538.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">149</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2217</span> Improving Temporal Correlations in Empirical Orthogonal Function Expansions for Data Interpolating Empirical Orthogonal Function Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ping%20Bo">Ping Bo</a>, <a href="https://publications.waset.org/abstracts/search?q=Meng%20Yunshan"> Meng Yunshan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Satellite-derived sea surface temperature (SST) is a key parameter for many operational and scientific applications. However, the disadvantage of SST data is a high percentage of missing data which is mainly caused by cloud coverage. Data Interpolating Empirical Orthogonal Function (DINEOF) algorithm is an EOF-based technique for reconstructing the missing data and has been widely used in oceanographic field. The reconstruction of SST images within a long time series using DINEOF can cause large discontinuities and one solution for this problem is to filter the temporal covariance matrix to reduce the spurious variability. Based on the previous researches, an algorithm is presented in this paper to improve the temporal correlations in EOF expansion. Similar with the previous researches, a filter, such as Laplacian filter, is implemented on the temporal covariance matrix, but the temporal relationship between two consecutive images which is used in the filter is considered in the presented algorithm, for example, two images in the same season are more likely correlated than those in the different seasons, hence the latter one is less weighted in the filter. The presented approach is tested for the monthly nighttime 4-km Advanced Very High Resolution Radiometer (AVHRR) Pathfinder SST for the long-term period spanning from 1989 to 2006. The results obtained from the presented algorithm are compared to those from the original DINEOF algorithm without filtering and from the DINEOF algorithm with filtering but without taking temporal relationship into account. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data%20interpolating%20empirical%20orthogonal%20function" title="data interpolating empirical orthogonal function">data interpolating empirical orthogonal function</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20reconstruction" title=" image reconstruction"> image reconstruction</a>, <a href="https://publications.waset.org/abstracts/search?q=sea%20surface%20temperature" title=" sea surface temperature"> sea surface temperature</a>, <a href="https://publications.waset.org/abstracts/search?q=temporal%20filter" title=" temporal filter"> temporal filter</a> </p> <a href="https://publications.waset.org/abstracts/64675/improving-temporal-correlations-in-empirical-orthogonal-function-expansions-for-data-interpolating-empirical-orthogonal-function-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/64675.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">324</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Laplacian%20matrix&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Laplacian%20matrix&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Laplacian%20matrix&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Laplacian%20matrix&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Laplacian%20matrix&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Laplacian%20matrix&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Laplacian%20matrix&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Laplacian%20matrix&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Laplacian%20matrix&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Laplacian%20matrix&page=74">74</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Laplacian%20matrix&page=75">75</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Laplacian%20matrix&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>