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: rough collision.</title> <meta name="description" content="Search results for: rough collision."> <meta name="keywords" content="rough collision."> <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="rough collision." 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="rough collision."> <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> 255</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: rough collision.</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">255</span> Some Properties of IF Rough Relational Algebraic Operators in Medical Databases</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Chhaya%20Gangwal">Chhaya Gangwal</a>, <a href="https://publications.waset.org/search?q=R.%20N.%20Bhaumik"> R. N. Bhaumik</a>, <a href="https://publications.waset.org/search?q=Shishir%20Kumar"> Shishir Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Some properties of Intuitionistic Fuzzy (IF) rough relational algebraic operators under an IF rough relational data model are investigated and illustrated using diabetes and heart disease databases. These properties are important and desirable for processing queries in an effective and efficient manner.</p> <p> </p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=IF%20Set" title="IF Set">IF Set</a>, <a href="https://publications.waset.org/search?q=Rough%20Set" title=" Rough Set"> Rough Set</a>, <a href="https://publications.waset.org/search?q=IF%20Rough%20Relational%20Database" title=" IF Rough Relational Database"> IF Rough Relational Database</a>, <a href="https://publications.waset.org/search?q=IF%20rough%20Relational%20Operators." title=" IF rough Relational Operators. "> IF rough Relational Operators. </a> </p> <a href="https://publications.waset.org/9998470/some-properties-of-if-rough-relational-algebraic-operators-in-medical-databases" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9998470/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9998470/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9998470/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9998470/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9998470/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9998470/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9998470/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9998470/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9998470/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9998470/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9998470.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">1454</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">254</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">253</span> The Lower and Upper Approximations in a Group</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Zhaohao%20Wang">Zhaohao Wang</a>, <a href="https://publications.waset.org/search?q=Lan%20Shu"> Lan Shu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we generalize some propositions in [C.Z. Wang, D.G. Chen, A short note on some properties of rough groups, Comput. Math. Appl. 59(2010)431-436.] and we give some equivalent conditions for rough subgroups. The notion of minimal upper rough subgroups is introduced and a equivalent characterization is given, which implies the rough version of Lagranges Theorem.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Lower%20approximations" title="Lower approximations">Lower approximations</a>, <a href="https://publications.waset.org/search?q=Upper%20approximations" title=" Upper approximations"> Upper approximations</a>, <a href="https://publications.waset.org/search?q=Rough%20sets" title=" Rough sets"> Rough sets</a>, <a href="https://publications.waset.org/search?q=Rough%20groups" title=" Rough groups"> Rough groups</a>, <a href="https://publications.waset.org/search?q=Lagrange" title=" Lagrange"> Lagrange</a> </p> <a href="https://publications.waset.org/9259/the-lower-and-upper-approximations-in-a-group" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9259/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9259/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9259/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9259/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9259/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9259/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9259/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9259/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9259/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9259/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9259.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2219</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">252</span> On Generalizing Rough Set Theory via using a Filter</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Serkan%20Narl%C4%B1">Serkan Narlı</a>, <a href="https://publications.waset.org/search?q=Ahmet%20Z.%20Ozcelik"> Ahmet Z. Ozcelik</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The theory of rough sets is generalized by using a filter. The filter is induced by binary relations and it is used to generalize the basic rough set concepts. The knowledge representations and processing of binary relations in the style of rough set theory are investigated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Rough%20set" title="Rough set">Rough set</a>, <a href="https://publications.waset.org/search?q=fuzzy%20set" title=" fuzzy set"> fuzzy set</a>, <a href="https://publications.waset.org/search?q=membership%20function" title=" membership function"> membership function</a>, <a href="https://publications.waset.org/search?q=knowledge%20representation%20and%20processing" title=" knowledge representation and processing"> knowledge representation and processing</a>, <a href="https://publications.waset.org/search?q=information%20theory" title=" information theory"> information theory</a> </p> <a href="https://publications.waset.org/11125/on-generalizing-rough-set-theory-via-using-a-filter" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11125/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11125/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11125/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11125/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11125/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11125/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11125/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11125/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11125/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11125/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11125.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">1813</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">251</span> Neural Network in Fixed Time for Collision Detection between Two Convex Polyhedra</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Khouil">M. Khouil</a>, <a href="https://publications.waset.org/search?q=N.%20Saber"> N. Saber</a>, <a href="https://publications.waset.org/search?q=M.%20Mestari"> M. Mestari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, a different architecture of a collision detection neural network (DCNN) is developed. This network, which has been particularly reviewed, has enabled us to solve with a new approach the problem of collision detection between two convex polyhedra in a fixed time (O (1) time). We used two types of neurons, linear and threshold logic, which simplified the actual implementation of all the networks proposed. The study of the collision detection is divided into two sections, the collision between a point and a polyhedron and then the collision between two convex polyhedra. The aim of this research is to determine through the AMAXNET network a mini maximum point in a fixed time, which allows us to detect the presence of a potential collision.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Collision%20identification" title="Collision identification">Collision identification</a>, <a href="https://publications.waset.org/search?q=fixed%20time" title=" fixed time"> fixed time</a>, <a href="https://publications.waset.org/search?q=convex%20polyhedra" title=" convex polyhedra"> convex polyhedra</a>, <a href="https://publications.waset.org/search?q=neural%20network" title=" neural network"> neural network</a>, <a href="https://publications.waset.org/search?q=AMAXNET." title=" AMAXNET."> AMAXNET.</a> </p> <a href="https://publications.waset.org/9998310/neural-network-in-fixed-time-for-collision-detection-between-two-convex-polyhedra" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9998310/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9998310/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9998310/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9998310/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9998310/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9998310/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9998310/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9998310/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9998310/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9998310/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9998310.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">1816</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">250</span> An Approaching Index to Evaluate a forward Collision Probability</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yuan-Lin%20Chen">Yuan-Lin Chen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper presents an approaching forward collision probability index (AFCPI) for alerting and assisting driver in keeping safety distance to avoid the forward collision accident in highway driving. The time to collision (TTC) and time headway (TH) are used to evaluate the TTC forward collision probability index (TFCPI) and the TH forward collision probability index (HFCPI), respectively. The Mamdani fuzzy inference algorithm is presented combining TFCPI and HFCPI to calculate the approaching collision probability index of the vehicle. The AFCPI is easier to understand for the driver who did not even have any professional knowledge in vehicle professional field. At the same time, the driver’s behavior is taken into account for suiting each driver. For the approaching index, the value 0 is indicating the 0% probability of forward collision, and the values 0.5 and 1 are indicating the 50% and 100% probabilities of forward collision, respectively. The AFCPI is useful and easy-to-understand for alerting driver to avoid the forward collision accidents when driving in highway.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Approaching%20index" title="Approaching index">Approaching index</a>, <a href="https://publications.waset.org/search?q=forward%20collision%20probability" title=" forward collision probability"> forward collision probability</a>, <a href="https://publications.waset.org/search?q=time%20to%20collision" title=" time to collision"> time to collision</a>, <a href="https://publications.waset.org/search?q=time%20headway." title=" time headway."> time headway.</a> </p> <a href="https://publications.waset.org/10008067/an-approaching-index-to-evaluate-a-forward-collision-probability" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10008067/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10008067/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10008067/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10008067/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10008067/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10008067/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10008067/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10008067/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10008067/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10008067/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10008067.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">1160</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">249</span> Real-time Detection of Space Manipulator Self-collision</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Zhang%20Xiaodong">Zhang Xiaodong</a>, <a href="https://publications.waset.org/search?q=Tang%20Zixin"> Tang Zixin</a>, <a href="https://publications.waset.org/search?q=Liu%20Xin"> Liu Xin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In order to avoid self-collision of space manipulators during operation process, a real-time detection method is proposed in this paper. The manipulator is fitted into a cylinder-enveloping surface, and then, a kind of detection algorithm of collision between cylinders is analyzed. The collision model of space manipulator self-links can be detected by using this algorithm in real-time detection during the operation process. To ensure security of the operation, a safety threshold is designed. The simulation and experiment results verify the effectiveness of the proposed algorithm for a 7-DOF space manipulator. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Space%20manipulator" title="Space manipulator">Space manipulator</a>, <a href="https://publications.waset.org/search?q=Collision%20detection" title=" Collision detection"> Collision detection</a>, <a href="https://publications.waset.org/search?q=Self-collision" title=" Self-collision"> Self-collision</a>, <a href="https://publications.waset.org/search?q=the%20real-time%20collision%20detection." title=" the real-time collision detection."> the real-time collision detection.</a> </p> <a href="https://publications.waset.org/10001430/real-time-detection-of-space-manipulator-self-collision" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10001430/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10001430/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10001430/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10001430/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10001430/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10001430/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10001430/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10001430/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10001430/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10001430/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10001430.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">2035</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">248</span> Some Solid Transportation Models with Crisp and Rough Costs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Pradip%20Kundu">Pradip Kundu</a>, <a href="https://publications.waset.org/search?q=Samarjit%20Kar"> Samarjit Kar</a>, <a href="https://publications.waset.org/search?q=Manoranjan%20Maiti"> Manoranjan Maiti</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, some practical solid transportation models are formulated considering per trip capacity of each type of conveyances with crisp and rough unit transportation costs. This is applicable for the system in which full vehicles, e.g. trucks, rail coaches are to be booked for transportation of products so that transportation cost is determined on the full of the conveyances. The models with unit transportation costs as rough variables are transformed into deterministic forms using rough chance constrained programming with the help of trust measure. Numerical examples are provided to illustrate the proposed models in crisp environment as well as with unit transportation costs as rough variables.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Solid%20transportation%20problem" title="Solid transportation problem">Solid transportation problem</a>, <a href="https://publications.waset.org/search?q=Rough%20set" title=" Rough set"> Rough set</a>, <a href="https://publications.waset.org/search?q=Rough%20variable" title=" Rough variable"> Rough variable</a>, <a href="https://publications.waset.org/search?q=Trust%20measure." title=" Trust measure."> Trust measure.</a> </p> <a href="https://publications.waset.org/4878/some-solid-transportation-models-with-crisp-and-rough-costs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4878/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4878/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4878/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4878/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4878/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4878/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4878/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4878/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4878/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4878/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4878.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">2622</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">247</span> A New Approach for Controlling Overhead Traveling Crane Using Rough Controller</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mazin%20Z.%20Othman">Mazin Z. Othman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper presents the idea of a rough controller with application to control the overhead traveling crane system. The structure of such a controller is based on a suggested concept of a fuzzy logic controller. A measure of fuzziness in rough sets is introduced. A comparison between fuzzy logic controller and rough controller has been demonstrated. The results of a simulation comparing the performance of both controllers are shown. From these results we infer that the performance of the proposed rough controller is satisfactory.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Accuracy%20measure" title="Accuracy measure">Accuracy measure</a>, <a href="https://publications.waset.org/search?q=Fuzzy%20Logic%20Controller%20%28FLC%29" title=" Fuzzy Logic Controller (FLC)"> Fuzzy Logic Controller (FLC)</a>, <a href="https://publications.waset.org/search?q=Overhead%20Traveling%20Crane%20%28OTC%29" title="Overhead Traveling Crane (OTC)">Overhead Traveling Crane (OTC)</a>, <a href="https://publications.waset.org/search?q=Rough%20Set%20Theory%20%28RST%29" title=" Rough Set Theory (RST)"> Rough Set Theory (RST)</a>, <a href="https://publications.waset.org/search?q=Roughness%20measure" title="Roughness measure">Roughness measure</a> </p> <a href="https://publications.waset.org/8473/a-new-approach-for-controlling-overhead-traveling-crane-using-rough-controller" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8473/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8473/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8473/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8473/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8473/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8473/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8473/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8473/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8473/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8473/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8473.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">1703</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">246</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">245</span> Variable Rough Set Model and Its Knowledge Reduction for Incomplete and Fuzzy Decision Information Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Da-kuan%20Wei">Da-kuan Wei</a>, <a href="https://publications.waset.org/search?q=Xian-zhong%20Zhou"> Xian-zhong Zhou</a>, <a href="https://publications.waset.org/search?q=Dong-jun%20Xin"> Dong-jun Xin</a>, <a href="https://publications.waset.org/search?q=Zhi-wei%20Chen"> Zhi-wei Chen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The information systems with incomplete attribute values and fuzzy decisions commonly exist in practical problems. On the base of the notion of variable precision rough set model for incomplete information system and the rough set model for incomplete and fuzzy decision information system, the variable rough set model for incomplete and fuzzy decision information system is constructed, which is the generalization of the variable precision rough set model for incomplete information system and that of rough set model for incomplete and fuzzy decision information system. The knowledge reduction and heuristic algorithm, built on the method and theory of precision reduction, are proposed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Rough%20set" title="Rough set">Rough set</a>, <a href="https://publications.waset.org/search?q=Incomplete%20and%20fuzzy%20decision%0Ainformation%20system" title=" Incomplete and fuzzy decision information system"> Incomplete and fuzzy decision information system</a>, <a href="https://publications.waset.org/search?q=Limited%20valued%20tolerance%20relation" title=" Limited valued tolerance relation"> Limited valued tolerance relation</a>, <a href="https://publications.waset.org/search?q=Knowledge%0Areduction" title=" Knowledge reduction"> Knowledge reduction</a>, <a href="https://publications.waset.org/search?q=Variable%20rough%20set%20model" title=" Variable rough set model"> Variable rough set model</a> </p> <a href="https://publications.waset.org/10310/variable-rough-set-model-and-its-knowledge-reduction-for-incomplete-and-fuzzy-decision-information-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10310/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10310/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10310/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10310/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10310/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10310/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10310/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10310/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10310/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10310/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10310.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">1585</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">244</span> RANFIS : Rough Adaptive Neuro-Fuzzy Inference System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sandeep%20Chandana">Sandeep Chandana</a>, <a href="https://publications.waset.org/search?q=Rene%20V.%20Mayorga"> Rene V. Mayorga</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The paper presents a new hybridization methodology involving Neural, Fuzzy and Rough Computing. A Rough Sets based approximation technique has been proposed based on a certain Neuro – Fuzzy architecture. A New Rough Neuron composition consisting of a combination of a Lower Bound neuron and a Boundary neuron has also been described. The conventional convergence of error in back propagation has been given away for a new framework based on 'Output Excitation Factor' and an inverse input transfer function. The paper also presents a brief comparison of performances, of the existing Rough Neural Networks and ANFIS architecture against the proposed methodology. It can be observed that the rough approximation based neuro-fuzzy architecture is superior to its counterparts.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Boundary%20neuron" title="Boundary neuron">Boundary neuron</a>, <a href="https://publications.waset.org/search?q=neuro-fuzzy" title=" neuro-fuzzy"> neuro-fuzzy</a>, <a href="https://publications.waset.org/search?q=output%20excitation%20factor" title=" output excitation factor"> output excitation factor</a>, <a href="https://publications.waset.org/search?q=RANFIS" title=" RANFIS"> RANFIS</a>, <a href="https://publications.waset.org/search?q=rough%20approximation" title=" rough approximation"> rough approximation</a>, <a href="https://publications.waset.org/search?q=rough%20neural%20computing." title=" rough neural computing."> rough neural computing.</a> </p> <a href="https://publications.waset.org/11968/ranfis-rough-adaptive-neuro-fuzzy-inference-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11968/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11968/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11968/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11968/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11968/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11968/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11968/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11968/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11968/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11968/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11968.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">1704</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">243</span> A New Criterion Pose and Shape of Objects for Collision Risk Estimation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Do%20Hyeung%20Kim">Do Hyeung Kim</a>, <a href="https://publications.waset.org/search?q=Dae%20Hee%20Seo"> Dae Hee Seo</a>, <a href="https://publications.waset.org/search?q=Byung%20Doo%20Kim"> Byung Doo Kim</a>, <a href="https://publications.waset.org/search?q=Byung%20Gil%20Lee"> Byung Gil Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>As many recent researches being implemented in aviation and maritime aspects, strong doubts have been raised concerning the reliability of the estimation of collision risk. It is shown that using position and velocity of objects can lead to imprecise results. In this paper, therefore, a new approach to the estimation of collision risks using pose and shape of objects is proposed. Simulation results are presented validating the accuracy of the new criterion to adapt to collision risk algorithm based on fuzzy logic.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Collision%20risk" title="Collision risk">Collision risk</a>, <a href="https://publications.waset.org/search?q=Pose%20and%20shape" title=" Pose and shape"> Pose and shape</a>, <a href="https://publications.waset.org/search?q=Fuzzy%20logic." title=" Fuzzy logic."> Fuzzy logic.</a> </p> <a href="https://publications.waset.org/9996846/a-new-criterion-pose-and-shape-of-objects-for-collision-risk-estimation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9996846/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9996846/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9996846/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9996846/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9996846/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9996846/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9996846/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9996846/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9996846/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9996846/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9996846.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">1909</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">242</span> An Intelligent Approach of Rough Set in Knowledge Discovery Databases</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hrudaya%20Ku.%20Tripathy">Hrudaya Ku. Tripathy</a>, <a href="https://publications.waset.org/search?q=B.%20K.%20Tripathy"> B. K. Tripathy</a>, <a href="https://publications.waset.org/search?q=Pradip%20K.%20Das"> Pradip K. Das</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Knowledge Discovery in Databases (KDD) has evolved into an important and active area of research because of theoretical challenges and practical applications associated with the problem of discovering (or extracting) interesting and previously unknown knowledge from very large real-world databases. Rough Set Theory (RST) is a mathematical formalism for representing uncertainty that can be considered an extension of the classical set theory. It has been used in many different research areas, including those related to inductive machine learning and reduction of knowledge in knowledge-based systems. One important concept related to RST is that of a rough relation. In this paper we presented the current status of research on applying rough set theory to KDD, which will be helpful for handle the characteristics of real-world databases. The main aim is to show how rough set and rough set analysis can be effectively used to extract knowledge from large databases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Data%20mining" title="Data mining">Data mining</a>, <a href="https://publications.waset.org/search?q=Data%20tables" title=" Data tables"> Data tables</a>, <a href="https://publications.waset.org/search?q=Knowledge%20discovery%20in%0Adatabase%20%28KDD%29" title=" Knowledge discovery in database (KDD)"> Knowledge discovery in database (KDD)</a>, <a href="https://publications.waset.org/search?q=Rough%20sets." title=" Rough sets."> Rough sets.</a> </p> <a href="https://publications.waset.org/224/an-intelligent-approach-of-rough-set-in-knowledge-discovery-databases" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/224/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/224/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/224/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/224/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/224/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/224/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/224/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/224/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/224/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/224/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/224.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">2336</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">241</span> On Certain Estimates Of Rough Oscillatory Singular Integrals</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=H.%20M.%20Al-Qassem">H. M. Al-Qassem</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>We obtain appropriate sharp estimates for rough oscillatory integrals. Our results represent significant improvements as well as natural extensions of what was known previously.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Oscillatory%20singular%20integral" title="Oscillatory singular integral">Oscillatory singular integral</a>, <a href="https://publications.waset.org/search?q=Rough%20kernel" title=" Rough kernel"> Rough kernel</a>, <a href="https://publications.waset.org/search?q=Singular%20integral" title=" Singular integral"> Singular integral</a>, <a href="https://publications.waset.org/search?q=L%5E%7Bp%7D%20boundedness." title=" L^{p} boundedness."> L^{p} boundedness.</a> </p> <a href="https://publications.waset.org/12303/on-certain-estimates-of-rough-oscillatory-singular-integrals" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12303/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12303/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12303/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12303/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12303/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12303/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12303/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12303/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12303/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12303/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12303.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">1314</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">240</span> Investigation on Ship Collision Phenomena by Analytical and Finite Element Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Abuzar.Abazari">Abuzar.Abazari</a>, <a href="https://publications.waset.org/search?q=Saeed.%20Ziaei-Rad"> Saeed. Ziaei-Rad</a>, <a href="https://publications.waset.org/search?q=Hoseein.%20Dalayeli"> Hoseein. Dalayeli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Collision is considered as a time-depended nonlinear dynamic phenomenon. The majority of researchers have focused on deriving the resultant damage of the ship collisions via analytical, experimental, and finite element methods.In this paper, first, the force-penetration curve of a head collision on a container ship with rigid barrier based on Yang and Pedersen-s methods for internal mechanic section is studied. Next, the obtained results from different analytical methods are compared with each others. Then, through a simulation of the container ship collision in Ansys Ls-Dyna, results from finite element approach are compared with analytical methods and the source of errors is discussed. Finally, the effects of parameters such as velocity, and angle of collision on the forcepenetration curve are investigated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Ship%20collision" title="Ship collision">Ship collision</a>, <a href="https://publications.waset.org/search?q=Force-penetration%20curve" title=" Force-penetration curve"> Force-penetration curve</a>, <a href="https://publications.waset.org/search?q=Damage" title=" Damage"> Damage</a> </p> <a href="https://publications.waset.org/11074/investigation-on-ship-collision-phenomena-by-analytical-and-finite-element-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11074/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11074/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11074/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11074/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11074/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11074/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11074/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11074/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11074/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11074/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11074.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">2127</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">239</span> Single Valued Neutrosophic Hesitant Fuzzy Rough Set and Its Application</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=K.%20M.%20Alsager">K. M. Alsager</a>, <a href="https://publications.waset.org/search?q=N.%20O.%20Alshehri"> N. O. Alshehri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we proposed the notion of single valued neutrosophic hesitant fuzzy rough set, by combining single valued neutrosophic hesitant fuzzy set and rough set. The combination of single valued neutrosophic hesitant fuzzy set and rough set is a powerful tool for dealing with uncertainty, granularity and incompleteness of knowledge in information systems. We presented both definition and some basic properties of the proposed model. Finally, we gave a general approach which is applied to a decision making problem in disease diagnoses, and demonstrated the effectiveness of the approach by a numerical example. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Single%20valued%20neutrosophic%20hesitant%20set" title="Single valued neutrosophic hesitant set">Single valued neutrosophic hesitant set</a>, <a href="https://publications.waset.org/search?q=single%20valued%0D%0Aneutrosophic%20hesitant%20relation" title=" single valued neutrosophic hesitant relation"> single valued neutrosophic hesitant relation</a>, <a href="https://publications.waset.org/search?q=single%20valued%20neutrosophic%20hesitant%0D%0Afuzzy%20rough%20set" title=" single valued neutrosophic hesitant fuzzy rough set"> single valued neutrosophic hesitant fuzzy rough set</a>, <a href="https://publications.waset.org/search?q=decision%20making%20method." title=" decision making method."> decision making method.</a> </p> <a href="https://publications.waset.org/10010087/single-valued-neutrosophic-hesitant-fuzzy-rough-set-and-its-application" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10010087/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10010087/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10010087/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10010087/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10010087/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10010087/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10010087/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10010087/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10010087/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10010087/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10010087.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">1286</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">238</span> Fast 3D Collision Detection Algorithm using 2D Intersection Area</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Taehyun%20Yoon">Taehyun Yoon</a>, <a href="https://publications.waset.org/search?q=Keechul%20Jung"> Keechul Jung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>There are many researches to detect collision between real object and virtual object in 3D space. In general, these techniques are need to huge computing power. So, many research and study are constructed by using cloud computing, network computing, and distribute computing. As a reason of these, this paper proposed a novel fast 3D collision detection algorithm between real and virtual object using 2D intersection area. Proposed algorithm uses 4 multiple cameras and coarse-and-fine method to improve accuracy and speed performance of collision detection. In the coarse step, this system examines the intersection area between real and virtual object silhouettes from all camera views. The result of this step is the index of virtual sensors which has a possibility of collision in 3D space. To decide collision accurately, at the fine step, this system examines the collision detection in 3D space by using the visual hull algorithm. Performance of the algorithm is verified by comparing with existing algorithm. We believe proposed algorithm help many other research, study and application fields such as HCI, augmented reality, intelligent space, and so on.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Collision%20Detection" title="Collision Detection">Collision Detection</a>, <a href="https://publications.waset.org/search?q=Computer%20Vision" title=" Computer Vision"> Computer Vision</a>, <a href="https://publications.waset.org/search?q=Human%20Computer%20Interaction" title=" Human Computer Interaction"> Human Computer Interaction</a>, <a href="https://publications.waset.org/search?q=Visual%20Hull" title=" Visual Hull"> Visual Hull</a> </p> <a href="https://publications.waset.org/4503/fast-3d-collision-detection-algorithm-using-2d-intersection-area" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4503/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4503/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4503/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4503/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4503/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4503/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4503/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4503/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4503/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4503/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4503.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">2406</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">237</span> A Novel Q-algorithm for EPC Global Class-1 Generation-2 Anti-collision Protocol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Wen-Tzu%20Chen">Wen-Tzu Chen</a>, <a href="https://publications.waset.org/search?q=Wen-Bin%20Kao"> Wen-Bin Kao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper provides a scheme to improve the read efficiency of anti-collision algorithm in EPCglobal UHF Class-1 Generation-2 RFID standard. In this standard, dynamic frame slotted ALOHA is specified to solve the anti-collision problem. Also, the Q-algorithm with a key parameter C is adopted to dynamically adjust the frame sizes. In the paper, we split the C parameter into two parameters to increase the read speed and derive the optimal values of the two parameters through simulations. The results indicate our method outperforms the original Q-algorithm.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=RFID" title="RFID">RFID</a>, <a href="https://publications.waset.org/search?q=anti-collision" title=" anti-collision"> anti-collision</a>, <a href="https://publications.waset.org/search?q=Q%20algorithm" title=" Q algorithm"> Q algorithm</a>, <a href="https://publications.waset.org/search?q=ALOHA" title=" ALOHA"> ALOHA</a> </p> <a href="https://publications.waset.org/14783/a-novel-q-algorithm-for-epc-global-class-1-generation-2-anti-collision-protocol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14783/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14783/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14783/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14783/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14783/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14783/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14783/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14783/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14783/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14783/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14783.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">4663</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">236</span> An Improved Limited Tolerance Rough Set Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Chen%20Wu">Chen Wu</a>, <a href="https://publications.waset.org/search?q=Komal%20Narejo"> Komal Narejo</a>, <a href="https://publications.waset.org/search?q=Dandan%20Li"> Dandan Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Some extended rough set models in incomplete information system cannot distinguish the two objects that have few known attributes and more unknown attributes; some cannot make a flexible and accurate discrimination. In order to solve this problem, this paper suggests an improved limited tolerance rough set model using two thresholds to control what two objects have a relationship between them in limited tolerance relation and to classify objects. Our practical study case shows the model can get fine and reasonable decision results.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Decision%20rule" title="Decision rule">Decision rule</a>, <a href="https://publications.waset.org/search?q=incomplete%20information%20system" title=" incomplete information system"> incomplete information system</a>, <a href="https://publications.waset.org/search?q=limited%20tolerance%20relation" title=" limited tolerance relation"> limited tolerance relation</a>, <a href="https://publications.waset.org/search?q=rough%20set%20model." title=" rough set model. "> rough set model. </a> </p> <a href="https://publications.waset.org/10008266/an-improved-limited-tolerance-rough-set-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10008266/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10008266/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10008266/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10008266/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10008266/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10008266/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10008266/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10008266/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10008266/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10008266/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10008266.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">1194</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">235</span> Super-ellipsoidal Potential Function for Autonomous Collision Avoidance of a Teleoperated UAV</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mohammed%20Qasim">Mohammed Qasim</a>, <a href="https://publications.waset.org/search?q=Kyoung-Dae%20Kim"> Kyoung-Dae Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present the design of the super-ellipsoidal potential function (SEPF), that can be used for autonomous collision avoidance of an unmanned aerial vehicle (UAV) in a 3-dimensional space. In the design of SEPF, we have the full control over the shape and size of the potential function. In particular, we can adjust the length, width, height, and the amount of flattening at the tips of the potential function so that the collision avoidance motion vector generated from the potential function can be adjusted accordingly. Based on the idea of the SEPF, we also propose an approach for the local autonomy of a UAV for its collision avoidance when the UAV is teleoperated by a human operator. In our proposed approach, a teleoperated UAV can not only avoid collision autonomously with other surrounding objects but also track the operator’s control input as closely as possible. As a result, an operator can always be in control of the UAV for his/her high-level guidance and navigation task without worrying too much about the UAVs collision avoidance while it is being teleoperated. The effectiveness of the proposed approach is demonstrated through a human-in-the-loop simulation of quadrotor UAV teleoperation using virtual robot experimentation platform (v-rep) and Matlab programs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Artificial%20potential%20function" title="Artificial potential function">Artificial potential function</a>, <a href="https://publications.waset.org/search?q=autonomy" title=" autonomy"> autonomy</a>, <a href="https://publications.waset.org/search?q=collision%0D%0Aavoidance" title=" collision avoidance"> collision avoidance</a>, <a href="https://publications.waset.org/search?q=teleoperation" title=" teleoperation"> teleoperation</a>, <a href="https://publications.waset.org/search?q=quadrotor" title=" quadrotor"> quadrotor</a>, <a href="https://publications.waset.org/search?q=UAV." title=" UAV."> UAV.</a> </p> <a href="https://publications.waset.org/10003479/super-ellipsoidal-potential-function-for-autonomous-collision-avoidance-of-a-teleoperated-uav" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10003479/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10003479/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10003479/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10003479/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10003479/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10003479/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10003479/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10003479/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10003479/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10003479/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10003479.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">1994</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">234</span> Upgraded Rough Clustering and Outlier Detection Method on Yeast Dataset by Entropy Rough K-Means Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=P.%20Ashok">P. Ashok</a>, <a href="https://publications.waset.org/search?q=G.%20M.%20Kadhar%20Nawaz"> G. M. Kadhar Nawaz </a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Rough set theory is used to handle uncertainty and incomplete information by applying two accurate sets, Lower approximation and Upper approximation. In this paper, the rough clustering algorithms are improved by adopting the Similarity, Dissimilarity–Similarity and Entropy based initial centroids selection method on three different clustering algorithms namely Entropy based Rough K-Means (ERKM), Similarity based Rough K-Means (SRKM) and Dissimilarity-Similarity based Rough K-Means (DSRKM) were developed and executed by yeast dataset. The rough clustering algorithms are validated by cluster validity indexes namely Rand and Adjusted Rand indexes. An experimental result shows that the ERKM clustering algorithm perform effectively and delivers better results than other clustering methods. Outlier detection is an important task in data mining and very much different from the rest of the objects in the clusters. Entropy based Rough Outlier Factor (EROF) method is seemly to detect outlier effectively for yeast dataset. In rough K-Means method, by tuning the epsilon (ᶓ) value from 0.8 to 1.08 can detect outliers on boundary region and the RKM algorithm delivers better results, when choosing the value of epsilon (ᶓ) in the specified range. An experimental result shows that the EROF method on clustering algorithm performed very well and suitable for detecting outlier effectively for all datasets. Further, experimental readings show that the ERKM clustering method outperformed the other methods.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Clustering" title="Clustering">Clustering</a>, <a href="https://publications.waset.org/search?q=Entropy" title=" Entropy"> Entropy</a>, <a href="https://publications.waset.org/search?q=Outlier" title=" Outlier"> Outlier</a>, <a href="https://publications.waset.org/search?q=Rough%20K-Means" title=" Rough K-Means"> Rough K-Means</a>, <a href="https://publications.waset.org/search?q=validity%20index." title=" validity index."> validity index.</a> </p> <a href="https://publications.waset.org/10003742/upgraded-rough-clustering-and-outlier-detection-method-on-yeast-dataset-by-entropy-rough-k-means-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10003742/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10003742/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10003742/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10003742/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10003742/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10003742/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10003742/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10003742/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10003742/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10003742/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10003742.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">233</span> Rough Neural Networks in Adapting Cellular Automata Rule for Reducing Image Noise</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yasser%20F.%20Hassan">Yasser F. Hassan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The reduction or removal of noise in a color image is an essential part of image processing, whether the final information is used for human perception or for an automatic inspection and analysis. This paper describes the modeling system based on the rough neural network model to adaptive cellular automata for various image processing tasks and noise remover. In this paper, we consider the problem of object processing in colored image using rough neural networks to help deriving the rules which will be used in cellular automata for noise image. The proposed method is compared with some classical and recent methods. The results demonstrate that the new model is capable of being trained to perform many different tasks, and that the quality of these results is comparable or better than established specialized algorithms.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Rough%20Sets" title="Rough Sets">Rough Sets</a>, <a href="https://publications.waset.org/search?q=Rough%20Neural%20Networks" title=" Rough Neural Networks"> Rough Neural Networks</a>, <a href="https://publications.waset.org/search?q=Cellular%20Automata" title=" Cellular Automata"> Cellular Automata</a>, <a href="https://publications.waset.org/search?q=Image%20Processing." title=" Image Processing. "> Image Processing. </a> </p> <a href="https://publications.waset.org/9997247/rough-neural-networks-in-adapting-cellular-automata-rule-for-reducing-image-noise" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997247/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997247/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997247/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997247/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997247/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997247/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997247/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997247/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997247/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997247/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997247.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">1948</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">232</span> Earthquake Classification in Molluca Collision Zone Using Conventional Statistical Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=H.%20J.%20Wattimanela">H. J. Wattimanela</a>, <a href="https://publications.waset.org/search?q=U.%20S.%20Passaribu"> U. S. Passaribu</a>, <a href="https://publications.waset.org/search?q=N.%20T.%20Puspito"> N. T. Puspito</a>, <a href="https://publications.waset.org/search?q=S.%20W.%20Indratno"> S. W. Indratno</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Molluca Collision Zone is located at the junction of the Eurasian, Australian, Pacific and the Philippines plates. Between the Sangihe arc, west of the collision zone, and to the east of Halmahera arc is active collision and convex toward the Molluca Sea. This research will analyze the behavior of earthquake occurrence in Molluca Collision Zone related to the distributions of an earthquake in each partition regions, determining the type of distribution of a occurrence earthquake of partition regions, and the mean occurence of earthquakes each partition regions, and the correlation between the partitions region. We calculate number of earthquakes using partition method and its behavioral using conventional statistical methods. In this research, we used data of shallow earthquakes type and its magnitudes ≥4 SR (period 1964-2013). From the results, we can classify partitioned regions based on the correlation into two classes: strong and very strong. This classification can be used for early warning system in disaster management.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Molluca%20Collision%20Zone" title="Molluca Collision Zone">Molluca Collision Zone</a>, <a href="https://publications.waset.org/search?q=partition%20regions" title=" partition regions"> partition regions</a>, <a href="https://publications.waset.org/search?q=conventional%20statistical%20methods" title=" conventional statistical methods"> conventional statistical methods</a>, <a href="https://publications.waset.org/search?q=Earthquakes" title=" Earthquakes"> Earthquakes</a>, <a href="https://publications.waset.org/search?q=classifications" title=" classifications"> classifications</a>, <a href="https://publications.waset.org/search?q=disaster%0D%0Amanagement." title=" disaster management. "> disaster management. </a> </p> <a href="https://publications.waset.org/9999875/earthquake-classification-in-molluca-collision-zone-using-conventional-statistical-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9999875/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9999875/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9999875/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9999875/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9999875/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9999875/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9999875/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9999875/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9999875/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9999875/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9999875.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">1984</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">231</span> Self-protection Method for Flying Robots to Avoid Collision</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Guosheng%20Wu">Guosheng Wu</a>, <a href="https://publications.waset.org/search?q=Luning%20Wang"> Luning Wang</a>, <a href="https://publications.waset.org/search?q=Changyuan%20Fan"> Changyuan Fan</a>, <a href="https://publications.waset.org/search?q=Xi%20Zhu"> Xi Zhu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper provides a new approach to solve the motion planning problems of flying robots in uncertain 3D dynamic environments. The robots controlled by this method can adaptively choose the fast way to avoid collision without information about the shapes and trajectories of obstacles. Based on sphere coordinates the new method accomplishes collision avoidance of flying robots without any other auxiliary positioning systems. The Self-protection System gives robots self-protection abilities to work in uncertain 3D dynamic environments. Simulations illustrate the validity of the proposed method.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Collision%20avoidance" title="Collision avoidance">Collision avoidance</a>, <a href="https://publications.waset.org/search?q=Mobile%20robots" title=" Mobile robots"> Mobile robots</a>, <a href="https://publications.waset.org/search?q=Motion-planning" title="Motion-planning">Motion-planning</a>, <a href="https://publications.waset.org/search?q=Sphere%20coordinates" title=" Sphere coordinates"> Sphere coordinates</a>, <a href="https://publications.waset.org/search?q=Self-protection." title=" Self-protection."> Self-protection.</a> </p> <a href="https://publications.waset.org/9721/self-protection-method-for-flying-robots-to-avoid-collision" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9721/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9721/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9721/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9721/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9721/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9721/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9721/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9721/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9721/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9721/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9721.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">1581</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">230</span> Application of Granular Computing Paradigm in Knowledge Induction </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Iftikhar%20U.%20Sikder">Iftikhar U. Sikder </a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper illustrates an application of granular computing approach, namely rough set theory in data mining. The paper outlines the formalism of granular computing and elucidates the mathematical underpinning of rough set theory, which has been widely used by the data mining and the machine learning community. A real-world application is illustrated, and the classification performance is compared with other contending machine learning algorithms. The predictive performance of the rough set rule induction model shows comparative success with respect to other contending algorithms.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Concept%20approximation" title="Concept approximation">Concept approximation</a>, <a href="https://publications.waset.org/search?q=granular%20computing" title=" granular computing"> granular computing</a>, <a href="https://publications.waset.org/search?q=reducts" title=" reducts"> reducts</a>, <a href="https://publications.waset.org/search?q=rough%20set%20theory" title=" rough set theory"> rough set theory</a>, <a href="https://publications.waset.org/search?q=rule%20induction." title=" rule induction. "> rule induction. </a> </p> <a href="https://publications.waset.org/10008037/application-of-granular-computing-paradigm-in-knowledge-induction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10008037/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10008037/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10008037/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10008037/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10008037/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10008037/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10008037/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10008037/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10008037/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10008037/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10008037.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">834</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">229</span> Applications of Rough Set Decompositions in Information Retrieval</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Chen%20Wu">Chen Wu</a>, <a href="https://publications.waset.org/search?q=Xiaohua%20Hu"> Xiaohua Hu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes rough set models with three different level knowledge granules in incomplete information system under tolerance relation by similarity between objects according to their attribute values. Through introducing dominance relation on the discourse to decompose similarity classes into three subclasses: little better subclass, little worse subclass and vague subclass, it dismantles lower and upper approximations into three components. By using these components, retrieving information to find naturally hierarchical expansions to queries and constructing answers to elaborative queries can be effective. It illustrates the approach in applying rough set models in the design of information retrieval system to access different granular expanded documents. The proposed method enhances rough set model application in the flexibility of expansions and elaborative queries in information retrieval. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Incomplete%20information%20system" title="Incomplete information system">Incomplete information system</a>, <a href="https://publications.waset.org/search?q=Rough%20set%20model" title=" Rough set model"> Rough set model</a>, <a href="https://publications.waset.org/search?q=tolerance%20relation" title="tolerance relation">tolerance relation</a>, <a href="https://publications.waset.org/search?q=dominance%20relation" title=" dominance relation"> dominance relation</a>, <a href="https://publications.waset.org/search?q=approximation" title=" approximation"> approximation</a>, <a href="https://publications.waset.org/search?q=decomposition" title=" decomposition"> decomposition</a>, <a href="https://publications.waset.org/search?q=elaborative%20query." title="elaborative query.">elaborative query.</a> </p> <a href="https://publications.waset.org/12504/applications-of-rough-set-decompositions-in-information-retrieval" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12504/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12504/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12504/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12504/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12504/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12504/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12504/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12504/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12504/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12504/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12504.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1612</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">228</span> Efficient Web-Learning Collision Detection Tool on Five-Axis Machine</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Chia-Jung%20Chen">Chia-Jung Chen</a>, <a href="https://publications.waset.org/search?q=Rong-Shine%20Lin"> Rong-Shine Lin</a>, <a href="https://publications.waset.org/search?q=Rong-Guey%20Chang"> Rong-Guey Chang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>As networking has become popular, Web-learning tends to be a trend while designing a tool. Moreover, five-axis machining has been widely used in industry recently; however, it has potential axial table colliding problems. Thus this paper aims at proposing an efficient web-learning collision detection tool on five-axis machining. However, collision detection consumes heavy resource that few devices can support, thus this research uses a systematic approach based on web knowledge to detect collision. The methodologies include the kinematics analyses for five-axis motions, separating axis method for collision detection, and computer simulation for verification. The machine structure is modeled as STL format in CAD software. The input to the detection system is the g-code part program, which describes the tool motions to produce the part surface. This research produced a simulation program with C programming language and demonstrated a five-axis machining example with collision detection on web site. The system simulates the five-axis CNC motion for tool trajectory and detects for any collisions according to the input g-codes and also supports high-performance web service benefiting from C. The result shows that our method improves 4.5 time of computational efficiency, comparing to the conventional detection method.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Collision%20detection" title="Collision detection">Collision detection</a>, <a href="https://publications.waset.org/search?q=Five-axis%20machining" title=" Five-axis machining"> Five-axis machining</a>, <a href="https://publications.waset.org/search?q=Separating%0D%0Aaxis." title=" Separating axis."> Separating axis.</a> </p> <a href="https://publications.waset.org/16447/efficient-web-learning-collision-detection-tool-on-five-axis-machine" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/16447/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/16447/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/16447/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/16447/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/16447/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/16447/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/16447/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/16447/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/16447/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/16447/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/16447.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">2180</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">227</span> Generalized Rough Sets Applied to Graphs Related to Urban Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mihai%20Rebenciuc">Mihai Rebenciuc</a>, <a href="https://publications.waset.org/search?q=Simona%20Mihaela%20Bibic"> Simona Mihaela Bibic</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Branch of modern mathematics, graphs represent instruments for optimization and solving practical applications in various fields such as economic networks, engineering, network optimization, the geometry of social action, generally, complex systems including contemporary urban problems (path or transport efficiencies, biourbanism, & c.). In this paper is studied the interconnection of some urban network, which can lead to a simulation problem of a digraph through another digraph. The simulation is made univoc or more general multivoc. The concepts of fragment and atom are very useful in the study of connectivity in the digraph that is simulation - including an alternative evaluation of k- connectivity. Rough set approach in (bi)digraph which is proposed in premier in this paper contribute to improved significantly the evaluation of k-connectivity. This rough set approach is based on generalized rough sets - basic facts are presented in this paper. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=%28Bi%29digraphs" title="(Bi)digraphs">(Bi)digraphs</a>, <a href="https://publications.waset.org/search?q=rough%20set%20theory" title=" rough set theory"> rough set theory</a>, <a href="https://publications.waset.org/search?q=systems%20of%20interacting%0D%0Aagents" title=" systems of interacting agents"> systems of interacting agents</a>, <a href="https://publications.waset.org/search?q=complex%20systems." title=" complex systems."> complex systems.</a> </p> <a href="https://publications.waset.org/10007960/generalized-rough-sets-applied-to-graphs-related-to-urban-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10007960/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10007960/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10007960/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10007960/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10007960/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10007960/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10007960/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10007960/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10007960/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10007960/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10007960.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">226</span> Network Anomaly Detection using Soft Computing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Surat%20Srinoy">Surat Srinoy</a>, <a href="https://publications.waset.org/search?q=Werasak%20Kurutach"> Werasak Kurutach</a>, <a href="https://publications.waset.org/search?q=Witcha%20Chimphlee"> Witcha Chimphlee</a>, <a href="https://publications.waset.org/search?q=Siriporn%20Chimphlee"> Siriporn Chimphlee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One main drawback of intrusion detection system is the inability of detecting new attacks which do not have known signatures. In this paper we discuss an intrusion detection method that proposes independent component analysis (ICA) based feature selection heuristics and using rough fuzzy for clustering data. ICA is to separate these independent components (ICs) from the monitored variables. Rough set has to decrease the amount of data and get rid of redundancy and Fuzzy methods allow objects to belong to several clusters simultaneously, with different degrees of membership. Our approach allows us to recognize not only known attacks but also to detect activity that may be the result of a new, unknown attack. The experimental results on Knowledge Discovery and Data Mining- (KDDCup 1999) dataset. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Network%20security" title="Network security">Network security</a>, <a href="https://publications.waset.org/search?q=intrusion%20detection" title=" intrusion detection"> intrusion detection</a>, <a href="https://publications.waset.org/search?q=rough%20set" title=" rough set"> rough set</a>, <a href="https://publications.waset.org/search?q=ICA" title=" ICA"> ICA</a>, <a href="https://publications.waset.org/search?q=anomaly%20detection" title=" anomaly detection"> anomaly detection</a>, <a href="https://publications.waset.org/search?q=independent%20component%20analysis" title=" independent component analysis"> independent component analysis</a>, <a href="https://publications.waset.org/search?q=rough%0Afuzzy%20." title=" rough fuzzy ."> rough fuzzy .</a> </p> <a href="https://publications.waset.org/14879/network-anomaly-detection-using-soft-computing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14879/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14879/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14879/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14879/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14879/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14879/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14879/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14879/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14879/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14879/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14879.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">1955</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=rough%20collision.&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=rough%20collision.&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=rough%20collision.&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=rough%20collision.&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=rough%20collision.&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=rough%20collision.&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=rough%20collision.&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=rough%20collision.&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=rough%20collision.&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>