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: upper bound.</title> <meta name="description" content="Search results for: upper bound."> <meta name="keywords" content="upper 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="upper 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="upper 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> 480</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: upper bound.</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">480</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">1233</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">479</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">1457</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">478</span> Parameter Selections of Fuzzy C-Means Based on Robust Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kuo-Lung%20Wu">Kuo-Lung Wu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The weighting exponent m is called the fuzzifier that can have influence on the clustering performance of fuzzy c-means (FCM) and m├Ä[1.5,2.5] is suggested by Pal and Bezdek [13]. In this paper, we will discuss the robust properties of FCM and show that the parameter m will have influence on the robustness of FCM. According to our analysis, we find that a large m value will make FCM more robust to noise and outliers. However, if m is larger than the theoretical upper bound proposed by Yu et al. [14], the sample mean will become the unique optimizer. Here, we suggest to implement the FCM algorithm with m├Ä[1.5,4] under the restriction when m is smaller than the theoretical upper bound. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Fuzzy%20c-means" title="Fuzzy c-means">Fuzzy c-means</a>, <a href="https://publications.waset.org/search?q=robust" title=" robust"> robust</a>, <a href="https://publications.waset.org/search?q=fuzzifier." title=" fuzzifier."> fuzzifier.</a> </p> <a href="https://publications.waset.org/13160/parameter-selections-of-fuzzy-c-means-based-on-robust-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13160/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13160/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13160/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13160/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13160/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13160/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13160/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13160/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13160/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13160/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13160.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">1661</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">477</span> Plastic Flow through Taper Dies: A Threedimensional Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Laxmi%20Narayan%20Patra">Laxmi Narayan Patra</a>, <a href="https://publications.waset.org/search?q=Susanta%20Kumar%20Sahoo"> Susanta Kumar Sahoo</a>, <a href="https://publications.waset.org/search?q=Mithun%20KumarMurmu"> Mithun KumarMurmu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The plastic flow of metal in the extrusion process is an important factor in controlling the mechanical properties of the extruded products. It is, however, difficult to predict the metal flow in three dimensional extrusions of sections due to the involvement of re-entrant corners. The present study is to find an upper bound solution for the extrusion of triangular sectioned through taper dies from round sectioned billet. A discontinuous kinematically admissible velocity field (KAVF) is proposed. From the proposed KAVF, the upper bound solution on non-dimensional extrusion pressure is determined with respect to the chosen process parameters. The theoretical results are compared with experimental results to check the validity of the proposed velocity field. An extrusion setup is designed and fabricated for the said purpose, and all extrusions are carried out using circular billets. Experiments are carried out with commercially available lead at room temperature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Extrusion" title="Extrusion">Extrusion</a>, <a href="https://publications.waset.org/search?q=Kinematically%20admissibly%20velocity%20fieldSpatial%20Elementary%20Rigid%20Region%20%28SERR%29" title=" Kinematically admissibly velocity fieldSpatial Elementary Rigid Region (SERR)"> Kinematically admissibly velocity fieldSpatial Elementary Rigid Region (SERR)</a>, <a href="https://publications.waset.org/search?q=Upper%20Bound%20Analysis" title=" Upper Bound Analysis"> Upper Bound Analysis</a> </p> <a href="https://publications.waset.org/9829/plastic-flow-through-taper-dies-a-threedimensional-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9829/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9829/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9829/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9829/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9829/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9829/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9829/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9829/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9829/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9829/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9829.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1744</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">476</span> Continuous Adaptive Robust Control for Nonlinear Uncertain Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Dong%20Sang%20Yoo">Dong Sang Yoo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>We consider nonlinear uncertain systems such that a  priori information of the uncertainties is not available. For such  systems, we assume that the upper bound of the uncertainties is  represented as a Fredholm integral equation of the first kind and we  propose an adaptation law that is capable of estimating the upper  bound and design a continuous robust control which renders nonlinear  uncertain systems ultimately bounded.</p> <p> </p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Adaptive%20Control" title="Adaptive Control">Adaptive Control</a>, <a href="https://publications.waset.org/search?q=Estimation" title=" Estimation"> Estimation</a>, <a href="https://publications.waset.org/search?q=Fredholm%20Integral" title=" Fredholm Integral"> Fredholm Integral</a>, <a href="https://publications.waset.org/search?q=Uncertain%20System." title=" Uncertain System. "> Uncertain System. </a> </p> <a href="https://publications.waset.org/9997013/continuous-adaptive-robust-control-for-nonlinear-uncertain-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997013/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997013/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997013/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997013/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997013/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997013/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997013/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997013/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997013/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997013/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997013.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">1652</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">475</span> Some New Upper Bounds for the Spectral Radius of Iterative Matrices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Guangbin%20Wang">Guangbin Wang</a>, <a href="https://publications.waset.org/search?q=Xue%20Li"> Xue Li</a>, <a href="https://publications.waset.org/search?q=Fuping%20Tan"> Fuping Tan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present some new upper bounds for the spectral radius of iterative matrices based on the concept of doubly α diagonally dominant matrix. And subsequently, we give two examples to show that our results are better than the earlier ones. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=doubly%20%CE%B1%20diagonally%20dominant%20matrix" title="doubly α diagonally dominant matrix">doubly α diagonally dominant matrix</a>, <a href="https://publications.waset.org/search?q=eigenvalue" title=" eigenvalue"> eigenvalue</a>, <a href="https://publications.waset.org/search?q=iterative%20matrix" title="iterative matrix">iterative 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=upper%20bound." title=" upper bound."> upper bound.</a> </p> <a href="https://publications.waset.org/15739/some-new-upper-bounds-for-the-spectral-radius-of-iterative-matrices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15739/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15739/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15739/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15739/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15739/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15739/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15739/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15739/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15739/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15739/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15739.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">1339</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">474</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">1595</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">473</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">1894</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">472</span> The Study of Relative Efficiency in Growth Curve Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nan%20Chen">Nan Chen</a>, <a href="https://publications.waset.org/search?q=Baoguang%20Tian"> Baoguang Tian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, some relative efficiency have been discussed, including the LSE estimate with respect to BLUE in curve model. Four new kinds of relative efficiency have defined, and their upper bounds have been discussed.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Relative%20efficiency" title="Relative efficiency">Relative efficiency</a>, <a href="https://publications.waset.org/search?q=LSE%20estimate" title=" LSE estimate"> LSE estimate</a>, <a href="https://publications.waset.org/search?q=BLUE%20estimate" title=" BLUE estimate"> BLUE estimate</a>, <a href="https://publications.waset.org/search?q=Upper%20bound" title=" Upper bound"> Upper bound</a>, <a href="https://publications.waset.org/search?q=Curve%20model." title=" Curve model."> Curve model.</a> </p> <a href="https://publications.waset.org/10000672/the-study-of-relative-efficiency-in-growth-curve-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10000672/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10000672/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10000672/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10000672/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10000672/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10000672/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10000672/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10000672/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10000672/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10000672/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10000672.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">1437</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">471</span> Extreme Temperature Forecast in Mbonge, Cameroon through Return Level Analysis of the Generalized Extreme Value (GEV) Distribution</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nkongho%20Ayuketang%20Arreyndip">Nkongho Ayuketang Arreyndip</a>, <a href="https://publications.waset.org/search?q=Ebobenow%20Joseph"> Ebobenow Joseph</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, temperature extremes are forecast by employing the block maxima method of the Generalized extreme value(GEV) distribution to analyse temperature data from the Cameroon Development Corporation (C.D.C). By considering two sets of data (Raw data and simulated data) and two (stationary and non-stationary) models of the GEV distribution, return levels analysis is carried out and it was found that in the stationary model, the return values are constant over time with the raw data while in the simulated data, the return values show an increasing trend but with an upper bound. In the non-stationary model, the return levels of both the raw data and simulated data show an increasing trend but with an upper bound. This clearly shows that temperatures in the tropics even-though show a sign of increasing in the future, there is a maximum temperature at which there is no exceedence. The results of this paper are very vital in Agricultural and Environmental research. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Return%20level" title="Return level">Return level</a>, <a href="https://publications.waset.org/search?q=Generalized%20extreme%20value%20%28GEV%29" title=" Generalized extreme value (GEV)"> Generalized extreme value (GEV)</a>, <a href="https://publications.waset.org/search?q=Meteorology" title=" Meteorology"> Meteorology</a>, <a href="https://publications.waset.org/search?q=Forecasting." title=" Forecasting."> Forecasting.</a> </p> <a href="https://publications.waset.org/10002493/extreme-temperature-forecast-in-mbonge-cameroon-through-return-level-analysis-of-the-generalized-extreme-value-gev-distribution" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10002493/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10002493/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10002493/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10002493/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10002493/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10002493/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10002493/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10002493/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10002493/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10002493/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10002493.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">2106</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">470</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">1564</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">469</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">1343</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">468</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">2473</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">467</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">1502</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">466</span> New Delay-Dependent Stability Criteria for Neural Networks With Two Additive Time-varying Delay Components</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Xingyuan%20Qu">Xingyuan Qu</a>, <a href="https://publications.waset.org/search?q=Shouming%20Zhong"> Shouming Zhong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, the problem of stability criteria of neural networks (NNs) with two-additive time-varying delay compenents is investigated. The relationship between the time-varying delay and its lower and upper bounds is taken into account when estimating the upper bound of the derivative of Lyapunov functional. As a result, some improved delay stability criteria for NNs with two-additive time-varying delay components are proposed. Finally, a numerical example is given to illustrate the effectiveness of the proposed method.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Delay-dependent%20stability" title="Delay-dependent stability">Delay-dependent stability</a>, <a href="https://publications.waset.org/search?q=time-varying%20delays" title=" time-varying delays"> time-varying delays</a>, <a href="https://publications.waset.org/search?q=Lyapunov%20functional" title=" Lyapunov functional"> Lyapunov functional</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> </p> <a href="https://publications.waset.org/14831/new-delay-dependent-stability-criteria-for-neural-networks-with-two-additive-time-varying-delay-components" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14831/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14831/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14831/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14831/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14831/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14831/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14831/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14831/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14831/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14831/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14831.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">1610</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">465</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">914</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">464</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">949</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">463</span> Systematic Unit-Memory Binary Convolutional Codes from Linear Block Codes over F2r + vF2r</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=John%20Mark%20Lampos">John Mark Lampos</a>, <a href="https://publications.waset.org/search?q=Virgilio%20Sison"> Virgilio Sison</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Two constructions of unit-memory binary convolutional codes from linear block codes over the finite semi-local ring F2r +vF2r , where v2 = v, are presented. In both cases, if the linear block code is systematic, then the resulting convolutional encoder is systematic, minimal, basic and non-catastrophic. The Hamming free distance of the convolutional code is bounded below by the minimum Hamming distance of the block code. New examples of binary convolutional codes that meet the Heller upper bound for systematic codes are given. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Convolutional%20codes" title="Convolutional codes">Convolutional codes</a>, <a href="https://publications.waset.org/search?q=semi-local%20ring" title=" semi-local ring"> semi-local ring</a>, <a href="https://publications.waset.org/search?q=free%20distance" title=" free distance"> free distance</a>, <a href="https://publications.waset.org/search?q=Heller%20bound." title="Heller bound.">Heller bound.</a> </p> <a href="https://publications.waset.org/9501/systematic-unit-memory-binary-convolutional-codes-from-linear-block-codes-over-f2r-vf2r" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9501/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9501/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9501/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9501/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9501/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9501/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9501/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9501/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9501/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9501/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9501.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">1652</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">462</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">1433</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">461</span> Subclasses of Bi-Univalent Functions Associated with Hohlov Operator</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Rashidah%20Omar">Rashidah Omar</a>, <a href="https://publications.waset.org/search?q=Suzeini%20Abdul%20Halim"> Suzeini Abdul Halim</a>, <a href="https://publications.waset.org/search?q=Aini%20Janteng"> Aini Janteng</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The coefficients estimate problem for Taylor-Maclaurin series is still an open problem especially for a function in the subclass of bi-univalent functions. A function <em>f </em>ϵ<em> A </em>is said to be bi-univalent in the open unit disk <em>D</em> if both <em>f </em>and <em>f<sup>-1</sup></em> are univalent in <em>D</em>. The symbol <em>A</em> denotes the class of all analytic functions <em>f</em> in <em>D</em> and it is normalized by the conditions <em>f</em>(0) = <em>f’</em>(0) – 1=0. The class of bi-univalent is denoted by  The subordination concept is used in determining second and third Taylor-Maclaurin coefficients. The upper bound for second and third coefficients is estimated for functions in the subclasses of bi-univalent functions which are subordinated to the function φ. An analytic function <em>f</em> is subordinate to an analytic function <em>g</em> if there is an analytic function <em>w</em> defined on <em>D</em> with <em>w</em>(0) = 0 and |<em>w</em>(z)| < 1 satisfying <em>f</em>(<em>z</em>) = <em>g</em>[<em>w</em>(<em>z</em>)]. In this paper, two subclasses of bi-univalent functions associated with Hohlov operator are introduced. The bound for second and third coefficients of functions in these subclasses is determined using subordination. The findings would generalize the previous related works of several earlier authors.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Analytic%20functions" title="Analytic functions">Analytic functions</a>, <a href="https://publications.waset.org/search?q=bi-univalent%20functions" title=" bi-univalent functions"> bi-univalent functions</a>, <a href="https://publications.waset.org/search?q=Hohlov%20operator" title=" Hohlov operator"> Hohlov operator</a>, <a href="https://publications.waset.org/search?q=subordination." title=" subordination. "> subordination. </a> </p> <a href="https://publications.waset.org/10008113/subclasses-of-bi-univalent-functions-associated-with-hohlov-operator" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10008113/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10008113/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10008113/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10008113/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10008113/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10008113/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10008113/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10008113/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10008113/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10008113/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10008113.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">946</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">460</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">1917</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">459</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">1683</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">458</span> A Hyperbolic Characterization of Projective Klingenberg Planes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Basri%20%C3%87elik">Basri Çelik</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the notion of Hyperbolic Klingenberg plane is introduced via a set of axioms like as Affine Klingenberg planes and Projective Klingenberg planes. Models of such planes are constructed by deleting a certain number m of equivalence classes of lines from a Projective Klingenberg plane. In the finite case, an upper bound for m is established and some combinatoric properties are investigated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Hyperbolic%20planes" title="Hyperbolic planes">Hyperbolic planes</a>, <a href="https://publications.waset.org/search?q=Klingenberg%20planes" title=" Klingenberg planes"> Klingenberg planes</a>, <a href="https://publications.waset.org/search?q=Projective%0Aplanes." title=" Projective planes."> Projective planes.</a> </p> <a href="https://publications.waset.org/3890/a-hyperbolic-characterization-of-projective-klingenberg-planes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3890/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3890/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3890/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3890/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3890/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3890/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3890/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3890/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3890/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3890/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3890.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">1329</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">457</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">451</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">456</span> Application of Particle Image Velocimetry in the Analysis of Scale Effects in Granular Soil</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Zuhair%20Kadhim%20Jahanger">Zuhair Kadhim Jahanger</a>, <a href="https://publications.waset.org/search?q=S.%20Joseph%20Antony"> S. Joseph Antony</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The available studies in the literature which dealt with the scale effects of strip footings on different sand packing systematically still remain scarce. In this research, the variation of ultimate bearing capacity and deformation pattern of soil beneath strip footings of different widths under plane-strain condition on the surface of loose, medium-dense and dense sand have been systematically studied using experimental and noninvasive methods for measuring microscopic deformations. The presented analyses are based on model scale compression test analysed using Particle Image Velocimetry (PIV) technique. Upper bound analysis of the current study shows that the maximum vertical displacement of the sand under the ultimate load increases for an increase in the width of footing, but at a decreasing rate with relative density of sand, whereas the relative vertical displacement in the sand decreases for an increase in the width of the footing. A well agreement is observed between experimental results for different footing widths and relative densities. The experimental analyses have shown that there exists pronounced scale effect for strip surface footing. The bearing capacity factors <em>Nγ</em> rapidly decrease up to footing widths <em>B</em>=0.25 m, 0.35 m, and 0.65 m for loose, medium-dense and dense sand respectively, after that there is no significant decrease in <em>Nγ</em>. The deformation modes of the soil as well as the ultimate bearing capacity values have been affected by the footing widths. The obtained results could be used to improve settlement calculation of the foundation interacting with granular soil.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=PIV" title="PIV">PIV</a>, <a href="https://publications.waset.org/search?q=granular%20mechanics" title=" granular mechanics"> granular mechanics</a>, <a href="https://publications.waset.org/search?q=scale%20effect" title=" scale effect"> scale effect</a>, <a href="https://publications.waset.org/search?q=upper%20bound%20analysis." title=" upper bound analysis."> upper bound analysis.</a> </p> <a href="https://publications.waset.org/10007511/application-of-particle-image-velocimetry-in-the-analysis-of-scale-effects-in-granular-soil" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10007511/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10007511/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10007511/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10007511/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10007511/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10007511/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10007511/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10007511/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10007511/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10007511/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10007511.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">1009</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">455</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">2562</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">454</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">3690</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">453</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">1867</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">452</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">1473</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">451</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">1982</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=upper%20bound.&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=upper%20bound.&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=upper%20bound.&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=upper%20bound.&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=upper%20bound.&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=upper%20bound.&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=upper%20bound.&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=upper%20bound.&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=upper%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=upper%20bound.&page=15">15</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=upper%20bound.&page=16">16</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=upper%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>