CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: Lower approximations</title> <meta name="description" content="Search results for: Lower approximations"> <meta name="keywords" content="Lower approximations"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="Lower approximations" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="Lower approximations"> <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> 1596</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: Lower approximations</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1596</span> The Lower and Upper Approximations in a Group</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Zhaohao%20Wang">Zhaohao Wang</a>, <a href="https://publications.waset.org/search?q=Lan%20Shu"> Lan Shu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we generalize some propositions in [C.Z. Wang, D.G. Chen, A short note on some properties of rough groups, Comput. Math. Appl. 59(2010)431-436.] and we give some equivalent conditions for rough subgroups. The notion of minimal upper rough subgroups is introduced and a equivalent characterization is given, which implies the rough version of Lagranges Theorem.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Lower%20approximations" title="Lower approximations">Lower approximations</a>, <a href="https://publications.waset.org/search?q=Upper%20approximations" title=" Upper approximations"> Upper approximations</a>, <a href="https://publications.waset.org/search?q=Rough%20sets" title=" Rough sets"> Rough sets</a>, <a href="https://publications.waset.org/search?q=Rough%20groups" title=" Rough groups"> Rough groups</a>, <a href="https://publications.waset.org/search?q=Lagrange" title=" Lagrange"> Lagrange</a> </p> <a href="https://publications.waset.org/9259/the-lower-and-upper-approximations-in-a-group" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9259/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9259/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9259/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9259/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9259/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9259/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9259/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9259/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9259/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9259/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9259.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">2219</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">1595</span> Moment Generating Functions of Observed Gaps between Hypopnea Using Saddlepoint Approximations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nur%20Zakiah%20Mohd%20Saat">Nur Zakiah Mohd Saat</a>, <a href="https://publications.waset.org/search?q=Abdul%20Aziz%20Jemain"> Abdul Aziz Jemain</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Saddlepoint approximations is one of the tools to obtain an expressions for densities and distribution functions. We approximate the densities of the observed gaps between the hypopnea events using the Huzurbazar saddlepoint approximation. We demonstrate the density of a maximum likelihood estimator in exponential families. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Exponential" title="Exponential">Exponential</a>, <a href="https://publications.waset.org/search?q=maximum%20likehood%20estimators" title=" maximum likehood estimators"> maximum likehood estimators</a>, <a href="https://publications.waset.org/search?q=observed%20gap" title=" observed gap"> observed gap</a>, <a href="https://publications.waset.org/search?q=Saddlepoint%20approximations." title=" Saddlepoint approximations."> Saddlepoint approximations.</a> </p> <a href="https://publications.waset.org/7779/moment-generating-functions-of-observed-gaps-between-hypopnea-using-saddlepoint-approximations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7779/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7779/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7779/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7779/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7779/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7779/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7779/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7779/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7779/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7779/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7779.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">1298</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">1594</span> System Reduction by Eigen Permutation Algorithm and Improved Pade Approximations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jay%20Singh">Jay Singh</a>, <a href="https://publications.waset.org/search?q=Kalyan%20Chatterjee"> Kalyan Chatterjee</a>, <a href="https://publications.waset.org/search?q=C.%20B.%20Vishwakarma"> C. B. Vishwakarma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>A mixed method by combining a Eigen algorithm and improved pade approximations is proposed for reducing the order of the large-scale dynamic systems. The most dominant Eigen value of both original and reduced order systems remain same in this method. The proposed method guarantees stability of the reduced model if the original high-order system is stable and is comparable in quality with the other well known existing order reduction methods. The superiority of the proposed method is shown through examples taken from the literature.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Eigen%20algorithm" title="Eigen algorithm">Eigen algorithm</a>, <a href="https://publications.waset.org/search?q=Order%20reduction" title=" Order reduction"> Order reduction</a>, <a href="https://publications.waset.org/search?q=improved%20pade%20approximations" title=" improved pade approximations"> improved pade approximations</a>, <a href="https://publications.waset.org/search?q=Stability" title=" Stability"> Stability</a>, <a href="https://publications.waset.org/search?q=Transfer%20function." title=" Transfer function."> Transfer function.</a> </p> <a href="https://publications.waset.org/9997666/system-reduction-by-eigen-permutation-algorithm-and-improved-pade-approximations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997666/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997666/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997666/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997666/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997666/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997666/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997666/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997666/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997666/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997666/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997666.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">2094</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">1593</span> Restarted GMRES Method Augmented with the Combination of Harmonic Ritz Vectors and Error Approximations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Qiang%20Niu">Qiang Niu</a>, <a href="https://publications.waset.org/search?q=Linzhang%20Lu"> Linzhang Lu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Restarted GMRES methods augmented with approximate eigenvectors are widely used for solving large sparse linear systems. Recently a new scheme of augmenting with error approximations is proposed. The main aim of this paper is to develop a restarted GMRES method augmented with the combination of harmonic Ritz vectors and error approximations. We demonstrate that the resulted combination method can gain the advantages of two approaches: (i) effectively deflate the small eigenvalues in magnitude that may hamper the convergence of the method and (ii) partially recover the global optimality lost due to restarting. The effectiveness and efficiency of the new method are demonstrated through various numerical examples.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Arnoldi%20process" title="Arnoldi process">Arnoldi process</a>, <a href="https://publications.waset.org/search?q=GMRES" title=" GMRES"> GMRES</a>, <a href="https://publications.waset.org/search?q=Krylov%20subspace" title=" Krylov subspace"> Krylov subspace</a>, <a href="https://publications.waset.org/search?q=systems%20of%20linear%20equations." title=" systems of linear equations."> systems of linear equations.</a> </p> <a href="https://publications.waset.org/5472/restarted-gmres-method-augmented-with-the-combination-of-harmonic-ritz-vectors-and-error-approximations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5472/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5472/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5472/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5472/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5472/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5472/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5472/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5472/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5472/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5472/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5472.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">1938</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">1592</span> Covering-based Rough sets Based on the Refinement of Covering-element</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jianguo%20Tang">Jianguo Tang</a>, <a href="https://publications.waset.org/search?q=Kun%20She"> Kun She</a>, <a href="https://publications.waset.org/search?q=William%20Zhu"> William Zhu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Covering-based rough sets is an extension of rough sets and it is based on a covering instead of a partition of the universe. Therefore it is more powerful in describing some practical problems than rough sets. However, by extending the rough sets, covering-based rough sets can increase the roughness of each model in recognizing objects. How to obtain better approximations from the models of a covering-based rough sets is an important issue. In this paper, two concepts, determinate elements and indeterminate elements in a universe, are proposed and given precise definitions respectively. This research makes a reasonable refinement of the covering-element from a new viewpoint. And the refinement may generate better approximations of covering-based rough sets models. To prove the theory above, it is applied to eight major coveringbased rough sets models which are adapted from other literature. The result is, in all these models, the lower approximation increases effectively. Correspondingly, in all models, the upper approximation decreases with exceptions of two models in some special situations. Therefore, the roughness of recognizing objects is reduced. This research provides a new approach to the study and application of covering-based rough sets. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Determinate%20element" title="Determinate element">Determinate element</a>, <a href="https://publications.waset.org/search?q=indeterminate%20element" title=" indeterminate element"> indeterminate element</a>, <a href="https://publications.waset.org/search?q=refinementof%20covering-element" title=" refinementof covering-element"> refinementof covering-element</a>, <a href="https://publications.waset.org/search?q=refinement%20of%20covering" title=" refinement of covering"> refinement of covering</a>, <a href="https://publications.waset.org/search?q=covering-basedrough%20sets." title=" covering-basedrough sets."> covering-basedrough sets.</a> </p> <a href="https://publications.waset.org/8682/covering-based-rough-sets-based-on-the-refinement-of-covering-element" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8682/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8682/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8682/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8682/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8682/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8682/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8682/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8682/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8682/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8682/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8682.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">1322</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">1591</span> Order Reduction using Modified Pole Clustering and Pade Approximations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=C.B.%20Vishwakarma">C.B. Vishwakarma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The authors present a mixed method for reducing the order of the large-scale dynamic systems. In this method, the denominator polynomial of the reduced order model is obtained by using the modified pole clustering technique while the coefficients of the numerator are obtained by Pade approximations. This method is conceptually simple and always generates stable reduced models if the original high-order system is stable. The proposed method is illustrated with the help of the numerical examples taken from the literature.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Modified%20pole%20clustering" title="Modified pole clustering">Modified pole clustering</a>, <a href="https://publications.waset.org/search?q=order%20reduction" title=" order reduction"> order reduction</a>, <a href="https://publications.waset.org/search?q=padeapproximation" title=" padeapproximation"> padeapproximation</a>, <a href="https://publications.waset.org/search?q=stability" title=" stability"> stability</a>, <a href="https://publications.waset.org/search?q=transfer%20function." title=" transfer function."> transfer function.</a> </p> <a href="https://publications.waset.org/4622/order-reduction-using-modified-pole-clustering-and-pade-approximations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4622/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4622/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4622/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4622/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4622/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4622/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4622/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4622/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4622/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4622/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4622.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">2980</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">1590</span> Properties and Approximation Distribution Reductions in Multigranulation Rough Set Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Properties">Properties</a>, <a href="https://publications.waset.org/search?q=Approximation%20Distribution%20Reductions%20in%20Multigranulation%20Rough%20Set%20Model">Approximation Distribution Reductions in Multigranulation Rough Set Model</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Some properties of approximation sets are studied in multi-granulation optimist model in rough set theory using maximal compatible classes. The relationships between or among lower and upper approximations in single and multiple granulation are compared and discussed. Through designing Boolean functions and discernibility matrices in incomplete information systems, the lower and upper approximation sets and reduction in multi-granulation environments can be found. By using examples, the correctness of computation approach is consolidated. The related conclusions obtained are suitable for further investigating in multiple granulation RSM.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Incomplete%20information%20system" title="Incomplete information system">Incomplete information system</a>, <a href="https://publications.waset.org/search?q=maximal%20compatible%20class" title=" maximal compatible class"> maximal compatible class</a>, <a href="https://publications.waset.org/search?q=multi-granulation%20rough%20set%20model" title=" multi-granulation rough set model"> multi-granulation rough set model</a>, <a href="https://publications.waset.org/search?q=reduction." title=" reduction."> reduction.</a> </p> <a href="https://publications.waset.org/10007849/properties-and-approximation-distribution-reductions-in-multigranulation-rough-set-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10007849/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10007849/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10007849/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10007849/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10007849/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10007849/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10007849/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10007849/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10007849/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10007849/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10007849.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">859</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">1589</span> Applications of High-Order Compact Finite Difference Scheme to Nonlinear Goursat Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mohd%20Agos%20Salim%20Nasir">Mohd Agos Salim Nasir</a>, <a href="https://publications.waset.org/search?q=Ahmad%20Izani%20Md.%20Ismail"> Ahmad Izani Md. Ismail</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Several numerical schemes utilizing central difference approximations have been developed to solve the Goursat problem. However, in a recent years compact discretization methods which leads to high-order finite difference schemes have been used since it is capable of achieving better accuracy as well as preserving certain features of the equation e.g. linearity. The basic idea of the new scheme is to find the compact approximations to the derivative terms by differentiating centrally the governing equations. Our primary interest is to study the performance of the new scheme when applied to two Goursat partial differential equations against the traditional finite difference scheme. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Goursat%20problem" title="Goursat problem">Goursat problem</a>, <a href="https://publications.waset.org/search?q=partial%20differential%20equation" title=" partial differential equation"> partial differential equation</a>, <a href="https://publications.waset.org/search?q=finite%0Adifference%20scheme" title=" finite difference scheme"> finite difference scheme</a>, <a href="https://publications.waset.org/search?q=compact%20finite%20difference" title=" compact finite difference"> compact finite difference</a> </p> <a href="https://publications.waset.org/13234/applications-of-high-order-compact-finite-difference-scheme-to-nonlinear-goursat-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13234/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13234/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13234/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13234/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13234/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13234/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13234/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13234/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13234/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13234/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13234.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">1902</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">1588</span> Numerical Methods versus Bjerksund and Stensland Approximations for American Options Pricing </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Marasovic%20Branka">Marasovic Branka</a>, <a href="https://publications.waset.org/search?q=Aljinovic%20Zdravka"> Aljinovic Zdravka</a>, <a href="https://publications.waset.org/search?q=Poklepovic%20Tea"> Poklepovic Tea</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Numerical methods like binomial and trinomial trees and finite difference methods can be used to price a wide range of options contracts for which there are no known analytical solutions. American options are the most famous of that kind of options. Besides numerical methods, American options can be valued with the approximation formulas, like Bjerksund-Stensland formulas from 1993 and 2002. When the value of American option is approximated by Bjerksund-Stensland formulas, the computer time spent to carry out that calculation is very short. The computer time spent using numerical methods can vary from less than one second to several minutes or even hours. However to be able to conduct a comparative analysis of numerical methods and Bjerksund-Stensland formulas, we will limit computer calculation time of numerical method to less than one second. Therefore, we ask the question: Which method will be most accurate at nearly the same computer calculation time?</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Bjerksund%20and%20Stensland%20approximations" title="Bjerksund and Stensland approximations">Bjerksund and Stensland approximations</a>, <a href="https://publications.waset.org/search?q=Computational%20analysis" title=" Computational analysis"> Computational analysis</a>, <a href="https://publications.waset.org/search?q=Finance" title=" Finance"> Finance</a>, <a href="https://publications.waset.org/search?q=Options%20pricing" title=" Options pricing"> Options pricing</a>, <a href="https://publications.waset.org/search?q=Numerical%20methods." title=" Numerical methods. "> Numerical methods. </a> </p> <a href="https://publications.waset.org/9997945/numerical-methods-versus-bjerksund-and-stensland-approximations-for-american-options-pricing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997945/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997945/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997945/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997945/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997945/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997945/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997945/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997945/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997945/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997945/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997945.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">6068</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">1587</span> Applications of Rough Set Decompositions in Information Retrieval</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Chen%20Wu">Chen Wu</a>, <a href="https://publications.waset.org/search?q=Xiaohua%20Hu"> Xiaohua Hu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes rough set models with three different level knowledge granules in incomplete information system under tolerance relation by similarity between objects according to their attribute values. Through introducing dominance relation on the discourse to decompose similarity classes into three subclasses: little better subclass, little worse subclass and vague subclass, it dismantles lower and upper approximations into three components. By using these components, retrieving information to find naturally hierarchical expansions to queries and constructing answers to elaborative queries can be effective. It illustrates the approach in applying rough set models in the design of information retrieval system to access different granular expanded documents. The proposed method enhances rough set model application in the flexibility of expansions and elaborative queries in information retrieval. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Incomplete%20information%20system" title="Incomplete information system">Incomplete information system</a>, <a href="https://publications.waset.org/search?q=Rough%20set%20model" title=" Rough set model"> Rough set model</a>, <a href="https://publications.waset.org/search?q=tolerance%20relation" title="tolerance relation">tolerance relation</a>, <a href="https://publications.waset.org/search?q=dominance%20relation" title=" dominance relation"> dominance relation</a>, <a href="https://publications.waset.org/search?q=approximation" title=" approximation"> approximation</a>, <a href="https://publications.waset.org/search?q=decomposition" title=" decomposition"> decomposition</a>, <a href="https://publications.waset.org/search?q=elaborative%20query." title="elaborative query.">elaborative query.</a> </p> <a href="https://publications.waset.org/12504/applications-of-rough-set-decompositions-in-information-retrieval" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12504/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12504/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12504/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12504/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12504/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12504/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12504/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12504/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12504/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12504/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12504.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">1612</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">1586</span> High Order Accurate Runge Kutta Nodal Discontinuous Galerkin Method for Numerical Solution of Linear Convection Equation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Faheem%20Ahmed">Faheem Ahmed</a>, <a href="https://publications.waset.org/search?q=Fareed%20Ahmed"> Fareed Ahmed</a>, <a href="https://publications.waset.org/search?q=Yongheng%20Guo"> Yongheng Guo</a>, <a href="https://publications.waset.org/search?q=Yong%20Yang"> Yong Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with a high-order accurate Runge Kutta Discontinuous Galerkin (RKDG) method for the numerical solution of the wave equation, which is one of the simple case of a linear hyperbolic partial differential equation. Nodal DG method is used for a finite element space discretization in 'x' by discontinuous approximations. This method combines mainly two key ideas which are based on the finite volume and finite element methods. The physics of wave propagation being accounted for by means of Riemann problems and accuracy is obtained by means of high-order polynomial approximations within the elements. High order accurate Low Storage Explicit Runge Kutta (LSERK) method is used for temporal discretization in 't' that allows the method to be nonlinearly stable regardless of its accuracy. The resulting RKDG methods are stable and high-order accurate. The L1 ,L2 and L∞ error norm analysis shows that the scheme is highly accurate and effective. Hence, the method is well suited to achieve high order accurate solution for the scalar wave equation and other hyperbolic equations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Nodal%20Discontinuous%20Galerkin%20Method" title="Nodal Discontinuous Galerkin Method">Nodal Discontinuous Galerkin Method</a>, <a href="https://publications.waset.org/search?q=RKDG" title=" RKDG"> RKDG</a>, <a href="https://publications.waset.org/search?q=Scalar%20Wave%20Equation" title=" Scalar Wave Equation"> Scalar Wave Equation</a>, <a href="https://publications.waset.org/search?q=LSERK" title=" LSERK"> LSERK</a> </p> <a href="https://publications.waset.org/14926/high-order-accurate-runge-kutta-nodal-discontinuous-galerkin-method-for-numerical-solution-of-linear-convection-equation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14926/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14926/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14926/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14926/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14926/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14926/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14926/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14926/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14926/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14926/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14926.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">2467</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">1585</span> Note on the Necessity of the Patch Test</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Rado%20Flajs">Rado Flajs</a>, <a href="https://publications.waset.org/search?q=Miran%20Saje"> Miran Saje</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>We present a simple nonconforming approximation of the linear two–point boundary value problem which violates patch test requirements. Nevertheless the solutions, obtained from these type of approximations, converge to the exact solution.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Generalized%20patch%20test" title="Generalized patch test">Generalized patch test</a>, <a href="https://publications.waset.org/search?q=Irons%27%20patch%20test" title=" Irons' patch test"> Irons' patch test</a>, <a href="https://publications.waset.org/search?q=nonconforming%20finite%20element" title=" nonconforming finite element"> nonconforming finite element</a>, <a href="https://publications.waset.org/search?q=convergence." title=" convergence."> convergence.</a> </p> <a href="https://publications.waset.org/14007/note-on-the-necessity-of-the-patch-test" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14007/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14007/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14007/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14007/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14007/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14007/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14007/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14007/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14007/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14007/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14007.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">1550</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">1584</span> Computing Entropy for Ortholog Detection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hsing-Kuo%20Pao">Hsing-Kuo Pao</a>, <a href="https://publications.waset.org/search?q=John%20Case"> John Case</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Biological sequences from different species are called or-thologs if they evolved from a sequence of a common ancestor species and they have the same biological function. Approximations of Kolmogorov complexity or entropy of biological sequences are already well known to be useful in extracting similarity information between such sequences -in the interest, for example, of ortholog detection. As is well known, the exact Kolmogorov complexity is not algorithmically computable. In prac-tice one can approximate it by computable compression methods. How-ever, such compression methods do not provide a good approximation to Kolmogorov complexity for short sequences. Herein is suggested a new ap-proach to overcome the problem that compression approximations may notwork well on short sequences. This approach is inspired by new, conditional computations of Kolmogorov entropy. A main contribution of the empir-ical work described shows the new set of entropy-based machine learning attributes provides good separation between positive (ortholog) and nega-tive (non-ortholog) data - better than with good, previously known alter-natives (which do not employ some means to handle short sequences well).Also empirically compared are the new entropy based attribute set and a number of other, more standard similarity attributes sets commonly used in genomic analysis. The various similarity attributes are evaluated by cross validation, through boosted decision tree induction C5.0, and by Receiver Operating Characteristic (ROC) analysis. The results point to the conclu-sion: the new, entropy based attribute set by itself is not the one giving the best prediction; however, it is the best attribute set for use in improving the other, standard attribute sets when conjoined with them.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=compression" title="compression">compression</a>, <a href="https://publications.waset.org/search?q=decision%20tree" title=" decision tree"> decision tree</a>, <a href="https://publications.waset.org/search?q=entropy" title=" entropy"> entropy</a>, <a href="https://publications.waset.org/search?q=ortholog" title=" ortholog"> ortholog</a>, <a href="https://publications.waset.org/search?q=ROC." title=" ROC."> ROC.</a> </p> <a href="https://publications.waset.org/11278/computing-entropy-for-ortholog-detection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11278/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11278/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11278/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11278/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11278/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11278/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11278/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11278/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11278/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11278/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11278.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">1827</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">1583</span> Join and Meet Block Based Default Definite Decision Rule Mining from IDT and an Incremental Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Chen%20Wu">Chen Wu</a>, <a href="https://publications.waset.org/search?q=Jingyu%20Yang"> Jingyu Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Using maximal consistent blocks of tolerance relation on the universe in incomplete decision table, the concepts of join block and meet block are introduced and studied. Including tolerance class, other blocks such as tolerant kernel and compatible kernel of an object are also discussed at the same time. Upper and lower approximations based on those blocks are also defined. Default definite decision rules acquired from incomplete decision table are proposed in the paper. An incremental algorithm to update default definite decision rules is suggested for effective mining tasks from incomplete decision table into which data is appended. Through an example, we demonstrate how default definite decision rules based on maximal consistent blocks, join blocks and meet blocks are acquired and how optimization is done in support of discernibility matrix and discernibility function in the incomplete decision table. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=rough%20set" title="rough set">rough set</a>, <a href="https://publications.waset.org/search?q=incomplete%20decision%20table" title=" incomplete decision table"> incomplete decision table</a>, <a href="https://publications.waset.org/search?q=maximalconsistent%20block" title=" maximalconsistent block"> maximalconsistent block</a>, <a href="https://publications.waset.org/search?q=default%20definite%20decision%20rule" title=" default definite decision rule"> default definite decision rule</a>, <a href="https://publications.waset.org/search?q=join%20and%20meet%20block." title=" join and meet block."> join and meet block.</a> </p> <a href="https://publications.waset.org/10939/join-and-meet-block-based-default-definite-decision-rule-mining-from-idt-and-an-incremental-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10939/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10939/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10939/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10939/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10939/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10939/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10939/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10939/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10939/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10939/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10939.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">1288</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">1582</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">1581</span> Application of Residual Correction Method on Hyperbolic Thermoelastic Response of Hollow Spherical Medium in Rapid Transient Heat Conduction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Po-Jen%20Su">Po-Jen Su</a>, <a href="https://publications.waset.org/search?q=Huann-Ming%20Chou"> Huann-Ming Chou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this article, we used the residual correction method to deal with transient thermoelastic problems with a hollow spherical region when the continuum medium possesses spherically isotropic thermoelastic properties. Based on linear thermoelastic theory, the equations of hyperbolic heat conduction and thermoelastic motion were combined to establish the thermoelastic dynamic model with consideration of the deformation acceleration effect and non-Fourier effect under the condition of transient thermal shock. The approximate solutions of temperature and displacement distributions are obtained using the residual correction method based on the maximum principle in combination with the finite difference method, making it easier and faster to obtain upper and lower approximations of exact solutions. The proposed method is found to be an effective numerical method with satisfactory accuracy. Moreover, the result shows that the effect of transient thermal shock induced by deformation acceleration is enhanced by non-Fourier heat conduction with increased peak stress. The influence on the stress increases with the thermal relaxation time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Maximum%20principle" title="Maximum principle">Maximum principle</a>, <a href="https://publications.waset.org/search?q=non-Fourier%20heat%20conduction" title=" non-Fourier heat conduction"> non-Fourier heat conduction</a>, <a href="https://publications.waset.org/search?q=residual%20correction%20method" title=" residual correction method"> residual correction method</a>, <a href="https://publications.waset.org/search?q=thermo-elastic%20response." title=" thermo-elastic response."> thermo-elastic response.</a> </p> <a href="https://publications.waset.org/10002814/application-of-residual-correction-method-on-hyperbolic-thermoelastic-response-of-hollow-spherical-medium-in-rapid-transient-heat-conduction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10002814/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10002814/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10002814/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10002814/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10002814/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10002814/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10002814/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10002814/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10002814/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10002814/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10002814.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">1747</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">1580</span> Stature Estimation Based On Lower Limb Dimensions in the Malaysian Population</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=F.%20M.%20Nor">F. M. Nor</a>, <a href="https://publications.waset.org/search?q=N.%20Abdullah"> N. Abdullah</a>, <a href="https://publications.waset.org/search?q=Al-M.%20Mustapa"> Al-M. Mustapa</a>, <a href="https://publications.waset.org/search?q=L.%20Q.%20Wen"> L. Q. Wen</a>, <a href="https://publications.waset.org/search?q=N.%20A.%20Faisal"> N. A. Faisal</a>, <a href="https://publications.waset.org/search?q=D.%20A.%20A.%20Ahmad%20Nazari"> D. A. A. Ahmad Nazari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Estimation of stature is an important step in developing a biological profile for human identification. It may provide a valuable indicator for unknown individual in a population. The aim of this study was to analyses the relationship between stature and lower limb dimensions in the Malaysian population. The sample comprised 100 corpses, which included 69 males and 31 females between age ranges of 20 to 90 years old. The parameters measured were stature, thigh length, lower leg length, leg length, foot length, foot height and foot breadth. Results showed that mean values in males were significantly higher than those in females (P < 0.05). There were significant correlations between lower limb dimensions and stature. Cross-validation of the equation on 100 individuals showed close approximation between known stature and estimated stature. It was concluded that lower limb dimensions were useful for estimation of stature, which should be validated in future studies. </p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Forensic%20anthropology%20population%20data" title="Forensic anthropology population data">Forensic anthropology population data</a>, <a href="https://publications.waset.org/search?q=lower%20leg%0D%0Alength" title=" lower leg length"> lower leg length</a>, <a href="https://publications.waset.org/search?q=Malaysian" title=" Malaysian"> Malaysian</a>, <a href="https://publications.waset.org/search?q=stature." title=" stature."> stature.</a> </p> <a href="https://publications.waset.org/16293/stature-estimation-based-on-lower-limb-dimensions-in-the-malaysian-population" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/16293/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/16293/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/16293/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/16293/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/16293/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/16293/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/16293/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/16293/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/16293/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/16293/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/16293.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">3205</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">1579</span> Lower Bounds of Some Small Ramsey Numbers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Decha%20Samana">Decha Samana</a>, <a href="https://publications.waset.org/search?q=Vites%20Longani"> Vites Longani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For positive integer s and t, the Ramsey number R(s, t) is the least positive integer n such that for every graph G of order n, either G contains Ks as a subgraph or G contains Kt as a subgraph. We construct the circulant graphs and use them to obtain lower bounds of some small Ramsey numbers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Lower%20bound" title="Lower bound">Lower bound</a>, <a href="https://publications.waset.org/search?q=Ramsey%20numbers" title=" Ramsey numbers"> Ramsey numbers</a>, <a href="https://publications.waset.org/search?q=Graphs" title=" Graphs"> Graphs</a>, <a href="https://publications.waset.org/search?q=Distance%20line." title=" Distance line."> Distance line.</a> </p> <a href="https://publications.waset.org/6768/lower-bounds-of-some-small-ramsey-numbers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6768/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6768/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6768/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6768/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6768/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6768/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6768/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6768/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6768/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6768/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6768.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1374</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">1578</span> Quartic Nonpolynomial Spline Solutions for Third Order Two-Point Boundary Value Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Talaat%20S.%20El-Danaf">Talaat S. El-Danaf</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we develop quartic nonpolynomial spline method for the numerical solution of third order two point boundary value problems. It is shown that the new method gives approximations, which are better than those produced by other spline methods. Convergence analysis of the method is discussed through standard procedures. Two numerical examples are given to illustrate the applicability and efficiency of the novel method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Quartic%20nonpolynomial%20spline" title="Quartic nonpolynomial spline">Quartic nonpolynomial spline</a>, <a href="https://publications.waset.org/search?q=Two-point%20boundary%0Avalue%20problem." title=" Two-point boundary value problem."> Two-point boundary value problem.</a> </p> <a href="https://publications.waset.org/13787/quartic-nonpolynomial-spline-solutions-for-third-order-two-point-boundary-value-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13787/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13787/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13787/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13787/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13787/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13787/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13787/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13787/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13787/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13787/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13787.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">2008</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">1577</span> Numerical Approximation to the Performance of CUSUM Charts for EMA (1) Process</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=K.%20Petcharat">K. Petcharat</a>, <a href="https://publications.waset.org/search?q=Y.%20Areepong"> Y. Areepong</a>, <a href="https://publications.waset.org/search?q=S.%20Sukparungsri"> S. Sukparungsri</a>, <a href="https://publications.waset.org/search?q=G.%20Mititelu"> G. Mititelu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> These paper, we approximate the average run length (ARL) for CUSUM chart when observation are an exponential first order moving average sequence (EMA1). We used Gauss-Legendre numerical scheme for integral equations (IE) method for approximate ARL0 and ARL1, where ARL in control and out of control, respectively. We compared the results from IE method and exact solution such that the two methods perform good agreement. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cumulative%20Sum%20Chart" title="Cumulative Sum Chart">Cumulative Sum Chart</a>, <a href="https://publications.waset.org/search?q=Moving%20Average%0AObservation" title=" Moving Average Observation"> Moving Average Observation</a>, <a href="https://publications.waset.org/search?q=Average%20Run%20Length" title=" Average Run Length"> Average Run Length</a>, <a href="https://publications.waset.org/search?q=Numerical%20Approximations." title=" Numerical Approximations."> Numerical Approximations.</a> </p> <a href="https://publications.waset.org/5222/numerical-approximation-to-the-performance-of-cusum-charts-for-ema-1-process" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5222/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5222/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5222/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5222/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5222/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5222/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5222/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5222/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5222/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5222/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5222.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">2163</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">1576</span> Futures Trading: Design of a Strategy</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jan%20Zeman">Jan Zeman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper describes the futures trading and aims to design the speculators trading strategy. The problem is formulated as the decision making task and such as is solved. The solution of the task leads to complex mathematical problems and the approximations of the decision making is demanded. Two kind of approximation are used in the paper: Monte Carlo for the multi-step prediction and iteration spread in time for the optimization. The solution is applied to the real-market data and the results of the off-line experiments are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=futures%20trading" title="futures trading">futures trading</a>, <a href="https://publications.waset.org/search?q=decision%20making" title=" decision making"> decision making</a> </p> <a href="https://publications.waset.org/9435/futures-trading-design-of-a-strategy" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9435/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9435/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9435/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9435/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9435/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9435/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9435/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9435/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9435/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9435/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9435.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">1124</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">1575</span> Implementation of Lower-Limb Rehabilitation System Using Attraction Motors with a Treadmill</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Young-Lim%20Choi">Young-Lim Choi</a>, <a href="https://publications.waset.org/search?q=Nak-Yun%20Choi"> Nak-Yun Choi</a>, <a href="https://publications.waset.org/search?q=Jae-Yong%20Seo"> Jae-Yong Seo</a>, <a href="https://publications.waset.org/search?q=Sang-Il%20Park"> Sang-Il Park</a>, <a href="https://publications.waset.org/search?q=Jong-Wook%20Kim"> Jong-Wook Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a prototype of a lower-limb rehabilitation system for recovering and strengthening patients- injured lower limbs. The system is composed of traction motors for each leg position, a treadmill as a walking base, tension sensors, microcontrollers controlling motor functions and a main system with graphic user interface. For derivation of reference or normal velocity profiles of the body segment point, kinematic method is applied based on the humanoid robot model using the reference joint angle data of normal walking. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Rehabilitation" title="Rehabilitation">Rehabilitation</a>, <a href="https://publications.waset.org/search?q=lower%20limb" title=" lower limb"> lower limb</a>, <a href="https://publications.waset.org/search?q=treadmill" title=" treadmill"> treadmill</a>, <a href="https://publications.waset.org/search?q=humanoid%0Arobot." title=" humanoid robot."> humanoid robot.</a> </p> <a href="https://publications.waset.org/7496/implementation-of-lower-limb-rehabilitation-system-using-attraction-motors-with-a-treadmill" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7496/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7496/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7496/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7496/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7496/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7496/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7496/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7496/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7496/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7496/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7496.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">1440</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">1574</span> Comparing Interval Estimators for Reliability in a Dependent Set-up</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Alessandro%20Barbiero">Alessandro Barbiero</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper some procedures for building confidence intervals for the reliability in stress-strength models are discussed and empirically compared. The particular case of a bivariate normal setup is considered. The confidence intervals suggested are obtained employing approximations or asymptotic properties of maximum likelihood estimators. The coverage and the precision of these intervals are empirically checked through a simulation study. An application to real paired data is also provided.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Approximate%20estimators" title="Approximate estimators">Approximate estimators</a>, <a href="https://publications.waset.org/search?q=asymptotic%20theory" title=" asymptotic theory"> asymptotic theory</a>, <a href="https://publications.waset.org/search?q=confidence%20interval" title=" confidence interval"> confidence interval</a>, <a href="https://publications.waset.org/search?q=Monte%20Carlo%20simulations" title=" Monte Carlo simulations"> Monte Carlo simulations</a>, <a href="https://publications.waset.org/search?q=stress-strength" title=" stress-strength"> stress-strength</a>, <a href="https://publications.waset.org/search?q=variance%20estimation." title=" variance estimation."> variance estimation.</a> </p> <a href="https://publications.waset.org/10002/comparing-interval-estimators-for-reliability-in-a-dependent-set-up" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10002/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10002/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10002/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10002/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10002/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10002/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10002/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10002/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10002/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10002/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10002.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">1474</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">1573</span> New Laguerre-s Type Method for Solving of a Polynomial Equations Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Oleksandr%20Poliakov">Oleksandr Poliakov</a>, <a href="https://publications.waset.org/search?q=Yevgen%20Pashkov"> Yevgen Pashkov</a>, <a href="https://publications.waset.org/search?q=Marina%20Kolesova"> Marina Kolesova</a>, <a href="https://publications.waset.org/search?q=Olena%20Chepenyuk"> Olena Chepenyuk</a>, <a href="https://publications.waset.org/search?q=Mykhaylo%20Kalinin"> Mykhaylo Kalinin</a>, <a href="https://publications.waset.org/search?q=Vadym%20Kramar"> Vadym Kramar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we present a substantiation of a new Laguerre-s type iterative method for solving of a nonlinear polynomial equations systems with real coefficients. The problems of its implementation, including relating to the structural choice of initial approximations, were considered. Test examples demonstrate the effectiveness of the method at the solving of many practical problems solving. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Iterative%20method" title="Iterative method">Iterative method</a>, <a href="https://publications.waset.org/search?q=Laguerre%27s%20method" title=" Laguerre's method"> Laguerre's method</a>, <a href="https://publications.waset.org/search?q=Newton%27s%0Amethod" title=" Newton's method"> Newton's method</a>, <a href="https://publications.waset.org/search?q=polynomial%20equation" title=" polynomial equation"> polynomial equation</a>, <a href="https://publications.waset.org/search?q=system%20of%20equations" title=" system of equations"> system of equations</a> </p> <a href="https://publications.waset.org/15431/new-laguerre-s-type-method-for-solving-of-a-polynomial-equations-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15431/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15431/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15431/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15431/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15431/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15431/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15431/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15431/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15431/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15431/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15431.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">1489</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">1572</span> Kinematic and Dynamic Analysis of a Lower Limb Exoskeleton</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Tawakal%20Hasnain%20Baluch">Tawakal Hasnain Baluch</a>, <a href="https://publications.waset.org/search?q=Adnan%20Masood"> Adnan Masood</a>, <a href="https://publications.waset.org/search?q=Javaid%20Iqbal"> Javaid Iqbal</a>, <a href="https://publications.waset.org/search?q=Umer%20Izhar"> Umer Izhar</a>, <a href="https://publications.waset.org/search?q=Umar%20Shahbaz%20Khan"> Umar Shahbaz Khan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper will provide the kinematic and dynamic analysis of a lower limb exoskeleton. The forward and inverse kinematics of proposed exoskeleton is performed using Denevit and Hartenberg method. The torques required for the actuators will be calculated using Lagrangian formulation technique. This research can be used to design the control of the proposed exoskeleton. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Dynamic%20Analysis" title="Dynamic Analysis">Dynamic Analysis</a>, <a href="https://publications.waset.org/search?q=Exoskeleton" title=" Exoskeleton"> Exoskeleton</a>, <a href="https://publications.waset.org/search?q=Kinematic%20Analysis" title=" Kinematic Analysis"> Kinematic Analysis</a>, <a href="https://publications.waset.org/search?q=Lower%20Limb" title=" Lower Limb"> Lower Limb</a>, <a href="https://publications.waset.org/search?q=Rehabilitation%20Robotics" title=" Rehabilitation Robotics"> Rehabilitation Robotics</a> </p> <a href="https://publications.waset.org/9496/kinematic-and-dynamic-analysis-of-a-lower-limb-exoskeleton" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9496/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9496/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9496/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9496/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9496/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9496/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9496/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9496/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9496/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9496/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9496.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">4596</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">1571</span> A Simplified Distribution for Nonlinear Seas</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20A.%20Tayfun">M. A. Tayfun</a>, <a href="https://publications.waset.org/search?q=M.%20A.%20Alkhalidi"> M. A. Alkhalidi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The exact theoretical expression describing the probability distribution of nonlinear sea-surface elevations derived from the second-order narrowband model has a cumbersome form that requires numerical computations, not well-disposed to theoretical or practical applications. Here, the same narrowband model is reexamined to develop a simpler closed-form approximation suitable for theoretical and practical applications. The salient features of the approximate form are explored, and its relative validity is verified with comparisons to other readily available approximations, and oceanic data.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Ocean%20waves" title="Ocean waves">Ocean waves</a>, <a href="https://publications.waset.org/search?q=probability%20distributions" title=" probability distributions"> probability distributions</a>, <a href="https://publications.waset.org/search?q=second-order%20nonlinearities" title=" second-order nonlinearities"> second-order nonlinearities</a>, <a href="https://publications.waset.org/search?q=skewness%20coefficient" title=" skewness coefficient"> skewness coefficient</a>, <a href="https://publications.waset.org/search?q=wave%20steepness." title=" wave steepness."> wave steepness.</a> </p> <a href="https://publications.waset.org/10000260/a-simplified-distribution-for-nonlinear-seas" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10000260/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10000260/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10000260/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10000260/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10000260/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10000260/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10000260/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10000260/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10000260/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10000260/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10000260.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">2096</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">1570</span> Non-Polynomial Spline Solution of Fourth-Order Obstacle Boundary-Value Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jalil%20Rashidinia">Jalil Rashidinia</a>, <a href="https://publications.waset.org/search?q=Reza%20Jalilian"> Reza Jalilian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we use quintic non-polynomial spline functions to develop numerical methods for approximation to the solution of a system of fourth-order boundaryvalue problems associated with obstacle, unilateral and contact problems. The convergence analysis of the methods has been discussed and shown that the given approximations are better than collocation and finite difference methods. Numerical examples are presented to illustrate the applications of these methods, and to compare the computed results with other known methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Quintic%20non-polynomial%20spline" title="Quintic non-polynomial spline">Quintic non-polynomial spline</a>, <a href="https://publications.waset.org/search?q=Boundary%20formula" title=" Boundary formula"> Boundary formula</a>, <a href="https://publications.waset.org/search?q=Convergence" title="Convergence">Convergence</a>, <a href="https://publications.waset.org/search?q=Obstacle%20problems." title=" Obstacle problems."> Obstacle problems.</a> </p> <a href="https://publications.waset.org/1642/non-polynomial-spline-solution-of-fourth-order-obstacle-boundary-value-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1642/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1642/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1642/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1642/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1642/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1642/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1642/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1642/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1642/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1642/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1642.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">1818</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">1569</span> Neutron Flux Characterization for Radioisotope Production at ETRR-2</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.%20M.%20Hassanain">A. M. Hassanain</a>, <a href="https://publications.waset.org/search?q=Nader%20M.%20A.%20Mohamed"> Nader M. A. Mohamed</a>, <a href="https://publications.waset.org/search?q=M.%20Naguib%20Aly"> M. Naguib Aly</a>, <a href="https://publications.waset.org/search?q=Alya%20A.%20Badawi"> Alya A. Badawi</a>, <a href="https://publications.waset.org/search?q=M.%20A.%20Gaheen"> M. A. Gaheen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The thermal, epithermal and fast fluxes were calculated for three irradiation channels at Egypt Second Research Reactor (ETRR-2) using CITVAP code. The validity of the calculations was verified by experimental measurements. There are some deviations between measurements and calculations. This is due to approximations in the calculation models used, homogenization of regions, condensation of energy groups and uncertainty in nuclear data used. Neutron flux data for the three irradiation channels are now available. This would enable predicting the irradiation conditions needed for future radioisotope production. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=ETRR-2" title="ETRR-2">ETRR-2</a>, <a href="https://publications.waset.org/search?q=Neutron%20flux" title=" Neutron flux"> Neutron flux</a>, <a href="https://publications.waset.org/search?q=Radioisotope%20production" title=" Radioisotope production"> Radioisotope production</a>, <a href="https://publications.waset.org/search?q=CITVAP" title=" CITVAP"> CITVAP</a> </p> <a href="https://publications.waset.org/2534/neutron-flux-characterization-for-radioisotope-production-at-etrr-2" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2534/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2534/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2534/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2534/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2534/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2534/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2534/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2534/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2534/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2534/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2534.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">2242</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">1568</span> A Family of Minimal Residual Based Algorithm for Adaptive Filtering</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Noor%20Atinah%20Ahmad">Noor Atinah Ahmad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Minimal Residual (MR) is modified for adaptive filtering application. Three forms of MR based algorithm are presented: i) the low complexity SPCG, ii) MREDSI, and iii) MREDSII. The low complexity is a reduced complexity version of a previously proposed SPCG algorithm. Approximations introduced reduce the algorithm to an LMS type algorithm, but, maintain the superior convergence of the SPCG algorithm. Both MREDSI and MREDSII are MR based methods with Euclidean direction of search. The choice of Euclidean directions is shown via simulation to give better misadjustment compared to their gradient search counterparts. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Adaptive%20filtering" title="Adaptive filtering">Adaptive filtering</a>, <a href="https://publications.waset.org/search?q=Adaptive%20least%20square" title=" Adaptive least square"> Adaptive least square</a>, <a href="https://publications.waset.org/search?q=Minimalresidual%20method." title=" Minimalresidual method."> Minimalresidual method.</a> </p> <a href="https://publications.waset.org/5796/a-family-of-minimal-residual-based-algorithm-for-adaptive-filtering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5796/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5796/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5796/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5796/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5796/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5796/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5796/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5796/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5796/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5796/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5796.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">1442</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">1567</span> Evaluation of Research in the Field of Energy Efficiency and MCA Methods Using Publications Databases</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Juan%20Sep%C3%BAlveda">Juan Sepúlveda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Energy is a fundamental component in sustainability, the access and use of this resource is related with economic growth, social improvements, and environmental impacts. In this sense, energy efficiency has been studied as a factor that enhances the positive impacts of energy in communities; however, the implementation of efficiency requires strong policy and strategies that usually rely on individual measures focused in independent dimensions. In this paper, the problem of energy efficiency as a multi-objective problem is studied, using scientometric analysis to discover trends and patterns that allow to identify the main variables and study approximations related with a further development of models to integrate energy efficiency and MCA into policy making for small communities. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Energy%20efficiency" title="Energy efficiency">Energy efficiency</a>, <a href="https://publications.waset.org/search?q=MCA" title=" MCA"> MCA</a>, <a href="https://publications.waset.org/search?q=Scientometrics" title=" Scientometrics"> Scientometrics</a>, <a href="https://publications.waset.org/search?q=trends." title=" trends."> trends.</a> </p> <a href="https://publications.waset.org/10003794/evaluation-of-research-in-the-field-of-energy-efficiency-and-mca-methods-using-publications-databases" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10003794/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10003794/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10003794/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10003794/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10003794/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10003794/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10003794/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10003794/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10003794/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10003794/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10003794.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">1751</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Lower%20approximations&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Lower%20approximations&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Lower%20approximations&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Lower%20approximations&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Lower%20approximations&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Lower%20approximations&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Lower%20approximations&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Lower%20approximations&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Lower%20approximations&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Lower%20approximations&page=53">53</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Lower%20approximations&page=54">54</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Lower%20approximations&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>