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: lower bound.</title> <meta name="description" content="Search results for: lower bound."> <meta name="keywords" content="lower bound."> <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="lower bound." name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="lower bound."> <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> 1695</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: lower bound.</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1695</span> An Efficient Algorithm for Reliability Lower Bound of Distributed Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mohamed%20H.%20S.%20Mohamed">Mohamed H. S. Mohamed</a>, <a href="https://publications.waset.org/search?q=Yang%20Xiao-zong"> Yang Xiao-zong</a>, <a href="https://publications.waset.org/search?q=Liu%20Hong-wei"> Liu Hong-wei</a>, <a href="https://publications.waset.org/search?q=Wu%20Zhi-bo"> Wu Zhi-bo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The reliability of distributed systems and computer networks have been modeled by a probabilistic network or a graph G. Computing the residual connectedness reliability (RCR), denoted by R(G), under the node fault model is very useful, but is an NP-hard problem. Since it may need exponential time of the network size to compute the exact value of R(G), it is important to calculate its tight approximate value, especially its lower bound, at a moderate calculation time. In this paper, we propose an efficient algorithm for reliability lower bound of distributed systems with unreliable nodes. We also applied our algorithm to several typical classes of networks to evaluate the lower bounds and show the effectiveness of our algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Distributed%20systems" title="Distributed systems">Distributed systems</a>, <a href="https://publications.waset.org/search?q=probabilistic%20network" title=" probabilistic network"> probabilistic network</a>, <a href="https://publications.waset.org/search?q=residual%0Aconnectedness%20reliability" title=" residual connectedness reliability"> residual connectedness reliability</a>, <a href="https://publications.waset.org/search?q=lower%20bound." title=" lower bound."> lower bound.</a> </p> <a href="https://publications.waset.org/3210/an-efficient-algorithm-for-reliability-lower-bound-of-distributed-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3210/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3210/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3210/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3210/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3210/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3210/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3210/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3210/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3210/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3210/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3210.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">1686</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1694</span> An Implementation of MacMahon's Partition Analysis in Ordering the Lower Bound of Processing Elements for the Algorithm of LU Decomposition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Halil%20Snopce">Halil Snopce</a>, <a href="https://publications.waset.org/search?q=Ilir%20Spahiu"> Ilir Spahiu</a>, <a href="https://publications.waset.org/search?q=Lavdrim%20Elmazi"> Lavdrim Elmazi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>A lot of Scientific and Engineering problems require the solution of large systems of linear equations of the form bAx in an effective manner. LU-Decomposition offers good choices for solving this problem. Our approach is to find the lower bound of processing elements needed for this purpose. Here is used the so called Omega calculus, as a computational method for solving problems via their corresponding Diophantine relation. From the corresponding algorithm is formed a system of linear diophantine equalities using the domain of computation which is given by the set of lattice points inside the polyhedron. Then is run the Mathematica program DiophantineGF.m. This program calculates the generating function from which is possible to find the number of solutions to the system of Diophantine equalities, which in fact gives the lower bound for the number of processors needed for the corresponding algorithm. There is given a mathematical explanation of the problem as well. Keywordsgenerating function, lattice points in polyhedron, lower bound of processor elements, system of Diophantine equationsand : calculus.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=generating%20function" title="generating function">generating function</a>, <a href="https://publications.waset.org/search?q=lattice%20points%20in%20polyhedron" title=" lattice points in polyhedron"> lattice points in polyhedron</a>, <a href="https://publications.waset.org/search?q=lower%20bound%20of%20processor%20elements" title=" lower bound of processor elements"> lower bound of processor elements</a>, <a href="https://publications.waset.org/search?q=system%20of%20Diophantine%20equations%20and%20calculus." title=" system of Diophantine equations and calculus. "> system of Diophantine equations and calculus. </a> </p> <a href="https://publications.waset.org/5313/an-implementation-of-macmahons-partition-analysis-in-ordering-the-lower-bound-of-processing-elements-for-the-algorithm-of-lu-decomposition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5313/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5313/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5313/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5313/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5313/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5313/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5313/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5313/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5313/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5313/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5313.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">1477</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1693</span> Lower Bound of Time Span Product for a General Class of Signals in Fractional Fourier Domain</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sukrit%20Shankar">Sukrit Shankar</a>, <a href="https://publications.waset.org/search?q=Chetana%20Shanta%20Patsa"> Chetana Shanta Patsa</a>, <a href="https://publications.waset.org/search?q=Jaydev%20Sharma"> Jaydev Sharma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Fractional Fourier Transform is a generalization of the classical Fourier Transform which is often symbolized as the rotation in time- frequency plane. Similar to the product of time and frequency span which provides the Uncertainty Principle for the classical Fourier domain, there has not been till date an Uncertainty Principle for the Fractional Fourier domain for a generalized class of finite energy signals. Though the lower bound for the product of time and Fractional Fourier span is derived for the real signals, a tighter lower bound for a general class of signals is of practical importance, especially for the analysis of signals containing chirps. We hence formulate a mathematical derivation that gives the lower bound of time and Fractional Fourier span product. The relation proves to be utmost importance in taking the Fractional Fourier Transform with adaptive time and Fractional span resolutions for a varied class of complex signals.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Fractional%20Fourier%20Transform" title="Fractional Fourier Transform">Fractional Fourier Transform</a>, <a href="https://publications.waset.org/search?q=uncertainty%20principle" title=" uncertainty principle"> uncertainty principle</a>, <a href="https://publications.waset.org/search?q=Fractional%20Fourier%20Span" title=" Fractional Fourier Span"> Fractional Fourier Span</a>, <a href="https://publications.waset.org/search?q=amplitude" title=" amplitude"> amplitude</a>, <a href="https://publications.waset.org/search?q=phase." title=" phase."> phase.</a> </p> <a href="https://publications.waset.org/8228/lower-bound-of-time-span-product-for-a-general-class-of-signals-in-fractional-fourier-domain" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8228/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8228/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8228/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8228/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8228/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8228/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8228/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8228/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8228/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8228/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8228.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">1199</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1692</span> Some New Inequalities for Eigenvalues of the Hadamard Product and the Fan Product of Matrices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jing%20Li">Jing Li</a>, <a href="https://publications.waset.org/search?q=Guang%20Zhou"> Guang Zhou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Let A and B be nonnegative matrices. A new upper bound on the spectral radius ρ(A◦B) is obtained. Meanwhile, a new lower bound on the smallest eigenvalue q(AB) for the Fan product, and a new lower bound on the minimum eigenvalue q(B ◦A−1) for the Hadamard product of B and A−1 of two nonsingular M-matrices A and B are given. Some results of comparison are also given in theory. To illustrate our results, numerical examples are considered.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Hadamard%20product" title="Hadamard product">Hadamard product</a>, <a href="https://publications.waset.org/search?q=Fan%20product%3B%20nonnegative%20matrix" title=" Fan product; nonnegative matrix"> Fan product; nonnegative matrix</a>, <a href="https://publications.waset.org/search?q=M-matrix" title=" M-matrix"> M-matrix</a>, <a href="https://publications.waset.org/search?q=Spectral%20radius" title=" Spectral radius"> Spectral radius</a>, <a href="https://publications.waset.org/search?q=Minimum%20eigenvalue" title=" Minimum eigenvalue"> Minimum eigenvalue</a>, <a href="https://publications.waset.org/search?q=1-path%20cover." title=" 1-path cover."> 1-path cover.</a> </p> <a href="https://publications.waset.org/16985/some-new-inequalities-for-eigenvalues-of-the-hadamard-product-and-the-fan-product-of-matrices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/16985/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/16985/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/16985/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/16985/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/16985/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/16985/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/16985/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/16985/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/16985/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/16985/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/16985.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">1901</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1691</span> Computing the Loop Bound in Iterative Data Flow Graphs Using Natural Token Flow</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ali%20Shatnawi">Ali Shatnawi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Signal processing applications which are iterative in nature are best represented by data flow graphs (DFG). In these applications, the maximum sampling frequency is dependent on the topology of the DFG, the cyclic dependencies in particular. The determination of the iteration bound, which is the reciprocal of the maximum sampling frequency, is critical in the process of hardware implementation of signal processing applications. In this paper, a novel technique to compute the iteration bound is proposed. This technique is different from all previously proposed techniques, in the sense that it is based on the natural flow of tokens into the DFG rather than the topology of the graph. The proposed algorithm has lower run-time complexity than all known algorithms. The performance of the proposed algorithm is illustrated through analytical analysis of the time complexity, as well as through simulation of some benchmark problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Data%20flow%20graph" title="Data flow graph">Data flow graph</a>, <a href="https://publications.waset.org/search?q=Iteration%20period%20bound" title=" Iteration period bound"> Iteration period bound</a>, <a href="https://publications.waset.org/search?q=Rateoptimalscheduling" title=" Rateoptimalscheduling"> Rateoptimalscheduling</a>, <a href="https://publications.waset.org/search?q=Recursive%20DSP%20algorithms." title=" Recursive DSP algorithms."> Recursive DSP algorithms.</a> </p> <a href="https://publications.waset.org/12934/computing-the-loop-bound-in-iterative-data-flow-graphs-using-natural-token-flow" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12934/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12934/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12934/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12934/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12934/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12934/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12934/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12934/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12934/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12934/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12934.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">2563</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1690</span> Lower Bounds of Some Small Ramsey Numbers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Decha%20Samana">Decha Samana</a>, <a href="https://publications.waset.org/search?q=Vites%20Longani"> Vites Longani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For positive integer s and t, the Ramsey number R(s, t) is the least positive integer n such that for every graph G of order n, either G contains Ks as a subgraph or G contains Kt as a subgraph. We construct the circulant graphs and use them to obtain lower bounds of some small Ramsey numbers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Lower%20bound" title="Lower bound">Lower bound</a>, <a href="https://publications.waset.org/search?q=Ramsey%20numbers" title=" Ramsey numbers"> Ramsey numbers</a>, <a href="https://publications.waset.org/search?q=Graphs" title=" Graphs"> Graphs</a>, <a href="https://publications.waset.org/search?q=Distance%20line." title=" Distance line."> Distance line.</a> </p> <a href="https://publications.waset.org/6768/lower-bounds-of-some-small-ramsey-numbers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6768/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6768/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6768/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6768/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6768/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6768/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6768/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6768/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6768/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6768/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6768.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">1376</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1689</span> Limit Analysis of FGM Circular Plates Subjected to Arbitrary Rotational Symmetric Loads</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kargarnovin%20M.H.">Kargarnovin M.H.</a>, <a href="https://publications.waset.org/search?q=Faghidian%20S.%20A"> Faghidian S. A</a>, <a href="https://publications.waset.org/search?q=Arghavani%20J."> Arghavani J.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The limit load carrying capacity of functionally graded materials (FGM) circular plates subjected to an arbitrary rotationally symmetric loading has been computed. It is provided that the plate material behaves rigid perfectly plastic and obeys either the Square or the Tresca yield criterion. To this end the upper and lower bound principles of limit analysis are employed to determine the exact value for the limiting load. The correctness of the result are verified and finally limiting loads for two examples namely; through radius and through thickness FGM circular plates with simply supported edges are calculated, respectively and moreover, the values of critical loading factor are determined. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Circular%20plate" title="Circular plate">Circular plate</a>, <a href="https://publications.waset.org/search?q=FGM%20circular%20plate" title=" FGM circular plate"> FGM circular plate</a>, <a href="https://publications.waset.org/search?q=Limit%20analysis" title=" Limit analysis"> Limit analysis</a>, <a href="https://publications.waset.org/search?q=Lower%20and%20Upper%20bound%20theorems." title="Lower and Upper bound theorems.">Lower and Upper bound theorems.</a> </p> <a href="https://publications.waset.org/4418/limit-analysis-of-fgm-circular-plates-subjected-to-arbitrary-rotational-symmetric-loads" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4418/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4418/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4418/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4418/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4418/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4418/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4418/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4418/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4418/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4418/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4418.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">1599</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1688</span> Jeffrey's Prior for Unknown Sinusoidal Noise Model via Cramer-Rao Lower Bound</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Samuel%20A.%20Phillips">Samuel A. Phillips</a>, <a href="https://publications.waset.org/search?q=Emmanuel%20A.%20Ayanlowo"> Emmanuel A. Ayanlowo</a>, <a href="https://publications.waset.org/search?q=Rasaki%20O.%20Olanrewaju"> Rasaki O. Olanrewaju</a>, <a href="https://publications.waset.org/search?q=Olayode%20Fatoki"> Olayode Fatoki</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper employs the Jeffrey's prior technique in the process of estimating the periodograms and frequency of sinusoidal model for unknown noisy time variants or oscillating events (data) in a Bayesian setting. The non-informative Jeffrey's prior was adopted for the posterior trigonometric function of the sinusoidal model such that Cramer-Rao Lower Bound (CRLB) inference was used in carving-out the minimum variance needed to curb the invariance structure effect for unknown noisy time observational and repeated circular patterns. An average monthly oscillating temperature series measured in degree Celsius (0C) from 1901 to 2014 was subjected to the posterior solution of the unknown noisy events of the sinusoidal model via Markov Chain Monte Carlo (MCMC). It was not only deduced that two minutes period is required before completing a cycle of changing temperature from one particular degree Celsius to another but also that the sinusoidal model via the CRLB-Jeffrey's prior for unknown noisy events produced a miniature posterior Maximum A Posteriori (MAP) compare to a known noisy events.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cramer-Rao%20Lower%20Bound%20%28CRLB%29" title="Cramer-Rao Lower Bound (CRLB)">Cramer-Rao Lower Bound (CRLB)</a>, <a href="https://publications.waset.org/search?q=Jeffrey%27s%20prior" title=" Jeffrey's prior"> Jeffrey's prior</a>, <a href="https://publications.waset.org/search?q=Sinusoidal" title=" Sinusoidal"> Sinusoidal</a>, <a href="https://publications.waset.org/search?q=Maximum%20A%20Posteriori%20%28MAP%29" title=" Maximum A Posteriori (MAP)"> Maximum A Posteriori (MAP)</a>, <a href="https://publications.waset.org/search?q=Markov%20Chain%20Monte%0D%0ACarlo%20%28MCMC%29" title=" Markov Chain Monte Carlo (MCMC)"> Markov Chain Monte Carlo (MCMC)</a>, <a href="https://publications.waset.org/search?q=Periodograms." title=" Periodograms."> Periodograms.</a> </p> <a href="https://publications.waset.org/10010357/jeffreys-prior-for-unknown-sinusoidal-noise-model-via-cramer-rao-lower-bound" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10010357/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10010357/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10010357/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10010357/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10010357/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10010357/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10010357/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10010357/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10010357/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10010357/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10010357.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">661</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1687</span> Calculation of Wave Function at the Origin (WFO) for Heavy Mesons by Numerical Solving of the Schrodinger Equation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Momeni%20Feyli">M. Momeni Feyli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Many recent high energy physics calculations involving charm and beauty invoke wave function at the origin (WFO) for the meson bound state. Uncertainties of charm and beauty quark masses and different models for potentials governing these bound states require a simple numerical algorithm for evaluation of the WFO's for these bound states. We present a simple algorithm for this propose which provides WFO's with high precision compared with similar ones already obtained in the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Mesons" title="Mesons">Mesons</a>, <a href="https://publications.waset.org/search?q=Bound%20states" title=" Bound states"> Bound states</a>, <a href="https://publications.waset.org/search?q=Schrodinger%20equation" title=" Schrodinger equation"> Schrodinger equation</a>, <a href="https://publications.waset.org/search?q=Nonrelativistic%0Aquark%20model." title=" Nonrelativistic quark model."> Nonrelativistic quark model.</a> </p> <a href="https://publications.waset.org/465/calculation-of-wave-function-at-the-origin-wfo-for-heavy-mesons-by-numerical-solving-of-the-schrodinger-equation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/465/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/465/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/465/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/465/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/465/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/465/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/465/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/465/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/465/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/465/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/465.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">1506</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1686</span> An Adversarial Construction of Instability Bounds in LIS Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Dimitrios%20Koukopoulos">Dimitrios Koukopoulos</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work, we study the impact of dynamically changing link slowdowns on the stability properties of packetswitched networks under the Adversarial Queueing Theory framework. Especially, we consider the Adversarial, Quasi-Static Slowdown Queueing Theory model, where each link slowdown may take on values in the two-valued set of integers {1, D} with D > 1 which remain fixed for a long time, under a (w, ¤ü)-adversary. In this framework, we present an innovative systematic construction for the estimation of adversarial injection rate lower bounds, which, if exceeded, cause instability in networks that use the LIS (Longest-in- System) protocol for contention-resolution. In addition, we show that a network that uses the LIS protocol for contention-resolution may result in dropping its instability bound at injection rates ¤ü > 0 when the network size and the high slowdown D take large values. This is the best ever known instability lower bound for LIS networks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Network%20stability" title="Network stability">Network stability</a>, <a href="https://publications.waset.org/search?q=quality%20of%20service" title=" quality of service"> quality of service</a>, <a href="https://publications.waset.org/search?q=adversarial%0Aqueueing%20theory" title=" adversarial queueing theory"> adversarial queueing theory</a>, <a href="https://publications.waset.org/search?q=greedy%20scheduling%20protocols." title=" greedy scheduling protocols."> greedy scheduling protocols.</a> </p> <a href="https://publications.waset.org/9398/an-adversarial-construction-of-instability-bounds-in-lis-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9398/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9398/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9398/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9398/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9398/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9398/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9398/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9398/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9398/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9398/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9398.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">1231</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1685</span> Spin-Dependent Transport Signatures of Bound States: From Finger to Top Gates</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yun-Hsuan%20Yu">Yun-Hsuan Yu</a>, <a href="https://publications.waset.org/search?q=Chi-Shung%20Tang"> Chi-Shung Tang</a>, <a href="https://publications.waset.org/search?q=Nzar%20Rauf%20Abdullah"> Nzar Rauf Abdullah</a>, <a href="https://publications.waset.org/search?q=Vidar%20Gudmundsson"> Vidar Gudmundsson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Spin-orbit gap feature in energy dispersion of one-dimensional devices is revealed via strong spin-orbit interaction (SOI) effects under Zeeman field. We describe the utilization of a finger-gate or a top-gate to control the spin-dependent transport characteristics in the SOI-Zeeman influenced split-gate devices by means of a generalized spin-mixed propagation matrix method. For the finger-gate system, we find a bound state in continuum for incident electrons within the ultra-low energy regime. For the top-gate system, we observe more bound-state features in conductance associated with the formation of spin-associated hole-like or electron-like quasi-bound states around band thresholds, as well as hole bound states around the reverse point of the energy dispersion. We demonstrate that the spin-dependent transport behavior of a top-gate system is similar to that of a finger-gate system only if the top-gate length is less than the effective Fermi wavelength. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Spin-orbit" title="Spin-orbit">Spin-orbit</a>, <a href="https://publications.waset.org/search?q=Zeeman" title=" Zeeman"> Zeeman</a>, <a href="https://publications.waset.org/search?q=top-gate" title=" top-gate"> top-gate</a>, <a href="https://publications.waset.org/search?q=finger-gate" title=" finger-gate"> finger-gate</a>, <a href="https://publications.waset.org/search?q=bound%20state." title=" bound state."> bound state.</a> </p> <a href="https://publications.waset.org/10008608/spin-dependent-transport-signatures-of-bound-states-from-finger-to-top-gates" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10008608/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10008608/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10008608/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10008608/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10008608/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10008608/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10008608/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10008608/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10008608/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10008608/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10008608.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">954</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1684</span> A Systematic Construction of Instability Bounds in LIS Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Dimitrios%20Koukopoulos">Dimitrios Koukopoulos</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this work, we study the impact of dynamically changing link slowdowns on the stability properties of packetswitched networks under the Adversarial Queueing Theory framework. Especially, we consider the Adversarial, Quasi-Static Slowdown Queueing Theory model, where each link slowdown may take on values in the two-valued set of integers {1, D} with D > 1 which remain fixed for a long time, under a (w, <em>p</em>)-adversary. In this framework, we present an innovative systematic construction for the estimation of adversarial injection rate lower bounds, which, if exceeded, cause instability in networks that use the LIS (Longest-in- System) protocol for contention-resolution. In addition, we show that a network that uses the LIS protocol for contention-resolution may result in dropping its instability bound at injection rates <em>p</em> > 0 when the network size and the high slowdown D take large values. This is the best ever known instability lower bound for LIS networks.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Parallel%20computing" title="Parallel computing">Parallel computing</a>, <a href="https://publications.waset.org/search?q=network%20stability" title=" network stability"> network stability</a>, <a href="https://publications.waset.org/search?q=adversarial%20queuing%20theory" title=" adversarial queuing theory"> adversarial queuing theory</a>, <a href="https://publications.waset.org/search?q=greedy%20scheduling%20protocols." title=" greedy scheduling protocols."> greedy scheduling protocols.</a> </p> <a href="https://publications.waset.org/3541/a-systematic-construction-of-instability-bounds-in-lis-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3541/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3541/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3541/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3541/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3541/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3541/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3541/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3541/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3541/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3541/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3541.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">1417</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1683</span> Concept of a Pseudo-Lower Bound Solution for Reinforced Concrete Slabs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20De%E2%80%AFFilippo">M. De Filippo</a>, <a href="https://publications.waset.org/search?q=J.%20S.%20Kuang"> J. S. Kuang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In construction industry, reinforced concrete (RC) slabs represent fundamental elements of buildings and bridges. Different methods are available for analysing the structural behaviour of slabs. In the early ages of last century, the yield-line method has been proposed to attempt to solve such problem. Simple geometry problems could easily be solved by using traditional hand analyses which include plasticity theories. Nowadays, advanced finite element (FE) analyses have mainly found their way into applications of many engineering fields due to the wide range of geometries to which they can be applied. In such cases, the application of an elastic or a plastic constitutive model would completely change the approach of the analysis itself. Elastic methods are popular due to their easy applicability to automated computations. However, elastic analyses are limited since they do not consider any aspect of the material behaviour beyond its yield limit, which turns to be an essential aspect of RC structural performance. Furthermore, their applicability to non-linear analysis for modeling plastic behaviour gives very reliable results. Per contra, this type of analysis is computationally quite expensive, i.e. not well suited for solving daily engineering problems. In the past years, many researchers have worked on filling this gap between easy-to-implement elastic methods and computationally complex plastic analyses. This paper aims at proposing a numerical procedure, through which a pseudo-lower bound solution, not violating the yield criterion, is achieved. The advantages of moment distribution are taken into account, hence the increase in strength provided by plastic behaviour is considered. The lower bound solution is improved by detecting over-yielded moments, which are used to artificially rule the moment distribution among the rest of the non-yielded elements. The proposed technique obeys Nielsen’s yield criterion. The outcome of this analysis provides a simple, yet accurate, and non-time-consuming tool of predicting the lower-bound solution of the collapse load of RC slabs. By using this method, structural engineers can find the fracture patterns and ultimate load bearing capacity. The collapse triggering mechanism is found by detecting yield-lines. An application to the simple case of a square clamped slab is shown, and a good match was found with the exact values of collapse load. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Computational%20mechanics" title="Computational mechanics">Computational mechanics</a>, <a href="https://publications.waset.org/search?q=lower%20bound%20method" title=" lower bound method"> lower bound method</a>, <a href="https://publications.waset.org/search?q=reinforced%20concrete%20slabs" title=" reinforced concrete slabs"> reinforced concrete slabs</a>, <a href="https://publications.waset.org/search?q=yield-line." title=" yield-line."> yield-line.</a> </p> <a href="https://publications.waset.org/10008919/concept-of-a-pseudo-lower-bound-solution-for-reinforced-concrete-slabs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10008919/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10008919/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10008919/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10008919/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10008919/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10008919/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10008919/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10008919/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10008919/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10008919/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10008919.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">1099</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1682</span> An Approximation Method for Three Quark Systems in the Hyper-Spherical Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=B.%20Rezaei">B. Rezaei</a>, <a href="https://publications.waset.org/search?q=G.%20R.%20Boroun"> G. R. Boroun</a>, <a href="https://publications.waset.org/search?q=M.%20Abdolmaleki"> M. Abdolmaleki</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The bound state energy of three quark systems is studied in the framework of a non- relativistic spin independent phenomenological model. The hyper- spherical coordinates are considered for the solution this system. According to Jacobi coordinate, we determined the bound state energy for (uud) and (ddu) quark systems, as quarks are flavorless mass, and it is restrict that choice potential at low and high range in nucleon bag for a bound state.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Adiabatic%20expansion" title="Adiabatic expansion">Adiabatic expansion</a>, <a href="https://publications.waset.org/search?q=grand%20angular%20momentum" title=" grand angular momentum"> grand angular momentum</a>, <a href="https://publications.waset.org/search?q=binding%20energy" title=" binding energy"> binding energy</a>, <a href="https://publications.waset.org/search?q=perturbation" title=" perturbation"> perturbation</a>, <a href="https://publications.waset.org/search?q=baryons." title=" baryons. "> baryons. </a> </p> <a href="https://publications.waset.org/17420/an-approximation-method-for-three-quark-systems-in-the-hyper-spherical-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/17420/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/17420/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/17420/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/17420/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/17420/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/17420/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/17420/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/17420/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/17420/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/17420/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/17420.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">1436</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1681</span> Bounds on Reliability of Parallel Computer Interconnection Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ranjan%20Kumar%20Dash">Ranjan Kumar Dash</a>, <a href="https://publications.waset.org/search?q=Chita%20Ranjan%20Tripathy"> Chita Ranjan Tripathy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The evaluation of residual reliability of large sized parallel computer interconnection systems is not practicable with the existing methods. Under such conditions, one must go for approximation techniques which provide the upper bound and lower bound on this reliability. In this context, a new approximation method for providing bounds on residual reliability is proposed here. The proposed method is well supported by two algorithms for simulation purpose. The bounds on residual reliability of three different categories of interconnection topologies are efficiently found by using the proposed method <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Parallel%20computer%20network" title="Parallel computer network">Parallel computer network</a>, <a href="https://publications.waset.org/search?q=reliability" title=" reliability"> reliability</a>, <a href="https://publications.waset.org/search?q=probabilisticgraph" title=" probabilisticgraph"> probabilisticgraph</a>, <a href="https://publications.waset.org/search?q=interconnection%20networks." title=" interconnection networks."> interconnection networks.</a> </p> <a href="https://publications.waset.org/4865/bounds-on-reliability-of-parallel-computer-interconnection-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4865/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4865/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4865/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4865/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4865/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4865/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4865/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4865/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4865/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4865/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4865.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">1346</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1680</span> Upper Bound of the Generalize p-Value for the Behrens-Fisher Problem with a Known Ratio of Variances</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Rada%20Somkhuean">Rada Somkhuean</a>, <a href="https://publications.waset.org/search?q=Suparat%20Niwitpong"> Suparat Niwitpong</a>, <a href="https://publications.waset.org/search?q=Sa-aat%20Niwitpong"> Sa-aat Niwitpong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper presents the generalized p-values for testing the Behrens-Fisher problem when a ratio of variance is known. We also derive a closed form expression of the upper bound of the proposed generalized p-value.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Generalized%20p-value" title="Generalized p-value">Generalized p-value</a>, <a href="https://publications.waset.org/search?q=hypothesis%20testing" title=" hypothesis testing"> hypothesis testing</a>, <a href="https://publications.waset.org/search?q=ratio%20of%20variances" title=" ratio of variances"> ratio of variances</a>, <a href="https://publications.waset.org/search?q=upper%20bound." title=" upper bound."> upper bound.</a> </p> <a href="https://publications.waset.org/16727/upper-bound-of-the-generalize-p-value-for-the-behrens-fisher-problem-with-a-known-ratio-of-variances" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/16727/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/16727/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/16727/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/16727/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/16727/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/16727/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/16727/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/16727/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/16727/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/16727/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/16727.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">1235</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1679</span> Applying Branch-and-Bound and Petri Net Methods in Solving the Two-Sided Assembly Line Balancing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nai-Chieh%20Wei">Nai-Chieh Wei</a>, <a href="https://publications.waset.org/search?q=I-Ming%20Chao"> I-Ming Chao</a>, <a href="https://publications.waset.org/search?q=Chin-Jung%20Liuand"> Chin-Jung Liuand</a>, <a href="https://publications.waset.org/search?q=Hong%20Long%20Chen"> Hong Long Chen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper combines the branch-and-bound method and the petri net to solve the two-sided assembly line balancing problem, thus facilitating effective branching and pruning of tasks. By integrating features of the petri net, such as reachability graph and incidence matrix, the propose method can support the branch-and-bound to effectively reduce poor branches with systematic graphs. Test results suggest that using petri net in the branching process can effectively guide the system trigger process, and thus, lead to consistent results.</p> <p> </p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Branch-and-Bound%20Method" title="Branch-and-Bound Method">Branch-and-Bound Method</a>, <a href="https://publications.waset.org/search?q=Petri%20Net" title=" Petri Net"> Petri Net</a>, <a href="https://publications.waset.org/search?q=Two-Sided%20Assembly%20Line%20Balancing%20Problem." title=" Two-Sided Assembly Line Balancing Problem."> Two-Sided Assembly Line Balancing Problem.</a> </p> <a href="https://publications.waset.org/9997429/applying-branch-and-bound-and-petri-net-methods-in-solving-the-two-sided-assembly-line-balancing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997429/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997429/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997429/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997429/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997429/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997429/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997429/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997429/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997429/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997429/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997429.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">1920</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1678</span> Volatility of Cu, Ni, Cr, Co, Pb, and As in Fluidised-Bed Combustion Chamber in Relation to Their Modes of Occurrence in Coal</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=L.%20Barto%C5%88ov%C3%A1">L. Bartoňová</a>, <a href="https://publications.waset.org/search?q=Z.%20Klika"> Z. Klika</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Modes of occurrence of Pb, As, Cr, Co, Cu, and Ni in bituminous coal and lignite were determined by means of sequential extraction using NH4OAc, HCl, HF and HNO3 extraction solutions. Elemental affinities obtained were then evaluated in relation to volatility of these elements during the combustion of these coals in two circulating fluidised-bed power stations. It was found out that higher percentage of the elements bound in silicates brought about lower volatility, while higher elemental proportion with monosulphides association (or bound as exchangeable ion) resulted in higher volatility. The only exception was the behavior of arsenic, whose volatility depended on amount of limestone added during the combustion process (as desulphurisation additive) rather than to its association in coal.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Coal%20combustion" title="Coal combustion">Coal combustion</a>, <a href="https://publications.waset.org/search?q=sequential%20extraction" title=" sequential extraction"> sequential extraction</a>, <a href="https://publications.waset.org/search?q=trace%20elements" title=" trace elements"> trace elements</a>, <a href="https://publications.waset.org/search?q=volatility." title=" volatility."> volatility.</a> </p> <a href="https://publications.waset.org/11168/volatility-of-cu-ni-cr-co-pb-and-as-in-fluidised-bed-combustion-chamber-in-relation-to-their-modes-of-occurrence-in-coal" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11168/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11168/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11168/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11168/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11168/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11168/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11168/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11168/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11168/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11168/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11168.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">1796</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1677</span> Bound State Solutions of the Schrödinger Equation for Hulthen-Yukawa Potential in D-Dimensions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=I.%20Otete">I. Otete</a>, <a href="https://publications.waset.org/search?q=A.%20I.%20Ejere"> A. I. Ejere</a>, <a href="https://publications.waset.org/search?q=I.%20S.%20Okunzuwa"> I. S. Okunzuwa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this work, we used the Hulthen-Yukawa potential to obtain the bound state energy eigenvalues of the Schrödinger equation in D-dimensions within the frame work of the Nikiforov-Uvarov (NU) method. We demonstrated the graphical behaviour of the Hulthen and the Yukawa potential and investigated how the screening parameter and the potential depth affected the structure and the nature of the bound state eigenvalues. The results we obtained showed that increasing the screening parameter lowers the energy eigenvalues. Also, the eigenvalues acted as an inverse function of the potential depth. That is, increasing the potential depth reduces the energy eigenvalues.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Schr%C3%B6dinger%27s%20equation" title="Schrödinger's equation">Schrödinger's equation</a>, <a href="https://publications.waset.org/search?q=bound%20state" title=" bound state"> bound state</a>, <a href="https://publications.waset.org/search?q=Hulthen-Yukawa%20potential" title=" Hulthen-Yukawa potential"> Hulthen-Yukawa potential</a>, <a href="https://publications.waset.org/search?q=Nikiforov-Uvarov" title=" Nikiforov-Uvarov"> Nikiforov-Uvarov</a>, <a href="https://publications.waset.org/search?q=D-dimensions" title=" D-dimensions"> D-dimensions</a> </p> <a href="https://publications.waset.org/10012347/bound-state-solutions-of-the-schrodinger-equation-for-hulthen-yukawa-potential-in-d-dimensions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10012347/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10012347/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10012347/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10012347/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10012347/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10012347/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10012347/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10012347/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10012347/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10012347/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10012347.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">456</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1676</span> All-Pairs Shortest-Paths Problem for Unweighted Graphs in O(n2 log n) Time</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Udaya%20Kumar%20Reddy%20K.%20R">Udaya Kumar Reddy K. R</a>, <a href="https://publications.waset.org/search?q=K.%20Viswanathan%20Iyer"> K. Viswanathan Iyer</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Given a simple connected unweighted undirected graph G = (V (G), E(G)) with |V (G)| = n and |E(G)| = m, we present a new algorithm for the all-pairs shortest-path (APSP) problem. The running time of our algorithm is in O(n2 log n). This bound is an improvement over previous best known O(n2.376) time bound of Raimund Seidel (1995) for general graphs. The algorithm presented does not rely on fast matrix multiplication. Our algorithm with slight modifications, enables us to compute the APSP problem for unweighted directed graph in time O(n2 log n), improving a previous best known O(n2.575) time bound of Uri Zwick (2002).</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Distance%20in%20graphs" title="Distance in graphs">Distance in graphs</a>, <a href="https://publications.waset.org/search?q=Dynamic%20programming" title=" Dynamic programming"> Dynamic programming</a>, <a href="https://publications.waset.org/search?q=Graphalgorithms" title=" Graphalgorithms"> Graphalgorithms</a>, <a href="https://publications.waset.org/search?q=Shortest%20paths." title=" Shortest paths."> Shortest paths.</a> </p> <a href="https://publications.waset.org/8870/all-pairs-shortest-paths-problem-for-unweighted-graphs-in-on2-log-n-time" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8870/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8870/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8870/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8870/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8870/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8870/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8870/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8870/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8870/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8870/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8870.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">3696</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1675</span> Graphs with Metric Dimension Two-A Characterization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sudhakara%20G">Sudhakara G</a>, <a href="https://publications.waset.org/search?q=Hemanth%20Kumar%20A.R"> Hemanth Kumar A.R</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we define distance partition of vertex set of a graph G with reference to a vertex in it and with the help of the same, a graph with metric dimension two (i.e. β (G) = 2 ) is characterized. In the process, we develop a polynomial time algorithm that verifies if the metric dimension of a given graph G is two. The same algorithm explores all metric bases of graph G whenever β (G) = 2 . We also find a bound for cardinality of any distance partite set with reference to a given vertex, when ever β (G) = 2 . Also, in a graph G with β (G) = 2 , a bound for cardinality of any distance partite set as well as a bound for number of vertices in any sub graph H of G is obtained in terms of diam H .</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Metric%20basis" title="Metric basis">Metric basis</a>, <a href="https://publications.waset.org/search?q=Distance%20partition" title=" Distance partition"> Distance partition</a>, <a href="https://publications.waset.org/search?q=Metric%20dimension." title=" Metric dimension."> Metric dimension.</a> </p> <a href="https://publications.waset.org/13897/graphs-with-metric-dimension-two-a-characterization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13897/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13897/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13897/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13897/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13897/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13897/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13897/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13897/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13897/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13897/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13897.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">1870</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1674</span> Discovering Liouville-Type Problems for p-Energy Minimizing Maps in Closed Half-Ellipsoids by Calculus Variation Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Lina%20Wu">Lina Wu</a>, <a href="https://publications.waset.org/search?q=Jia%20Liu"> Jia Liu</a>, <a href="https://publications.waset.org/search?q=Ye%20Li"> Ye Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The goal of this project is to investigate constant properties (called the Liouville-type Problem) for a p-stable map as a local or global minimum of a p-energy functional where the domain is a Euclidean space and the target space is a closed half-ellipsoid. The First and Second Variation Formulas for a p-energy functional has been applied in the Calculus Variation Method as computation techniques. Stokes’ Theorem, Cauchy-Schwarz Inequality, Hardy-Sobolev type Inequalities, and the Bochner Formula as estimation techniques have been used to estimate the lower bound and the upper bound of the derived p-Harmonic Stability Inequality. One challenging point in this project is to construct a family of variation maps such that the images of variation maps must be guaranteed in a closed half-ellipsoid. The other challenging point is to find a contradiction between the lower bound and the upper bound in an analysis of p-Harmonic Stability Inequality when a p-energy minimizing map is not constant. Therefore, the possibility of a non-constant p-energy minimizing map has been ruled out and the constant property for a p-energy minimizing map has been obtained. Our research finding is to explore the constant property for a p-stable map from a Euclidean space into a closed half-ellipsoid in a certain range of p. The certain range of p is determined by the dimension values of a Euclidean space (the domain) and an ellipsoid (the target space). The certain range of p is also bounded by the curvature values on an ellipsoid (that is, the ratio of the longest axis to the shortest axis). Regarding Liouville-type results for a p-stable map, our research finding on an ellipsoid is a generalization of mathematicians’ results on a sphere. Our result is also an extension of mathematicians’ Liouville-type results from a special ellipsoid with only one parameter to any ellipsoid with (n+1) parameters in the general setting. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Bochner%20Formula" title="Bochner Formula">Bochner Formula</a>, <a href="https://publications.waset.org/search?q=Stokes%E2%80%99%20Theorem" title=" Stokes’ Theorem"> Stokes’ Theorem</a>, <a href="https://publications.waset.org/search?q=Cauchy-Schwarz%0D%0AInequality" title=" Cauchy-Schwarz Inequality"> Cauchy-Schwarz Inequality</a>, <a href="https://publications.waset.org/search?q=first%20and%20second%20variation%20formulas" title=" first and second variation formulas"> first and second variation formulas</a>, <a href="https://publications.waset.org/search?q=Hardy-Sobolev%20type%0D%0Ainequalities" title=" Hardy-Sobolev type inequalities"> Hardy-Sobolev type inequalities</a>, <a href="https://publications.waset.org/search?q=Liouville-type%20problem" title=" Liouville-type problem"> Liouville-type problem</a>, <a href="https://publications.waset.org/search?q=p-harmonic%20map." title=" p-harmonic map."> p-harmonic map.</a> </p> <a href="https://publications.waset.org/10006222/discovering-liouville-type-problems-for-p-energy-minimizing-maps-in-closed-half-ellipsoids-by-calculus-variation-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10006222/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10006222/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10006222/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10006222/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10006222/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10006222/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10006222/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10006222/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10006222/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10006222/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10006222.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">915</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1673</span> The Relative Efficiency of Parameter Estimation in Linear Weighted Regression</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Baoguang%20Tian">Baoguang Tian</a>, <a href="https://publications.waset.org/search?q=Nan%20Chen"> Nan Chen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>A new relative efficiency in linear model in reference is instructed into the linear weighted regression, and its upper and lower bound are proposed. In the linear weighted regression model, for the best linear unbiased estimation of mean matrix respect to the least-squares estimation, two new relative efficiencies are given, and their upper and lower bounds are also studied.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Linear%20weighted%20regression" title="Linear weighted regression">Linear weighted regression</a>, <a href="https://publications.waset.org/search?q=Relative%20efficiency" title=" Relative efficiency"> Relative efficiency</a>, <a href="https://publications.waset.org/search?q=Mean%20matrix" title=" Mean matrix"> Mean matrix</a>, <a href="https://publications.waset.org/search?q=Trace." title=" Trace."> Trace.</a> </p> <a href="https://publications.waset.org/9999966/the-relative-efficiency-of-parameter-estimation-in-linear-weighted-regression" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9999966/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9999966/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9999966/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9999966/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9999966/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9999966/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9999966/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9999966/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9999966/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9999966/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9999966.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">2478</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1672</span> Pt(IV) Complexes with Polystrene-bound Schiff Bases as Antimicrobial Agent: Synthesis and Characterization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Dilek%20Nartop">Dilek Nartop</a>, <a href="https://publications.waset.org/search?q=Nur%C5%9Fen%20Sar%C4%B1"> Nurşen Sarı</a>, <a href="https://publications.waset.org/search?q=Hatice%20%C3%96%C4%9F%C3%BCt%C3%A7%C3%BC"> Hatice Öğütçü</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Novel polystrene-bound Schiff bases and their Pt(IV) complexes have been prepared from condensation reaction of polystyrene-A-NH2 with 2-hydroxybenzaldehyde and 5-fluoro-3- bromo-2-hydroxybenzaldehyde. The structures of Pt(IV) complexes with polystyrene including Schiff bases have been determined by elemental analyses, magnetic susceptibility, IR, 1H-NMR, UV-vis, TG/DTA and AAS. The antibacterial and antifungal activities of the synthesized compounds have been studied by the well-diffusion method against some selected microorganisms: (Bacillus cereus spp., Listeria monocytogenes 4b, Micrococcus luteus, Staphylococcus aureus, Staphylococcus epidermis, Brucella abortus, Escherichia coli, Pseudomonas putida spp., Shigella dysenteria type 10, Salmonella typhi H). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Polymer-bound%20Schiff%20bases" title="Polymer-bound Schiff bases">Polymer-bound Schiff bases</a>, <a href="https://publications.waset.org/search?q=polystyrene-A-NH2" title=" polystyrene-A-NH2"> polystyrene-A-NH2</a>, <a href="https://publications.waset.org/search?q=Pt%28IV%29%20complexes" title=" Pt(IV) complexes"> Pt(IV) complexes</a>, <a href="https://publications.waset.org/search?q=biological%20activity." title=" biological activity."> biological activity.</a> </p> <a href="https://publications.waset.org/14207/ptiv-complexes-with-polystrene-bound-schiff-bases-as-antimicrobial-agent-synthesis-and-characterization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14207/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14207/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14207/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14207/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14207/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14207/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14207/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14207/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14207/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14207/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14207.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">1985</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1671</span> A Comparison of SVM-based Criteria in Evolutionary Method for Gene Selection and Classification of Microarray Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Rameswar%20Debnath">Rameswar Debnath</a>, <a href="https://publications.waset.org/search?q=Haruhisa%20Takahashi"> Haruhisa Takahashi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An evolutionary method whose selection and recombination operations are based on generalization error-bounds of support vector machine (SVM) can select a subset of potentially informative genes for SVM classifier very efficiently [7]. In this paper, we will use the derivative of error-bound (first-order criteria) to select and recombine gene features in the evolutionary process, and compare the performance of the derivative of error-bound with the error-bound itself (zero-order) in the evolutionary process. We also investigate several error-bounds and their derivatives to compare the performance, and find the best criteria for gene selection and classification. We use 7 cancer-related human gene expression datasets to evaluate the performance of the zero-order and first-order criteria of error-bounds. Though both criteria have the same strategy in theoretically, experimental results demonstrate the best criterion for microarray gene expression data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=support%20vector%20machine" title="support vector machine">support vector machine</a>, <a href="https://publications.waset.org/search?q=generalization%20error-bound" title=" generalization error-bound"> generalization error-bound</a>, <a href="https://publications.waset.org/search?q=feature%20selection" title="feature selection">feature selection</a>, <a href="https://publications.waset.org/search?q=evolutionary%20algorithm" title=" evolutionary algorithm"> evolutionary algorithm</a>, <a href="https://publications.waset.org/search?q=microarray%20data" title=" microarray data"> microarray data</a> </p> <a href="https://publications.waset.org/10270/a-comparison-of-svm-based-criteria-in-evolutionary-method-for-gene-selection-and-classification-of-microarray-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10270/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10270/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10270/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10270/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10270/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10270/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10270/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10270/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10270/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10270/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10270.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">1539</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1670</span> Asymptotic Stability of Input-saturated System with Linear-growth-bound Disturbances via Variable Structure Control: An LMI Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yun%20Jong%20Choi">Yun Jong Choi</a>, <a href="https://publications.waset.org/search?q=Nam%20Woong"> Nam Woong</a>, <a href="https://publications.waset.org/search?q=PooGyeon%20Park"> PooGyeon Park</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Variable Structure Control (VSC) is one of the most useful tools handling the practical system with uncertainties and disturbances. Up to now, unfortunately, not enough studies on the input-saturated system with linear-growth-bound disturbances via VSC have been presented. Therefore, this paper proposes an asymp¬totic stability condition for the system via VSC. The designed VSC controller consists of two control parts. The linear control part plays a role in stabilizing the system, and simultaneously, the nonlinear control part in rejecting the linear-growth-bound disturbances perfectly. All conditions derived in this paper are expressed with Linear Matrices Inequalities (LMIs), which can be easily solved with an LMI toolbox in MATLAB.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Input%20saturation" title="Input saturation">Input saturation</a>, <a href="https://publications.waset.org/search?q=linear-growth%20bounded%20disturbances" title=" linear-growth bounded disturbances"> linear-growth bounded disturbances</a>, <a href="https://publications.waset.org/search?q=linear%20matrix%20inequality%20%28LMI%29" title=" linear matrix inequality (LMI)"> linear matrix inequality (LMI)</a>, <a href="https://publications.waset.org/search?q=variable%20structure%20control" title=" variable structure control"> variable structure control</a> </p> <a href="https://publications.waset.org/11209/asymptotic-stability-of-input-saturated-system-with-linear-growth-bound-disturbances-via-variable-structure-control-an-lmi-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11209/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11209/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11209/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11209/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11209/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11209/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11209/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11209/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11209/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11209/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11209.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">1640</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1669</span> Usage-based Traffic Control for P2P Content Delivery</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Megumi%20Shibuya">Megumi Shibuya</a>, <a href="https://publications.waset.org/search?q=Tomohiko%20Ogishi"> Tomohiko Ogishi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, content delivery services have grown rapidly over the Internet. For ASPs (Application Service Provider) providing content delivery services, P2P architecture is beneficial to reduce outgoing traffic from content servers. On the other hand, ISPs are suffering from the increase in P2P traffic. The P2P traffic is unnecessarily redundant because the same content or the same fractions of content are transferred through an inter-ISP link several times. Subscriber ISPs have to pay a transit fee to upstream ISPs based on the volume of inter-ISP traffic. In order to solve such problems, several works have been done for the purpose of P2P traffic reduction. However, these existing works cannot control the traffic volume of a certain link. In order to solve such an ISP-s operational requirement, we propose a method to control traffic volume for a link within a preconfigured upper bound value. We evaluated that the proposed method works well by conducting a simulation on a 1,000-user scale. We confirm that the traffic volume could be controlled at a lower level than the upper bound for all evaluated conditions. Moreover, our method could control the traffic volume at 98.95% link usage against the target value. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=P2P" title="P2P">P2P</a>, <a href="https://publications.waset.org/search?q=traffic%20control" title=" traffic control"> traffic control</a>, <a href="https://publications.waset.org/search?q=traffic%20localization" title=" traffic localization"> traffic localization</a>, <a href="https://publications.waset.org/search?q=ALTO." title=" ALTO."> ALTO.</a> </p> <a href="https://publications.waset.org/1121/usage-based-traffic-control-for-p2p-content-delivery" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1121/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1121/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1121/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1121/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1121/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1121/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1121/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1121/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1121/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1121/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1121.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">1566</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1668</span> Behrens-Fisher Problem with One Variance Unknown</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sa-aat%20Niwitpong">Sa-aat Niwitpong</a>, <a href="https://publications.waset.org/search?q=Rada%20Somkhuean"> Rada Somkhuean</a>, <a href="https://publications.waset.org/search?q=Suparat%20Niwitpong"> Suparat Niwitpong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper presents the generalized p-values for testing the Behrens-Fisher problem when one variance is unknown. We also derive a closed form expression of the upper bound of the proposed generalized p-value.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Generalized%20p-value" title="Generalized p-value">Generalized p-value</a>, <a href="https://publications.waset.org/search?q=hypothesis%20testing" title=" hypothesis testing"> hypothesis testing</a>, <a href="https://publications.waset.org/search?q=upper%20bound." title=" upper bound."> upper bound.</a> </p> <a href="https://publications.waset.org/16728/behrens-fisher-problem-with-one-variance-unknown" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/16728/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/16728/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/16728/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/16728/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/16728/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/16728/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/16728/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/16728/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/16728/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/16728/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/16728.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">1459</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1667</span> Two New Relative Efficiencies of Linear Weighted Regression</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Shuimiao%20Wan">Shuimiao Wan</a>, <a href="https://publications.waset.org/search?q=Chao%20Yuan"> Chao Yuan</a>, <a href="https://publications.waset.org/search?q=Baoguang%20Tian"> Baoguang Tian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In statistics parameter theory, usually the parameter estimations have two kinds, one is the least-square estimation (LSE), and the other is the best linear unbiased estimation (BLUE). Due to the determining theorem of minimum variance unbiased estimator (MVUE), the parameter estimation of BLUE in linear model is most ideal. But since the calculations are complicated or the covariance is not given, people are hardly to get the solution. Therefore, people prefer to use LSE rather than BLUE. And this substitution will take some losses. To quantize the losses, many scholars have presented many kinds of different relative efficiencies in different views. For the linear weighted regression model, this paper discusses the relative efficiencies of LSE of β to BLUE of β. It also defines two new relative efficiencies and gives their lower bounds. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Linear%20weighted%20regression" title="Linear weighted regression">Linear weighted regression</a>, <a href="https://publications.waset.org/search?q=Relative%20efficiency" title=" Relative efficiency"> Relative efficiency</a>, <a href="https://publications.waset.org/search?q=Lower%20bound" title=" Lower bound"> Lower bound</a>, <a href="https://publications.waset.org/search?q=Parameter%20estimation." title=" Parameter estimation."> Parameter estimation.</a> </p> <a href="https://publications.waset.org/10001598/two-new-relative-efficiencies-of-linear-weighted-regression" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10001598/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10001598/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10001598/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10001598/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10001598/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10001598/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10001598/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10001598/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10001598/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10001598/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10001598.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">2122</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1666</span> Identification of LTI Autonomous All Pole System Using Eigenvector Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sudipta%20Majumdar">Sudipta Majumdar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a method for identification of a linear time invariant (LTI) autonomous all pole system using singular value decomposition. The novelty of this paper is two fold: First, MUSIC algorithm for estimating complex frequencies from real measurements is proposed. Secondly, using the proposed algorithm, we can identify the coefficients of differential equation that determines the LTI system by switching off our input signal. For this purpose, we need only to switch off the input, apply our complex MUSIC algorithm and determine the coefficients as symmetric polynomials in the complex frequencies. This method can be applied to unstable system and has higher resolution as compared to time series solution when, noisy data are used. The classical performance bound, Cramer Rao bound (CRB), has been used as a basis for performance comparison of the proposed method for multiple poles estimation in noisy exponential signal. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=MUSIC%20algorithm" title="MUSIC algorithm">MUSIC algorithm</a>, <a href="https://publications.waset.org/search?q=Cramer%20Rao%20bound" title=" Cramer Rao bound"> Cramer Rao bound</a>, <a href="https://publications.waset.org/search?q=frequency%20estimation." title=" frequency estimation."> frequency estimation.</a> </p> <a href="https://publications.waset.org/10008406/identification-of-lti-autonomous-all-pole-system-using-eigenvector-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10008406/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10008406/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10008406/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10008406/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10008406/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10008406/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10008406/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10008406/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10008406/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10008406/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10008406.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">936</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=lower%20bound.&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=lower%20bound.&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=lower%20bound.&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=lower%20bound.&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=lower%20bound.&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=lower%20bound.&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=lower%20bound.&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=lower%20bound.&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=lower%20bound.&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=lower%20bound.&page=56">56</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=lower%20bound.&page=57">57</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=lower%20bound.&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>