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: transform matrix</title> <meta name="description" content="Search results for: transform matrix"> <meta name="keywords" content="transform 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="transform 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="transform 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> 3651</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: transform matrix</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3651</span> Application of the Discrete Rationalized Haar Transform to Distributed Parameter System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Joon-Hoon%20Park">Joon-Hoon Park</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper the rationalized Haar transform is applied for distributed parameter system identification and estimation. A distributed parameter system is a dynamical and mathematical model described by a partial differential equation. And system identification concerns the problem of determining mathematical models from observed data. The Haar function has some disadvantages of calculation because it contains irrational numbers, for these reasons the rationalized Haar function that has only rational numbers. The algorithm adopted in this paper is based on the transform and operational matrix of the rationalized Haar function. This approach provides more convenient and efficient computational results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20parameter%20system" title="distributed parameter system">distributed parameter system</a>, <a href="https://publications.waset.org/abstracts/search?q=rationalized%20Haar%20transform" title=" rationalized Haar transform"> rationalized Haar transform</a>, <a href="https://publications.waset.org/abstracts/search?q=operational%20matrix" title=" operational matrix"> operational matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=system%20identification" title=" system identification "> system identification </a> </p> <a href="https://publications.waset.org/abstracts/24246/application-of-the-discrete-rationalized-haar-transform-to-distributed-parameter-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24246.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">509</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">3650</span> Infinite Impulse Response Digital Filters Design</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Phuoc%20Si%20Nguyen">Phuoc Si Nguyen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Infinite impulse response (IIR) filters can be designed from an analogue low pass prototype by using frequency transformation in the s-domain and bilinear z-transformation with pre-warping frequency; this method is known as frequency transformation from the s-domain to the z-domain. This paper will introduce a new method to transform an IIR digital filter to another type of IIR digital filter (low pass, high pass, band pass, band stop or narrow band) using a technique based on inverse bilinear z-transformation and inverse matrices. First, a matrix equation is derived from inverse bilinear z-transformation and Pascal’s triangle. This Low Pass Digital to Digital Filter Pascal Matrix Equation is used to transform a low pass digital filter to other digital filter types. From this equation and the inverse matrix, a Digital to Digital Filter Pascal Matrix Equation can be derived that is able to transform any IIR digital filter. This paper will also introduce some specific matrices to replace the inverse matrix, which is difficult to determine due to the larger size of the matrix in the current method. This will make computing and hand calculation easier when transforming from one IIR digital filter to another in the digital domain. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bilinear%20z-transformation" title="bilinear z-transformation">bilinear z-transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=frequency%20transformation" title=" frequency transformation"> frequency transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=inverse%20bilinear%20z-transformation" title=" inverse bilinear z-transformation"> inverse bilinear z-transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=IIR%20digital%20filters" title=" IIR digital filters"> IIR digital filters</a> </p> <a href="https://publications.waset.org/abstracts/48777/infinite-impulse-response-digital-filters-design" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48777.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">423</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">3649</span> Frequency Transformation with Pascal Matrix Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Phuoc%20Si%20Nguyen">Phuoc Si Nguyen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Frequency transformation with Pascal matrix equations is a method for transforming an electronic filter (analogue or digital) into another filter. The technique is based on frequency transformation in the s-domain, bilinear z-transform with pre-warping frequency, inverse bilinear transformation and a very useful application of the Pascal’s triangle that simplifies computing and enables calculation by hand when transforming from one filter to another. This paper will introduce two methods to transform a filter into a digital filter: frequency transformation from the s-domain into the z-domain; and frequency transformation in the z-domain. Further, two Pascal matrix equations are derived: an analogue to digital filter Pascal matrix equation and a digital to digital filter Pascal matrix equation. These are used to design a desired digital filter from a given filter. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=frequency%20transformation" title="frequency transformation">frequency transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=bilinear%20z-transformation" title=" bilinear z-transformation"> bilinear z-transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=pre-warping%20frequency" title=" pre-warping frequency"> pre-warping frequency</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20filters" title=" digital filters"> digital filters</a>, <a href="https://publications.waset.org/abstracts/search?q=analog%20filters" title=" analog filters"> analog filters</a>, <a href="https://publications.waset.org/abstracts/search?q=pascal%E2%80%99s%20triangle" title=" pascal’s triangle"> pascal’s triangle</a> </p> <a href="https://publications.waset.org/abstracts/34866/frequency-transformation-with-pascal-matrix-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34866.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">549</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3648</span> Image Rotation Using an Augmented 2-Step Shear Transform</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hee-Choul%20Kwon">Hee-Choul Kwon</a>, <a href="https://publications.waset.org/abstracts/search?q=Heeyong%20Kwon"> Heeyong Kwon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Image rotation is one of main pre-processing steps for image processing or image pattern recognition. It is implemented with a rotation matrix multiplication. It requires a lot of floating point arithmetic operations and trigonometric calculations, so it takes a long time to execute. Therefore, there has been a need for a high speed image rotation algorithm without two major time-consuming operations. However, the rotated image has a drawback, i.e. distortions. We solved the problem using an augmented two-step shear transform. We compare the presented algorithm with the conventional rotation with images of various sizes. Experimental results show that the presented algorithm is superior to the conventional rotation one. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=high-speed%20rotation%20operation" title="high-speed rotation operation">high-speed rotation operation</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20rotation" title=" image rotation"> image rotation</a>, <a href="https://publications.waset.org/abstracts/search?q=transform%20matrix" title=" transform matrix"> transform matrix</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=pattern%20recognition" title=" pattern recognition"> pattern recognition</a> </p> <a href="https://publications.waset.org/abstracts/64167/image-rotation-using-an-augmented-2-step-shear-transform" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/64167.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">277</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">3647</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">3646</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">3645</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">3644</span> Principle Components Updates via Matrix Perturbations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aiman%20Elragig">Aiman Elragig</a>, <a href="https://publications.waset.org/abstracts/search?q=Hanan%20Dreiwi"> Hanan Dreiwi</a>, <a href="https://publications.waset.org/abstracts/search?q=Dung%20Ly"> Dung Ly</a>, <a href="https://publications.waset.org/abstracts/search?q=Idriss%20Elmabrook"> Idriss Elmabrook</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper highlights a new approach to look at online principle components analysis (OPCA). Given a data matrix X <span style="color: rgb(84, 84, 84); font-family: arial, sans-serif; font-size: small; font-style: normal; font-variant-ligatures: normal; font-variant-caps: normal; font-weight: normal; letter-spacing: normal; orphans: 2; text-align: left; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; -webkit-text-stroke-width: 0px; background-color: rgb(255, 255, 255); text-decoration-style: initial; text-decoration-color: initial; display: inline !important; float: none;">∈ </span> R,^m x n we characterise the online updates of its covariance as a matrix perturbation problem. Up to the principle components, it turns out that online updates of the batch PCA can be captured by symmetric matrix perturbation of the batch covariance matrix. We have shown that as n→ n0 >> 1, the batch covariance and its update become almost similar. Finally, utilize our new setup of online updates to find a bound on the angle distance of the principle components of X and its update. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=online%20data%20updates" title="online data updates">online data updates</a>, <a href="https://publications.waset.org/abstracts/search?q=covariance%20matrix" title=" covariance matrix"> covariance matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=online%20principle%20component%20analysis" title=" online principle component analysis"> online principle component analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix%20perturbation" title=" matrix perturbation"> matrix perturbation</a> </p> <a href="https://publications.waset.org/abstracts/76536/principle-components-updates-via-matrix-perturbations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/76536.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">195</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">3643</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">3642</span> Video Compression Using Contourlet Transform</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Delara%20Kazempour">Delara Kazempour</a>, <a href="https://publications.waset.org/abstracts/search?q=Mashallah%20Abasi%20Dezfuli"> Mashallah Abasi Dezfuli</a>, <a href="https://publications.waset.org/abstracts/search?q=Reza%20Javidan"> Reza Javidan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Video compression used for channels with limited bandwidth and storage devices has limited storage capabilities. One of the most popular approaches in video compression is the usage of different transforms. Discrete cosine transform is one of the video compression methods that have some problems such as blocking, noising and high distortion inappropriate effect in compression ratio. wavelet transform is another approach is better than cosine transforms in balancing of compression and quality but the recognizing of curve curvature is so limit. Because of the importance of the compression and problems of the cosine and wavelet transforms, the contourlet transform is most popular in video compression. In the new proposed method, we used contourlet transform in video image compression. Contourlet transform can save details of the image better than the previous transforms because this transform is multi-scale and oriented. This transform can recognize discontinuity such as edges. In this approach we lost data less than previous approaches. Contourlet transform finds discrete space structure. This transform is useful for represented of two dimension smooth images. This transform, produces compressed images with high compression ratio along with texture and edge preservation. Finally, the results show that the majority of the images, the parameters of the mean square error and maximum signal-to-noise ratio of the new method based contourlet transform compared to wavelet transform are improved but in most of the images, the parameters of the mean square error and maximum signal-to-noise ratio in the cosine transform is better than the method based on contourlet transform. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=video%20compression" title="video compression">video compression</a>, <a href="https://publications.waset.org/abstracts/search?q=contourlet%20transform" title=" contourlet transform"> contourlet transform</a>, <a href="https://publications.waset.org/abstracts/search?q=discrete%20cosine%20transform" title=" discrete cosine transform"> discrete cosine transform</a>, <a href="https://publications.waset.org/abstracts/search?q=wavelet%20transform" title=" wavelet transform"> wavelet transform</a> </p> <a href="https://publications.waset.org/abstracts/6930/video-compression-using-contourlet-transform" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6930.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">443</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">3641</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">3640</span> A Robust Hybrid Blind Digital Image Watermarking System Using Discrete Wavelet Transform and Contourlet Transform </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nidal%20F.%20Shilbayeh">Nidal F. Shilbayeh</a>, <a href="https://publications.waset.org/abstracts/search?q=Belal%20AbuHaija"> Belal AbuHaija</a>, <a href="https://publications.waset.org/abstracts/search?q=Zainab%20N.%20Al-Qudsy"> Zainab N. Al-Qudsy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a hybrid blind digital watermarking system using Discrete Wavelet Transform (DWT) and Contourlet Transform (CT) has been implemented and tested. The implemented combined digital watermarking system has been tested against five common types of image attacks. The performance evaluation shows improved results in terms of imperceptibility, robustness, and high tolerance against these attacks; accordingly, the system is very effective and applicable. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=discrete%20wavelet%20transform%20%28DWT%29" title="discrete wavelet transform (DWT)">discrete wavelet transform (DWT)</a>, <a href="https://publications.waset.org/abstracts/search?q=contourlet%20transform%20%28CT%29" title=" contourlet transform (CT)"> contourlet transform (CT)</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20image%20watermarking" title=" digital image watermarking"> digital image watermarking</a>, <a href="https://publications.waset.org/abstracts/search?q=copyright%20protection" title=" copyright protection"> copyright protection</a>, <a href="https://publications.waset.org/abstracts/search?q=geometric%20attack" title=" geometric attack"> geometric attack</a> </p> <a href="https://publications.waset.org/abstracts/69379/a-robust-hybrid-blind-digital-image-watermarking-system-using-discrete-wavelet-transform-and-contourlet-transform" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/69379.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">394</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">3639</span> Precoding-Assisted Frequency Division Multiple Access Transmission Scheme: A Cyclic Prefixes- Available Modulation-Based Filter Bank Multi-Carrier Technique</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ying%20Wang">Ying Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Jianhong%20Xiang"> Jianhong Xiang</a>, <a href="https://publications.waset.org/abstracts/search?q=Yu%20Zhong"> Yu Zhong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The offset Quadrature Amplitude Modulation-based Filter Bank Multi-Carrier (FBMC) system provides superior spectral properties over Orthogonal Frequency Division Multiplexing. However, seriously affected by imaginary interference, its performances are hampered in many areas. In this paper, we propose a Precoding-Assisted Frequency Division Multiple Access (PA-FDMA) modulation scheme. By spreading FBMC symbols into the frequency domain and transmitting them with a precoding matrix, the impact of imaginary interference can be eliminated. Specifically, we first generate the coding pre-solution matrix with a nonuniform Fast Fourier Transform and pick the best columns by introducing auxiliary factors. Secondly, according to the column indexes, we obtain the precoding matrix for one symbol and impose scaling factors to ensure that the power is approximately constant throughout the transmission time. Finally, we map the precoding matrix of one symbol to multiple symbols and transmit multiple data frames, thus achieving frequency-division multiple access. Additionally, observing the interference between adjacent frames, we mitigate them by adding frequency Cyclic Prefixes (CP) and evaluating them with a signal-to-interference ratio. Note that PA-FDMA can be considered a CP-available FBMC technique because the underlying strategy is FBMC. Simulation results show that the proposed scheme has better performance compared to Single Carrier Frequency Division Multiple Access (SC-FDMA), etc. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=PA-FDMA" title="PA-FDMA">PA-FDMA</a>, <a href="https://publications.waset.org/abstracts/search?q=SC-FDMA" title=" SC-FDMA"> SC-FDMA</a>, <a href="https://publications.waset.org/abstracts/search?q=FBMC" title=" FBMC"> FBMC</a>, <a href="https://publications.waset.org/abstracts/search?q=non-uniform%20fast%20fourier%20transform" title=" non-uniform fast fourier transform"> non-uniform fast fourier transform</a> </p> <a href="https://publications.waset.org/abstracts/181922/precoding-assisted-frequency-division-multiple-access-transmission-scheme-a-cyclic-prefixes-available-modulation-based-filter-bank-multi-carrier-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/181922.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">64</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">3638</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">3637</span> Donoho-Stark’s and Hardy’s Uncertainty Principles for the Short-Time Quaternion Offset Linear Canonical Transform</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Younus%20Bhat">Mohammad Younus Bhat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The quaternion offset linear canonical transform (QOLCT), which isa time-shifted and frequency-modulated version of the quaternion linear canonical transform (QLCT), provides a more general framework of most existing signal processing tools. For the generalized QOLCT, the classical Heisenberg’s and Lieb’s uncertainty principles have been studied recently. In this paper, we first define the short-time quaternion offset linear canonical transform (ST-QOLCT) and drive its relationship with the quaternion Fourier transform (QFT). The crux of the paper lies in the generalization of several well-known uncertainty principles for the ST-QOLCT, including Donoho-Stark’s uncertainty principle, Hardy’s uncertainty principle, Beurling’s uncertainty principle, and the logarithmic uncertainty principle. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Quaternion%20Fourier%20transform" title="Quaternion Fourier transform">Quaternion Fourier transform</a>, <a href="https://publications.waset.org/abstracts/search?q=Quaternion%20offset%20linear%20canonical%20transform" title=" Quaternion offset linear canonical transform"> Quaternion offset linear canonical transform</a>, <a href="https://publications.waset.org/abstracts/search?q=short-time%20quaternion%20offset%20linear%20canonical%20transform" title=" short-time quaternion offset linear canonical transform"> short-time quaternion offset linear canonical transform</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertainty%20principle" title=" uncertainty principle"> uncertainty principle</a> </p> <a href="https://publications.waset.org/abstracts/142375/donoho-starks-and-hardys-uncertainty-principles-for-the-short-time-quaternion-offset-linear-canonical-transform" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/142375.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">211</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">3636</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">3635</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">3634</span> Object Tracking in Motion Blurred Images with Adaptive Mean Shift and Wavelet Feature</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Iman%20Iraei">Iman Iraei</a>, <a href="https://publications.waset.org/abstracts/search?q=Mina%20Sharifi"> Mina Sharifi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A method for object tracking in motion blurred images is proposed in this article. This paper shows that object tracking could be improved with this approach. We use mean shift algorithm to track different objects as a main tracker. But, the problem is that mean shift could not track the selected object accurately in blurred scenes. So, for better tracking result, and increasing the accuracy of tracking, wavelet transform is used. We use a feature named as blur extent, which could help us to get better results in tracking. For calculating of this feature, we should use Harr wavelet. We can look at this matter from two different angles which lead to determine whether an image is blurred or not and to what extent an image is blur. In fact, this feature left an impact on the covariance matrix of mean shift algorithm and cause to better performance of tracking. This method has been concentrated mostly on motion blur parameter. transform. The results reveal the ability of our method in order to reach more accurately tracking. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mean%20shift" title="mean shift">mean shift</a>, <a href="https://publications.waset.org/abstracts/search?q=object%20tracking" title=" object tracking"> object tracking</a>, <a href="https://publications.waset.org/abstracts/search?q=blur%20extent" title=" blur extent"> blur extent</a>, <a href="https://publications.waset.org/abstracts/search?q=wavelet%20transform" title=" wavelet transform"> wavelet transform</a>, <a href="https://publications.waset.org/abstracts/search?q=motion%20blur" title=" motion blur"> motion blur</a> </p> <a href="https://publications.waset.org/abstracts/81408/object-tracking-in-motion-blurred-images-with-adaptive-mean-shift-and-wavelet-feature" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/81408.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">210</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">3633</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">3632</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">3631</span> The Optical OFDM Equalization Based on the Fractional Fourier Transform</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Cherifi">A. Cherifi</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20S.%20Bouazza"> B. S. Bouazza</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20O.%20Dahman"> A. O. Dahman</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Yagoubi"> B. Yagoubi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Transmission over Optical channels will introduce inter-symbol interference (ISI) as well as inter-channel (or inter-carrier) interference (ICI). To decrease the effects of ICI, this paper proposes equalizer for the Optical OFDM system based on the fractional Fourier transform (FrFFT). In this FrFT-OFDM system, traditional Fourier transform is replaced by fractional Fourier transform to modulate and demodulate the data symbols. The equalizer proposed consists of sampling the received signal in the different time per time symbol. Theoretical analysis and numerical simulation are discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=OFDM" title="OFDM">OFDM</a>, <a href="https://publications.waset.org/abstracts/search?q=fractional%20fourier%20transform" title=" fractional fourier transform"> fractional fourier transform</a>, <a href="https://publications.waset.org/abstracts/search?q=internet%20and%20information%20technology" title=" internet and information technology"> internet and information technology</a> </p> <a href="https://publications.waset.org/abstracts/27211/the-optical-ofdm-equalization-based-on-the-fractional-fourier-transform" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27211.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">406</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">3630</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">3629</span> Sampling Two-Channel Nonseparable Wavelets and Its Applications in Multispectral Image Fusion</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bin%20Liu">Bin Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Weijie%20Liu"> Weijie Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Bin%20Sun"> Bin Sun</a>, <a href="https://publications.waset.org/abstracts/search?q=Yihui%20Luo"> Yihui Luo </a> </p> <p class="card-text"><strong>Abstract:</strong></p> In order to solve the problem of lower spatial resolution and block effect in the fusion method based on separable wavelet transform in the resulting fusion image, a new sampling mode based on multi-resolution analysis of two-channel non separable wavelet transform, whose dilation matrix is [1,1;1,-1], is presented and a multispectral image fusion method based on this kind of sampling mode is proposed. Filter banks related to this kind of wavelet are constructed, and multiresolution decomposition of the intensity of the MS and panchromatic image are performed in the sampled mode using the constructed filter bank. The low- and high-frequency coefficients are fused by different fusion rules. The experiment results show that this method has good visual effect. The fusion performance has been noted to outperform the IHS fusion method, as well as, the fusion methods based on DWT, IHS-DWT, IHS-Contourlet transform, and IHS-Curvelet transform in preserving both spectral quality and high spatial resolution information. Furthermore, when compared with the fusion method based on nonsubsampled two-channel non separable wavelet, the proposed method has been observed to have higher spatial resolution and good global spectral information. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20fusion" title="image fusion">image fusion</a>, <a href="https://publications.waset.org/abstracts/search?q=two-channel%20sampled%20nonseparable%20wavelets" title=" two-channel sampled nonseparable wavelets"> two-channel sampled nonseparable wavelets</a>, <a href="https://publications.waset.org/abstracts/search?q=multispectral%20image" title=" multispectral image"> multispectral image</a>, <a href="https://publications.waset.org/abstracts/search?q=panchromatic%20image" title=" panchromatic image"> panchromatic image</a> </p> <a href="https://publications.waset.org/abstracts/15357/sampling-two-channel-nonseparable-wavelets-and-its-applications-in-multispectral-image-fusion" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15357.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">440</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">3628</span> Study of Biodegradable Composite Materials Based on Polylactic Acid and Vegetal Reinforcements</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Manel%20Hannachi">Manel Hannachi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mustapha%20Nechiche"> Mustapha Nechiche</a>, <a href="https://publications.waset.org/abstracts/search?q=Said%20Azem"> Said Azem</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study focuses on biodegradable materials made from Poly-lactic acid (PLA) and vegetal reinforcements. Three materials are developed from PLA, as a matrix, and : (i) olive kernels (OK); (ii) alfa (α) short fibers and (iii) OK+ α mixture, as reinforcements. After processing of PLA pellets and olive kernels in powder and alfa stems in short fibers, three mixtures, namely PLA-OK, PLA-α, and PLA-OK-α are prepared and homogenized in Turbula®. These mixtures are then compacted at 180°C under 10 MPa during 15 mn. Scanning Electron Microscopy (SEM) examinations show that PLA matrix adheres at surface of all reinforcements and the dispersion of these ones in matrix is good. X-ray diffraction (XRD) analyses highlight an increase of PLA inter-reticular distances, especially for the PLA-OK case. These results are explained by the dissociation of some molecules derived from reinforcements followed by diffusion of the released atoms in the structure of PLA. This is consistent with Fourier Transform Infrared Spectroscopy (FTIR) and Differential Scanning Calorimetry (DSC) analysis results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=alfa%20short%20fibers" title="alfa short fibers">alfa short fibers</a>, <a href="https://publications.waset.org/abstracts/search?q=biodegradable%20composite" title=" biodegradable composite"> biodegradable composite</a>, <a href="https://publications.waset.org/abstracts/search?q=olive%20kernels" title=" olive kernels"> olive kernels</a>, <a href="https://publications.waset.org/abstracts/search?q=poly-lactic%20acid" title=" poly-lactic acid"> poly-lactic acid</a> </p> <a href="https://publications.waset.org/abstracts/85801/study-of-biodegradable-composite-materials-based-on-polylactic-acid-and-vegetal-reinforcements" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/85801.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">147</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">3627</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">3626</span> The Effectschemical Treatment on Alkyl Phenol Modified Sisal Fiber Reinforced Epoxy Composite</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rajesh%20Panda">Rajesh Panda</a>, <a href="https://publications.waset.org/abstracts/search?q=Jimi%20Tjong"> Jimi Tjong</a>, <a href="https://publications.waset.org/abstracts/search?q=Sanjay%20K.%20Nayak"> Sanjay K. Nayak</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohini%20M.%20Sain"> Mohini M. Sain</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this manuscript was to evaluate the effect of chemical treatment of sisal fibre on the mechanical and viscoelastic properties of bio based epoxy/fibre composites. The composite samples were manufactured through a vacuum infusion process by adding alkyl phenols from cashew nutshell liquid (CSNL). Changes in the chemical structure of the sisal fibres resulting from the treatments were analyzed by Fourier transform infrared spectroscopy (FTIR). Both alkali and silane treatments produced enhancements in the mechanical properties of sisal fibre bundles. The alkali treatment, when combined with the silane treatment, the mechanical properties of epoxy composites notably improved (13%) in comparison to untreated sisal fibre reinforced composites.This was attributed to an enhanced fibre/matrix interface. The incorporation of CSNL into the sisal/epoxy composite enhanced the fibre-matrix interfacial properties because of the addition of -OH groups to the epoxy matrix. The incorporation of sisal fibre imparts stiffness to the epoxy matrix. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=phenalkamine" title="phenalkamine">phenalkamine</a>, <a href="https://publications.waset.org/abstracts/search?q=sisal%20fiber" title=" sisal fiber"> sisal fiber</a>, <a href="https://publications.waset.org/abstracts/search?q=vacuum%20infusion" title=" vacuum infusion"> vacuum infusion</a>, <a href="https://publications.waset.org/abstracts/search?q=cashew%20nutshell%20liquid" title=" cashew nutshell liquid"> cashew nutshell liquid</a>, <a href="https://publications.waset.org/abstracts/search?q=cashew%20nutshell%20liquid%20%28CSNL%29" title=" cashew nutshell liquid (CSNL)"> cashew nutshell liquid (CSNL)</a> </p> <a href="https://publications.waset.org/abstracts/93896/the-effectschemical-treatment-on-alkyl-phenol-modified-sisal-fiber-reinforced-epoxy-composite" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/93896.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">284</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">3625</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">3624</span> Principal Component Analysis in Drug-Excipient Interactions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Farzad%20Khajavi">Farzad Khajavi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Studies about the interaction between active pharmaceutical ingredients (API) and excipients are so important in the pre-formulation stage of development of all dosage forms. Analytical techniques such as differential scanning calorimetry (DSC), Thermal gravimetry (TG), and Furrier transform infrared spectroscopy (FTIR) are commonly used tools for investigating regarding compatibility and incompatibility of APIs with excipients. Sometimes the interpretation of data obtained from these techniques is difficult because of severe overlapping of API spectrum with excipients in their mixtures. Principal component analysis (PCA) as a powerful factor analytical method is used in these situations to resolve data matrices acquired from these analytical techniques. Binary mixtures of API and interested excipients are considered and produced. Peaks of FTIR, DSC, or TG of pure API and excipient and their mixtures at different mole ratios will construct the rows of the data matrix. By applying PCA on the data matrix, the number of principal components (PCs) is determined so that it contains the total variance of the data matrix. By plotting PCs or factors obtained from the score of the matrix in two-dimensional spaces if the pure API and its mixture with the excipient at the high amount of API and the 1:1mixture form a separate cluster and the other cluster comprise of the pure excipient and its blend with the API at the high amount of excipient. This confirms the existence of compatibility between API and the interested excipient. Otherwise, the incompatibility will overcome a mixture of API and excipient. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=API" title="API">API</a>, <a href="https://publications.waset.org/abstracts/search?q=compatibility" title=" compatibility"> compatibility</a>, <a href="https://publications.waset.org/abstracts/search?q=DSC" title=" DSC"> DSC</a>, <a href="https://publications.waset.org/abstracts/search?q=TG" title=" TG"> TG</a>, <a href="https://publications.waset.org/abstracts/search?q=interactions" title=" interactions"> interactions</a> </p> <a href="https://publications.waset.org/abstracts/143179/principal-component-analysis-in-drug-excipient-interactions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/143179.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">132</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">3623</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">3622</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> <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=transform%20matrix&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=transform%20matrix&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=transform%20matrix&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=transform%20matrix&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=transform%20matrix&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=transform%20matrix&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=transform%20matrix&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=transform%20matrix&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=transform%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=transform%20matrix&page=121">121</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=transform%20matrix&page=122">122</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=transform%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>