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: generalized trees</title> <meta name="description" content="Search results for: generalized trees"> <meta name="keywords" content="generalized trees"> <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="generalized trees" 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="generalized trees"> <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> 583</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: generalized trees</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">583</span> Measuring the Structural Similarity of Web-based Documents: A Novel Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Matthias%20Dehmer">Matthias Dehmer</a>, <a href="https://publications.waset.org/search?q=Frank%20Emmert%20Streib"> Frank Emmert Streib</a>, <a href="https://publications.waset.org/search?q=Alexander%20Mehler"> Alexander Mehler</a>, <a href="https://publications.waset.org/search?q=J%C3%BCrgen%20Kilian"> Jürgen Kilian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Most known methods for measuring the structural similarity of document structures are based on, e.g., tag measures, path metrics and tree measures in terms of their DOM-Trees. Other methods measures the similarity in the framework of the well known vector space model. In contrast to these we present a new approach to measuring the structural similarity of web-based documents represented by so called generalized trees which are more general than DOM-Trees which represent only directed rooted trees.We will design a new similarity measure for graphs representing web-based hypertext structures. Our similarity measure is mainly based on a novel representation of a graph as strings of linear integers, whose components represent structural properties of the graph. The similarity of two graphs is then defined as the optimal alignment of the underlying property strings. In this paper we apply the well known technique of sequence alignments to solve a novel and challenging problem: Measuring the structural similarity of generalized trees. More precisely, we first transform our graphs considered as high dimensional objects in linear structures. Then we derive similarity values from the alignments of the property strings in order to measure the structural similarity of generalized trees. Hence, we transform a graph similarity problem to a string similarity problem. We demonstrate that our similarity measure captures important structural information by applying it to two different test sets consisting of graphs representing web-based documents.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Graph%20similarity" title="Graph similarity">Graph similarity</a>, <a href="https://publications.waset.org/search?q=hierarchical%20and%20directed%20graphs" title=" hierarchical and directed graphs"> hierarchical and directed graphs</a>, <a href="https://publications.waset.org/search?q=hypertext" title=" hypertext"> hypertext</a>, <a href="https://publications.waset.org/search?q=generalized%20trees" title=" generalized trees"> generalized trees</a>, <a href="https://publications.waset.org/search?q=web%20structure%20mining." title=" web structure mining."> web structure mining.</a> </p> <a href="https://publications.waset.org/15928/measuring-the-structural-similarity-of-web-based-documents-a-novel-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15928/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15928/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15928/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15928/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15928/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15928/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15928/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15928/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15928/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15928/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15928.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">2557</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">582</span> Application of a Similarity Measure for Graphs to Web-based Document Structures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Matthias%20Dehmer">Matthias Dehmer</a>, <a href="https://publications.waset.org/search?q=Frank%20Emmert%20Streib"> Frank Emmert Streib</a>, <a href="https://publications.waset.org/search?q=Alexander%20Mehler"> Alexander Mehler</a>, <a href="https://publications.waset.org/search?q=J%C3%BCrgen%20Kilian"> Jürgen Kilian</a>, <a href="https://publications.waset.org/search?q=Max%20M%C3%BChlhauser"> Max Mühlhauser</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Due to the tremendous amount of information provided by the World Wide Web (WWW) developing methods for mining the structure of web-based documents is of considerable interest. In this paper we present a similarity measure for graphs representing web-based hypertext structures. Our similarity measure is mainly based on a novel representation of a graph as linear integer strings, whose components represent structural properties of the graph. The similarity of two graphs is then defined as the optimal alignment of the underlying property strings. In this paper we apply the well known technique of sequence alignments for solving a novel and challenging problem: Measuring the structural similarity of generalized trees. In other words: We first transform our graphs considered as high dimensional objects in linear structures. Then we derive similarity values from the alignments of the property strings in order to measure the structural similarity of generalized trees. Hence, we transform a graph similarity problem to a string similarity problem for developing a efficient graph similarity measure. We demonstrate that our similarity measure captures important structural information by applying it to two different test sets consisting of graphs representing web-based document structures. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Graph%20similarity" title="Graph similarity">Graph similarity</a>, <a href="https://publications.waset.org/search?q=hierarchical%20and%20directed%20graphs" title=" hierarchical and directed graphs"> hierarchical and directed graphs</a>, <a href="https://publications.waset.org/search?q=hypertext" title="hypertext">hypertext</a>, <a href="https://publications.waset.org/search?q=generalized%20trees" title=" generalized trees"> generalized trees</a>, <a href="https://publications.waset.org/search?q=web%20structure%20mining." title=" web structure mining."> web structure mining.</a> </p> <a href="https://publications.waset.org/15299/application-of-a-similarity-measure-for-graphs-to-web-based-document-structures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15299/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15299/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15299/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15299/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15299/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15299/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15299/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15299/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15299/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15299/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15299.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">1892</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">581</span> Towards Clustering of Web-based Document Structures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Matthias%20Dehmer">Matthias Dehmer</a>, <a href="https://publications.waset.org/search?q=Frank%20Emmert%20Streib"> Frank Emmert Streib</a>, <a href="https://publications.waset.org/search?q=J%C3%BCrgen%20Kilian"> Jürgen Kilian</a>, <a href="https://publications.waset.org/search?q=Andreas%20Zulauf"> Andreas Zulauf</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Methods for organizing web data into groups in order to analyze web-based hypertext data and facilitate data availability are very important in terms of the number of documents available online. Thereby, the task of clustering web-based document structures has many applications, e.g., improving information retrieval on the web, better understanding of user navigation behavior, improving web users requests servicing, and increasing web information accessibility. In this paper we investigate a new approach for clustering web-based hypertexts on the basis of their graph structures. The hypertexts will be represented as so called generalized trees which are more general than usual directed rooted trees, e.g., DOM-Trees. As a important preprocessing step we measure the structural similarity between the generalized trees on the basis of a similarity measure d. Then, we apply agglomerative clustering to the obtained similarity matrix in order to create clusters of hypertext graph patterns representing navigation structures. In the present paper we will run our approach on a data set of hypertext structures and obtain good results in Web Structure Mining. Furthermore we outline the application of our approach in Web Usage Mining as future work. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Clustering%20methods" title="Clustering methods">Clustering methods</a>, <a href="https://publications.waset.org/search?q=graph-based%20patterns" title=" graph-based patterns"> graph-based patterns</a>, <a href="https://publications.waset.org/search?q=graph%20similarity" title=" graph similarity"> graph similarity</a>, <a href="https://publications.waset.org/search?q=hypertext%20structures" title=" hypertext structures"> hypertext structures</a>, <a href="https://publications.waset.org/search?q=web%20structure%20mining" title=" web structure mining"> web structure mining</a> </p> <a href="https://publications.waset.org/10653/towards-clustering-of-web-based-document-structures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10653/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10653/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10653/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10653/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10653/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10653/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10653/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10653/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10653/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10653/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10653.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">1506</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">580</span> Heritage Tree Expert Assessment and Classification: Malaysian Perspective</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=B.-Y.-S.%20Lau">B.-Y.-S. Lau</a>, <a href="https://publications.waset.org/search?q=Y.-C.-T.%20Jonathan"> Y.-C.-T. Jonathan</a>, <a href="https://publications.waset.org/search?q=M.-S.%20Alias"> M.-S. Alias</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Heritage trees are natural large, individual trees with exceptionally value due to association with age or event or distinguished people. In Malaysia, there is an abundance of tropical heritage trees throughout the country. It is essential to set up a repository of heritage trees to prevent valuable trees from being cut down. In this cross domain study, a web-based online expert system namely the Heritage Tree Expert Assessment and Classification (HTEAC) is developed and deployed for public to nominate potential heritage trees. Based on the nomination, tree care experts or arborists would evaluate and verify the nominated trees as heritage trees. The expert system automatically rates the approved heritage trees according to pre-defined grades via Delphi technique. Features and usability test of the expert system are presented. Preliminary result is promising for the system to be used as a full scale public system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Arboriculture" title="Arboriculture">Arboriculture</a>, <a href="https://publications.waset.org/search?q=Delphi" title=" Delphi"> Delphi</a>, <a href="https://publications.waset.org/search?q=expert%20system" title=" expert system"> expert system</a>, <a href="https://publications.waset.org/search?q=heritage%20tree" title=" heritage tree"> heritage tree</a>, <a href="https://publications.waset.org/search?q=urban%20forestry." title=" urban forestry."> urban forestry.</a> </p> <a href="https://publications.waset.org/10007867/heritage-tree-expert-assessment-and-classification-malaysian-perspective" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10007867/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10007867/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10007867/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10007867/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10007867/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10007867/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10007867/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10007867/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10007867/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10007867/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10007867.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">1430</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">579</span> Evaluation of Hazardous Status of Avenue Trees in University of Port Harcourt</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=F.%20S.%20Eguakun">F. S. Eguakun</a>, <a href="https://publications.waset.org/search?q=T.%20C.%20Nkwor"> T. C. Nkwor </a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Trees in the university environment are uniquely position; however, they can also present a millstone to the infrastructure and humans they coexist with. The numerous benefits of trees can be negated due to poor tree health and anthropogenic activities and as such can become hazardous. The study aims at evaluating the hazardous status of avenue trees in University of Port Harcourt. Data were collected from all the avenue trees within the selected major roads in the University. Tree growth variables were measured and health condition of the avenue trees were assessed as an indicator of some structural defects. The hazard status of the avenue trees was determined. Several tree species were used as avenue trees in the University however, <em>Azadirachta indica</em> (81%) was found to be most abundant. The result shows that only 0.3% avenue tree species was found to pose severe harzard in Abuja part of the University. Most avenue trees (55.2%) were rated as medium hazard status. Due to the danger and risk associated with hazardous trees, the study recommends that good and effective management strategies be implemented so as to prevent future damages from trees with small or medium hazard status.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Avenue%20tree" title="Avenue tree">Avenue tree</a>, <a href="https://publications.waset.org/search?q=hazard%20status" title=" hazard status"> hazard status</a>, <a href="https://publications.waset.org/search?q=inventory" title=" inventory"> inventory</a>, <a href="https://publications.waset.org/search?q=urban." title=" urban. "> urban. </a> </p> <a href="https://publications.waset.org/10010560/evaluation-of-hazardous-status-of-avenue-trees-in-university-of-port-harcourt" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10010560/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10010560/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10010560/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10010560/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10010560/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10010560/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10010560/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10010560/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10010560/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10010560/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10010560.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">716</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">578</span> Generalized Fuzzy Subalgebras and Fuzzy Ideals of BCI-Algebras with Operators </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yuli%20Hu">Yuli Hu</a>, <a href="https://publications.waset.org/search?q=Shaoquan%20Sun"> Shaoquan Sun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this paper is to introduce the concepts of generalized fuzzy subalgebras, generalized fuzzy ideals and generalized fuzzy quotient algebras of BCI-algebras with operators, and to investigate their basic properties. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=BCI-algebras%20with%20operators" title="BCI-algebras with operators">BCI-algebras with operators</a>, <a href="https://publications.waset.org/search?q=generalized%20fuzzy%20subalgebras" title=" generalized fuzzy subalgebras"> generalized fuzzy subalgebras</a>, <a href="https://publications.waset.org/search?q=generalized%20fuzzy%20ideals" title=" generalized fuzzy ideals"> generalized fuzzy ideals</a>, <a href="https://publications.waset.org/search?q=generalized%20fuzzy%20quotient%20algebras." title=" generalized fuzzy quotient algebras."> generalized fuzzy quotient algebras.</a> </p> <a href="https://publications.waset.org/10008379/generalized-fuzzy-subalgebras-and-fuzzy-ideals-of-bci-algebras-with-operators" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10008379/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10008379/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10008379/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10008379/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10008379/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10008379/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10008379/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10008379/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10008379/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10008379/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10008379.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">814</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">577</span> Evolutionary Decision Trees and Software Metrics for Module Defects Identification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Monica%20Chi%C5%9F">Monica Chiş</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Software metric is a measure of some property of a piece of software or its specification. The aim of this paper is to present an application of evolutionary decision trees in software engineering in order to classify the software modules that have or have not one or more reported defects. For this some metrics are used for detecting the class of modules with defects or without defects. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Evolutionary%20decision%20trees" title="Evolutionary decision trees">Evolutionary decision trees</a>, <a href="https://publications.waset.org/search?q=decision%20trees" title=" decision trees"> decision trees</a>, <a href="https://publications.waset.org/search?q=softwaremetrics." title=" softwaremetrics."> softwaremetrics.</a> </p> <a href="https://publications.waset.org/8972/evolutionary-decision-trees-and-software-metrics-for-module-defects-identification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8972/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8972/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8972/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8972/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8972/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8972/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8972/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8972/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8972/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8972/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8972.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">1752</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">576</span> An Iterative Algorithm to Compute the Generalized Inverse A(2) T,S Under the Restricted Inner Product</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Xingping%20Sheng">Xingping Sheng</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let T and S be a subspace of Cn and Cm, respectively. Then for A ∈ Cm×n satisfied AT ⊕ S = Cm, the generalized inverse A(2) T,S is given by A(2) T,S = (PS⊥APT )†. In this paper, a finite formulae is presented to compute generalized inverse A(2) T,S under the concept of restricted inner product, which defined as < A,B >T,S=< PS⊥APT,B > for the A,B ∈ Cm×n. By this iterative method, when taken the initial matrix X0 = PTA∗PS⊥, the generalized inverse A(2) T,S can be obtained within at most mn iteration steps in absence of roundoff errors. Finally given numerical example is shown that the iterative formulae is quite efficient. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Generalized%20inverse%20A%282%29%0D%0AT" title="Generalized inverse A(2) T">Generalized inverse A(2) T</a>, <a href="https://publications.waset.org/search?q=S" title="S">S</a>, <a href="https://publications.waset.org/search?q=Restricted%20inner%20product" title=" Restricted inner product"> Restricted inner product</a>, <a href="https://publications.waset.org/search?q=Iterative%20method" title=" Iterative method"> Iterative method</a>, <a href="https://publications.waset.org/search?q=Orthogonal%20projection." title=" Orthogonal projection."> Orthogonal projection.</a> </p> <a href="https://publications.waset.org/9544/an-iterative-algorithm-to-compute-the-generalized-inverse-a2-ts-under-the-restricted-inner-product" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9544/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9544/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9544/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9544/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9544/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9544/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9544/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9544/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9544/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9544/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9544.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">1257</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">575</span> The New Relative Efficiency Based on the Least Eigenvalue in Generalized Linear Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Chao%20Yuan">Chao Yuan</a>, <a href="https://publications.waset.org/search?q=Bao%20Guang%20Tian"> Bao Guang Tian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A new relative efficiency is defined as LSE and BLUE in the generalized linear model. The relative efficiency is based on the ratio of the least eigenvalues. In this paper, we discuss about its lower bound and the relationship between it and generalized relative coefficient. Finally, this paper proves that the new estimation is better under Stein function and special condition in some degree. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Generalized%20linear%20model" title="Generalized linear model">Generalized linear model</a>, <a href="https://publications.waset.org/search?q=generalized%20relative%20coefficient" title=" generalized relative coefficient"> generalized relative coefficient</a>, <a href="https://publications.waset.org/search?q=least%20eigenvalue" title=" least eigenvalue"> least eigenvalue</a>, <a href="https://publications.waset.org/search?q=relative%20efficiency." title=" relative efficiency."> relative efficiency.</a> </p> <a href="https://publications.waset.org/10004984/the-new-relative-efficiency-based-on-the-least-eigenvalue-in-generalized-linear-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10004984/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10004984/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10004984/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10004984/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10004984/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10004984/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10004984/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10004984/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10004984/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10004984/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10004984.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">1188</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">574</span> Generalized Chebyshev Collocation Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Junghan%20Kim">Junghan Kim</a>, <a href="https://publications.waset.org/search?q=Wonkyu%20Chung"> Wonkyu Chung</a>, <a href="https://publications.waset.org/search?q=Sunyoung%20Bu"> Sunyoung Bu</a>, <a href="https://publications.waset.org/search?q=Philsu%20Kim"> Philsu Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we introduce a generalized Chebyshev collocation method (GCCM) based on the generalized Chebyshev polynomials for solving stiff systems. For employing a technique of the embedded Runge-Kutta method used in explicit schemes, the property of the generalized Chebyshev polynomials is used, in which the nodes for the higher degree polynomial are overlapped with those for the lower degree polynomial. The constructed algorithm controls both the error and the time step size simultaneously and further the errors at each integration step are embedded in the algorithm itself, which provides the efficiency of the computational cost. For the assessment of the effectiveness, numerical results obtained by the proposed method and the Radau IIA are presented and compared.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Generalized%20Chebyshev%20Collocation%20method" title="Generalized Chebyshev Collocation method">Generalized Chebyshev Collocation method</a>, <a href="https://publications.waset.org/search?q=Generalized%20Chebyshev%20Polynomial" title=" Generalized Chebyshev Polynomial"> Generalized Chebyshev Polynomial</a>, <a href="https://publications.waset.org/search?q=Initial%20value%20problem." title=" Initial value problem."> Initial value problem.</a> </p> <a href="https://publications.waset.org/9999909/generalized-chebyshev-collocation-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9999909/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9999909/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9999909/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9999909/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9999909/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9999909/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9999909/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9999909/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9999909/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9999909/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9999909.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">2640</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">573</span> (T1, T2)*- Semi Star Generalized Locally Closed Sets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Sundararaman">M. Sundararaman</a>, <a href="https://publications.waset.org/search?q=K.%20Chandrasekhara%20Rao"> K. Chandrasekhara Rao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The aim of this paper is to continue the study of (T1, T2)-semi star generalized closed sets by introducing the concepts of (T1, T2)-semi star generalized locally closed sets and study their basic properties in bitopological spaces.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=%28T1" title="(T1">(T1</a>, <a href="https://publications.waset.org/search?q=T2%29%2A-semi%20star%20generalized%20locally%20closed%20sets" title=" T2)*-semi star generalized locally closed sets"> T2)*-semi star generalized locally closed sets</a>, <a href="https://publications.waset.org/search?q=T1T2-semi%20star%20generalized%20closed%20sets." title=" T1T2-semi star generalized closed sets."> T1T2-semi star generalized closed sets.</a> </p> <a href="https://publications.waset.org/13485/t1-t2-semi-star-generalized-locally-closed-sets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13485/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13485/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13485/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13485/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13485/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13485/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13485/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13485/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13485/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13485/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13485.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1471</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">572</span> The Baer Radical of Rings in Term of Prime and Semiprime Generalized Bi-ideals</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Rattiya%20Boonruang">Rattiya Boonruang</a>, <a href="https://publications.waset.org/search?q=Aiyared%20Iampan"> Aiyared Iampan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Using the idea of prime and semiprime bi-ideals of rings, the concept of prime and semiprime generalized bi-ideals of rings is introduced, which is an extension of the concept of prime and semiprime bi-ideals of rings and some interesting characterizations of prime and semiprime generalized bi-ideals are obtained. Also, we give the relationship between the Baer radical and prime and semiprime generalized bi-ideals of rings in the same way as of biideals of rings which was studied by Roux. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=ring" title="ring">ring</a>, <a href="https://publications.waset.org/search?q=prime%20and%20semiprime%20%28generalized%29%20bi-ideal" title=" prime and semiprime (generalized) bi-ideal"> prime and semiprime (generalized) bi-ideal</a>, <a href="https://publications.waset.org/search?q=Baer%0Aradical." title=" Baer radical."> Baer radical.</a> </p> <a href="https://publications.waset.org/15439/the-baer-radical-of-rings-in-term-of-prime-and-semiprime-generalized-bi-ideals" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15439/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15439/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15439/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15439/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15439/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15439/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15439/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15439/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15439/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15439/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15439.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">1294</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">571</span> Convergence Analysis of the Generalized Alternating Two-Stage Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Guangbin%20Wang">Guangbin Wang</a>, <a href="https://publications.waset.org/search?q=Liangliang%20Li"> Liangliang Li</a>, <a href="https://publications.waset.org/search?q=Fuping%20Tan"> Fuping Tan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we give the generalized alternating twostage method in which the inner iterations are accomplished by a generalized alternating method. And we present convergence results of the method for solving nonsingular linear systems when the coefficient matrix of the linear system is a monotone matrix or an H-matrix.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Generalized%20alternating%20two-stage%20method" title="Generalized alternating two-stage method">Generalized alternating two-stage method</a>, <a href="https://publications.waset.org/search?q=linear%20system" title=" linear system"> linear system</a>, <a href="https://publications.waset.org/search?q=convergence." title=" convergence."> convergence.</a> </p> <a href="https://publications.waset.org/7714/convergence-analysis-of-the-generalized-alternating-two-stage-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7714/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7714/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7714/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7714/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7714/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7714/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7714/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7714/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7714/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7714/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7714.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">1259</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">570</span> Regular Generalized Star Star closed sets in Bitopological Spaces</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=K.%20Kannan">K. Kannan</a>, <a href="https://publications.waset.org/search?q=D.%20Narasimhan"> D. Narasimhan</a>, <a href="https://publications.waset.org/search?q=K.%20Chandrasekhara%20Rao"> K. Chandrasekhara Rao</a>, <a href="https://publications.waset.org/search?q=R.%20Ravikumar"> R. Ravikumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The aim of this paper is to introduce the concepts of τ1τ2-regular generalized star star closed sets , τ1τ2-regular generalized star star open sets and study their basic properties in bitopological spaces.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=%CF%841%CF%842-regular%20closed%20sets" title="τ1τ2-regular closed sets">τ1τ2-regular closed sets</a>, <a href="https://publications.waset.org/search?q=%CF%841%CF%842-regular%20open%20sets" title=" τ1τ2-regular open sets"> τ1τ2-regular open sets</a>, <a href="https://publications.waset.org/search?q=%CF%841%CF%842-regular%20generalized%20closed%20sets" title=" τ1τ2-regular generalized closed sets"> τ1τ2-regular generalized closed sets</a>, <a href="https://publications.waset.org/search?q=%CF%841%CF%842-regular%20generalized%20star%0D%0Aclosed%20sets" title=" τ1τ2-regular generalized star closed sets"> τ1τ2-regular generalized star closed sets</a>, <a href="https://publications.waset.org/search?q=%CF%841%CF%842-regular%20generalized%20star%20star%20closed%20sets." title=" τ1τ2-regular generalized star star closed sets."> τ1τ2-regular generalized star star closed sets.</a> </p> <a href="https://publications.waset.org/15440/regular-generalized-star-star-closed-sets-in-bitopological-spaces" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15440/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15440/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15440/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15440/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15440/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15440/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15440/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15440/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15440/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15440/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15440.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2212</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">569</span> A Generalized Framework for Working with Multiagent Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Debal%20Saha">Debal Saha</a>, <a href="https://publications.waset.org/search?q=NirmalBaranHui"> NirmalBaranHui</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The present paper discusses the basic concepts and the underlying principles of Multi-Agent Systems (MAS) along with an interdisciplinary exploitation of these principles. It has been found that they have been utilized for lots of research and studies on various systems spanning across diverse engineering and scientific realms showing the need of development of a proper generalized framework. Such framework has been developed for the Multi-Agent Systems and it has been generalized keeping in mind the diverse areas where they find application. All the related aspects have been categorized and a general definition has been given where ever possible.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Generalized%20framework" title="Generalized framework">Generalized framework</a>, <a href="https://publications.waset.org/search?q=multiagent%20systems." title=" multiagent systems."> multiagent systems.</a> </p> <a href="https://publications.waset.org/8419/a-generalized-framework-for-working-with-multiagent-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8419/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8419/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8419/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8419/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8419/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8419/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8419/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8419/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8419/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8419/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8419.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">1783</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">568</span> On Properties of Generalized Bi-Γ-Ideals of Γ-Semirings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Teerayut%20Chomchuen">Teerayut Chomchuen</a>, <a href="https://publications.waset.org/search?q=Aiyared%20Iampan"> Aiyared Iampan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The notion of Γ-semirings was introduced by Murali Krishna Rao as a generalization of the notion of Γ-rings as well as of semirings. We have known that the notion of Γ-semirings is a generalization of the notion of semirings. In this paper, extending Kaushik, Moin and Khan’s work, we generalize the notion of generalized bi-Γ-ideals of Γ-semirings and investigate some related properties of generalized bi-Γ-ideals.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=%CE%93-semiring" title="Γ-semiring">Γ-semiring</a>, <a href="https://publications.waset.org/search?q=bi-%CE%93-ideal" title=" bi-Γ-ideal"> bi-Γ-ideal</a>, <a href="https://publications.waset.org/search?q=generalized%20bi-%CE%93-ideal." title=" generalized bi-Γ-ideal."> generalized bi-Γ-ideal.</a> </p> <a href="https://publications.waset.org/17224/on-properties-of-generalized-bi-g-ideals-of-g-semirings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/17224/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/17224/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/17224/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/17224/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/17224/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/17224/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/17224/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/17224/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/17224/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/17224/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/17224.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">2293</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">567</span> Solving Linear Matrix Equations by Matrix Decompositions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yongxin%20Yuan">Yongxin Yuan</a>, <a href="https://publications.waset.org/search?q=Kezheng%20Zuo"> Kezheng Zuo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, a system of linear matrix equations is considered. A new necessary and sufficient condition for the consistency of the equations is derived by means of the generalized singular-value decomposition, and the explicit representation of the general solution is provided.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Matrix%20equation" title="Matrix equation">Matrix equation</a>, <a href="https://publications.waset.org/search?q=Generalized%20inverse" title=" Generalized inverse"> Generalized inverse</a>, <a href="https://publications.waset.org/search?q=Generalized%0D%0Asingular-value%20decomposition." title=" Generalized singular-value decomposition."> Generalized singular-value decomposition.</a> </p> <a href="https://publications.waset.org/10000378/solving-linear-matrix-equations-by-matrix-decompositions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10000378/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10000378/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10000378/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10000378/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10000378/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10000378/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10000378/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10000378/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10000378/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10000378/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10000378.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">2058</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">566</span> Restarted Generalized Second-Order Krylov Subspace Methods for Solving Quadratic Eigenvalue Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Liping%20Zhou">Liping Zhou</a>, <a href="https://publications.waset.org/search?q=Liang%20Bao"> Liang Bao</a>, <a href="https://publications.waset.org/search?q=Yiqin%20Lin"> Yiqin Lin</a>, <a href="https://publications.waset.org/search?q=Yimin%20Wei"> Yimin Wei</a>, <a href="https://publications.waset.org/search?q=Qinghua%20Wu"> Qinghua Wu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This article is devoted to the numerical solution of large-scale quadratic eigenvalue problems. Such problems arise in a wide variety of applications, such as the dynamic analysis of structural mechanical systems, acoustic systems, fluid mechanics, and signal processing. We first introduce a generalized second-order Krylov subspace based on a pair of square matrices and two initial vectors and present a generalized second-order Arnoldi process for constructing an orthonormal basis of the generalized second-order Krylov subspace. Then, by using the projection technique and the refined projection technique, we propose a restarted generalized second-order Arnoldi method and a restarted refined generalized second-order Arnoldi method for computing some eigenpairs of largescale quadratic eigenvalue problems. Some theoretical results are also presented. Some numerical examples are presented to illustrate the effectiveness of the proposed methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Quadratic%20eigenvalue%20problem" title="Quadratic eigenvalue problem">Quadratic eigenvalue problem</a>, <a href="https://publications.waset.org/search?q=Generalized%20secondorder%20Krylov%20subspace" title=" Generalized secondorder Krylov subspace"> Generalized secondorder Krylov subspace</a>, <a href="https://publications.waset.org/search?q=Generalized%20second-order%20Arnoldi%20process" title=" Generalized second-order Arnoldi process"> Generalized second-order Arnoldi process</a>, <a href="https://publications.waset.org/search?q=Projection%20technique" title=" Projection technique"> Projection technique</a>, <a href="https://publications.waset.org/search?q=Refined%20technique" title=" Refined technique"> Refined technique</a>, <a href="https://publications.waset.org/search?q=Restarting." title=" Restarting."> Restarting.</a> </p> <a href="https://publications.waset.org/9935/restarted-generalized-second-order-krylov-subspace-methods-for-solving-quadratic-eigenvalue-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9935/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9935/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9935/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9935/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9935/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9935/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9935/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9935/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9935/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9935/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9935.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1867</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">565</span> Minimization Problems for Generalized Reflexive and Generalized Anti-Reflexive Matrices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Yongxin%20Yuan">Yongxin Yuan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Let R ∈ Cm×m and S ∈ Cn×n be nontrivial unitary involutions, i.e., RH = R = R−1 = ±Im and SH = S = S−1 = ±In. A ∈ Cm×n is said to be a generalized reflexive (anti-reflexive) matrix if RAS = A (RAS = −A). Let ρ be the set of m × n generalized reflexive (anti-reflexive) matrices. Given X ∈ Cn×p, Z ∈ Cm×p, Y ∈ Cm×q and W ∈ Cn×q, we characterize the matrices A in ρ that minimize AX−Z2+Y HA−WH2, and, given an arbitrary A&tilde; ∈ Cm×n, we find a unique matrix among the minimizers of AX − Z2 + Y HA − WH2 in ρ that minimizes A − A&tilde;. We also obtain sufficient and necessary conditions for existence of A ∈ ρ such that AX = Z, Y HA = WH, and characterize the set of all such matrices A if the conditions are satisfied. These results are applied to solve a class of left and right inverse eigenproblems for generalized reflexive (anti-reflexive) matrices.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=approximation" title="approximation">approximation</a>, <a href="https://publications.waset.org/search?q=generalized%20reflexive%20matrix" title=" generalized reflexive matrix"> generalized reflexive matrix</a>, <a href="https://publications.waset.org/search?q=generalized%0D%0Aanti-reflexive%20matrix" title=" generalized anti-reflexive matrix"> generalized anti-reflexive matrix</a>, <a href="https://publications.waset.org/search?q=inverse%20eigenvalue%20problem." title=" inverse eigenvalue problem."> inverse eigenvalue problem.</a> </p> <a href="https://publications.waset.org/17082/minimization-problems-for-generalized-reflexive-and-generalized-anti-reflexive-matrices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/17082/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/17082/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/17082/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/17082/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/17082/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/17082/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/17082/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/17082/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/17082/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/17082/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/17082.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">1108</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">564</span> The Mutated Distance between Two Mixture Trees</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Wan%20Chian%20Li">Wan Chian Li</a>, <a href="https://publications.waset.org/search?q=Justie%20Su-Tzu%20Juan"> Justie Su-Tzu Juan</a>, <a href="https://publications.waset.org/search?q=Yi-Chun%20Wang"> Yi-Chun Wang</a>, <a href="https://publications.waset.org/search?q=Shu-Chuan%20Chen"> Shu-Chuan Chen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The evolutionary tree is an important topic in bioinformation. In 2006, Chen and Lindsay proposed a new method to build the mixture tree from DNA sequences. Mixture tree is a new type evolutionary tree, and it has two additional information besides the information of ordinary evolutionary tree. One of the information is time parameter, and the other is the set of mutated sites. In 2008, Lin and Juan proposed an algorithm to compute the distance between two mixture trees. Their algorithm computes the distance with only considering the time parameter between two mixture trees. In this paper, we proposes a method to measure the similarity of two mixture trees with considering the set of mutated sites and develops two algorithm to compute the distance between two mixture trees. The time complexity of these two proposed algorithms are O(n2 × max{h(T1), h(T2)}) and O(n2), respectively</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=evolutionary%20tree" title="evolutionary tree">evolutionary tree</a>, <a href="https://publications.waset.org/search?q=mixture%20tree" title=" mixture tree"> mixture tree</a>, <a href="https://publications.waset.org/search?q=mutated%20site" title=" mutated site"> mutated site</a>, <a href="https://publications.waset.org/search?q=distance." title=" distance."> distance.</a> </p> <a href="https://publications.waset.org/14336/the-mutated-distance-between-two-mixture-trees" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14336/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14336/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14336/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14336/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14336/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14336/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14336/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14336/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14336/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14336/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14336.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">1416</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">563</span> Generalized Chaplygin Gas and Varying Bulk Viscosity in Lyra Geometry</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.%20K.%20Sethi">A. K. Sethi</a>, <a href="https://publications.waset.org/search?q=R.%20N.%20Patra"> R. N. Patra</a>, <a href="https://publications.waset.org/search?q=B.%20Nayak"> B. Nayak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we have considered Friedmann-Robertson-Walker (FRW) metric with generalized Chaplygin gas which has viscosity in the context of Lyra geometry. The viscosity is considered in two different ways (i.e. zero viscosity, non-constant <em>r</em> (rho)-dependent bulk viscosity) using constant deceleration parameter which concluded that, for a special case, the viscous generalized Chaplygin gas reduces to modified Chaplygin gas. The represented model indicates on the presence of Chaplygin gas in the Universe. Observational constraints are applied and discussed on the physical and geometrical nature of the Universe.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Bulk%20viscosity" title="Bulk viscosity">Bulk viscosity</a>, <a href="https://publications.waset.org/search?q=Lyra%20geometry" title=" Lyra geometry"> Lyra geometry</a>, <a href="https://publications.waset.org/search?q=generalized%20Chaplygin%20gas" title=" generalized Chaplygin gas"> generalized Chaplygin gas</a>, <a href="https://publications.waset.org/search?q=cosmology." title=" cosmology."> cosmology.</a> </p> <a href="https://publications.waset.org/10010904/generalized-chaplygin-gas-and-varying-bulk-viscosity-in-lyra-geometry" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10010904/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10010904/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10010904/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10010904/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10010904/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10010904/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10010904/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10010904/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10010904/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10010904/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10010904.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">797</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">562</span> Weyl Type Theorem and the Fuglede Property</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20H.%20M.%20Rashid">M. H. M. Rashid</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Given H a Hilbert space and B(H) the algebra of bounded linear operator in H, let δAB denote the generalized derivation defined by A and B. The main objective of this article is to study Weyl type theorems for generalized derivation for (A,B) satisfying a couple of Fuglede. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Fuglede%20Property" title="Fuglede Property">Fuglede Property</a>, <a href="https://publications.waset.org/search?q=Weyl%E2%80%99s%20theorem" title=" Weyl’s theorem"> Weyl’s theorem</a>, <a href="https://publications.waset.org/search?q=generalized%0D%0Aderivation" title=" generalized derivation"> generalized derivation</a>, <a href="https://publications.waset.org/search?q=Aluthge%20Transformation." title=" Aluthge Transformation."> Aluthge Transformation.</a> </p> <a href="https://publications.waset.org/10011450/weyl-type-theorem-and-the-fuglede-property" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10011450/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10011450/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10011450/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10011450/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10011450/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10011450/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10011450/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10011450/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10011450/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10011450/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10011450.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">555</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">561</span> Implementation of Generalized Plasticity in Load-Deformation Behavior of Foundation with Emphasis on Localization Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.%20H.%20Akhaveissy">A. H. Akhaveissy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nonlinear finite element method with eight noded isoparametric quadrilateral element is used for prediction of loaddeformation behavior including bearing capacity of foundations. Modified generalized plasticity model with non-associated flow rule is applied for analysis of soil-footing system. Also Von Mises and Tresca criterions are used for simulation of soil behavior. Modified generalized plasticity model is able to simulate load-deformation including softening behavior. Localization phenomena are considered by different meshes. Localization phenomena have not been seen in the examples. Predictions by modified generalized plasticity model show good agreement with laboratory data and theoretical prediction in comparison the other models. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Localization%20phenomena" title="Localization phenomena">Localization phenomena</a>, <a href="https://publications.waset.org/search?q=Generalized%20plasticity" title=" Generalized plasticity"> Generalized plasticity</a>, <a href="https://publications.waset.org/search?q=Non-associated%20Flow%20Rule" title="Non-associated Flow Rule">Non-associated Flow Rule</a> </p> <a href="https://publications.waset.org/2814/implementation-of-generalized-plasticity-in-load-deformation-behavior-of-foundation-with-emphasis-on-localization-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2814/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2814/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2814/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2814/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2814/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2814/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2814/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2814/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2814/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2814/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2814.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1595</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">560</span> Generating Concept Trees from Dynamic Self-organizing Map</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Norashikin%20Ahmad">Norashikin Ahmad</a>, <a href="https://publications.waset.org/search?q=Damminda%20Alahakoon"> Damminda Alahakoon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Self-organizing map (SOM) provides both clustering and visualization capabilities in mining data. Dynamic self-organizing maps such as Growing Self-organizing Map (GSOM) has been developed to overcome the problem of fixed structure in SOM to enable better representation of the discovered patterns. However, in mining large datasets or historical data the hierarchical structure of the data is also useful to view the cluster formation at different levels of abstraction. In this paper, we present a technique to generate concept trees from the GSOM. The formation of tree from different spread factor values of GSOM is also investigated and the quality of the trees analyzed. The results show that concept trees can be generated from GSOM, thus, eliminating the need for re-clustering of the data from scratch to obtain a hierarchical view of the data under study.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=dynamic%20self-organizing%20map" title="dynamic self-organizing map">dynamic self-organizing map</a>, <a href="https://publications.waset.org/search?q=concept%20formation" title=" concept formation"> concept formation</a>, <a href="https://publications.waset.org/search?q=clustering." title=" clustering."> clustering.</a> </p> <a href="https://publications.waset.org/7922/generating-concept-trees-from-dynamic-self-organizing-map" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7922/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7922/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7922/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7922/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7922/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7922/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7922/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7922/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7922/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7922/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7922.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">1459</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">559</span> On Fourier Type Integral Transform for a Class of Generalized Quotients</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.%20S.%20Issa">A. S. Issa</a>, <a href="https://publications.waset.org/search?q=S.%20K.%20Q.%20AL-Omari"> S. K. Q. AL-Omari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we investigate certain spaces of generalized functions for the Fourier and Fourier type integral transforms. We discuss convolution theorems and establish certain spaces of distributions for the considered integrals. The new Fourier type integral is well-defined, linear, one-to-one and continuous with respect to certain types of convergences. Many properties and an inverse problem are also discussed in some details. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Fourier%20type%20integral" title="Fourier type integral">Fourier type integral</a>, <a href="https://publications.waset.org/search?q=Fourier%20integral" title=" Fourier integral"> Fourier integral</a>, <a href="https://publications.waset.org/search?q=generalized%0D%0Aquotient" title=" generalized quotient"> generalized quotient</a>, <a href="https://publications.waset.org/search?q=Boehmian" title=" Boehmian"> Boehmian</a>, <a href="https://publications.waset.org/search?q=distribution." title=" distribution."> distribution.</a> </p> <a href="https://publications.waset.org/10004771/on-fourier-type-integral-transform-for-a-class-of-generalized-quotients" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10004771/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10004771/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10004771/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10004771/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10004771/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10004771/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10004771/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10004771/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10004771/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10004771/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10004771.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">1182</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">558</span> Independent Spanning Trees on Systems-on-chip Hypercubes Routing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Eduardo%20Sant%27Ana%20da%20Silva">Eduardo Sant'Ana da Silva</a>, <a href="https://publications.waset.org/search?q=Andre%20Luiz%20Pires%20Guedes"> Andre Luiz Pires Guedes</a>, <a href="https://publications.waset.org/search?q=Eduardo%20Todt"> Eduardo Todt</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Independent spanning trees (ISTs) provide a number of advantages in data broadcasting. One can cite the use in fault tolerance network protocols for distributed computing and bandwidth. However, the problem of constructing multiple ISTs is considered hard for arbitrary graphs. In this paper we present an efficient algorithm to construct ISTs on hypercubes that requires minimum resources to be performed.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Hypercube" title="Hypercube">Hypercube</a>, <a href="https://publications.waset.org/search?q=Independent%20Spanning%20Trees" title=" Independent Spanning Trees"> Independent Spanning Trees</a>, <a href="https://publications.waset.org/search?q=Networks%0D%0AOn%20Chip" title=" Networks On Chip"> Networks On Chip</a>, <a href="https://publications.waset.org/search?q=Systems%20On%20Chip." title=" Systems On Chip."> Systems On Chip.</a> </p> <a href="https://publications.waset.org/11659/independent-spanning-trees-on-systems-on-chip-hypercubes-routing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11659/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11659/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11659/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11659/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11659/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11659/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11659/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11659/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11659/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11659/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11659.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">1886</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">557</span> Comparison of Phylogenetic Trees of Multiple Protein Sequence Alignment Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Khaddouja%20Boujenfa">Khaddouja Boujenfa</a>, <a href="https://publications.waset.org/search?q=Nadia%20Essoussi"> Nadia Essoussi</a>, <a href="https://publications.waset.org/search?q=Mohamed%20Limam"> Mohamed Limam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Multiple sequence alignment is a fundamental part in many bioinformatics applications such as phylogenetic analysis. Many alignment methods have been proposed. Each method gives a different result for the same data set, and consequently generates a different phylogenetic tree. Hence, the chosen alignment method affects the resulting tree. However in the literature, there is no evaluation of multiple alignment methods based on the comparison of their phylogenetic trees. This work evaluates the following eight aligners: ClustalX, T-Coffee, SAGA, MUSCLE, MAFFT, DIALIGN, ProbCons and Align-m, based on their phylogenetic trees (test trees) produced on a given data set. The Neighbor-Joining method is used to estimate trees. Three criteria, namely, the dNNI, the dRF and the Id_Tree are established to test the ability of different alignment methods to produce closer test tree compared to the reference one (true tree). Results show that the method which produces the most accurate alignment gives the nearest test tree to the reference tree. MUSCLE outperforms all aligners with respect to the three criteria and for all datasets, performing particularly better when sequence identities are within 10-20%. It is followed by T-Coffee at lower sequence identity (<10%), Align-m at 20-30% identity, and ClustalX and ProbCons at 30-50% identity. Also, it is noticed that when sequence identities are higher (>30%), trees scores of all methods become similar. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Multiple%20alignment%20methods" title="Multiple alignment methods">Multiple alignment methods</a>, <a href="https://publications.waset.org/search?q=phylogenetic%20trees" title=" phylogenetic trees"> phylogenetic trees</a>, <a href="https://publications.waset.org/search?q=Neighbor-Joining%20method" title=" Neighbor-Joining method"> Neighbor-Joining method</a>, <a href="https://publications.waset.org/search?q=Robinson-Foulds%20distance." title=" Robinson-Foulds distance."> Robinson-Foulds distance.</a> </p> <a href="https://publications.waset.org/4182/comparison-of-phylogenetic-trees-of-multiple-protein-sequence-alignment-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4182/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4182/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4182/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4182/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4182/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4182/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4182/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4182/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4182/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4182/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4182.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1827</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">556</span> The Induced Generalized Hybrid Averaging Operator and its Application in Financial Decision Making</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jos%C3%A9%20M.%20Merig%C3%B3">José M. Merigó</a>, <a href="https://publications.waset.org/search?q=Montserrat%20Casanovas"> Montserrat Casanovas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present the induced generalized hybrid averaging (IGHA) operator. It is a new aggregation operator that generalizes the hybrid averaging (HA) by using generalized means and order inducing variables. With this formulation, we get a wide range of mean operators such as the induced HA (IHA), the induced hybrid quadratic averaging (IHQA), the HA, etc. The ordered weighted averaging (OWA) operator and the weighted average (WA) are included as special cases of the HA operator. Therefore, with this generalization we can obtain a wide range of aggregation operators such as the induced generalized OWA (IGOWA), the generalized OWA (GOWA), etc. We further generalize the IGHA operator by using quasi-arithmetic means. Then, we get the Quasi-IHA operator. Finally, we also develop an illustrative example of the new approach in a financial decision making problem. The main advantage of the IGHA is that it gives a more complete view of the decision problem to the decision maker because it considers a wide range of situations depending on the operator used. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Decision%20making" title="Decision making">Decision making</a>, <a href="https://publications.waset.org/search?q=Aggregation%20operators" title=" Aggregation operators"> Aggregation operators</a>, <a href="https://publications.waset.org/search?q=OWA%20operator" title=" OWA operator"> OWA operator</a>, <a href="https://publications.waset.org/search?q=Generalized%20means" title=" Generalized means"> Generalized means</a>, <a href="https://publications.waset.org/search?q=Selection%20of%20investments." title=" Selection of investments."> Selection of investments.</a> </p> <a href="https://publications.waset.org/15546/the-induced-generalized-hybrid-averaging-operator-and-its-application-in-financial-decision-making" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15546/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15546/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15546/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15546/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15546/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15546/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15546/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15546/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15546/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15546/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15546.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">1500</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">555</span> Ranking Genes from DNA Microarray Data of Cervical Cancer by a local Tree Comparison</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Frank%20Emmert-Streib">Frank Emmert-Streib</a>, <a href="https://publications.waset.org/search?q=Matthias%20Dehmer"> Matthias Dehmer</a>, <a href="https://publications.waset.org/search?q=Jing%20Liu"> Jing Liu</a>, <a href="https://publications.waset.org/search?q=Max%20Muhlhauser"> Max Muhlhauser</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The major objective of this paper is to introduce a new method to select genes from DNA microarray data. As criterion to select genes we suggest to measure the local changes in the correlation graph of each gene and to select those genes whose local changes are largest. More precisely, we calculate the correlation networks from DNA microarray data of cervical cancer whereas each network represents a tissue of a certain tumor stage and each node in the network represents a gene. From these networks we extract one tree for each gene by a local decomposition of the correlation network. The interpretation of a tree is that it represents the n-nearest neighbor genes on the n-th level of a tree, measured by the Dijkstra distance, and, hence, gives the local embedding of a gene within the correlation network. For the obtained trees we measure the pairwise similarity between trees rooted by the same gene from normal to cancerous tissues. This evaluates the modification of the tree topology due to tumor progression. Finally, we rank the obtained similarity values from all tissue comparisons and select the top ranked genes. For these genes the local neighborhood in the correlation networks changes most between normal and cancerous tissues. As a result we find that the top ranked genes are candidates suspected to be involved in tumor growth. This indicates that our method captures essential information from the underlying DNA microarray data of cervical cancer.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Graph%20similarity" title="Graph similarity">Graph similarity</a>, <a href="https://publications.waset.org/search?q=generalized%20trees" title=" generalized trees"> generalized trees</a>, <a href="https://publications.waset.org/search?q=graph%20alignment" title=" graph alignment"> graph alignment</a>, <a href="https://publications.waset.org/search?q=DNA%20microarray%20data" title=" DNA microarray data"> DNA microarray data</a>, <a href="https://publications.waset.org/search?q=cervical%20cancer." title=" cervical cancer."> cervical cancer.</a> </p> <a href="https://publications.waset.org/4875/ranking-genes-from-dna-microarray-data-of-cervical-cancer-by-a-local-tree-comparison" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4875/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4875/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4875/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4875/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4875/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4875/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4875/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4875/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4875/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4875/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4875.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">1753</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">554</span> Behrens-Fisher Problem with One Variance Unknown</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sa-aat%20Niwitpong">Sa-aat Niwitpong</a>, <a href="https://publications.waset.org/search?q=Rada%20Somkhuean"> Rada Somkhuean</a>, <a href="https://publications.waset.org/search?q=Suparat%20Niwitpong"> Suparat Niwitpong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper presents the generalized p-values for testing the Behrens-Fisher problem when one variance is unknown. We also derive a closed form expression of the upper bound of the proposed generalized p-value.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Generalized%20p-value" title="Generalized p-value">Generalized p-value</a>, <a href="https://publications.waset.org/search?q=hypothesis%20testing" title=" hypothesis testing"> hypothesis testing</a>, <a href="https://publications.waset.org/search?q=upper%20bound." title=" upper bound."> upper bound.</a> </p> <a href="https://publications.waset.org/16728/behrens-fisher-problem-with-one-variance-unknown" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/16728/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/16728/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/16728/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/16728/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/16728/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/16728/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/16728/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/16728/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/16728/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/16728/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/16728.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1457</span> </span> </div> </div> <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=generalized%20trees&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=generalized%20trees&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=generalized%20trees&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=generalized%20trees&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=generalized%20trees&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=generalized%20trees&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=generalized%20trees&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=generalized%20trees&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=generalized%20trees&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=generalized%20trees&page=19">19</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=generalized%20trees&page=20">20</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=generalized%20trees&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>