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: IF Sets</title> <meta name="description" content="Search results for: IF Sets"> <meta name="keywords" content="IF Sets"> <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="IF Sets" 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="IF Sets"> <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> 603</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: IF Sets</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">603</span> Structure of Covering-based Rough Sets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Shiping%20Wang">Shiping Wang</a>, <a href="https://publications.waset.org/search?q=Peiyong%20Zhu"> Peiyong Zhu</a>, <a href="https://publications.waset.org/search?q=William%20Zhu"> William Zhu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Rough set theory is a very effective tool to deal with granularity and vagueness in information systems. Covering-based rough set theory is an extension of classical rough set theory. In this paper, firstly we present the characteristics of the reducible element and the minimal description covering-based rough sets through downsets. Then we establish lattices and topological spaces in coveringbased rough sets through down-sets and up-sets. In this way, one can investigate covering-based rough sets from algebraic and topological points of view.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Covering" title="Covering">Covering</a>, <a href="https://publications.waset.org/search?q=poset" title=" poset"> poset</a>, <a href="https://publications.waset.org/search?q=down-set" title=" down-set"> down-set</a>, <a href="https://publications.waset.org/search?q=lattice" title=" lattice"> lattice</a>, <a href="https://publications.waset.org/search?q=topological%20space" title=" topological space"> topological space</a>, <a href="https://publications.waset.org/search?q=topological%20base." title=" topological base."> topological base.</a> </p> <a href="https://publications.waset.org/13163/structure-of-covering-based-rough-sets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13163/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13163/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13163/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13163/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13163/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13163/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13163/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13163/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13163/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13163/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13163.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">1849</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">602</span> Regular Generalized Star Star closed sets in Bitopological Spaces</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=K.%20Kannan">K. Kannan</a>, <a href="https://publications.waset.org/search?q=D.%20Narasimhan"> D. Narasimhan</a>, <a href="https://publications.waset.org/search?q=K.%20Chandrasekhara%20Rao"> K. Chandrasekhara Rao</a>, <a href="https://publications.waset.org/search?q=R.%20Ravikumar"> R. Ravikumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The aim of this paper is to introduce the concepts of τ1τ2-regular generalized star star closed sets , τ1τ2-regular generalized star star open sets and study their basic properties in bitopological spaces.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=%CF%841%CF%842-regular%20closed%20sets" title="τ1τ2-regular closed sets">τ1τ2-regular closed sets</a>, <a href="https://publications.waset.org/search?q=%CF%841%CF%842-regular%20open%20sets" title=" τ1τ2-regular open sets"> τ1τ2-regular open sets</a>, <a href="https://publications.waset.org/search?q=%CF%841%CF%842-regular%20generalized%20closed%20sets" title=" τ1τ2-regular generalized closed sets"> τ1τ2-regular generalized closed sets</a>, <a href="https://publications.waset.org/search?q=%CF%841%CF%842-regular%20generalized%20star%0D%0Aclosed%20sets" title=" τ1τ2-regular generalized star closed sets"> τ1τ2-regular generalized star closed sets</a>, <a href="https://publications.waset.org/search?q=%CF%841%CF%842-regular%20generalized%20star%20star%20closed%20sets." title=" τ1τ2-regular generalized star star closed sets."> τ1τ2-regular generalized star star closed sets.</a> </p> <a href="https://publications.waset.org/15440/regular-generalized-star-star-closed-sets-in-bitopological-spaces" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15440/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15440/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15440/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15440/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15440/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15440/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15440/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15440/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15440/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15440/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15440.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">2212</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">601</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">600</span> On Fuzzy Weakly-Closed Sets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=J.%20Mahanta">J. Mahanta</a>, <a href="https://publications.waset.org/search?q=P.K.%20Das"> P.K. Das</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>A new class of fuzzy closed sets, namely fuzzy weakly closed set in a fuzzy topological space is introduced and it is established that this class of fuzzy closed sets lies between fuzzy closed sets and fuzzy generalized closed sets. Alongwith the study of fundamental results of such closed sets, we define and characterize fuzzy weakly compact space and fuzzy weakly closed space.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Fuzzy%20weakly-closed%20set" title="Fuzzy weakly-closed set">Fuzzy weakly-closed set</a>, <a href="https://publications.waset.org/search?q=fuzzy%20weakly-closed%0D%0Aspace" title=" fuzzy weakly-closed space"> fuzzy weakly-closed space</a>, <a href="https://publications.waset.org/search?q=fuzzy%20weakly-compactness" title=" fuzzy weakly-compactness"> fuzzy weakly-compactness</a>, <a href="https://publications.waset.org/search?q=MSC%3A%2054A40" title=" MSC: 54A40"> MSC: 54A40</a>, <a href="https://publications.waset.org/search?q=54D30." title=" 54D30."> 54D30.</a> </p> <a href="https://publications.waset.org/16774/on-fuzzy-weakly-closed-sets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/16774/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/16774/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/16774/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/16774/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/16774/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/16774/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/16774/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/16774/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/16774/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/16774/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/16774.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">1775</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">599</span> (T1, T2)*- Semi Star Generalized Locally Closed Sets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Sundararaman">M. Sundararaman</a>, <a href="https://publications.waset.org/search?q=K.%20Chandrasekhara%20Rao"> K. Chandrasekhara Rao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The aim of this paper is to continue the study of (T1, T2)-semi star generalized closed sets by introducing the concepts of (T1, T2)-semi star generalized locally closed sets and study their basic properties in bitopological spaces.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=%28T1" title="(T1">(T1</a>, <a href="https://publications.waset.org/search?q=T2%29%2A-semi%20star%20generalized%20locally%20closed%20sets" title=" T2)*-semi star generalized locally closed sets"> T2)*-semi star generalized locally closed sets</a>, <a href="https://publications.waset.org/search?q=T1T2-semi%20star%20generalized%20closed%20sets." title=" T1T2-semi star generalized closed sets."> T1T2-semi star generalized closed sets.</a> </p> <a href="https://publications.waset.org/13485/t1-t2-semi-star-generalized-locally-closed-sets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13485/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13485/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13485/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13485/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13485/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13485/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13485/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13485/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13485/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13485/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13485.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">1471</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">598</span> A New Condition for Conflicting Bifuzzy Sets Based On Intuitionistic Evaluation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Imran%20C.T.">Imran C.T.</a>, <a href="https://publications.waset.org/search?q=Syibrah%20M.N."> Syibrah M.N.</a>, <a href="https://publications.waset.org/search?q=Mohd%20Lazim%20A."> Mohd Lazim A.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fuzzy sets theory affirmed that the linguistic value for every contraries relation is complementary. It was stressed in the intuitionistic fuzzy sets (IFS) that the conditions for contraries relations, which are the fuzzy values, cannot be greater than one. However, complementary in two contradict phenomena are not always true. This paper proposes a new idea condition for conflicting bifuzzy sets by relaxing the condition of intuitionistic fuzzy sets. Here, we will critically forward examples using triangular fuzzy number in formulating a new condition for conflicting bifuzzy sets (CBFS). Evaluation of positive and negative in conflicting phenomena were calculated concurrently by relaxing the condition in IFS. The hypothetical illustration showed the applicability of the new condition in CBFS for solving non-complement contraries intuitionistic evaluation. This approach can be applied to any decision making where conflicting is very much exist. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Conflicting%20bifuzzy%20set" title="Conflicting bifuzzy set">Conflicting bifuzzy set</a>, <a href="https://publications.waset.org/search?q=conflicting%20degree" title=" conflicting degree"> conflicting degree</a>, <a href="https://publications.waset.org/search?q=fuzzy%0Asets" title=" fuzzy sets"> fuzzy sets</a>, <a href="https://publications.waset.org/search?q=fuzzy%20numbers." title=" fuzzy numbers."> fuzzy numbers.</a> </p> <a href="https://publications.waset.org/8086/a-new-condition-for-conflicting-bifuzzy-sets-based-on-intuitionistic-evaluation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8086/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8086/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8086/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8086/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8086/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8086/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8086/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8086/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8086/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8086/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8086.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">1679</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">597</span> Fuzzy Multiple Criteria Decision Making for Unmanned Combat Aircraft Selection Using Proximity Measure Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=C.%20Ardil">C. Ardil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Intuitionistic fuzzy sets (IFS), Pythagorean fuzzy sets (PyFS), Picture fuzzy sets (PFS), q-rung orthopair fuzzy sets (q-ROF), Spherical fuzzy sets (SFS), T-spherical FS, and Neutrosophic sets (NS) are reviewed as multidimensional extensions of fuzzy sets in order to more explicitly and informatively describe the opinions of decision-making experts under uncertainty. To handle operations with standard fuzzy sets (SFS), the necessary operators; weighted arithmetic mean (WAM), weighted geometric mean (WGM), and Minkowski distance function are defined. The algorithm of the proposed proximity measure method (PMM) is provided with a multiple criteria group decision making method (MCDM) for use in a standard fuzzy set environment. To demonstrate the feasibility of the proposed method, the problem of selecting the best drone for an Air Force procurement request is used. The proximity measure method (PMM) based multidimensional standard fuzzy sets (SFS) is introduced to demonstrate its use with an issue involving unmanned combat aircraft selection.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=standard%20fuzzy%20sets%20%28SFS%29" title="standard fuzzy sets (SFS)">standard fuzzy sets (SFS)</a>, <a href="https://publications.waset.org/search?q=unmanned%20combat%20aircraft%20selection" title=" unmanned combat aircraft selection"> unmanned combat aircraft selection</a>, <a href="https://publications.waset.org/search?q=multiple%20criteria%20decision%20making%20%28MCDM%29" title=" multiple criteria decision making (MCDM)"> multiple criteria decision making (MCDM)</a>, <a href="https://publications.waset.org/search?q=proximity%20measure%20method%20%28PMM%29." title=" proximity measure method (PMM)."> proximity measure method (PMM).</a> </p> <a href="https://publications.waset.org/10012991/fuzzy-multiple-criteria-decision-making-for-unmanned-combat-aircraft-selection-using-proximity-measure-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10012991/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10012991/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10012991/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10012991/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10012991/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10012991/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10012991/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10012991/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10012991/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10012991/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10012991.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">359</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">596</span> Investigations on Some Operations of Soft Sets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Xun%20Ge">Xun Ge</a>, <a href="https://publications.waset.org/search?q=Songlin%20Yang"> Songlin Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Soft set theory was initiated by Molodtsov in 1999. In the past years, this theory had been applied to many branches of mathematics, information science and computer science. In 2003, Maji et al. introduced some operations of soft sets and gave some operational rules. Recently, some of these operational rules are pointed out to be not true. Furthermore, Ali et al., in their paper, introduced and discussed some new operations of soft sets. In this paper, we further investigate these operational rules given by Maji et al. and Ali et al.. We obtain some sufficient-necessary conditions such that corresponding operational rules hold and give correct forms for some operational rules. These results will be help for us to use rightly operational rules of soft sets in research and application of soft set theory.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Soft%20sets" title="Soft sets">Soft sets</a>, <a href="https://publications.waset.org/search?q=union" title=" union"> union</a>, <a href="https://publications.waset.org/search?q=intersection" title=" intersection"> intersection</a>, <a href="https://publications.waset.org/search?q=complement." title=" complement."> complement.</a> </p> <a href="https://publications.waset.org/15505/investigations-on-some-operations-of-soft-sets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15505/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15505/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15505/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15505/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15505/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15505/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15505/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15505/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15505/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15505/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15505.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">1717</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">595</span> A Fuzzy Nonlinear Regression Model for Interval Type-2 Fuzzy Sets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=O.%20Poleshchuk">O. Poleshchuk</a>, <a href="https://publications.waset.org/search?q=E.Komarov"> E.Komarov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper presents a regression model for interval type-2 fuzzy sets based on the least squares estimation technique. Unknown coefficients are assumed to be triangular fuzzy numbers. The basic idea is to determine aggregation intervals for type-1 fuzzy sets, membership functions of whose are low membership function and upper membership function of interval type-2 fuzzy set. These aggregation intervals were called weighted intervals. Low and upper membership functions of input and output interval type-2 fuzzy sets for developed regression models are considered as piecewise linear functions.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Interval%20type-2%20fuzzy%20sets" title="Interval type-2 fuzzy sets">Interval type-2 fuzzy sets</a>, <a href="https://publications.waset.org/search?q=fuzzy%20regression" title=" fuzzy regression"> fuzzy regression</a>, <a href="https://publications.waset.org/search?q=weighted%20interval." title=" weighted interval."> weighted interval.</a> </p> <a href="https://publications.waset.org/9998347/a-fuzzy-nonlinear-regression-model-for-interval-type-2-fuzzy-sets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9998347/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9998347/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9998347/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9998347/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9998347/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9998347/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9998347/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9998347/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9998347/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9998347/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9998347.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">2218</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">594</span> Generation of Sets of Synthetic Classifiers for the Evaluation of Abstract-Level Combination Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=N.%20Greco">N. Greco</a>, <a href="https://publications.waset.org/search?q=S.%20Impedovo"> S. Impedovo</a>, <a href="https://publications.waset.org/search?q=R.Modugno"> R.Modugno</a>, <a href="https://publications.waset.org/search?q=G.%20Pirlo"> G. Pirlo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper presents a new technique for generating sets of synthetic classifiers to evaluate abstract-level combination methods. The sets differ in terms of both recognition rates of the individual classifiers and degree of similarity. For this purpose, each abstract-level classifier is considered as a random variable producing one class label as the output for an input pattern. From the initial set of classifiers, new slightly different sets are generated by applying specific operators, which are defined at the purpose. Finally, the sets of synthetic classifiers have been used to estimate the performance of combination methods for abstract-level classifiers. The experimental results demonstrate the effectiveness of the proposed approach.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Abstract-level%20Classifier" title="Abstract-level Classifier">Abstract-level Classifier</a>, <a href="https://publications.waset.org/search?q=Dempster-Shafer%20Rule" title=" Dempster-Shafer Rule"> Dempster-Shafer Rule</a>, <a href="https://publications.waset.org/search?q=Multi-expert%20Systems" title=" Multi-expert Systems"> Multi-expert Systems</a>, <a href="https://publications.waset.org/search?q=Similarity%20Index" title=" Similarity Index"> Similarity Index</a>, <a href="https://publications.waset.org/search?q=System%20Evaluation" title=" System Evaluation"> System Evaluation</a> </p> <a href="https://publications.waset.org/11212/generation-of-sets-of-synthetic-classifiers-for-the-evaluation-of-abstract-level-combination-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11212/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11212/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11212/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11212/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11212/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11212/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11212/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11212/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11212/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11212/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11212.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">1487</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">593</span> Minimal Critical Sets of Inertias for Irreducible Zero-nonzero Patterns of Order 3</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ber-Lin%20Yu">Ber-Lin Yu</a>, <a href="https://publications.waset.org/search?q=Ting-Zhu%20Huang"> Ting-Zhu Huang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>If there exists a nonempty, proper subset S of the set of all (n + 1)(n + 2)/2 inertias such that S Ôèå i(A) is sufficient for any n × n zero-nonzero pattern A to be inertially arbitrary, then S is called a critical set of inertias for zero-nonzero patterns of order n. If no proper subset of S is a critical set, then S is called a minimal critical set of inertias. In [3], Kim, Olesky and Driessche identified all minimal critical sets of inertias for 2 × 2 zero-nonzero patterns. Identifying all minimal critical sets of inertias for n × n zero-nonzero patterns with n ≥ 3 is posed as an open question in [3]. In this paper, all minimal critical sets of inertias for 3 × 3 zero-nonzero patterns are identified. It is shown that the sets {(0, 0, 3), (3, 0, 0)}, {(0, 0, 3), (0, 3, 0)}, {(0, 0, 3), (0, 1, 2)}, {(0, 0, 3), (1, 0, 2)}, {(0, 0, 3), (2, 0, 1)} and {(0, 0, 3), (0, 2, 1)} are the only minimal critical sets of inertias for 3 × 3 irreducible zerononzero patterns.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Permutation%20digraph" title="Permutation digraph">Permutation digraph</a>, <a href="https://publications.waset.org/search?q=zero-nonzero%20pattern" title=" zero-nonzero pattern"> zero-nonzero pattern</a>, <a href="https://publications.waset.org/search?q=irreducible%20pattern" title=" irreducible pattern"> irreducible pattern</a>, <a href="https://publications.waset.org/search?q=critical%20set%20of%20inertias" title=" critical set of inertias"> critical set of inertias</a>, <a href="https://publications.waset.org/search?q=inertially%20arbitrary." title=" inertially arbitrary."> inertially arbitrary.</a> </p> <a href="https://publications.waset.org/11586/minimal-critical-sets-of-inertias-for-irreducible-zero-nonzero-patterns-of-order-3" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11586/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11586/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11586/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11586/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11586/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11586/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11586/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11586/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11586/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11586/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11586.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">1237</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">592</span> Some Equalities Connected with Fuzzy Soft Matrices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=D.%20R.%20Jain">D. R. Jain</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The aim of this paper is to use matrix representation of Fuzzy soft sets for proving some equalities connected with Fuzzy soft sets based on set-operations.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Equality" title="Equality">Equality</a>, <a href="https://publications.waset.org/search?q=Fuzzy%20soft%20matrix" title=" Fuzzy soft matrix"> Fuzzy soft matrix</a>, <a href="https://publications.waset.org/search?q=Fuzzy%20soft%20sets" title=" Fuzzy soft sets"> Fuzzy soft sets</a>, <a href="https://publications.waset.org/search?q=operations." title=" operations."> operations.</a> </p> <a href="https://publications.waset.org/9999735/some-equalities-connected-with-fuzzy-soft-matrices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9999735/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9999735/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9999735/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9999735/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9999735/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9999735/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9999735/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9999735/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9999735/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9999735/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9999735.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">1782</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">591</span> A New Similarity Measure on Intuitionistic Fuzzy Sets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Binyamin%20Yusoff">Binyamin Yusoff</a>, <a href="https://publications.waset.org/search?q=Imran%20Taib"> Imran Taib</a>, <a href="https://publications.waset.org/search?q=Lazim%20Abdullah"> Lazim Abdullah</a>, <a href="https://publications.waset.org/search?q=Abd%20Fatah%20Wahab"> Abd Fatah Wahab</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Intuitionistic fuzzy sets as proposed by Atanassov, have gained much attention from past and latter researchers for applications in various fields. Similarity measures between intuitionistic fuzzy sets were developed afterwards. However, it does not cater the conflicting behavior of each element evaluated. We therefore made some modification to the similarity measure of IFS by considering conflicting concept to the model. In this paper, we concentrate on Zhang and Fu-s similarity measures for IFSs and some examples are given to validate these similarity measures. A simple modification to Zhang and Fu-s similarity measures of IFSs was proposed to find the best result according to the use of degree of indeterminacy. Finally, we mark up with the application to real decision making problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Intuitionistic%20fuzzy%20sets" title="Intuitionistic fuzzy sets">Intuitionistic fuzzy sets</a>, <a href="https://publications.waset.org/search?q=similarity%20measures" title=" similarity measures"> similarity measures</a>, <a href="https://publications.waset.org/search?q=multicriteriadecision%20making." title=" multicriteriadecision making."> multicriteriadecision making.</a> </p> <a href="https://publications.waset.org/1280/a-new-similarity-measure-on-intuitionistic-fuzzy-sets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1280/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1280/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1280/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1280/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1280/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1280/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1280/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1280/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1280/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1280/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1280.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">2847</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">590</span> Cantor Interpolating Spline to Design Electronic Mail Boxes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Adil%20Al-Rammahi">Adil Al-Rammahi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Electronic mail is very important in present time. Many researchers work for designing, improving, securing, fasting, goodness and others fields in electronic mail. This paper introduced new algorithm to use Cantor sets and cubic spline interpolating function in the electronic mail design. Cantor sets used as the area (or domain) of the mail, while spline function used for designing formula. The roots of spline function versus Cantor sets used as the controller admin. The roots calculated by the numerical Newton – Raphson's method. The result of this algorithm was promised.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cantor%20sets" title="Cantor sets">Cantor sets</a>, <a href="https://publications.waset.org/search?q=spline" title=" spline"> spline</a>, <a href="https://publications.waset.org/search?q=electronic%20mail%20design" title=" electronic mail design"> electronic mail design</a>, <a href="https://publications.waset.org/search?q=Newton%20%E2%80%93%20Raphson%27s%20method." title=" Newton – Raphson's method."> Newton – Raphson's method.</a> </p> <a href="https://publications.waset.org/9997183/cantor-interpolating-spline-to-design-electronic-mail-boxes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997183/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997183/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997183/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997183/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997183/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997183/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997183/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997183/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997183/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997183/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997183.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">1597</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">589</span> Meta Random Forests</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Praveen%20Boinee">Praveen Boinee</a>, <a href="https://publications.waset.org/search?q=Alessandro%20De%20Angelis"> Alessandro De Angelis</a>, <a href="https://publications.waset.org/search?q=Gian%20Luca%20Foresti"> Gian Luca Foresti</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Leo Breimans Random Forests (RF) is a recent development in tree based classifiers and quickly proven to be one of the most important algorithms in the machine learning literature. It has shown robust and improved results of classifications on standard data sets. Ensemble learning algorithms such as AdaBoost and Bagging have been in active research and shown improvements in classification results for several benchmarking data sets with mainly decision trees as their base classifiers. In this paper we experiment to apply these Meta learning techniques to the random forests. We experiment the working of the ensembles of random forests on the standard data sets available in UCI data sets. We compare the original random forest algorithm with their ensemble counterparts and discuss the results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Random%20Forests%20%5BRF%5D" title="Random Forests [RF]">Random Forests [RF]</a>, <a href="https://publications.waset.org/search?q=ensembles" title=" ensembles"> ensembles</a>, <a href="https://publications.waset.org/search?q=UCI." title=" UCI."> UCI.</a> </p> <a href="https://publications.waset.org/3799/meta-random-forests" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3799/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3799/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3799/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3799/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3799/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3799/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3799/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3799/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3799/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3799/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3799.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">2710</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">588</span> Some Clopen Sets in the Uniform Topology on BCI-algebras</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.%20Hasankhani">A. Hasankhani</a>, <a href="https://publications.waset.org/search?q=H.%20Saadat"> H. Saadat</a>, <a href="https://publications.waset.org/search?q=M.%20M.%20Zahedi"> M. M. Zahedi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper some properties of the uniformity topology on a BCI-algebras are discussed.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=%28Fuzzy%29%20ideal" title="(Fuzzy) ideal">(Fuzzy) ideal</a>, <a href="https://publications.waset.org/search?q=%28Fuzzy%29%20subalgebra" title=" (Fuzzy) subalgebra"> (Fuzzy) subalgebra</a>, <a href="https://publications.waset.org/search?q=Uniformity" title=" Uniformity"> Uniformity</a>, <a href="https://publications.waset.org/search?q=clopen%20sets." title=" clopen sets."> clopen sets.</a> </p> <a href="https://publications.waset.org/4851/some-clopen-sets-in-the-uniform-topology-on-bci-algebras" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4851/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4851/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4851/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4851/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4851/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4851/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4851/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4851/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4851/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4851/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4851.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">1658</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">587</span> Segmentation of Cardiac Images by the Force Field Driven Speed Term</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Renato%20Dedic">Renato Dedic</a>, <a href="https://publications.waset.org/search?q=Madjid%20Allili"> Madjid Allili</a>, <a href="https://publications.waset.org/search?q=Roger%20Lecomte"> Roger Lecomte</a>, <a href="https://publications.waset.org/search?q=Adbelhamid%20Benchakroun"> Adbelhamid Benchakroun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The class of geometric deformable models, so-called level sets, has brought tremendous impact to medical imagery. In this paper we present yet another application of level sets to medical imaging. The method we give here will in a way modify the speed term in the standard level sets equation of motion. To do so we build a potential based on the distance and the gradient of the image we study. In turn the potential gives rise to the force field: F~F(x, y) = P ∀(p,q)∈I ((x, y) - (p, q)) |ÔêçI(p,q)| |(x,y)-(p,q)| 2 . The direction and intensity of the force field at each point will determine the direction of the contour-s evolution. The images we used to test our method were produced by the Univesit'e de Sherbrooke-s PET scanners. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=PET" title="PET">PET</a>, <a href="https://publications.waset.org/search?q=Cardiac" title=" Cardiac"> Cardiac</a>, <a href="https://publications.waset.org/search?q=Heart" title=" Heart"> Heart</a>, <a href="https://publications.waset.org/search?q=Mouse" title=" Mouse"> Mouse</a>, <a href="https://publications.waset.org/search?q=Geodesic" title=" Geodesic"> Geodesic</a>, <a href="https://publications.waset.org/search?q=Geometric" title=" Geometric"> Geometric</a>, <a href="https://publications.waset.org/search?q=Level%20Sets" title=" Level Sets"> Level Sets</a>, <a href="https://publications.waset.org/search?q=Deformable%20Models" title=" Deformable Models"> Deformable Models</a>, <a href="https://publications.waset.org/search?q=Edge%20Detection" title=" Edge Detection"> Edge Detection</a>, <a href="https://publications.waset.org/search?q=Segmentation." title=" Segmentation."> Segmentation.</a> </p> <a href="https://publications.waset.org/9401/segmentation-of-cardiac-images-by-the-force-field-driven-speed-term" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9401/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9401/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9401/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9401/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9401/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9401/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9401/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9401/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9401/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9401/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9401.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">1211</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">586</span> Low Cost Chip Set Selection Algorithm for Multi-way Partitioning of Digital System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jae%20Young%20Park">Jae Young Park</a>, <a href="https://publications.waset.org/search?q=Soongyu%20Kwon"> Soongyu Kwon</a>, <a href="https://publications.waset.org/search?q=Kyu%20Han%20Kim"> Kyu Han Kim</a>, <a href="https://publications.waset.org/search?q=Hyeong%20Geon%20Lee"> Hyeong Geon Lee</a>, <a href="https://publications.waset.org/search?q=Jong%20Tae%20Kim"> Jong Tae Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper considers the problem of finding low cost chip set for a minimum cost partitioning of a large logic circuits. Chip sets are selected from a given library. Each chip in the library has a different price, area, and I/O pin. We propose a low cost chip set selection algorithm. Inputs to the algorithm are a netlist and a chip information in the library. Output is a list of chip sets satisfied with area and maximum partitioning number and it is sorted by cost. The algorithm finds the sorted list of chip sets from minimum cost to maximum cost. We used MCNC benchmark circuits for experiments. The experimental results show that all of chip sets found satisfy the multiple partitioning constraints. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=lowest%20cost%20chip%20set" title="lowest cost chip set">lowest cost chip set</a>, <a href="https://publications.waset.org/search?q=MCNC%20benchmark" title=" MCNC benchmark"> MCNC benchmark</a>, <a href="https://publications.waset.org/search?q=multi-way%0Apartitioning." title=" multi-way partitioning."> multi-way partitioning.</a> </p> <a href="https://publications.waset.org/7406/low-cost-chip-set-selection-algorithm-for-multi-way-partitioning-of-digital-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7406/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7406/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7406/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7406/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7406/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7406/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7406/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7406/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7406/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7406/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7406.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">1503</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">585</span> A New Objective Weight on Interval Type-2 Fuzzy Sets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nurnadiah%20Z.">Nurnadiah Z.</a>, <a href="https://publications.waset.org/search?q=Lazim%20A."> Lazim A.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The design of weight is one of the important parts in fuzzy decision making, as it would have a deep effect on the evaluation results. Entropy is one of the weight measure based on objective evaluation. Non--probabilistic-type entropy measures for fuzzy set and interval type-2 fuzzy sets (IT2FS) have been developed and applied to weight measure. Since the entropy for (IT2FS) for decision making yet to be explored, this paper proposes a new objective weight method by using entropy weight method for multiple attribute decision making (MADM). This paper utilizes the nature of IT2FS concept in the evaluation process to assess the attribute weight based on the credibility of data. An example was presented to demonstrate the feasibility of the new method in decision making. The entropy measure of interval type-2 fuzzy sets yield flexible judgment and could be applied in decision making environment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Objective%20weight" title="Objective weight">Objective weight</a>, <a href="https://publications.waset.org/search?q=entropy%20weight" title=" entropy weight"> entropy weight</a>, <a href="https://publications.waset.org/search?q=multiple%20attributedecision%20making" title=" multiple attributedecision making"> multiple attributedecision making</a>, <a href="https://publications.waset.org/search?q=type-2%20fuzzy%20sets" title=" type-2 fuzzy sets"> type-2 fuzzy sets</a>, <a href="https://publications.waset.org/search?q=interval%20type-2%20fuzzy%20sets" title=" interval type-2 fuzzy sets"> interval type-2 fuzzy sets</a> </p> <a href="https://publications.waset.org/6678/a-new-objective-weight-on-interval-type-2-fuzzy-sets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6678/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6678/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6678/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6678/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6678/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6678/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6678/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6678/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6678/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6678/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6678.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">1660</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">584</span> Comparative Study of Intuitionistic and Generalized Neutrosophic Soft Sets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Debabrata%20Mandal">Debabrata Mandal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The aim of this paper is to define several operations such as Intersection, Union, OR, AND operations of intuitionistic (resp. generalized) neutrosophic soft sets in the sense of Maji and compare these with intuitionistic (resp. generalized) neutrosophic soft sets in the sense of Said et al via examples. At the end of the paper, a new concept - extension is introduced, which can be used to refine our choices in case of decision making.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=AND" title="AND">AND</a>, <a href="https://publications.waset.org/search?q=OR" title=" OR"> OR</a>, <a href="https://publications.waset.org/search?q=Union" title=" Union"> Union</a>, <a href="https://publications.waset.org/search?q=Intersection" title=" Intersection"> Intersection</a>, <a href="https://publications.waset.org/search?q=Extension" title=" Extension"> Extension</a>, <a href="https://publications.waset.org/search?q=Decision%0D%0Amaking." title=" Decision making."> Decision making.</a> </p> <a href="https://publications.waset.org/10001135/comparative-study-of-intuitionistic-and-generalized-neutrosophic-soft-sets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10001135/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10001135/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10001135/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10001135/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10001135/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10001135/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10001135/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10001135/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10001135/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10001135/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10001135.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">1697</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">583</span> Uncertainty Multiple Criteria Decision Making Analysis for Stealth Combat Aircraft Selection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=C.%20Ardil">C. Ardil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Fuzzy set theory and its extensions (intuitionistic fuzzy sets, picture fuzzy sets, and neutrosophic sets) have been widely used to address imprecision and uncertainty in complex decision-making. However, they may struggle with inherent indeterminacy and inconsistency in real-world situations. This study introduces uncertainty sets as a promising alternative, offering a structured framework for incorporating both types of uncertainty into decision-making processes.This work explores the theoretical foundations and applications of uncertainty sets. A novel decision-making algorithm based on uncertainty set-based proximity measures is developed and demonstrated through a practical application: selecting the most suitable stealth combat aircraft. </p><p>The results highlight the effectiveness of uncertainty sets in ranking alternatives under uncertainty. Uncertainty sets offer several advantages, including structured uncertainty representation, robust ranking mechanisms, and enhanced decision-making capabilities due to their ability to account for ambiguity.Future research directions are also outlined, including <span style="background-color: initial;">comparative analysis with existing MCDM methods under uncertainty, sensitivity analysis to assess the robustness of rankings,</span><span style="background-color: initial;">and broader application to various MCDM problems with diverse complexities. By exploring these avenues, uncertainty sets can be </span><span style="background-color: initial;">further established as a valuable tool for navigating uncertainty in complex decision-making scenarios.</span></p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Uncertainty%20set" title="Uncertainty set">Uncertainty set</a>, <a href="https://publications.waset.org/search?q=stealth%20combat%20aircraft%20selection%20multiple%20criteria%20decision-making%20analysis" title=" stealth combat aircraft selection multiple criteria decision-making analysis"> stealth combat aircraft selection multiple criteria decision-making analysis</a>, <a href="https://publications.waset.org/search?q=MCDM" title=" MCDM"> MCDM</a>, <a href="https://publications.waset.org/search?q=uncertainty%20proximity%20analysis" title=" uncertainty proximity analysis"> uncertainty proximity analysis</a> </p> <a href="https://publications.waset.org/10013592/uncertainty-multiple-criteria-decision-making-analysis-for-stealth-combat-aircraft-selection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10013592/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10013592/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10013592/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10013592/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10013592/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10013592/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10013592/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10013592/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10013592/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10013592/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10013592.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">186</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">582</span> 3D Brain Tumor Segmentation Using Level-Sets Method and Meshes Simplification from Volumetric MR Images</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=K.%20Aloui">K. Aloui</a>, <a href="https://publications.waset.org/search?q=M.%20S.%20Naceur"> M. S. Naceur</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The main objective of this paper is to provide an efficient tool for delineating brain tumors in three-dimensional magnetic resonance images. To achieve this goal, we use basically a level-sets approach to delineating three-dimensional brain tumors. Then we introduce a compression plan of 3D brain structures based for the meshes simplification, adapted for time to the specific needs of the telemedicine and to the capacities restricted by network communication. We present here the main stages of our system, and preliminary results which are very encouraging for clinical practice.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Medical%20imaging" title="Medical imaging">Medical imaging</a>, <a href="https://publications.waset.org/search?q=level-sets" title=" level-sets"> level-sets</a>, <a href="https://publications.waset.org/search?q=compression" title=" compression"> compression</a>, <a href="https://publications.waset.org/search?q=meshess%20implification" title=" meshess implification"> meshess implification</a>, <a href="https://publications.waset.org/search?q=telemedicine." title=" telemedicine."> telemedicine.</a> </p> <a href="https://publications.waset.org/13762/3d-brain-tumor-segmentation-using-level-sets-method-and-meshes-simplification-from-volumetric-mr-images" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13762/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13762/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13762/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13762/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13762/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13762/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13762/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13762/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13762/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13762/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13762.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">2133</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">581</span> Imputation Technique for Feature Selection in Microarray Data Set</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Younies%20Mahmoud">Younies Mahmoud</a>, <a href="https://publications.waset.org/search?q=Mai%20Mabrouk"> Mai Mabrouk</a>, <a href="https://publications.waset.org/search?q=Elsayed%20Sallam"> Elsayed Sallam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Analyzing DNA microarray data sets is a great challenge, which faces the bioinformaticians due to the complication of using statistical and machine learning techniques. The challenge will be doubled if the microarray data sets contain missing data, which happens regularly because these techniques cannot deal with missing data. One of the most important data analysis process on the microarray data set is feature selection. This process finds the most important genes that affect certain disease. In this paper, we introduce a technique for imputing the missing data in microarray data sets while performing feature selection.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=DNA%20microarray" title="DNA microarray">DNA microarray</a>, <a href="https://publications.waset.org/search?q=feature%20selection" title=" feature selection"> feature selection</a>, <a href="https://publications.waset.org/search?q=missing%20data" title=" missing data"> missing data</a>, <a href="https://publications.waset.org/search?q=bioinformatics." title=" bioinformatics."> bioinformatics.</a> </p> <a href="https://publications.waset.org/10000619/imputation-technique-for-feature-selection-in-microarray-data-set" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10000619/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10000619/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10000619/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10000619/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10000619/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10000619/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10000619/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10000619/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10000619/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10000619/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10000619.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">2791</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">580</span> Standard Fuzzy Sets for Aircraft Selection using Multiple Criteria Decision Making Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=C.%20Ardil">C. Ardil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This study uses two-dimensional standard fuzzy sets to enhance multiple criteria decision-making analysis for passenger aircraft selection, allowing decision-makers to express judgments with uncertain and vague information. Using two-dimensional fuzzy numbers, three decision makers evaluated three aircraft alternatives according to seven decision criteria. A validity analysis based on two-dimensional standard fuzzy weighted geometric (SFWG) and two-dimensional standard fuzzy weighted average (SFGA) operators is conducted to test the proposed approach's robustness and effectiveness in the fuzzy multiple criteria decision making (MCDM) evaluation process. </p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Standard%20fuzzy%20sets%20%28SFSs%29" title="Standard fuzzy sets (SFSs)">Standard fuzzy sets (SFSs)</a>, <a href="https://publications.waset.org/search?q=aircraft%20selection" title=" aircraft selection"> aircraft selection</a>, <a href="https://publications.waset.org/search?q=multiple%20criteria%20decision%20making" title=" multiple criteria decision making"> multiple criteria decision making</a>, <a href="https://publications.waset.org/search?q=intuitionistic%20fuzzy%20sets%20%28IFSs%29" title=" intuitionistic fuzzy sets (IFSs)"> intuitionistic fuzzy sets (IFSs)</a>, <a href="https://publications.waset.org/search?q=SFWG" title=" SFWG"> SFWG</a>, <a href="https://publications.waset.org/search?q=SFGA" title=" SFGA"> SFGA</a>, <a href="https://publications.waset.org/search?q=MCDM" title=" MCDM"> MCDM</a> </p> <a href="https://publications.waset.org/10013062/standard-fuzzy-sets-for-aircraft-selection-using-multiple-criteria-decision-making-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10013062/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10013062/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10013062/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10013062/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10013062/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10013062/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10013062/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10013062/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10013062/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10013062/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10013062.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">391</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">579</span> A Note on the Minimum Cardinality of Critical Sets of Inertias for Irreducible Zero-nonzero Patterns of Order 4</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ber-Lin%20Yu">Ber-Lin Yu</a>, <a href="https://publications.waset.org/search?q=Ting-Zhu%20Huang"> Ting-Zhu Huang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>If there exists a nonempty, proper subset S of the set of all (n+1)(n+2)/2 inertias such that S Ôèå i(A) is sufficient for any n×n zero-nonzero pattern A to be inertially arbitrary, then S is called a critical set of inertias for zero-nonzero patterns of order n. If no proper subset of S is a critical set, then S is called a minimal critical set of inertias. In [Kim, Olesky and Driessche, Critical sets of inertias for matrix patterns, Linear and Multilinear Algebra, 57 (3) (2009) 293-306], identifying all minimal critical sets of inertias for n×n zero-nonzero patterns with n ≥ 3 and the minimum cardinality of such a set are posed as two open questions by Kim, Olesky and Driessche. In this note, the minimum cardinality of all critical sets of inertias for 4 × 4 irreducible zero-nonzero patterns is identified.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Zero-nonzero%20pattern" title="Zero-nonzero pattern">Zero-nonzero pattern</a>, <a href="https://publications.waset.org/search?q=inertia" title=" inertia"> inertia</a>, <a href="https://publications.waset.org/search?q=critical%20set%20of%20inertias" title=" critical set of inertias"> critical set of inertias</a>, <a href="https://publications.waset.org/search?q=inertially%20arbitrary." title=" inertially arbitrary."> inertially arbitrary.</a> </p> <a href="https://publications.waset.org/10461/a-note-on-the-minimum-cardinality-of-critical-sets-of-inertias-for-irreducible-zero-nonzero-patterns-of-order-4" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10461/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10461/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10461/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10461/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10461/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10461/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10461/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10461/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10461/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10461/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10461.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">1198</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">578</span> Multi-labeled Data Expressed by a Set of Labels</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Tetsuya%20Furukawa">Tetsuya Furukawa</a>, <a href="https://publications.waset.org/search?q=Masahiro%20Kuzunishi"> Masahiro Kuzunishi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Collected data must be organized to be utilized efficiently, and hierarchical classification of data is efficient approach to organize data. When data is classified to multiple categories or annotated with a set of labels, users request multi-labeled data by giving a set of labels. There are several interpretations of the data expressed by a set of labels. This paper discusses which data is expressed by a set of labels by introducing orders for sets of labels and shows that there are four types of orders, which are characterized by whether the labels of expressed data includes every label of the given set of labels within the range of the set. Desirable properties of the orders, data is also expressed by the higher set of labels and different sets of labels express different data, are discussed for the orders.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Classification%20Hierarchies" title="Classification Hierarchies">Classification Hierarchies</a>, <a href="https://publications.waset.org/search?q=Multi-labeled%20Data" title=" Multi-labeled Data"> Multi-labeled Data</a>, <a href="https://publications.waset.org/search?q=Multiple%20Classificaiton" title=" Multiple Classificaiton"> Multiple Classificaiton</a>, <a href="https://publications.waset.org/search?q=Orders%20of%20Sets%20of%20Labels" title=" Orders of Sets of Labels"> Orders of Sets of Labels</a> </p> <a href="https://publications.waset.org/8262/multi-labeled-data-expressed-by-a-set-of-labels" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8262/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8262/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8262/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8262/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8262/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8262/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8262/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8262/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8262/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8262/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8262.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">1304</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">577</span> Heterogeneous Attribute Reduction in Noisy System based on a Generalized Neighborhood Rough Sets Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Siyuan%20Jing">Siyuan Jing</a>, <a href="https://publications.waset.org/search?q=Kun%20She"> Kun She</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Neighborhood Rough Sets (NRS) has been proven to be an efficient tool for heterogeneous attribute reduction. However, most of researches are focused on dealing with complete and noiseless data. Factually, most of the information systems are noisy, namely, filled with incomplete data and inconsistent data. In this paper, we introduce a generalized neighborhood rough sets model, called VPTNRS, to deal with the problem of heterogeneous attribute reduction in noisy system. We generalize classical NRS model with tolerance neighborhood relation and the probabilistic theory. Furthermore, we use the neighborhood dependency to evaluate the significance of a subset of heterogeneous attributes and construct a forward greedy algorithm for attribute reduction based on it. Experimental results show that the model is efficient to deal with noisy data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=attribute%20reduction" title="attribute reduction">attribute reduction</a>, <a href="https://publications.waset.org/search?q=incomplete%20data" title=" incomplete data"> incomplete data</a>, <a href="https://publications.waset.org/search?q=inconsistent%20data" title=" inconsistent data"> inconsistent data</a>, <a href="https://publications.waset.org/search?q=tolerance%20neighborhood%20relation" title="tolerance neighborhood relation">tolerance neighborhood relation</a>, <a href="https://publications.waset.org/search?q=rough%20sets" title=" rough sets"> rough sets</a> </p> <a href="https://publications.waset.org/7597/heterogeneous-attribute-reduction-in-noisy-system-based-on-a-generalized-neighborhood-rough-sets-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7597/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7597/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7597/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7597/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7597/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7597/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7597/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7597/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7597/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7597/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7597.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">1588</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">576</span> Piecewise Interpolation Filter for Effective Processing of Large Signal Sets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Anatoli%20Torokhti">Anatoli Torokhti</a>, <a href="https://publications.waset.org/search?q=Stanley%20Miklavcic"> Stanley Miklavcic</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Suppose KY and KX are large sets of observed and reference signals, respectively, each containing N signals. Is it possible to construct a filter F : KY → KX that requires a priori information only on few signals, p N, from KX but performs better than the known filters based on a priori information on every reference signal from KX? It is shown that the positive answer is achievable under quite unrestrictive assumptions. The device behind the proposed method is based on a special extension of the piecewise linear interpolation technique to the case of random signal sets. The proposed technique provides a single filter to process any signal from the arbitrarily large signal set. The filter is determined in terms of pseudo-inverse matrices so that it always exists. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Wiener%20filter" title="Wiener filter">Wiener filter</a>, <a href="https://publications.waset.org/search?q=filtering%20of%20stochastic%20signals." title=" filtering of stochastic signals."> filtering of stochastic signals.</a> </p> <a href="https://publications.waset.org/12739/piecewise-interpolation-filter-for-effective-processing-of-large-signal-sets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12739/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12739/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12739/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12739/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12739/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12739/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12739/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12739/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12739/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12739/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12739.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">1412</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">575</span> Medical Image Segmentation Using Deformable Model and Local Fitting Binary: Thoracic Aorta</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=B.%20Bagheri%20Nakhjavanlo">B. Bagheri Nakhjavanlo</a>, <a href="https://publications.waset.org/search?q=T.%20S.%20Ellis"> T. S. Ellis</a>, <a href="https://publications.waset.org/search?q=P.Raoofi"> P.Raoofi</a>, <a href="https://publications.waset.org/search?q=Sh.ziari"> Sh.ziari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an application of level sets for the segmentation of abdominal and thoracic aortic aneurysms in CTA datasets. An important challenge in reliably detecting aortic is the need to overcome problems associated with intensity inhomogeneities. Level sets are part of an important class of methods that utilize partial differential equations (PDEs) and have been extensively applied in image segmentation. A kernel function in the level set formulation aids the suppression of noise in the extracted regions of interest and then guides the motion of the evolving contour for the detection of weak boundaries. The speed of curve evolution has been significantly improved with a resulting decrease in segmentation time compared with previous implementations of level sets, and are shown to be more effective than other approaches in coping with intensity inhomogeneities. We have applied the Courant Friedrichs Levy (CFL) condition as stability criterion for our algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Image%20segmentation" title="Image segmentation">Image segmentation</a>, <a href="https://publications.waset.org/search?q=Level-sets" title=" Level-sets"> Level-sets</a>, <a href="https://publications.waset.org/search?q=Local%20fitting%20binary" title=" Local fitting binary"> Local fitting binary</a>, <a href="https://publications.waset.org/search?q=Thoracic%20aorta." title=" Thoracic aorta."> Thoracic aorta.</a> </p> <a href="https://publications.waset.org/4023/medical-image-segmentation-using-deformable-model-and-local-fitting-binary-thoracic-aorta" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4023/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4023/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4023/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4023/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4023/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4023/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4023/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4023/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4023/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4023/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4023.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">1456</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">574</span> Holomorphic Prioritization of Sets within Decagram of Strategic Decision Making of POSM Using Operational Research (OR): Analytic Hierarchy Process (AHP) Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Elias%20O.%20Tembe">Elias O. Tembe</a>, <a href="https://publications.waset.org/search?q=Hussain%20A.%20Al-Salamin"> Hussain A. Al-Salamin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>There is decagram of strategic decisions of operations and production/service management (POSM) within operational research (OR) which must collate, namely: design, inventory, quality, location, process and capacity, layout, scheduling, maintain ace, and supply chain. This paper presents an architectural configuration conceptual framework of a decagram of sets decisions in a form of mathematical complete graph and abelian graph. Mathematically, a complete graph is undirected (UDG), and directed (DG) a relationship where every pair of vertices is connected, collated, confluent, and holomorphic. There has not been any study conducted which, however, prioritizes the holomorphic sets which of POMS within OR field of study. The study utilizes OR structured technique known as The Analytic Hierarchy Process (AHP) analysis for organizing, sorting and prioritizing(ranking) the sets within the decagram of POMS according to their attribution (propensity), and provides an analysis how the prioritization has real-world application within the 21st century.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=AHP%20analysis" title="AHP analysis">AHP analysis</a>, <a href="https://publications.waset.org/search?q=Decagram" title=" Decagram"> Decagram</a>, <a href="https://publications.waset.org/search?q=Decagon" title=" Decagon"> Decagon</a>, <a href="https://publications.waset.org/search?q=Holomorphic." title=" Holomorphic."> Holomorphic.</a> </p> <a href="https://publications.waset.org/10000335/holomorphic-prioritization-of-sets-within-decagram-of-strategic-decision-making-of-posm-using-operational-research-or-analytic-hierarchy-process-ahp-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10000335/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10000335/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10000335/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10000335/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10000335/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10000335/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10000335/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10000335/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10000335/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10000335/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10000335.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">2000</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=IF%20Sets&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=IF%20Sets&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=IF%20Sets&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=IF%20Sets&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=IF%20Sets&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=IF%20Sets&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=IF%20Sets&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=IF%20Sets&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=IF%20Sets&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=IF%20Sets&page=20">20</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=IF%20Sets&page=21">21</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=IF%20Sets&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>