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: random finite sets</title> <meta name="description" content="Search results for: random finite sets"> <meta name="keywords" content="random finite 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="random finite 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="random finite 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> 2692</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: random finite sets</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2692</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">2711</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">2691</span> Gaussian Particle Flow Bernoulli Filter for Single Target Tracking</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hyeongbok%20Kim">Hyeongbok Kim</a>, <a href="https://publications.waset.org/search?q=Lingling%20Zhao"> Lingling Zhao</a>, <a href="https://publications.waset.org/search?q=Xiaohong%20Su"> Xiaohong Su</a>, <a href="https://publications.waset.org/search?q=Junjie%20Wang"> Junjie Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The Bernoulli filter is a precise Bayesian filter for single target tracking based on the random finite set theory. The standard Bernoulli filter often underestimates the number of the targets. This study proposes a Gaussian particle flow (GPF) Bernoulli filter employing particle flow to migrate particles from prior to posterior positions to improve the performance of the standard Bernoulli filter. By employing the particle flow filter, the computational speed of the Bernoulli filters is significantly improved. In addition, the GPF Bernoulli filter provides more accurate estimation compared with that of the standard Bernoulli filter. Simulation results confirm the improved tracking performance and computational speed in two- and three-dimensional scenarios compared with other algorithms.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Bernoulli%20filter" title="Bernoulli filter">Bernoulli filter</a>, <a href="https://publications.waset.org/search?q=particle%20filter" title=" particle filter"> particle filter</a>, <a href="https://publications.waset.org/search?q=particle%20flow%20filter" title=" particle flow filter"> particle flow filter</a>, <a href="https://publications.waset.org/search?q=random%20finite%20sets" title=" random finite sets"> random finite sets</a>, <a href="https://publications.waset.org/search?q=target%20tracking." title=" target tracking."> target tracking.</a> </p> <a href="https://publications.waset.org/10013110/gaussian-particle-flow-bernoulli-filter-for-single-target-tracking" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10013110/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10013110/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10013110/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10013110/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10013110/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10013110/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10013110/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10013110/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10013110/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10013110/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10013110.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">345</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">2690</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">2689</span> Research on the Predict Method of Random Vibration Cumulative Fatigue Damage Life Based on the Finite Element Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Wang%20Chengcheng">Wang Chengcheng</a>, <a href="https://publications.waset.org/search?q=Li%20Chuanri"> Li Chuanri</a>, <a href="https://publications.waset.org/search?q=Xu%20Fei"> Xu Fei</a>, <a href="https://publications.waset.org/search?q=Guo%20Ying"> Guo Ying</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Aiming at most of the aviation products are facing the problem of fatigue fracture in vibration environment, we makes use of the testing result of a bracket, analysis for the structure with ANSYS-Workbench, predict the life of the bracket by different ways, and compared with the testing result. With the research on analysis methods, make an organic combination of simulation analysis and testing, Not only ensure the accuracy of simulation analysis and life predict, but also make a dynamic supervision of product life process, promote the application of finite element simulation analysis in engineering practice.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Random%20vibration" title="Random vibration">Random vibration</a>, <a href="https://publications.waset.org/search?q=finite%20element%20simulation" title=" finite element simulation"> finite element simulation</a>, <a href="https://publications.waset.org/search?q=fatigue" title=" fatigue"> fatigue</a>, <a href="https://publications.waset.org/search?q=frequency%20domain." title=" frequency domain."> frequency domain.</a> </p> <a href="https://publications.waset.org/5759/research-on-the-predict-method-of-random-vibration-cumulative-fatigue-damage-life-based-on-the-finite-element-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5759/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5759/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5759/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5759/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5759/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5759/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5759/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5759/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5759/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5759/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5759.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">4710</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">2688</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">2687</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">2686</span> Ensembling Classifiers – An Application toImage Data Classification from Cherenkov Telescope Experiment</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> 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 with classifiers such as random forests, neural networks and support vector machines. The data sets are from MAGIC, a Cherenkov telescope experiment. The task is to classify gamma signals from overwhelmingly hadron and muon signals representing a rare class classification problem. We compare the individual classifiers with their ensemble counterparts and discuss the results. WEKA a wonderful tool for machine learning has been used for making the experiments. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Ensembles" title="Ensembles">Ensembles</a>, <a href="https://publications.waset.org/search?q=WEKA" title=" WEKA"> WEKA</a>, <a href="https://publications.waset.org/search?q=Neural%20networks%20%5BNN%5D" title=" Neural networks [NN]"> Neural networks [NN]</a>, <a href="https://publications.waset.org/search?q=SupportVector%20Machines%20%5BSVM%5D" title=" SupportVector Machines [SVM]"> SupportVector Machines [SVM]</a>, <a href="https://publications.waset.org/search?q=Random%20Forests%20%5BRF%5D." title=" Random Forests [RF]."> Random Forests [RF].</a> </p> <a href="https://publications.waset.org/8462/ensembling-classifiers-an-application-toimage-data-classification-from-cherenkov-telescope-experiment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8462/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8462/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8462/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8462/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8462/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8462/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8462/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8462/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8462/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8462/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8462.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">1765</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">2685</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">2684</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">2683</span> Evolutionary Training of Hybrid Systems of Recurrent Neural Networks and Hidden Markov Models</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Rohitash%20Chandra">Rohitash Chandra</a>, <a href="https://publications.waset.org/search?q=Christian%20W.%20Omlin"> Christian W. Omlin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present a hybrid architecture of recurrent neural networks (RNNs) inspired by hidden Markov models (HMMs). We train the hybrid architecture using genetic algorithms to learn and represent dynamical systems. We train the hybrid architecture on a set of deterministic finite-state automata strings and observe the generalization performance of the hybrid architecture when presented with a new set of strings which were not present in the training data set. In this way, we show that the hybrid system of HMM and RNN can learn and represent deterministic finite-state automata. We ran experiments with different sets of population sizes in the genetic algorithm; we also ran experiments to find out which weight initializations were best for training the hybrid architecture. The results show that the hybrid architecture of recurrent neural networks inspired by hidden Markov models can train and represent dynamical systems. The best training and generalization performance is achieved when the hybrid architecture is initialized with random real weight values of range -15 to 15. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Deterministic%20finite-state%20automata" title="Deterministic finite-state automata">Deterministic finite-state automata</a>, <a href="https://publications.waset.org/search?q=genetic%0Aalgorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/search?q=hidden%20Markov%20models" title=" hidden Markov models"> hidden Markov models</a>, <a href="https://publications.waset.org/search?q=hybrid%20systems%20and%20recurrent%0Aneural%20networks." title=" hybrid systems and recurrent neural networks."> hybrid systems and recurrent neural networks.</a> </p> <a href="https://publications.waset.org/12598/evolutionary-training-of-hybrid-systems-of-recurrent-neural-networks-and-hidden-markov-models" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12598/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12598/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12598/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12598/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12598/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12598/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12598/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12598/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12598/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12598/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12598.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">1890</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">2682</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">2681</span> The Giant Component in a Random Subgraph of a Weak Expander</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yilun%20Shang">Yilun Shang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we investigate the appearance of the giant component in random subgraphs G(p) of a given large finite graph family Gn = (Vn, En) in which each edge is present independently with probability p. We show that if the graph Gn satisfies a weak isoperimetric inequality and has bounded degree, then the probability p under which G(p) has a giant component of linear order with some constant probability is bounded away from zero and one. In addition, we prove the probability of abnormally large order of the giant component decays exponentially. When a contact graph is modeled as Gn, our result is of special interest in the study of the spread of infectious diseases or the identification of community in various social networks.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=subgraph" title="subgraph">subgraph</a>, <a href="https://publications.waset.org/search?q=expander" title=" expander"> expander</a>, <a href="https://publications.waset.org/search?q=random%20graph" title=" random graph"> random graph</a>, <a href="https://publications.waset.org/search?q=giant%20component" title=" giant component"> giant component</a>, <a href="https://publications.waset.org/search?q=percolation." title=" percolation."> percolation.</a> </p> <a href="https://publications.waset.org/8522/the-giant-component-in-a-random-subgraph-of-a-weak-expander" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8522/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8522/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8522/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8522/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8522/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8522/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8522/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8522/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8522/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8522/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8522.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">2680</span> Region Based Hidden Markov Random Field Model for Brain MR Image Segmentation </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Terrence%20Chen">Terrence Chen</a>, <a href="https://publications.waset.org/search?q=Thomas%20S.%20Huang"> Thomas S. Huang </a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present the region based hidden Markov random field model (RBHMRF), which encodes the characteristics of different brain regions into a probabilistic framework for brain MR image segmentation. The recently proposed TV+L1 model is used for region extraction. By utilizing different spatial characteristics in different brain regions, the RMHMRF model performs beyond the current state-of-the-art method, the hidden Markov random field model (HMRF), which uses identical spatial information throughout the whole brain. Experiments on both real and synthetic 3D MR images show that the segmentation result of the proposed method has higher accuracy compared to existing algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Finite%20Gaussian%20mixture%20model" title="Finite Gaussian mixture model">Finite Gaussian mixture model</a>, <a href="https://publications.waset.org/search?q=Hidden%20Markov%0Arandom%20field%20model" title=" Hidden Markov random field model"> Hidden Markov random field model</a>, <a href="https://publications.waset.org/search?q=image%20segmentation" title=" image segmentation"> image segmentation</a>, <a href="https://publications.waset.org/search?q=MRI." title=" MRI."> MRI.</a> </p> <a href="https://publications.waset.org/6519/region-based-hidden-markov-random-field-model-for-brain-mr-image-segmentation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6519/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6519/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6519/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6519/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6519/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6519/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6519/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6519/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6519/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6519/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6519.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">2102</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">2679</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">2678</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">1680</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">2677</span> On Finite Hjelmslev Planes of Parameters (pk−1, p)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Atilla%20Akpinar">Atilla Akpinar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we study on finite projective Hjelmslev planes M(Zq) coordinatized by Hjelmslev ring Zq (where prime power q = pk). We obtain finite hyperbolic Klingenberg planes from these planes under certain conditions. Also, we give a combinatorical result on M(Zq), related by deleting a line from lines in same neighbour.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Finite%20Klingenberg%20plane" title="Finite Klingenberg plane">Finite Klingenberg plane</a>, <a href="https://publications.waset.org/search?q=finite%20hyperbolic%20Klingenberg%20plane." title=" finite hyperbolic Klingenberg plane."> finite hyperbolic Klingenberg plane.</a> </p> <a href="https://publications.waset.org/14775/on-finite-hjelmslev-planes-of-parameters-pk1-p" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14775/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14775/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14775/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14775/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14775/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14775/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14775/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14775/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14775/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14775/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14775.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">1147</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">2676</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">360</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">2675</span> Stochastic Model Predictive Control for Linear Discrete-Time Systems with Random Dither Quantization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Tomoaki%20Hashimoto">Tomoaki Hashimoto</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, feedback control systems using random dither quantizers have been proposed for linear discrete-time systems. However, the constraints imposed on state and control variables have not yet been taken into account for the design of feedback control systems with random dither quantization. Model predictive control is a kind of optimal feedback control in which control performance over a finite future is optimized with a performance index that has a moving initial and terminal time. An important advantage of model predictive control is its ability to handle constraints imposed on state and control variables. Based on the model predictive control approach, the objective of this paper is to present a control method that satisfies probabilistic state constraints for linear discrete-time feedback control systems with random dither quantization. In other words, this paper provides a method for solving the optimal control problems subject to probabilistic state constraints for linear discrete-time feedback control systems with random dither quantization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Optimal%20control" title="Optimal control">Optimal control</a>, <a href="https://publications.waset.org/search?q=stochastic%20systems" title=" stochastic systems"> stochastic systems</a>, <a href="https://publications.waset.org/search?q=discrete-time%0D%0Asystems" title=" discrete-time systems"> discrete-time systems</a>, <a href="https://publications.waset.org/search?q=probabilistic%20constraints" title=" probabilistic constraints"> probabilistic constraints</a>, <a href="https://publications.waset.org/search?q=random%20dither%20quantization." title=" random dither quantization."> random dither quantization.</a> </p> <a href="https://publications.waset.org/10006341/stochastic-model-predictive-control-for-linear-discrete-time-systems-with-random-dither-quantization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10006341/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10006341/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10006341/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10006341/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10006341/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10006341/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10006341/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10006341/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10006341/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10006341/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10006341.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">1155</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">2674</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">2673</span> A Very Efficient Pseudo-Random Number Generator Based On Chaotic Maps and S-Box Tables</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Hamdi">M. Hamdi</a>, <a href="https://publications.waset.org/search?q=R.%20Rhouma"> R. Rhouma</a>, <a href="https://publications.waset.org/search?q=S.%20Belghith"> S. Belghith</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Generating random numbers are mainly used to create secret keys or random sequences. It can be carried out by various techniques. In this paper we present a very simple and efficient pseudo random number generator (PRNG) based on chaotic maps and S-Box tables. This technique adopted two main operations one to generate chaotic values using two logistic maps and the second to transform them into binary words using random S-Box tables. The simulation analysis indicates that our PRNG possessing excellent statistical and cryptographic properties.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Chaotic%20map" title="Chaotic map">Chaotic map</a>, <a href="https://publications.waset.org/search?q=Cryptography" title=" Cryptography"> Cryptography</a>, <a href="https://publications.waset.org/search?q=Random%20Numbers" title=" Random Numbers"> Random Numbers</a>, <a href="https://publications.waset.org/search?q=Statistical%20tests" title=" Statistical tests"> Statistical tests</a>, <a href="https://publications.waset.org/search?q=S-box." title=" S-box."> S-box.</a> </p> <a href="https://publications.waset.org/10001089/a-very-efficient-pseudo-random-number-generator-based-on-chaotic-maps-and-s-box-tables" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10001089/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10001089/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10001089/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10001089/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10001089/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10001089/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10001089/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10001089/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10001089/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10001089/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10001089.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">3867</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">2672</span> Some Application of Random Fuzzy Queueing System Based On Fuzzy Simulation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Behrouz%20Fathi-Vajargah">Behrouz Fathi-Vajargah</a>, <a href="https://publications.waset.org/search?q=Sara%20Ghasemalipour"> Sara Ghasemalipour</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper studies a random fuzzy queueing system that the interarrival times of customers arriving at the server and the service times are independent and identically distributed random fuzzy variables. We match the random fuzzy queueing system with the random fuzzy alternating renewal process and we do not use from α-pessimistic and α-optimistic values to estimate the average chance of the event ”random fuzzy queueing system is busy at time t”, we employ the fuzzy simulation method in practical applications. Some theorem is proved and finally we solve a numerical example with fuzzy simulation method.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Random%20fuzzy%20variables" title="Random fuzzy variables">Random fuzzy variables</a>, <a href="https://publications.waset.org/search?q=Fuzzy%20simulation" title=" Fuzzy simulation"> Fuzzy simulation</a>, <a href="https://publications.waset.org/search?q=Queueing%0D%0Asystem" title=" Queueing system"> Queueing system</a>, <a href="https://publications.waset.org/search?q=Interarrival%20times." title=" Interarrival times."> Interarrival times.</a> </p> <a href="https://publications.waset.org/9997864/some-application-of-random-fuzzy-queueing-system-based-on-fuzzy-simulation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997864/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997864/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997864/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997864/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997864/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997864/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997864/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997864/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997864/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997864/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997864.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">2084</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">2671</span> Nonlinear Finite Element Modeling of Deep Beam Resting on Linear and Nonlinear Random Soil</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Seguini">M. Seguini</a>, <a href="https://publications.waset.org/search?q=D.%20Nedjar"> D. Nedjar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An accuracy nonlinear analysis of a deep beam resting on elastic perfectly plastic soil is carried out in this study. In fact, a nonlinear finite element modeling for large deflection and moderate rotation of Euler-Bernoulli beam resting on linear and nonlinear random soil is investigated. The geometric nonlinear analysis of the beam is based on the theory of von Kàrmàn, where the Newton-Raphson incremental iteration method is implemented in a Matlab code to solve the nonlinear equation of the soil-beam interaction system. However, two analyses (deterministic and probabilistic) are proposed to verify the accuracy and the efficiency of the proposed model where the theory of the local average based on the Monte Carlo approach is used to analyze the effect of the spatial variability of the soil properties on the nonlinear beam response. The effect of six main parameters are investigated: the external load, the length of a beam, the coefficient of subgrade reaction of the soil, the Young’s modulus of the beam, the coefficient of variation and the correlation length of the soil’s coefficient of subgrade reaction. A comparison between the beam resting on linear and nonlinear soil models is presented for different beam’s length and external load. Numerical results have been obtained for the combination of the geometric nonlinearity of beam and material nonlinearity of random soil. This comparison highlighted the need of including the material nonlinearity and spatial variability of the soil in the geometric nonlinear analysis, when the beam undergoes large deflections. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Finite%20element%20method" title="Finite element method">Finite element method</a>, <a href="https://publications.waset.org/search?q=geometric%20nonlinearity" title=" geometric nonlinearity"> geometric nonlinearity</a>, <a href="https://publications.waset.org/search?q=material%20nonlinearity" title=" material nonlinearity"> material nonlinearity</a>, <a href="https://publications.waset.org/search?q=soil-structure%20interaction" title=" soil-structure interaction"> soil-structure interaction</a>, <a href="https://publications.waset.org/search?q=spatial%20variability." title=" spatial variability."> spatial variability.</a> </p> <a href="https://publications.waset.org/10003633/nonlinear-finite-element-modeling-of-deep-beam-resting-on-linear-and-nonlinear-random-soil" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10003633/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10003633/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10003633/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10003633/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10003633/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10003633/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10003633/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10003633/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10003633/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10003633/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10003633.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">1944</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">2670</span> A Finite Difference Calculation Procedure for the Navier-Stokes Equations on a Staggered Curvilinear Grid</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=R.%20M.%20Barron">R. M. Barron</a>, <a href="https://publications.waset.org/search?q=B.%20Zogheib"> B. Zogheib</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A new numerical method for solving the twodimensional, steady, incompressible, viscous flow equations on a Curvilinear staggered grid is presented in this paper. The proposed methodology is finite difference based, but essentially takes advantage of the best features of two well-established numerical formulations, the finite difference and finite volume methods. Some weaknesses of the finite difference approach are removed by exploiting the strengths of the finite volume method. In particular, the issue of velocity-pressure coupling is dealt with in the proposed finite difference formulation by developing a pressure correction equation in a manner similar to the SIMPLE approach commonly used in finite volume formulations. However, since this is purely a finite difference formulation, numerical approximation of fluxes is not required. Results obtained from the present method are based on the first-order upwind scheme for the convective terms, but the methodology can easily be modified to accommodate higher order differencing schemes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Curvilinear" title="Curvilinear">Curvilinear</a>, <a href="https://publications.waset.org/search?q=finite%20difference" title=" finite difference"> finite difference</a>, <a href="https://publications.waset.org/search?q=finite%20volume" title=" finite volume"> finite volume</a>, <a href="https://publications.waset.org/search?q=SIMPLE." title=" SIMPLE."> SIMPLE.</a> </p> <a href="https://publications.waset.org/5455/a-finite-difference-calculation-procedure-for-the-navier-stokes-equations-on-a-staggered-curvilinear-grid" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5455/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5455/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5455/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5455/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5455/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5455/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5455/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5455/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5455/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5455/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5455.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">3203</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">2669</span> FIR Filter Design via Linear Complementarity Problem, Messy Genetic Algorithm, and Ising Messy Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.M.%20Al-Fahed%20Nuseirat">A.M. Al-Fahed Nuseirat</a>, <a href="https://publications.waset.org/search?q=R.%20Abu-Zitar"> R. Abu-Zitar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper the design of maximally flat linear phase finite impulse response (FIR) filters is considered. The problem is handled with totally two different approaches. The first one is completely deterministic numerical approach where the problem is formulated as a Linear Complementarity Problem (LCP). The other one is based on a combination of Markov Random Fields (MRF's) approach with messy genetic algorithm (MGA). Markov Random Fields (MRFs) are a class of probabilistic models that have been applied for many years to the analysis of visual patterns or textures. Our objective is to establish MRFs as an interesting approach to modeling messy genetic algorithms. We establish a theoretical result that every genetic algorithm problem can be characterized in terms of a MRF model. This allows us to construct an explicit probabilistic model of the MGA fitness function and introduce the Ising MGA. Experimentations done with Ising MGA are less costly than those done with standard MGA since much less computations are involved. The least computations of all is for the LCP. Results of the LCP, random search, random seeded search, MGA, and Ising MGA are discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Filter%20design" title="Filter design">Filter design</a>, <a href="https://publications.waset.org/search?q=FIR%20digital%20filters" title=" FIR digital filters"> FIR digital filters</a>, <a href="https://publications.waset.org/search?q=LCP" title=" LCP"> LCP</a>, <a href="https://publications.waset.org/search?q=Ising%20model" title=" Ising model"> Ising model</a>, <a href="https://publications.waset.org/search?q=MGA" title="MGA">MGA</a>, <a href="https://publications.waset.org/search?q=Ising%20MGA." title=" Ising MGA."> Ising MGA.</a> </p> <a href="https://publications.waset.org/3072/fir-filter-design-via-linear-complementarity-problem-messy-genetic-algorithm-and-ising-messy-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3072/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3072/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3072/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3072/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3072/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3072/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3072/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3072/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3072/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3072/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3072.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">2023</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">2668</span> Using Analytical Hierarchy Process and TOPSIS Approaches in Designing a Finite Element Analysis Automation Program</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ming%20Wen">Ming Wen</a>, <a href="https://publications.waset.org/search?q=Nasim%20Nezamoddini"> Nasim Nezamoddini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Sophisticated numerical simulations like finite element analysis (FEA) involve a complicated process from model setup to post-processing tasks that require replication of time-consuming steps. Utilizing FEA automation program simplifies the complexity of the involved steps while minimizing human errors in analysis set up, calculations, and results processing. One of the main challenges in designing FEA automation programs is to identify user requirements and link them to possible design alternatives. This paper presents a decision-making framework to design a Python based FEA automation program for modal analysis, frequency response analysis, and random vibration fatigue (RVF) analysis procedures. Analytical hierarchy process (AHP) and technique for order preference by similarity to ideal solution (TOPSIS) are applied to evaluate design alternatives considering the feedback received from experts and program users.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=FEA" title="FEA">FEA</a>, <a href="https://publications.waset.org/search?q=random%20vibration%20fatigue" title=" random vibration fatigue"> random vibration fatigue</a>, <a href="https://publications.waset.org/search?q=process%20automation" title=" process automation"> process automation</a>, <a href="https://publications.waset.org/search?q=AHP" title=" AHP"> AHP</a>, <a href="https://publications.waset.org/search?q=TOPSIS" title=" TOPSIS"> TOPSIS</a>, <a href="https://publications.waset.org/search?q=multiple-criteria%20decision-making" title=" multiple-criteria decision-making"> multiple-criteria decision-making</a>, <a href="https://publications.waset.org/search?q=MCDM." title=" MCDM."> MCDM.</a> </p> <a href="https://publications.waset.org/10012035/using-analytical-hierarchy-process-and-topsis-approaches-in-designing-a-finite-element-analysis-automation-program" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10012035/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10012035/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10012035/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10012035/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10012035/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10012035/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10012035/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10012035/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10012035/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10012035/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10012035.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">531</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">2667</span> On the Fp-Normal Subgroups of Finite Groups</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Shitian%20Liu">Shitian Liu</a>, <a href="https://publications.waset.org/search?q=Deqin%20Chen"> Deqin Chen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let G be a finite group, and let F be a formation of finite group. We say that a subgroup H of G is p F -normal in G if there exists a normal subgroup T of G such that HT is a permutable Hall subgroup of G and G G (H <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Finite%20group" title="Finite group">Finite group</a>, <a href="https://publications.waset.org/search?q=Fp%20-normal%20subgroup" title=" Fp -normal subgroup"> Fp -normal subgroup</a>, <a href="https://publications.waset.org/search?q=Sylowsubgroup" title=" Sylowsubgroup"> Sylowsubgroup</a>, <a href="https://publications.waset.org/search?q=Maximal%20subgroup" title=" Maximal subgroup"> Maximal subgroup</a> </p> <a href="https://publications.waset.org/12370/on-the-fp-normal-subgroups-of-finite-groups" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12370/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12370/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12370/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12370/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12370/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12370/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12370/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12370/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12370/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12370/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12370.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">1190</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">2666</span> On Speeding Up Support Vector Machines: Proximity Graphs Versus Random Sampling for Pre-Selection Condensation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Xiaohua%20Liu">Xiaohua Liu</a>, <a href="https://publications.waset.org/search?q=Juan%20F.%20Beltran"> Juan F. Beltran</a>, <a href="https://publications.waset.org/search?q=Nishant%20Mohanchandra"> Nishant Mohanchandra</a>, <a href="https://publications.waset.org/search?q=Godfried%20T.%20Toussaint"> Godfried T. Toussaint</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Support vector machines (SVMs) are considered to be the best machine learning algorithms for minimizing the predictive probability of misclassification. However, their drawback is that for large data sets the computation of the optimal decision boundary is a time consuming function of the size of the training set. Hence several methods have been proposed to speed up the SVM algorithm. Here three methods used to speed up the computation of the SVM classifiers are compared experimentally using a musical genre classification problem. The simplest method pre-selects a random sample of the data before the application of the SVM algorithm. Two additional methods use proximity graphs to pre-select data that are near the decision boundary. One uses k-Nearest Neighbor graphs and the other Relative Neighborhood Graphs to accomplish the task. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Machine%20learning" title="Machine learning">Machine learning</a>, <a href="https://publications.waset.org/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/search?q=support%20vector%20machines" title=" support vector machines"> support vector machines</a>, <a href="https://publications.waset.org/search?q=proximity%20graphs" title=" proximity graphs"> proximity graphs</a>, <a href="https://publications.waset.org/search?q=relative-neighborhood%20graphs" title=" relative-neighborhood graphs"> relative-neighborhood graphs</a>, <a href="https://publications.waset.org/search?q=k-nearestneighbor%20graphs" title=" k-nearestneighbor graphs"> k-nearestneighbor graphs</a>, <a href="https://publications.waset.org/search?q=random%20sampling" title=" random sampling"> random sampling</a>, <a href="https://publications.waset.org/search?q=training%20data%20condensation." title=" training data condensation."> training data condensation.</a> </p> <a href="https://publications.waset.org/5928/on-speeding-up-support-vector-machines-proximity-graphs-versus-random-sampling-for-pre-selection-condensation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5928/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5928/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5928/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5928/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5928/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5928/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5928/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5928/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5928/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5928/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5928.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">1919</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">2665</span> The Convergence Theorems for Mixing Random Variable Sequences</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yan-zhao%20Yang">Yan-zhao Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, some limit properties for mixing random variables sequences were studied and some results on weak law of large number for mixing random variables sequences were presented. Some complete convergence theorems were also obtained. The results extended and improved the corresponding theorems in i.i.d random variables sequences. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Complete%20convergence" title="Complete convergence">Complete convergence</a>, <a href="https://publications.waset.org/search?q=mixing%20random%20variables" title=" mixing random variables"> mixing random variables</a>, <a href="https://publications.waset.org/search?q=weak%20law%20of%20large%20numbers." title=" weak law of large numbers."> weak law of large numbers.</a> </p> <a href="https://publications.waset.org/10001921/the-convergence-theorems-for-mixing-random-variable-sequences" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10001921/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10001921/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10001921/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10001921/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10001921/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10001921/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10001921/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10001921/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10001921/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10001921/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10001921.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">1622</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">2664</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">2663</span> Synchronization Technique for Random Switching Frequency Pulse-Width Modulation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Apinan%20Aurasopon">Apinan Aurasopon</a>, <a href="https://publications.waset.org/search?q=Worawat%20Sa-ngiavibool"> Worawat Sa-ngiavibool</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper proposes a synchronized random switching frequency pulse width modulation (SRSFPWM). In this technique, the clock signal is used to control the random noise frequency which is produced by the feedback voltage of a hysteresis circuit. These make the triangular carrier frequency equaling to the random noise frequency in each switching period with the symmetrical positive and negative slopes of triangular carrier. Therefore, there is no error voltage in PWM signal. The PSpice simulated results shown the proposed technique improved the performance in case of low frequency harmonics of PWM signal comparing with conventional random switching frequency PWM.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Random%20switching%20frequency%20pulse%20-%20width%20modulation." title="Random switching frequency pulse - width modulation.">Random switching frequency pulse - width modulation.</a> </p> <a href="https://publications.waset.org/1915/synchronization-technique-for-random-switching-frequency-pulse-width-modulation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1915/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1915/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1915/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1915/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1915/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1915/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1915/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1915/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1915/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1915/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1915.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">2796</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=random%20finite%20sets&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=random%20finite%20sets&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=random%20finite%20sets&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=random%20finite%20sets&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=random%20finite%20sets&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=random%20finite%20sets&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=random%20finite%20sets&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=random%20finite%20sets&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=random%20finite%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=random%20finite%20sets&page=89">89</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=random%20finite%20sets&page=90">90</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=random%20finite%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>