CINXE.COM
Search results for: random matrix theory
<!DOCTYPE html> <html lang="en" dir="ltr"> <head> <!-- Google tag (gtag.js) --> <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> <!-- Yandex.Metrika counter --> <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> <!-- /Yandex.Metrika counter --> <!-- Matomo --> <!-- End Matomo Code --> <title>Search results for: random matrix theory</title> <meta name="description" content="Search results for: random matrix theory"> <meta name="keywords" content="random matrix theory"> <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="random matrix theory" 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="random matrix theory"> <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> 8670</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: random matrix theory</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8670</span> Random Matrix Theory Analysis of Cross-Correlation in the Nigerian Stock Exchange</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chimezie%20P.%20Nnanwa">Chimezie P. Nnanwa</a>, <a href="https://publications.waset.org/abstracts/search?q=Thomas%20C.%20Urama"> Thomas C. Urama</a>, <a href="https://publications.waset.org/abstracts/search?q=Patrick%20O.%20Ezepue"> Patrick O. Ezepue</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we use Random Matrix Theory to analyze the eigen-structure of the empirical correlations of 82 stocks which are consistently traded in the Nigerian Stock Exchange (NSE) over a 4-year study period 3 August 2009 to 26 August 2013. We apply the Marchenko-Pastur distribution of eigenvalues of a purely random matrix to investigate the presence of investment-pertinent information contained in the empirical correlation matrix of the selected stocks. We use hypothesised standard normal distribution of eigenvector components from RMT to assess deviations of the empirical eigenvectors to this distribution for different eigenvalues. We also use the Inverse Participation Ratio to measure the deviation of eigenvectors of the empirical correlation matrix from RMT results. These preliminary results on the dynamics of asset price correlations in the NSE are important for improving risk-return trade-offs associated with Markowitz’s portfolio optimization in the stock exchange, which is pursued in future work. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=correlation%20matrix" title="correlation matrix">correlation matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=eigenvalue%20and%20eigenvector" title=" eigenvalue and eigenvector"> eigenvalue and eigenvector</a>, <a href="https://publications.waset.org/abstracts/search?q=inverse%20participation%20ratio" title=" inverse participation ratio"> inverse participation ratio</a>, <a href="https://publications.waset.org/abstracts/search?q=portfolio%20optimization" title=" portfolio optimization"> portfolio optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20matrix%20theory" title=" random matrix theory"> random matrix theory</a> </p> <a href="https://publications.waset.org/abstracts/68007/random-matrix-theory-analysis-of-cross-correlation-in-the-nigerian-stock-exchange" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/68007.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">344</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">8669</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">516</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">8668</span> Change Point Detection Using Random Matrix Theory with Application to Frailty in Elderly Individuals</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Malika%20Kharouf">Malika Kharouf</a>, <a href="https://publications.waset.org/abstracts/search?q=Aly%20Chkeir"> Aly Chkeir</a>, <a href="https://publications.waset.org/abstracts/search?q=Khac%20Tuan%20Huynh"> Khac Tuan Huynh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Detecting change points in time series data is a challenging problem, especially in scenarios where there is limited prior knowledge regarding the data’s distribution and the nature of the transitions. We present a method designed for detecting changes in the covariance structure of high-dimensional time series data, where the number of variables closely matches the data length. Our objective is to achieve unbiased test statistic estimation under the null hypothesis. We delve into the utilization of Random Matrix Theory to analyze the behavior of our test statistic within a high-dimensional context. Specifically, we illustrate that our test statistic converges pointwise to a normal distribution under the null hypothesis. To assess the effectiveness of our proposed approach, we conduct evaluations on a simulated dataset. Furthermore, we employ our method to examine changes aimed at detecting frailty in the elderly. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=change%20point%20detection" title="change point detection">change point detection</a>, <a href="https://publications.waset.org/abstracts/search?q=hypothesis%20tests" title=" hypothesis tests"> hypothesis tests</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20matrix%20theory" title=" random matrix theory"> random matrix theory</a>, <a href="https://publications.waset.org/abstracts/search?q=frailty%20in%20elderly" title=" frailty in elderly"> frailty in elderly</a> </p> <a href="https://publications.waset.org/abstracts/186766/change-point-detection-using-random-matrix-theory-with-application-to-frailty-in-elderly-individuals" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/186766.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">52</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">8667</span> Analysis of Cross-Correlations in Emerging Markets Using Random Matrix Theory</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thomas%20Chinwe%20Urama">Thomas Chinwe Urama</a>, <a href="https://publications.waset.org/abstracts/search?q=Patrick%20Oseloka%20Ezepue"> Patrick Oseloka Ezepue</a>, <a href="https://publications.waset.org/abstracts/search?q=Peters%20Chimezie%20Nnanwa"> Peters Chimezie Nnanwa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper investigates the universal financial dynamics in two dominant stock markets in Sub-Saharan Africa, through an in-depth analysis of the cross-correlation matrix of price returns in Nigerian Stock Market (NSM) and Johannesburg Stock Exchange (JSE), for the period 2009 to 2013. The strength of correlations between stocks is known to be higher in JSE than that of the NSM. Particularly important for modelling Nigerian derivatives in the future, the interactions of other stocks with the oil sector are weak, whereas the banking sector has strong positive interactions with the other sectors in the stock exchange. For the JSE, it is the oil sector and beverages that have greater sectorial correlations, instead of the banks which have the weaker correlation with other sectors in the stock exchange. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=random%20matrix%20theory" title="random matrix theory">random matrix theory</a>, <a href="https://publications.waset.org/abstracts/search?q=cross-correlations" title=" cross-correlations"> cross-correlations</a>, <a href="https://publications.waset.org/abstracts/search?q=emerging%20markets" title=" emerging markets"> emerging markets</a>, <a href="https://publications.waset.org/abstracts/search?q=option%20pricing" title=" option pricing"> option pricing</a>, <a href="https://publications.waset.org/abstracts/search?q=eigenvalues%20eigenvectors" title=" eigenvalues eigenvectors"> eigenvalues eigenvectors</a>, <a href="https://publications.waset.org/abstracts/search?q=inverse%20participation%20ratios%20and%20implied%20volatility" title=" inverse participation ratios and implied volatility"> inverse participation ratios and implied volatility</a> </p> <a href="https://publications.waset.org/abstracts/65711/analysis-of-cross-correlations-in-emerging-markets-using-random-matrix-theory" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/65711.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">299</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">8666</span> Existence Theory for First Order Functional Random Differential Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rajkumar%20N.%20Ingle">Rajkumar N. Ingle</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the existence of a solution of nonlinear functional random differential equations of the first order is proved under caratheodory condition. The study of the functional random differential equation has got importance in the random analysis of the dynamical systems of universal phenomena. Objectives: Nonlinear functional random differential equation is useful to the scientists, engineers, and mathematicians, who are engaged in N.F.R.D.E. analyzing a universal random phenomenon, govern by nonlinear random initial value problems of D.E. Applications of this in the theory of diffusion or heat conduction. Methodology: Using the concepts of probability theory, functional analysis, generally the existence theorems for the nonlinear F.R.D.E. are prove by using some tools such as fixed point theorem. The significance of the study: Our contribution will be the generalization of some well-known results in the theory of Nonlinear F.R.D.E.s. Further, it seems that our study will be useful to scientist, engineers, economists and mathematicians in their endeavors to analyses the nonlinear random problems of the universe in a better way. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Random%20Fixed%20Point%20Theorem" title="Random Fixed Point Theorem">Random Fixed Point Theorem</a>, <a href="https://publications.waset.org/abstracts/search?q=functional%20random%20differential%20equation" title=" functional random differential equation"> functional random differential equation</a>, <a href="https://publications.waset.org/abstracts/search?q=N.F.R.D.E." title=" N.F.R.D.E."> N.F.R.D.E.</a>, <a href="https://publications.waset.org/abstracts/search?q=universal%20random%20phenomenon" title=" universal random phenomenon "> universal random phenomenon </a> </p> <a href="https://publications.waset.org/abstracts/28934/existence-theory-for-first-order-functional-random-differential-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28934.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">501</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">8665</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">8664</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">8663</span> Existence Result of Third Order Functional Random Integro-Differential Inclusion</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=D.%20S.%20Palimkar">D. S. Palimkar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The FRIGDI (functional random integrodifferential inclusion) seems to be new and includes several known random differential inclusions already studied in the literature as special cases have been discussed in the literature for various aspects of the solutions. In this paper, we prove the existence result for FIGDI under the non-convex case of multi-valued function involved in it.Using random fixed point theorem of B. C. Dhage and caratheodory condition. This result is new to the theory of differential inclusion. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=caratheodory%20condition" title="caratheodory condition">caratheodory condition</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20differential%20inclusion" title=" random differential inclusion"> random differential inclusion</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20solution" title=" random solution"> random solution</a>, <a href="https://publications.waset.org/abstracts/search?q=integro-differential%20inclusion" title=" integro-differential inclusion"> integro-differential inclusion</a> </p> <a href="https://publications.waset.org/abstracts/34570/existence-result-of-third-order-functional-random-integro-differential-inclusion" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34570.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">466</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">8662</span> [Keynote Talk]: Existence of Random Fixed Point Theorem for Contractive Mappings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=D.%20S.%20Palimkar">D. S. Palimkar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Random fixed point theory has received much attention in recent years, and it is needed for the study of various classes of random equations. The study of random fixed point theorems was initiated by the Prague school of probabilistic in the 1950s. The existence and uniqueness of fixed points for the self-maps of a metric space by altering distances between the points with the use of a control function is an interesting aspect in the classical fixed point theory. In a new category of fixed point problems for a single self-map with the help of a control function that alters the distance between two points in a metric space which they called an altering distance function. In this paper, we prove the results of existence of random common fixed point and its uniqueness for a pair of random mappings under weakly contractive condition for generalizing alter distance function in polish spaces using Random Common Fixed Point Theorem for Generalized Weakly Contractions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Polish%20space" title="Polish space">Polish space</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20common%20fixed%20point%20theorem" title=" random common fixed point theorem"> random common fixed point theorem</a>, <a href="https://publications.waset.org/abstracts/search?q=weakly%20contractive%20mapping" title=" weakly contractive mapping"> weakly contractive mapping</a>, <a href="https://publications.waset.org/abstracts/search?q=altering%20function" title=" altering function"> altering function</a> </p> <a href="https://publications.waset.org/abstracts/79650/keynote-talk-existence-of-random-fixed-point-theorem-for-contractive-mappings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/79650.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">273</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">8661</span> Some Conjectures and Programs about Computing the Detour Index of Molecular Graphs of Nanotubes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shokofeh%20Ebrtahimi">Shokofeh Ebrtahimi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let G be the chemical graph of a molecule. The matrix D = [dij ] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G.Chemical graph theory is the topology branch of mathematical chemistry which applies graph theory to mathematical modelling of chemical phenomena.[1] The pioneers of the chemical graph theory are Alexandru Balaban, Ante Graovac, Ivan Gutman, Haruo Hosoya, Milan Randić and Nenad TrinajstićLet G be the chemical graph of a molecule. The matrix D = [dij ] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G. In this paper, a new program for computing the detour index of molecular graphs of nanotubes by heptagons is determineded. Some Conjectures about detour index of Molecular graphs of nanotubes is included. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=chemical%20graph" title="chemical graph">chemical graph</a>, <a href="https://publications.waset.org/abstracts/search?q=detour%20matrix" title=" detour matrix"> detour matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=Detour%20index" title=" Detour index"> Detour index</a>, <a href="https://publications.waset.org/abstracts/search?q=carbon%20nanotube" title=" carbon nanotube"> carbon nanotube</a> </p> <a href="https://publications.waset.org/abstracts/39724/some-conjectures-and-programs-about-computing-the-detour-index-of-molecular-graphs-of-nanotubes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39724.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">292</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">8660</span> A Physical Theory of Information vs. a Mathematical Theory of Communication</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Manouchehr%20Amiri">Manouchehr Amiri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This article introduces a general notion of physical bit information that is compatible with the basics of quantum mechanics and incorporates the Shannon entropy as a special case. This notion of physical information leads to the Binary data matrix model (BDM), which predicts the basic results of quantum mechanics, general relativity, and black hole thermodynamics. The compatibility of the model with holographic, information conservation, and Landauer’s principles are investigated. After deriving the “Bit Information principle” as a consequence of BDM, the fundamental equations of Planck, De Broglie, Beckenstein, and mass-energy equivalence are derived. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=physical%20theory%20of%20information" title="physical theory of information">physical theory of information</a>, <a href="https://publications.waset.org/abstracts/search?q=binary%20data%20matrix%20model" title=" binary data matrix model"> binary data matrix model</a>, <a href="https://publications.waset.org/abstracts/search?q=Shannon%20information%20theory" title=" Shannon information theory"> Shannon information theory</a>, <a href="https://publications.waset.org/abstracts/search?q=bit%20information%20principle" title=" bit information principle"> bit information principle</a> </p> <a href="https://publications.waset.org/abstracts/166010/a-physical-theory-of-information-vs-a-mathematical-theory-of-communication" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/166010.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">171</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">8659</span> Efficient Antenna Array Beamforming with Robustness against Random Steering Mismatch</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ju-Hong%20Lee">Ju-Hong Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Ching-Wei%20Liao"> Ching-Wei Liao</a>, <a href="https://publications.waset.org/abstracts/search?q=Kun-Che%20Lee"> Kun-Che Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with the problem of using antenna sensors for adaptive beamforming in the presence of random steering mismatch. We present an efficient adaptive array beamformer with robustness to deal with the considered problem. The robustness of the proposed beamformer comes from the efficient designation of the steering vector. Using the received array data vector, we construct an appropriate correlation matrix associated with the received array data vector and a correlation matrix associated with signal sources. Then, the eigenvector associated with the largest eigenvalue of the constructed signal correlation matrix is designated as an appropriate estimate of the steering vector. Finally, the adaptive weight vector required for adaptive beamforming is obtained by using the estimated steering vector and the constructed correlation matrix of the array data vector. Simulation results confirm the effectiveness of the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20beamforming" title="adaptive beamforming">adaptive beamforming</a>, <a href="https://publications.waset.org/abstracts/search?q=antenna%20array" title=" antenna array"> antenna array</a>, <a href="https://publications.waset.org/abstracts/search?q=linearly%20constrained%20minimum%20variance" title=" linearly constrained minimum variance"> linearly constrained minimum variance</a>, <a href="https://publications.waset.org/abstracts/search?q=robustness" title=" robustness"> robustness</a>, <a href="https://publications.waset.org/abstracts/search?q=steering%20vector" title=" steering vector"> steering vector</a> </p> <a href="https://publications.waset.org/abstracts/84543/efficient-antenna-array-beamforming-with-robustness-against-random-steering-mismatch" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/84543.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">199</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">8658</span> Theory of the Optimum Signal Approximation Clarifying the Importance in the Recognition of Parallel World and Application to Secure Signal Communication with Feedback</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Takuro%20Kida">Takuro Kida</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuichi%20Kida"> Yuichi Kida</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, it is shown a base of the new trend of algorithm mathematically that treats a historical reason of continuous discrimination in the world as well as its solution by introducing new concepts of parallel world that includes an invisible set of errors as its companion. With respect to a matrix operator-filter bank that the matrix operator-analysis-filter bank H and the matrix operator-sampling-filter bank S are given, firstly, we introduce the detail algorithm to derive the optimum matrix operator-synthesis-filter bank Z that minimizes all the worst-case measures of the matrix operator-error-signals E(ω) = F(ω) − Y(ω) between the matrix operator-input-signals F(ω) and the matrix operator-output-signals Y(ω) of the matrix operator-filter bank at the same time. Further, feedback is introduced to the above approximation theory, and it is indicated that introducing conversations with feedback do not superior automatically to the accumulation of existing knowledge of signal prediction. Secondly, the concept of category in the field of mathematics is applied to the above optimum signal approximation and is indicated that the category-based approximation theory is applied to the set-theoretic consideration of the recognition of humans. Based on this discussion, it is shown naturally why the narrow perception that tends to create isolation shows an apparent advantage in the short term and, often, why such narrow thinking becomes intimate with discriminatory action in a human group. Throughout these considerations, it is presented that, in order to abolish easy and intimate discriminatory behavior, it is important to create a parallel world of conception where we share the set of invisible error signals, including the words and the consciousness of both worlds. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=matrix%20filterbank" title="matrix filterbank">matrix filterbank</a>, <a href="https://publications.waset.org/abstracts/search?q=optimum%20signal%20approximation" title=" optimum signal approximation"> optimum signal approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=category%20theory" title=" category theory"> category theory</a>, <a href="https://publications.waset.org/abstracts/search?q=simultaneous%20minimization" title=" simultaneous minimization"> simultaneous minimization</a> </p> <a href="https://publications.waset.org/abstracts/150610/theory-of-the-optimum-signal-approximation-clarifying-the-importance-in-the-recognition-of-parallel-world-and-application-to-secure-signal-communication-with-feedback" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/150610.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">143</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">8657</span> Asymptotic Spectral Theory for Nonlinear Random Fields</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Karima%20Kimouche">Karima Kimouche</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we consider the asymptotic problems in spectral analysis of stationary causal random fields. We impose conditions only involving (conditional) moments, which are easily verifiable for a variety of nonlinear random fields. Limiting distributions of periodograms and smoothed periodogram spectral density estimates are obtained and applications to the spectral domain bootstrap are given. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=spatial%20nonlinear%20processes" title="spatial nonlinear processes">spatial nonlinear processes</a>, <a href="https://publications.waset.org/abstracts/search?q=spectral%20estimators" title=" spectral estimators"> spectral estimators</a>, <a href="https://publications.waset.org/abstracts/search?q=GMC%20condition" title=" GMC condition"> GMC condition</a>, <a href="https://publications.waset.org/abstracts/search?q=bootstrap%20method" title=" bootstrap method"> bootstrap method</a> </p> <a href="https://publications.waset.org/abstracts/12479/asymptotic-spectral-theory-for-nonlinear-random-fields" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12479.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">453</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">8656</span> Influence of Random Fibre Packing on the Compressive Strength of Fibre Reinforced Plastic</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Y.%20Wang">Y. Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Zhang"> S. Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=X.%20Chen"> X. Chen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The longitudinal compressive strength of fibre reinforced plastic (FRP) possess a large stochastic variability, which limits efficient application of composite structures. This study aims to address how the random fibre packing affects the uncertainty of FRP compressive strength. An novel approach is proposed to generate random fibre packing status by a combination of Latin hypercube sampling and random sequential expansion. 3D nonlinear finite element model is built which incorporates both the matrix plasticity and fibre geometrical instability. The matrix is modeled by isotropic ideal elasto-plastic solid elements, and the fibres are modeled by linear-elastic rebar elements. Composite with a series of different nominal fibre volume fractions are studied. Premature fibre waviness at different magnitude and direction is introduced in the finite element model. Compressive tests on uni-directional CFRP (carbon fibre reinforced plastic) are conducted following the ASTM D6641. By a comparison of 3D FE models and compressive tests, it is clearly shown that the stochastic variation of compressive strength is partly caused by the random fibre packing, and normal or lognormal distribution tends to be a good fit the probabilistic compressive strength. Furthermore, it is also observed that different random fibre packing could trigger two different fibre micro-buckling modes while subjected to longitudinal compression: out-of-plane buckling and twisted buckling. The out-of-plane buckling mode results much larger compressive strength, and this is the major reason why the random fibre packing results a large uncertainty in the FRP compressive strength. This study would contribute to new approaches to the quality control of FRP considering higher compressive strength or lower uncertainty. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=compressive%20strength" title="compressive strength">compressive strength</a>, <a href="https://publications.waset.org/abstracts/search?q=FRP" title=" FRP"> FRP</a>, <a href="https://publications.waset.org/abstracts/search?q=micro-buckling" title=" micro-buckling"> micro-buckling</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20fibre%20packing" title=" random fibre packing"> random fibre packing</a> </p> <a href="https://publications.waset.org/abstracts/86173/influence-of-random-fibre-packing-on-the-compressive-strength-of-fibre-reinforced-plastic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/86173.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">273</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">8655</span> E-Bike FE Model Analysis: Connection Stiffness of Elements with Different DOFs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lele%20Zhang">Lele Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Hui%20Leng%20Choo"> Hui Leng Choo</a>, <a href="https://publications.waset.org/abstracts/search?q=Alexander%20Konyukhov"> Alexander Konyukhov</a>, <a href="https://publications.waset.org/abstracts/search?q=Shuguang%20Li"> Shuguang Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Finite Element (FE) model of simplified e-bike structure was generated by main frame with two tiers, which consisted of pipe, mass, beam, and shell elements (pipe 289, beam188, shell 181, shell 281, combin14, link11, mass21). These elements would be introduced and demonstrated using mathematical formulas. Based on coupling theory, constrain equations was proposed. Exporting all the parameters obtained from theory part, the connection stiffness matrix of the whole e-bike structure between each of these elements was detected. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=coupling%20theory" title="coupling theory">coupling theory</a>, <a href="https://publications.waset.org/abstracts/search?q=stiffness%20matrix" title=" stiffness matrix"> stiffness matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=e-bike" title=" e-bike"> e-bike</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20element%20model" title=" finite element model"> finite element model</a> </p> <a href="https://publications.waset.org/abstracts/30316/e-bike-fe-model-analysis-connection-stiffness-of-elements-with-different-dofs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30316.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">375</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">8654</span> An Application of Graph Theory to The Electrical Circuit Using Matrix Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Samai%27la%20Abdullahi">Samai'la Abdullahi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A graph is a pair of two set and so that a graph is a pictorial representation of a system using two basic element nodes and edges. A node is represented by a circle (either hallo shade) and edge is represented by a line segment connecting two nodes together. In this paper, we present a circuit network in the concept of graph theory application and also circuit models of graph are represented in logical connection method were we formulate matrix method of adjacency and incidence of matrix and application of truth table. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=euler%20circuit%20and%20path" title="euler circuit and path">euler circuit and path</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20representation%20of%20circuit%20networks" title=" graph representation of circuit networks"> graph representation of circuit networks</a>, <a href="https://publications.waset.org/abstracts/search?q=representation%20of%20graph%20models" title=" representation of graph models"> representation of graph models</a>, <a href="https://publications.waset.org/abstracts/search?q=representation%20of%20circuit%20network%20using%20logical%20truth%20table" title=" representation of circuit network using logical truth table"> representation of circuit network using logical truth table</a> </p> <a href="https://publications.waset.org/abstracts/32358/an-application-of-graph-theory-to-the-electrical-circuit-using-matrix-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32358.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">561</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">8653</span> BIASS in the Estimation of Covariance Matrices and Optimality Criteria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Juan%20M.%20Rodriguez-Diaz">Juan M. Rodriguez-Diaz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The precision of parameter estimators in the Gaussian linear model is traditionally accounted by the variance-covariance matrix of the asymptotic distribution. However, this measure can underestimate the true variance, specially for small samples. Traditionally, optimal design theory pays attention to this variance through its relationship with the model's information matrix. For this reason it seems convenient, at least in some cases, adapt the optimality criteria in order to get the best designs for the actual variance structure, otherwise the loss in efficiency of the designs obtained with the traditional approach may be very important. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=correlated%20observations" title="correlated observations">correlated observations</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20matrix" title=" information matrix"> information matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=optimality%20criteria" title=" optimality criteria"> optimality criteria</a>, <a href="https://publications.waset.org/abstracts/search?q=variance-covariance%20matrix" title=" variance-covariance matrix "> variance-covariance matrix </a> </p> <a href="https://publications.waset.org/abstracts/31104/biass-in-the-estimation-of-covariance-matrices-and-optimality-criteria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31104.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">8652</span> Category-Base Theory of the Optimum Signal Approximation Clarifying the Importance of Parallel Worlds in the Recognition of Human and Application to Secure Signal Communication with Feedback</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Takuro%20Kida">Takuro Kida</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuichi%20Kida"> Yuichi Kida</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We show a base of the new trend of algorithm mathematically that treats a historical reason of continuous discrimination in the world as well as its solution by introducing new concepts of parallel world that includes an invisible set of errors as its companion. With respect to a matrix operator-filter bank that the matrix operator-analysis-filter bank H and the matrix operator-sampling-filter bank S are given, firstly, we introduce the detailed algorithm to derive the optimum matrix operator-synthesis-filter bank Z that minimizes all the worst-case measures of the matrix operator-error-signals E(ω) = F(ω) − Y(ω) between the matrix operator-input-signals F(ω) and the matrix operator-output signals Y(ω) of the matrix operator-filter bank at the same time. Further, feedback is introduced to the above approximation theory and it is indicated that introducing conversations with feedback does not superior automatically to the accumulation of existing knowledge of signal prediction. Secondly, the concept of category in the field of mathematics is applied to the above optimum signal approximation and is indicated that the category-based approximation theory is applied to the set-theoretic consideration of the recognition of humans. Based on this discussion, it is shown naturally why the narrow perception that tends to create isolation shows an apparent advantage in the short term and, often, why such narrow thinking becomes intimate with discriminatory action in a human group. Throughout these considerations, it is presented that, in order to abolish easy and intimate discriminatory behavior, it is important to create a parallel world of conception where we share the set of invisible error signals, including the words and the consciousness of both worlds. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=signal%20prediction" title="signal prediction">signal prediction</a>, <a href="https://publications.waset.org/abstracts/search?q=pseudo%20inverse%20matrix" title=" pseudo inverse matrix"> pseudo inverse matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20intelligence" title=" artificial intelligence"> artificial intelligence</a>, <a href="https://publications.waset.org/abstracts/search?q=conditional%20optimization" title=" conditional optimization"> conditional optimization</a> </p> <a href="https://publications.waset.org/abstracts/144630/category-base-theory-of-the-optimum-signal-approximation-clarifying-the-importance-of-parallel-worlds-in-the-recognition-of-human-and-application-to-secure-signal-communication-with-feedback" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/144630.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">156</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">8651</span> Seismic Response Mitigation of Structures Using Base Isolation System Considering Uncertain Parameters</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rama%20Debbarma">Rama Debbarma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The present study deals with the performance of Linear base isolation system to mitigate seismic response of structures characterized by random system parameters. This involves optimization of the tuning ratio and damping properties of the base isolation system considering uncertain system parameters. However, the efficiency of base isolator may reduce if it is not tuned to the vibrating mode it is designed to suppress due to unavoidable presence of system parameters uncertainty. With the aid of matrix perturbation theory and first order Taylor series expansion, the total probability concept is used to evaluate the unconditional response of the primary structures considering random system parameters. For this, the conditional second order information of the response quantities are obtained in random vibration framework using state space formulation. Subsequently, the maximum unconditional root mean square displacement of the primary structures is used as the objective function to obtain optimum damping parameters Numerical study is performed to elucidate the effect of parameters uncertainties on the optimization of parameters of linear base isolator and system performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=linear%20base%20isolator" title="linear base isolator">linear base isolator</a>, <a href="https://publications.waset.org/abstracts/search?q=earthquake" title=" earthquake"> earthquake</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertain%20parameters" title=" uncertain parameters"> uncertain parameters</a> </p> <a href="https://publications.waset.org/abstracts/32755/seismic-response-mitigation-of-structures-using-base-isolation-system-considering-uncertain-parameters" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32755.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">434</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8650</span> Parameters Optimization of the Laminated Composite Plate for Sound Transmission Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yu%20T.%20Tsai">Yu T. Tsai</a>, <a href="https://publications.waset.org/abstracts/search?q=Jin%20H.%20Huang"> Jin H. Huang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the specific sound transmission loss (TL) of the laminated composite plate (LCP) with different material properties in each layer is investigated. The numerical method to obtain the TL of the LCP is proposed by using elastic plate theory. The transfer matrix approach is novelty presented for computational efficiency in solving the numerous layers of dynamic stiffness matrix (D-matrix) of the LCP. Besides the numerical simulations for calculating the TL of the LCP, the material properties inverse method is presented for the design of a laminated composite plate analogous to a metallic plate with a specified TL. As a result, it demonstrates that the proposed computational algorithm exhibits high efficiency with a small number of iterations for achieving the goal. This method can be effectively employed to design and develop tailor-made materials for various applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=sound%20transmission%20loss" title="sound transmission loss">sound transmission loss</a>, <a href="https://publications.waset.org/abstracts/search?q=laminated%20composite%20plate" title=" laminated composite plate"> laminated composite plate</a>, <a href="https://publications.waset.org/abstracts/search?q=transfer%20matrix%20approach" title=" transfer matrix approach"> transfer matrix approach</a>, <a href="https://publications.waset.org/abstracts/search?q=inverse%20problem" title=" inverse problem"> inverse problem</a>, <a href="https://publications.waset.org/abstracts/search?q=elastic%20plate%20theory" title=" elastic plate theory"> elastic plate theory</a>, <a href="https://publications.waset.org/abstracts/search?q=material%20properties" title=" material properties"> material properties</a> </p> <a href="https://publications.waset.org/abstracts/25937/parameters-optimization-of-the-laminated-composite-plate-for-sound-transmission-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25937.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">8649</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">8648</span> Micromechanical Modeling of Fiber-Matrix Debonding in Unidirectional Composites</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Palizvan">M. Palizvan</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20T.%20Abadi"> M. T. Abadi</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20H.%20Sadr"> M. H. Sadr</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Due to variations in damage mechanisms in the microscale, the behavior of fiber-reinforced composites is nonlinear and difficult to model. To make use of computational advantages, homogenization method is applied to the micro-scale model in order to minimize the cost at the expense of detail of local microscale phenomena. In this paper, the effective stiffness is calculated using the homogenization of nonlinear behavior of a composite representative volume element (RVE) containing fiber-matrix debonding. The damage modes for the RVE are considered by using cohesive elements and contacts for the cohesive behavior of the interface between fiber and matrix. To predict more realistic responses of composite materials, different random distributions of fibers are proposed besides square and hexagonal arrays. It was shown that in some cases, there is quite different damage behavior in different fiber distributions. A comprehensive comparison has been made between different graphs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=homogenization" title="homogenization">homogenization</a>, <a href="https://publications.waset.org/abstracts/search?q=cohesive%20zone%20model" title=" cohesive zone model"> cohesive zone model</a>, <a href="https://publications.waset.org/abstracts/search?q=fiber-matrix%20debonding" title=" fiber-matrix debonding"> fiber-matrix debonding</a>, <a href="https://publications.waset.org/abstracts/search?q=RVE" title=" RVE"> RVE</a> </p> <a href="https://publications.waset.org/abstracts/99817/micromechanical-modeling-of-fiber-matrix-debonding-in-unidirectional-composites" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/99817.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">167</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">8647</span> Quantum Statistical Machine Learning and Quantum Time Series</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Omar%20Alzeley">Omar Alzeley</a>, <a href="https://publications.waset.org/abstracts/search?q=Sergey%20Utev"> Sergey Utev</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Minimizing a constrained multivariate function is the fundamental of Machine learning, and these algorithms are at the core of data mining and data visualization techniques. The decision function that maps input points to output points is based on the result of optimization. This optimization is the central of learning theory. One approach to complex systems where the dynamics of the system is inferred by a statistical analysis of the fluctuations in time of some associated observable is time series analysis. The purpose of this paper is a mathematical transition from the autoregressive model of classical time series to the matrix formalization of quantum theory. Firstly, we have proposed a quantum time series model (QTS). Although Hamiltonian technique becomes an established tool to detect a deterministic chaos, other approaches emerge. The quantum probabilistic technique is used to motivate the construction of our QTS model. The QTS model resembles the quantum dynamic model which was applied to financial data. Secondly, various statistical methods, including machine learning algorithms such as the Kalman filter algorithm, are applied to estimate and analyses the unknown parameters of the model. Finally, simulation techniques such as Markov chain Monte Carlo have been used to support our investigations. The proposed model has been examined by using real and simulated data. We establish the relation between quantum statistical machine and quantum time series via random matrix theory. It is interesting to note that the primary focus of the application of QTS in the field of quantum chaos was to find a model that explain chaotic behaviour. Maybe this model will reveal another insight into quantum chaos. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=machine%20learning" title="machine learning">machine learning</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation%20techniques" title=" simulation techniques"> simulation techniques</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20probability" title=" quantum probability"> quantum probability</a>, <a href="https://publications.waset.org/abstracts/search?q=tensor%20product" title=" tensor product"> tensor product</a>, <a href="https://publications.waset.org/abstracts/search?q=time%20series" title=" time series"> time series</a> </p> <a href="https://publications.waset.org/abstracts/52720/quantum-statistical-machine-learning-and-quantum-time-series" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52720.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">469</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">8646</span> Adaptive Target Detection of High-Range-Resolution Radar in Non-Gaussian Clutter</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lina%20Pan">Lina Pan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In non-Gaussian clutter of a spherically invariant random vector, in the cases that a certain estimated covariance matrix could become singular, the adaptive target detection of high-range-resolution radar is addressed. Firstly, the restricted maximum likelihood (RML) estimates of unknown covariance matrix and scatterer amplitudes are derived for non-Gaussian clutter. And then the RML estimate of texture is obtained. Finally, a novel detector is devised. It is showed that, without secondary data, the proposed detector outperforms the existing Kelly binary integrator. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=non-Gaussian%20clutter" title="non-Gaussian clutter">non-Gaussian clutter</a>, <a href="https://publications.waset.org/abstracts/search?q=covariance%20matrix%20estimation" title=" covariance matrix estimation"> covariance matrix estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=target%20detection" title=" target detection"> target detection</a>, <a href="https://publications.waset.org/abstracts/search?q=maximum%20likelihood" title=" maximum likelihood"> maximum likelihood</a> </p> <a href="https://publications.waset.org/abstracts/24879/adaptive-target-detection-of-high-range-resolution-radar-in-non-gaussian-clutter" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24879.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">8645</span> Gaussian Probability Density for Forest Fire Detection Using Satellite Imagery</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Benkraouda">S. Benkraouda</a>, <a href="https://publications.waset.org/abstracts/search?q=Z.%20Djelloul-Khedda"> Z. Djelloul-Khedda</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Yagoubi"> B. Yagoubi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> we present a method for early detection of forest fires from a thermal infrared satellite image, using the image matrix of the probability of belonging. The principle of the method is to compare a theoretical mathematical model to an experimental model. We considered that each line of the image matrix, as an embodiment of a non-stationary random process. Since the distribution of pixels in the satellite image is statistically dependent, we divided these lines into small stationary and ergodic intervals to characterize the image by an adequate mathematical model. A standard deviation was chosen to generate random variables, so each interval behaves naturally like white Gaussian noise. The latter has been selected as the mathematical model that represents a set of very majority pixels, which we can be considered as the image background. Before modeling the image, we made a few pretreatments, then the parameters of the theoretical Gaussian model were extracted from the modeled image, these settings will be used to calculate the probability of each interval of the modeled image to belong to the theoretical Gaussian model. The high intensities pixels are regarded as foreign elements to it, so they will have a low probability, and the pixels that belong to the background image will have a high probability. Finally, we did present the reverse of the matrix of probabilities of these intervals for a better fire detection. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=forest%20fire" title="forest fire">forest fire</a>, <a href="https://publications.waset.org/abstracts/search?q=forest%20fire%20detection" title=" forest fire detection"> forest fire detection</a>, <a href="https://publications.waset.org/abstracts/search?q=satellite%20image" title=" satellite image"> satellite image</a>, <a href="https://publications.waset.org/abstracts/search?q=normal%20distribution" title=" normal distribution"> normal distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=theoretical%20gaussian%20model" title=" theoretical gaussian model"> theoretical gaussian model</a>, <a href="https://publications.waset.org/abstracts/search?q=thermal%20infrared%20matrix%20image" title=" thermal infrared matrix image"> thermal infrared matrix image</a> </p> <a href="https://publications.waset.org/abstracts/118320/gaussian-probability-density-for-forest-fire-detection-using-satellite-imagery" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/118320.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">142</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">8644</span> Stochastic Simulation of Random Numbers Using Linear Congruential Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Melvin%20Ballera">Melvin Ballera</a>, <a href="https://publications.waset.org/abstracts/search?q=Aldrich%20Olivar"> Aldrich Olivar</a>, <a href="https://publications.waset.org/abstracts/search?q=Mary%20Soriano"> Mary Soriano</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Digital computers nowadays must be able to have a utility that is capable of generating random numbers. Usually, computer-generated random numbers are not random given predefined values such as starting point and end points, making the sequence almost predictable. There are many applications of random numbers such business simulation, manufacturing, services domain, entertainment sector and other equally areas making worthwhile to design a unique method and to allow unpredictable random numbers. Applying stochastic simulation using linear congruential algorithm, it shows that as it increases the numbers of the seed and range the number randomly produced or selected by the computer becomes unique. If this implemented in an environment where random numbers are very much needed, the reliability of the random number is guaranteed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=stochastic%20simulation" title="stochastic simulation">stochastic simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20numbers" title=" random numbers"> random numbers</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20congruential%20algorithm" title=" linear congruential algorithm"> linear congruential algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=pseudorandomness" title=" pseudorandomness"> pseudorandomness</a> </p> <a href="https://publications.waset.org/abstracts/52819/stochastic-simulation-of-random-numbers-using-linear-congruential-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52819.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">316</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">8643</span> Development of Graph-Theoretic Model for Ranking Top of Rail Lubricants </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Subhash%20Chandra%20Sharma">Subhash Chandra Sharma</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Soleimani"> Mohammad Soleimani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Selection of the correct lubricant for the top of rail application is a complex process. In this paper, the selection of the proper lubricant for a Top-Of-Rail (TOR) lubrication system based on graph theory and matrix approach has been developed. Attributes influencing the selection process and their influence on each other has been represented through a digraph and an equivalent matrix. A matrix function which is called the Permanent Function is derived. By substituting the level of inherent contribution of the influencing parameters and their influence on each other qualitatively, a criterion called Suitability Index is derived. Based on these indices, lubricants can be ranked for their suitability. The proposed model can be useful for maintenance engineers in selecting the best lubricant for a TOR application. The proposed methodology is illustrated step–by-step through an example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=lubricant%20selection" title="lubricant selection">lubricant selection</a>, <a href="https://publications.waset.org/abstracts/search?q=top%20of%20rail%20lubrication" title=" top of rail lubrication"> top of rail lubrication</a>, <a href="https://publications.waset.org/abstracts/search?q=graph-theory" title=" graph-theory"> graph-theory</a>, <a href="https://publications.waset.org/abstracts/search?q=Ranking%20of%20lubricants" title=" Ranking of lubricants"> Ranking of lubricants</a> </p> <a href="https://publications.waset.org/abstracts/51856/development-of-graph-theoretic-model-for-ranking-top-of-rail-lubricants" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51856.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">295</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">8642</span> Quantum Graph Approach for Energy and Information Transfer through Networks of Cables</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mubarack%20Ahmed">Mubarack Ahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=Gabriele%20Gradoni"> Gabriele Gradoni</a>, <a href="https://publications.waset.org/abstracts/search?q=Stephen%20C.%20Creagh"> Stephen C. Creagh</a>, <a href="https://publications.waset.org/abstracts/search?q=Gregor%20Tanner"> Gregor Tanner</a> </p> <p class="card-text"><strong>Abstract:</strong></p> High-frequency cables commonly connect modern devices and sensors. Interestingly, the proportion of electric components is rising fast in an attempt to achieve lighter and greener devices. Modelling the propagation of signals through these cable networks in the presence of parameter uncertainty is a daunting task. In this work, we study the response of high-frequency cable networks using both Transmission Line and Quantum Graph (QG) theories. We have successfully compared the two theories in terms of reflection spectra using measurements on real, lossy cables. We have derived a generalisation of the vertex scattering matrix to include non-uniform networks – networks of cables with different characteristic impedances and propagation constants. The QG model implicitly takes into account the pseudo-chaotic behavior, at the vertices, of the propagating electric signal. We have successfully compared the asymptotic growth of eigenvalues of the Laplacian with the predictions of Weyl law. We investigate the nearest-neighbour level-spacing distribution of the resonances and compare our results with the predictions of Random Matrix Theory (RMT). To achieve this, we will compare our graphs with the generalisation of Wigner distribution for open systems. The problem of scattering from networks of cables can also provide an analogue model for wireless communication in highly reverberant environments. In this context, we provide a preliminary analysis of the statistics of communication capacity for communication across cable networks, whose eventual aim is to enable detailed laboratory testing of information transfer rates using software defined radio. We specialise this analysis in particular for the case of MIMO (Multiple-Input Multiple-Output) protocols. We have successfully validated our QG model with both TL model and laboratory measurements. The growth of Eigenvalues compares well with Weyl’s law and the level-spacing distribution agrees so well RMT predictions. The results we achieved in the MIMO application compares favourably with the prediction of a parallel on-going research (sponsored by NEMF21.) <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=eigenvalues" title="eigenvalues">eigenvalues</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple-input%20multiple-output" title=" multiple-input multiple-output"> multiple-input multiple-output</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20graph" title=" quantum graph"> quantum graph</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20matrix%20theory" title=" random matrix theory"> random matrix theory</a>, <a href="https://publications.waset.org/abstracts/search?q=transmission%20line" title=" transmission line"> transmission line</a> </p> <a href="https://publications.waset.org/abstracts/95020/quantum-graph-approach-for-energy-and-information-transfer-through-networks-of-cables" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/95020.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">173</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">8641</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> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">‹</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=random%20matrix%20theory&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20matrix%20theory&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20matrix%20theory&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20matrix%20theory&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20matrix%20theory&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20matrix%20theory&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20matrix%20theory&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20matrix%20theory&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20matrix%20theory&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=random%20matrix%20theory&page=288">288</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20matrix%20theory&page=289">289</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=random%20matrix%20theory&page=2" rel="next">›</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>