CINXE.COM

Search results for: star schema

<!DOCTYPE html> <html lang="en" dir="ltr"> <head> <!-- Google tag (gtag.js) --> <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> <!-- Yandex.Metrika counter --> <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> <!-- /Yandex.Metrika counter --> <!-- Matomo --> <!-- End Matomo Code --> <title>Search results for: star schema</title> <meta name="description" content="Search results for: star schema"> <meta name="keywords" content="star schema"> <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="star schema" 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="star schema"> <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> 109</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: star schema</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">109</span> The Comparison of Anchor and Star Schema from a Query Performance Perspective</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Radek%20N%C4%9Bmec">Radek Němec</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Today's business environment requires that companies have access to highly relevant information in a matter of seconds. Modern Business Intelligence tools rely on data structured mostly in traditional dimensional database schemas, typically represented by star schemas. Dimensional modeling is already recognized as a leading industry standard in the field of data warehousing although several drawbacks and pitfalls were reported. This paper focuses on the analysis of another data warehouse modeling technique - the anchor modeling, and its characteristics in context with the standardized dimensional modeling technique from a query performance perspective. The results of the analysis show information about performance of queries executed on database schemas structured according to principles of each database modeling technique. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Data%20warehousing" title="Data warehousing">Data warehousing</a>, <a href="https://publications.waset.org/search?q=anchor%20modeling" title=" anchor modeling"> anchor modeling</a>, <a href="https://publications.waset.org/search?q=star%20schema" title=" star schema"> star schema</a>, <a href="https://publications.waset.org/search?q=anchor%20schema" title=" anchor schema"> anchor schema</a>, <a href="https://publications.waset.org/search?q=query%20performance." title=" query performance."> query performance.</a> </p> <a href="https://publications.waset.org/4000/the-comparison-of-anchor-and-star-schema-from-a-query-performance-perspective" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4000/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4000/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4000/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4000/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4000/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4000/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4000/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4000/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4000/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4000/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4000.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">3319</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">108</span> XML Schema Automatic Matching Solution</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Huynh%20Quyet%20Thang">Huynh Quyet Thang</a>, <a href="https://publications.waset.org/search?q=Vo%20Sy%20Nam"> Vo Sy Nam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Schema matching plays a key role in many different applications, such as schema integration, data integration, data warehousing, data transformation, E-commerce, peer-to-peer data management, ontology matching and integration, semantic Web, semantic query processing, etc. Manual matching is expensive and error-prone, so it is therefore important to develop techniques to automate the schema matching process. In this paper, we present a solution for XML schema automated matching problem which produces semantic mappings between corresponding schema elements of given source and target schemas. This solution contributed in solving more comprehensively and efficiently XML schema automated matching problem. Our solution based on combining linguistic similarity, data type compatibility and structural similarity of XML schema elements. After describing our solution, we present experimental results that demonstrate the effectiveness of this approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=XML%20Schema" title="XML Schema">XML Schema</a>, <a href="https://publications.waset.org/search?q=Schema%20Matching" title=" Schema Matching"> Schema Matching</a>, <a href="https://publications.waset.org/search?q=SemanticMatching" title=" SemanticMatching"> SemanticMatching</a>, <a href="https://publications.waset.org/search?q=Automatic%20XML%20Schema%20Matching." title=" Automatic XML Schema Matching."> Automatic XML Schema Matching.</a> </p> <a href="https://publications.waset.org/3391/xml-schema-automatic-matching-solution" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3391/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3391/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3391/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3391/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3391/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3391/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3391/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3391/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3391/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3391/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3391.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">1831</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">107</span> Business Rules for Data Warehouse</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Rajeev%20Kaula">Rajeev Kaula</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Business rules and data warehouse are concepts and technologies that impact a wide variety of organizational tasks. In general, each area has evolved independently, impacting application development and decision-making. Generating knowledge from data warehouse is a complex process. This paper outlines an approach to ease import of information and knowledge from a data warehouse star schema through an inference class of business rules. The paper utilizes the Oracle database for illustrating the working of the concepts. The star schema structure and the business rules are stored within a relational database. The approach is explained through a prototype in Oracle-s PL/SQL Server Pages. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Business%20Rules" title="Business Rules">Business Rules</a>, <a href="https://publications.waset.org/search?q=Data%20warehouse" title=" Data warehouse"> Data warehouse</a>, <a href="https://publications.waset.org/search?q=PL%2FSQL%20ServerPages" title=" PL/SQL ServerPages"> PL/SQL ServerPages</a>, <a href="https://publications.waset.org/search?q=Relational%20model" title=" Relational model"> Relational model</a>, <a href="https://publications.waset.org/search?q=Web%20Application." title=" Web Application."> Web Application.</a> </p> <a href="https://publications.waset.org/4660/business-rules-for-data-warehouse" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4660/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4660/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4660/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4660/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4660/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4660/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4660/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4660/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4660/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4660/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4660.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">2984</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">106</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 &tau;1&tau;2-regular generalized star star closed sets , &tau;1&tau;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">105</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">104</span> Development of Star Tracker for Satellite</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=S.%20Yelubayev">S. Yelubayev</a>, <a href="https://publications.waset.org/search?q=V.%20Ten"> V. Ten</a>, <a href="https://publications.waset.org/search?q=B.%20Albazarov"> B. Albazarov</a>, <a href="https://publications.waset.org/search?q=E.%20Sarsenbayev"> E. Sarsenbayev</a>, <a href="https://publications.waset.org/search?q=%D0%9A.%20%D0%90lipbayev"> К. Аlipbayev</a>, <a href="https://publications.waset.org/search?q=A.%20Shamro"> A. Shamro</a>, <a href="https://publications.waset.org/search?q=%D0%A2.%20Bopeyev"> Т. Bopeyev</a>, <a href="https://publications.waset.org/search?q=%D0%90.%20Sukhenko"> А. Sukhenko</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Much attention is paid to the development of space branch in Kazakhstan at present. Two Earth remote sensing satellites of Kazakhstan have been launched successfully. Many projects related to the development of components for satellite are carried in Kazakhstan, in particular the project related to the development of star tracker experimental model. It is planned to use the results of this project for development of star tracker prototype in the future. This article describes the main stages of development of star tracker experimental model.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Development" title="Development">Development</a>, <a href="https://publications.waset.org/search?q=prototype" title=" prototype"> prototype</a>, <a href="https://publications.waset.org/search?q=satellite" title=" satellite"> satellite</a>, <a href="https://publications.waset.org/search?q=star%20tracker." title=" star tracker."> star tracker.</a> </p> <a href="https://publications.waset.org/10000793/development-of-star-tracker-for-satellite" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10000793/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10000793/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10000793/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10000793/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10000793/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10000793/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10000793/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10000793/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10000793/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10000793/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10000793.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">2934</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">103</span> Agent-Based Offline Electronic Voting</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mehmet%20Tahir%20Sand%C4%B1kkaya">Mehmet Tahir Sandıkkaya</a>, <a href="https://publications.waset.org/search?q=B%C3%BClent%20%C3%96rencik"> Bülent Örencik</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Many electronic voting systems, classified mainly as homomorphic cryptography based, mix-net based and blind signature based, appear after the eighties when zero knowledge proofs were introduced. The common ground for all these three systems is that none of them works without real time cryptologic calculations that should be held on a server. As far as known, the agent-based approach has not been used in a secure electronic voting system. In this study, an agent-based electronic voting schema, which does not contain real time calculations on the server side, is proposed. Conventional cryptologic methods are used in the proposed schema and some of the requirements of an electronic voting system are constructed within the schema. The schema seems quite secure if the used cryptologic methods and agents are secure. In this paper, proposed schema will be explained and compared with already known electronic voting systems.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Electronic%20voting" title="Electronic voting">Electronic voting</a>, <a href="https://publications.waset.org/search?q=E-voting" title=" E-voting"> E-voting</a>, <a href="https://publications.waset.org/search?q=Mobile%20softwareagents" title=" Mobile softwareagents"> Mobile softwareagents</a>, <a href="https://publications.waset.org/search?q=Offline%20electronic%20voting." title=" Offline electronic voting."> Offline electronic voting.</a> </p> <a href="https://publications.waset.org/11052/agent-based-offline-electronic-voting" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/11052/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/11052/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/11052/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/11052/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/11052/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/11052/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/11052/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/11052/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/11052/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/11052/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/11052.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">1539</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">102</span> The Correlation between Users’ Star Rating and Usability on Mobile Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Abdulmohsen%20A.%20AlBesher">Abdulmohsen A. AlBesher</a>, <a href="https://publications.waset.org/search?q=Richard%20T.%20Stone"> Richard T. Stone</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Star rating for mobile applications is a very useful way to differentiate between the best and worst rated applications. However, the question is whether the rating reflects the level of usability or not. The aim of this paper is to find out if the user&rsquo; star ratings on mobile apps correlate with the usability of those apps. Thus, we tested three mobile apps, which have different star ratings: low, medium, and high. Participating in the study, 15 mobile phone users were asked to do one single task for each of the three tested apps. After each task, the participant evaluated the app by answering a survey based on the System Usability Scale (SUS). The results found that there is no major correlation between the star rating and the usability. However, it was found that the task completion time and the numbers of errors that may happen while completing the task were significantly correlated to the usability. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Mobile%20applications" title="Mobile applications">Mobile applications</a>, <a href="https://publications.waset.org/search?q=SUS" title=" SUS"> SUS</a>, <a href="https://publications.waset.org/search?q=Star%20rating" title=" Star rating"> Star rating</a>, <a href="https://publications.waset.org/search?q=Usability." title=" Usability."> Usability.</a> </p> <a href="https://publications.waset.org/10006963/the-correlation-between-users-star-rating-and-usability-on-mobile-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10006963/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10006963/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10006963/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10006963/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10006963/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10006963/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10006963/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10006963/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10006963/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10006963/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10006963.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">919</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">101</span> A Hamiltonian Decomposition of 5-star</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Walter%20Hussak">Walter Hussak</a>, <a href="https://publications.waset.org/search?q=Heiko%20Schr%C3%B6der"> Heiko Schröder</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Star graphs are Cayley graphs of symmetric groups of permutations, with transpositions as the generating sets. A star graph is a preferred interconnection network topology to a hypercube for its ability to connect a greater number of nodes with lower degree. However, an attractive property of the hypercube is that it has a Hamiltonian decomposition, i.e. its edges can be partitioned into disjoint Hamiltonian cycles, and therefore a simple routing can be found in the case of an edge failure. The existence of Hamiltonian cycles in Cayley graphs has been known for some time. So far, there are no published results on the much stronger condition of the existence of Hamiltonian decompositions. In this paper, we give a construction of a Hamiltonian decomposition of the star graph 5-star of degree 4, by defining an automorphism for 5-star and a Hamiltonian cycle which is edge-disjoint with its image under the automorphism.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=interconnection%20networks" title="interconnection networks">interconnection networks</a>, <a href="https://publications.waset.org/search?q=paths%20and%20cycles" title=" paths and cycles"> paths and cycles</a>, <a href="https://publications.waset.org/search?q=graphs%20andgroups." title=" graphs andgroups."> graphs andgroups.</a> </p> <a href="https://publications.waset.org/5655/a-hamiltonian-decomposition-of-5-star" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5655/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5655/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5655/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5655/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5655/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5655/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5655/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5655/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5655/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5655/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5655.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">1746</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">100</span> The Load Balancing Algorithm for the Star Interconnection Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ahmad%20M.%20Awwad">Ahmad M. Awwad</a>, <a href="https://publications.waset.org/search?q=Jehad%20Al-Sadi"> Jehad Al-Sadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The star network is one of the promising interconnection networks for future high speed parallel computers, it is expected to be one of the future-generation networks. The star network is both edge and vertex symmetry, it was shown to have many gorgeous topological proprieties also it is owns hierarchical structure framework. Although much of the research work has been done on this promising network in literature, it still suffers from having enough algorithms for load balancing problem. In this paper we try to work on this issue by investigating and proposing an efficient algorithm for load balancing problem for the star network. The proposed algorithm is called Star Clustered Dimension Exchange Method SCDEM to be implemented on the star network. The proposed algorithm is based on the Clustered Dimension Exchange Method (CDEM). The SCDEM algorithm is shown to be efficient in redistributing the load balancing as evenly as possible among all nodes of different factor networks.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Interconnection%20networks" title="Interconnection networks">Interconnection networks</a>, <a href="https://publications.waset.org/search?q=Load%20balancing" title=" Load balancing"> Load balancing</a>, <a href="https://publications.waset.org/search?q=Star%0D%0Anetwork." title=" Star network."> Star network.</a> </p> <a href="https://publications.waset.org/10000219/the-load-balancing-algorithm-for-the-star-interconnection-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10000219/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10000219/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10000219/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10000219/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10000219/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10000219/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10000219/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10000219/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10000219/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10000219/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10000219.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">2107</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">99</span> An Optimization Algorithm Based on Dynamic Schema with Dissimilarities and Similarities of Chromosomes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Radhwan%20Yousif%20Sedik%20Al-Jawadi">Radhwan Yousif Sedik Al-Jawadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Optimization is necessary for finding appropriate solutions to a range of real-life problems. In particular, genetic (or more generally, evolutionary) algorithms have proved very useful in solving many problems for which analytical solutions are not available. In this paper, we present an optimization algorithm called Dynamic Schema with Dissimilarity and Similarity of Chromosomes (DSDSC) which is a variant of the classical genetic algorithm. This approach constructs new chromosomes from a schema and pairs of existing ones by exploring their dissimilarities and similarities. To show the effectiveness of the algorithm, it is tested and compared with the classical GA, on 15 two-dimensional optimization problems taken from literature. We have found that, in most cases, our method is better than the classical genetic algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20algorithm" title="Genetic algorithm">Genetic algorithm</a>, <a href="https://publications.waset.org/search?q=similarity%20and%20dissimilarity" title=" similarity and dissimilarity"> similarity and dissimilarity</a>, <a href="https://publications.waset.org/search?q=chromosome%20injection" title=" chromosome injection"> chromosome injection</a>, <a href="https://publications.waset.org/search?q=dynamic%20schema." title=" dynamic schema."> dynamic schema.</a> </p> <a href="https://publications.waset.org/10005170/an-optimization-algorithm-based-on-dynamic-schema-with-dissimilarities-and-similarities-of-chromosomes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10005170/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10005170/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10005170/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10005170/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10005170/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10005170/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10005170/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10005170/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10005170/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10005170/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10005170.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">1297</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">98</span> 3D Star Skeleton for Fast Human Posture Representation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sungkuk%20Chun">Sungkuk Chun</a>, <a href="https://publications.waset.org/search?q=Kwangjin%20Hong"> Kwangjin Hong</a>, <a href="https://publications.waset.org/search?q=Keechul%20Jung"> Keechul Jung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose an improved 3D star skeleton technique, which is a suitable skeletonization for human posture representation and reflects the 3D information of human posture. Moreover, the proposed technique is simple and then can be performed in real-time. The existing skeleton construction techniques, such as distance transformation, Voronoi diagram, and thinning, focus on the precision of skeleton information. Therefore, those techniques are not applicable to real-time posture recognition since they are computationally expensive and highly susceptible to noise of boundary. Although a 2D star skeleton was proposed to complement these problems, it also has some limitations to describe the 3D information of the posture. To represent human posture effectively, the constructed skeleton should consider the 3D information of posture. The proposed 3D star skeleton contains 3D data of human, and focuses on human action and posture recognition. Our 3D star skeleton uses the 8 projection maps which have 2D silhouette information and depth data of human surface. And the extremal points can be extracted as the features of 3D star skeleton, without searching whole boundary of object. Therefore, on execution time, our 3D star skeleton is faster than the “greedy" 3D star skeleton using the whole boundary points on the surface. Moreover, our method can offer more accurate skeleton of posture than the existing star skeleton since the 3D data for the object is concerned. Additionally, we make a codebook, a collection of representative 3D star skeletons about 7 postures, to recognize what posture of constructed skeleton is. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=computer%20vision" title="computer vision">computer vision</a>, <a href="https://publications.waset.org/search?q=gesture%20recognition" title=" gesture recognition"> gesture recognition</a>, <a href="https://publications.waset.org/search?q=skeletonization" title=" skeletonization"> skeletonization</a>, <a href="https://publications.waset.org/search?q=human%20posture%20representation." title="human posture representation.">human posture representation.</a> </p> <a href="https://publications.waset.org/4451/3d-star-skeleton-for-fast-human-posture-representation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4451/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4451/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4451/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4451/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4451/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4451/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4451/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4451/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4451/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4451/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4451.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">2122</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">97</span> The Comparative Analysis of Micro-reading and Traditional Reading Based On Schema Theory</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Haiyan%20Wang">Haiyan Wang </a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Micro-reading is a new way of reading depended on short messages of mobile phones, network articles and short literary forms, which impacts greatly on traditional way of reading. The effect of &quot;micro-reading&quot; is deeper especially for those growing middle school students and college students. Aiming at the problem with the development of college students&#39; micro-reading and based on the influence of schema theory on the research of cognition of reading, this paper is to analyze the comparison between micro-reading and traditional reading and explore reading strategies in micro-era based on the negative and positive effect which schema theory has on micro-reading.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Schema%20theory" title="Schema theory">Schema theory</a>, <a href="https://publications.waset.org/search?q=comparative%20analysis" title=" comparative analysis"> comparative analysis</a>, <a href="https://publications.waset.org/search?q=micro-reading" title=" micro-reading"> micro-reading</a>, <a href="https://publications.waset.org/search?q=traditional%20reading" title=" traditional reading"> traditional reading</a> </p> <a href="https://publications.waset.org/9998731/the-comparative-analysis-of-micro-reading-and-traditional-reading-based-on-schema-theory" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9998731/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9998731/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9998731/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9998731/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9998731/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9998731/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9998731/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9998731/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9998731/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9998731/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9998731.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">3716</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">96</span> Meta-Search in Human Resource Management </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=J%C3%BCrgen%20Dorn">Jürgen Dorn</a>, <a href="https://publications.waset.org/search?q=Tabbasum%20Naz"> Tabbasum Naz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the area of Human Resource Management, the trend is towards online exchange of information about human resources. For example, online applications for employment become standard and job offerings are posted in many job portals. However, there are too many job portals to monitor all of them if someone is interested in a new job. We developed a prototype for integrating information of different job portals into one meta-search engine. First, existing job portals were investigated and XML schema documents were derived automated from these portals. Second, translation rules for transforming each schema to a central HR-XML-conform schema were determined. The HR-XML-schema is used to build a form for searching jobs. The data supplied by a user in this form is now translated into queries for the different job portals. Each result obtained by a job portal is sent to the meta-search engine that ranks the result of all received job offers according to user's preferences. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Meta-search" title="Meta-search">Meta-search</a>, <a href="https://publications.waset.org/search?q=Information%20extraction%20and%20integration" title=" Information extraction and integration"> Information extraction and integration</a>, <a href="https://publications.waset.org/search?q=human%20resource%20management" title="human resource management">human resource management</a>, <a href="https://publications.waset.org/search?q=job%20search." title=" job search."> job search.</a> </p> <a href="https://publications.waset.org/5622/meta-search-in-human-resource-management" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5622/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5622/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5622/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5622/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5622/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5622/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5622/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5622/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5622/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5622/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5622.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">1694</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">95</span> Characterizations of Star-Shaped, L-Convex, and Convex Polygons</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Thomas%20Shermer">Thomas Shermer</a>, <a href="https://publications.waset.org/search?q=Godfried%20T.%20Toussaint"> Godfried T. Toussaint</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A chord of a simple polygon P is a line segment [xy] that intersects the boundary of P only at both endpoints x and y. A chord of P is called an interior chord provided the interior of [xy] lies in the interior of P. P is weakly visible from [xy] if for every point v in P there exists a point w in [xy] such that [vw] lies in P. In this paper star-shaped, L-convex, and convex polygons are characterized in terms of weak visibility properties from internal chords and starshaped subsets of P. A new Krasnoselskii-type characterization of isothetic star-shaped polygons is also presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Convex%20polygons" title="Convex polygons">Convex polygons</a>, <a href="https://publications.waset.org/search?q=L-convex%20polygons" title=" L-convex polygons"> L-convex polygons</a>, <a href="https://publications.waset.org/search?q=star-shaped%0Apolygons" title=" star-shaped polygons"> star-shaped polygons</a>, <a href="https://publications.waset.org/search?q=chords" title=" chords"> chords</a>, <a href="https://publications.waset.org/search?q=weak%20visibility" title=" weak visibility"> weak visibility</a>, <a href="https://publications.waset.org/search?q=discrete%20and%20computational%0Ageometry" title=" discrete and computational geometry"> discrete and computational geometry</a> </p> <a href="https://publications.waset.org/7701/characterizations-of-star-shaped-l-convex-and-convex-polygons" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7701/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7701/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7701/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7701/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7701/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7701/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7701/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7701/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7701/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7701/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7701.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">2343</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">94</span> A Formal Suite of Object Relational Database Metrics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Justus%20S">Justus S</a>, <a href="https://publications.waset.org/search?q=K%20Iyakutti"> K Iyakutti</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Object Relational Databases (ORDB) are complex in nature than traditional relational databases because they combine the characteristics of both object oriented concepts and relational features of conventional databases. Design of an ORDB demands efficient and quality schema considering the structural, functional and componential traits. This internal quality of the schema is assured by metrics that measure the relevant attributes. This is extended to substantiate the understandability, usability and reliability of the schema, thus assuring external quality of the schema. This work institutes a formalization of ORDB metrics; metric definition, evaluation methodology and the calibration of the metric. Three ORDB schemas were used to conduct the evaluation and the formalization of the metrics. The metrics are calibrated using content and criteria related validity based on the measurability, consistency and reliability of the metrics. Nominal and summative scales are derived based on the evaluated metric values and are standardized. Future works pertaining to ORDB metrics forms the concluding note. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Measurements" title="Measurements">Measurements</a>, <a href="https://publications.waset.org/search?q=Product%20metrics" title=" Product metrics"> Product metrics</a>, <a href="https://publications.waset.org/search?q=Metrics%20calibration" title=" Metrics calibration"> Metrics calibration</a>, <a href="https://publications.waset.org/search?q=Object-relational%20database." title="Object-relational database.">Object-relational database.</a> </p> <a href="https://publications.waset.org/2212/a-formal-suite-of-object-relational-database-metrics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2212/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2212/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2212/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2212/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2212/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2212/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2212/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2212/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2212/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2212/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2212.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">1665</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">93</span> Coalescing Data Marts</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=N.%20Parimala">N. Parimala</a>, <a href="https://publications.waset.org/search?q=P.%20Pahwa"> P. Pahwa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> OLAP uses multidimensional structures, to provide access to data for analysis. Traditionally, OLAP operations are more focused on retrieving data from a single data mart. An exception is the drill across operator. This, however, is restricted to retrieving facts on common dimensions of the multiple data marts. Our concern is to define further operations while retrieving data from multiple data marts. Towards this, we have defined six operations which coalesce data marts. While doing so we consider the common as well as the non-common dimensions of the data marts. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Data%20warehouse" title="Data warehouse">Data warehouse</a>, <a href="https://publications.waset.org/search?q=Dimension" title=" Dimension"> Dimension</a>, <a href="https://publications.waset.org/search?q=OLAP" title=" OLAP"> OLAP</a>, <a href="https://publications.waset.org/search?q=Star%20Schema." title=" Star Schema."> Star Schema.</a> </p> <a href="https://publications.waset.org/15559/coalescing-data-marts" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15559/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15559/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15559/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15559/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15559/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15559/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15559/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15559/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15559/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15559/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15559.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">1559</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">92</span> Construction of Attitude Reference Benchmark for Test of Star Sensor Based on Precise Timing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Tingting%20Lu">Tingting Lu</a>, <a href="https://publications.waset.org/search?q=Yonghai%20Wang"> Yonghai Wang</a>, <a href="https://publications.waset.org/search?q=Haiyong%20Wang"> Haiyong Wang</a>, <a href="https://publications.waset.org/search?q=Jiaqi%20Liu"> Jiaqi Liu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> To satisfy the need of outfield tests of star sensors, a method is put forward to construct the reference attitude benchmark. Firstly, its basic principle is introduced; Then, all the separate conversion matrixes are deduced, which include: the conversion matrix responsible for the transformation from the Earth Centered Inertial frame i to the Earth-centered Earth-fixed frame w according to the time of an atomic clock, the conversion matrix from frame w to the geographic frame t, and the matrix from frame t to the platform frame p, so the attitude matrix of the benchmark platform relative to the frame i can be obtained using all the three matrixes as the multiplicative factors; Next, the attitude matrix of the star sensor relative to frame i is got when the mounting matrix from frame p to the star sensor frame s is calibrated, and the reference attitude angles for star sensor outfield tests can be calculated from the transformation from frame i to frame s; Finally, the computer program is finished to solve the reference attitudes, and the error curves are drawn about the three axis attitude angles whose absolute maximum error is just 0.25ÔÇ│. The analysis on each loop and the final simulating results manifest that the method by precise timing to acquire the absolute reference attitude is feasible for star sensor outfield tests. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Atomic%20time" title="Atomic time">Atomic time</a>, <a href="https://publications.waset.org/search?q=attitude%20determination" title=" attitude determination"> attitude determination</a>, <a href="https://publications.waset.org/search?q=coordinate%0Aconversion" title=" coordinate conversion"> coordinate conversion</a>, <a href="https://publications.waset.org/search?q=inertial%20coordinate%20system" title=" inertial coordinate system"> inertial coordinate system</a>, <a href="https://publications.waset.org/search?q=star%20sensor." title=" star sensor."> star sensor.</a> </p> <a href="https://publications.waset.org/2825/construction-of-attitude-reference-benchmark-for-test-of-star-sensor-based-on-precise-timing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2825/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2825/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2825/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2825/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2825/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2825/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2825/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2825/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2825/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2825/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2825.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">1200</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">91</span> Customer Loyalty and the Impacts of Service Quality:The Case of Five Star Hotels in Jordan</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Al-Rousan">Al-Rousan</a>, <a href="https://publications.waset.org/search?q=M.%20Ramzi"> M. Ramzi</a>, <a href="https://publications.waset.org/search?q=Badaruddin%20Mohamed"> Badaruddin Mohamed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the present Jordan hotels scenario, service quality is a vital competitive policy to keep customer support and build great base. Hotels are trying to win customer loyalty by providing enhanced quality services. This paper attempts to examine the impact of tourism service quality dimension in the Jordanian five star hotels. A total of 322 surveys were administrated to tourists who were staying at three branches Marriott hotel in Jordan. The results show that dimensions of service quality such as empathy, reliability, responsiveness and tangibility significantly predict customer loyalty. Specifically, among the dimension of tourism service quality, the most significant predictor of customer loyalty is tangibility. This paper implies that five star hotels in Jordan should also come forward and try their best to present better tourism service quality to win back their customers- loyalty. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Tourism" title="Tourism">Tourism</a>, <a href="https://publications.waset.org/search?q=Service%20Quality" title=" Service Quality"> Service Quality</a>, <a href="https://publications.waset.org/search?q=Loyalty" title=" Loyalty"> Loyalty</a>, <a href="https://publications.waset.org/search?q=Five%20Star%20hotels" title=" Five Star hotels"> Five Star hotels</a>, <a href="https://publications.waset.org/search?q=Jordan." title="Jordan.">Jordan.</a> </p> <a href="https://publications.waset.org/4322/customer-loyalty-and-the-impacts-of-service-qualitythe-case-of-five-star-hotels-in-jordan" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4322/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4322/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4322/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4322/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4322/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4322/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4322/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4322/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4322/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4322/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4322.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">5974</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">90</span> A Conceptual Query-Driven Design Framework for Data Warehouse</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Resmi%20Nair">Resmi Nair</a>, <a href="https://publications.waset.org/search?q=Campbell%20Wilson"> Campbell Wilson</a>, <a href="https://publications.waset.org/search?q=Bala%20Srinivasan"> Bala Srinivasan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Data warehouse is a dedicated database used for querying and reporting. Queries in this environment show special characteristics such as multidimensionality and aggregation. Exploiting the nature of queries, in this paper we propose a query driven design framework. The proposed framework is general and allows a designer to generate a schema based on a set of queries. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Conceptual%20schema" title="Conceptual schema">Conceptual schema</a>, <a href="https://publications.waset.org/search?q=data%20warehouse" title=" data warehouse"> data warehouse</a>, <a href="https://publications.waset.org/search?q=queries" title=" queries"> queries</a>, <a href="https://publications.waset.org/search?q=requirements." title="requirements.">requirements.</a> </p> <a href="https://publications.waset.org/14457/a-conceptual-query-driven-design-framework-for-data-warehouse" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14457/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14457/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14457/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14457/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14457/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14457/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14457/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14457/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14457/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14457/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14457.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">2006</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">89</span> Restructuring of XML Documents in the Form of Ontologies</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jamal%20Bakkas">Jamal Bakkas</a>, <a href="https://publications.waset.org/search?q=Mohamed%20Bahaj"> Mohamed Bahaj</a>, <a href="https://publications.waset.org/search?q=Abdellatif%20Soklabi"> Abdellatif Soklabi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The intense use of the web has made it a very changing environment, its content is in permanent evolution to adapt to the demands. The standards have accompanied this evolution by passing from standards that regroup data with their presentations without any structuring such as HTML, to standards that separate both and give more importance to the structural aspect of the content such as XML standard and its derivatives. Currently, with the appearance of the Semantic Web, ontologies become increasingly present on the web and standards that allow their representations as OWL and RDF/RDFS begin to gain momentum. This paper provided an automatic method that converts XML schema document to ontologies represented in OWL.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=XML%20Schema" title="XML Schema">XML Schema</a>, <a href="https://publications.waset.org/search?q=OWL" title=" OWL"> OWL</a>, <a href="https://publications.waset.org/search?q=RDB" title=" RDB"> RDB</a>, <a href="https://publications.waset.org/search?q=Mapping" title=" Mapping"> Mapping</a>, <a href="https://publications.waset.org/search?q=Ontology." title=" Ontology. "> Ontology. </a> </p> <a href="https://publications.waset.org/9997853/restructuring-of-xml-documents-in-the-form-of-ontologies" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997853/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997853/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997853/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997853/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997853/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997853/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997853/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997853/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997853/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997853/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997853.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">2378</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">88</span> Fault Tolerant (n, k)-Star Power Network Topology for Multi-Agent Communication in Automated Power Distribution Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ning%20Gong">Ning Gong</a>, <a href="https://publications.waset.org/search?q=Michael%20Korostelev"> Michael Korostelev</a>, <a href="https://publications.waset.org/search?q=Qiangguo%20Ren"> Qiangguo Ren</a>, <a href="https://publications.waset.org/search?q=Li%20Bai"> Li Bai</a>, <a href="https://publications.waset.org/search?q=Saroj%20Biswas"> Saroj Biswas</a>, <a href="https://publications.waset.org/search?q=Frank%20Ferrese"> Frank Ferrese</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper investigates the joint effect of the interconnected (n,k)-star network topology and Multi-Agent automated control on restoration and reconfiguration of power systems. With the increasing trend in development in Multi-Agent control technologies applied to power system reconfiguration in presence of faulty components or nodes. Fault tolerance is becoming an important challenge in the design processes of the distributed power system topology. Since the reconfiguration of a power system is performed by agent communication, the (n,k)-star interconnected network topology is studied and modeled in this paper to optimize the process of power reconfiguration. In this paper, we discuss the recently proposed (n,k)-star topology and examine its properties and advantages as compared to the traditional multi-bus power topologies. We design and simulate the topology model for distributed power system test cases. A related lemma based on the fault tolerance and conditional diagnosability properties is presented and proved both theoretically and practically. The conclusion is reached that (n,k)-star topology model has measurable advantages compared to standard bus power systems while exhibiting fault tolerance properties in power restoration, as well as showing efficiency when applied to power system route discovery.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=%28n" title="(n">(n</a>, <a href="https://publications.waset.org/search?q=k%29-star%20Topology" title=" k)-star Topology"> k)-star Topology</a>, <a href="https://publications.waset.org/search?q=Fault%20Tolerance" title=" Fault Tolerance"> Fault Tolerance</a>, <a href="https://publications.waset.org/search?q=Conditional%20Diagnosability" title=" Conditional Diagnosability"> Conditional Diagnosability</a>, <a href="https://publications.waset.org/search?q=Multi-Agent%20System" title=" Multi-Agent System"> Multi-Agent System</a>, <a href="https://publications.waset.org/search?q=Automated%20Power%20System." title=" Automated Power System."> Automated Power System.</a> </p> <a href="https://publications.waset.org/10000173/fault-tolerant-n-k-star-power-network-topology-for-multi-agent-communication-in-automated-power-distribution-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10000173/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10000173/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10000173/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10000173/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10000173/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10000173/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10000173/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10000173/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10000173/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10000173/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10000173.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">2450</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">87</span> Comparative Survey of Object Serialization Techniques and the Programming Supports</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kazuaki%20Maeda">Kazuaki Maeda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper compares six approaches of object serialization from qualitative and quantitative aspects. Those are object serialization in Java, IDL, XStream, Protocol Buffers, Apache Avro, and MessagePack. Using each approach, a common example is serialized to a file and the size of the file is measured. The qualitative comparison works are investigated in the way of checking whether schema definition is required or not, whether schema compiler is required or not, whether serialization is based on ascii or binary, and which programming languages are supported. It is clear that there is no best solution. Each solution makes good in the context it was developed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=structured%20data" title="structured data">structured data</a>, <a href="https://publications.waset.org/search?q=serialization" title=" serialization"> serialization</a>, <a href="https://publications.waset.org/search?q=programming" title=" programming"> programming</a> </p> <a href="https://publications.waset.org/15057/comparative-survey-of-object-serialization-techniques-and-the-programming-supports" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15057/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15057/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15057/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15057/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15057/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15057/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15057/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15057/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15057/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15057/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15057.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">2514</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">86</span> Schema and Data Migration of a Relational Database RDB to the Extensible Markup Language XML</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Alae%20El%20Alami">Alae El Alami</a>, <a href="https://publications.waset.org/search?q=Mohamed%20Bahaj"> Mohamed Bahaj</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This article discusses the passage of RDB to XML documents (schema and data) based on metadata and semantic enrichment, which makes the RDB under flattened shape and is enriched by the object concept. The integration and exploitation of the object concept in the XML uses a syntax allowing for the verification of the conformity of the document XML during the creation. The information extracted from the RDB is therefore analyzed and filtered in order to adjust according to the structure of the XML files and the associated object model. Those implemented in the XML document through a SQL query are built dynamically. A prototype was implemented to realize automatic migration, and so proves the effectiveness of this particular approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=RDB" title="RDB">RDB</a>, <a href="https://publications.waset.org/search?q=XML" title=" XML"> XML</a>, <a href="https://publications.waset.org/search?q=DTD" title=" DTD"> DTD</a>, <a href="https://publications.waset.org/search?q=semantic%20enrichment." title=" semantic enrichment."> semantic enrichment.</a> </p> <a href="https://publications.waset.org/10003182/schema-and-data-migration-of-a-relational-database-rdb-to-the-extensible-markup-language-xml" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10003182/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10003182/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10003182/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10003182/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10003182/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10003182/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10003182/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10003182/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10003182/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10003182/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10003182.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">1824</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">85</span> Data Migration between Document-Oriented and Relational Databases</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Bogdan%20Walek">Bogdan Walek</a>, <a href="https://publications.waset.org/search?q=Cyril%20Klimes"> Cyril Klimes</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Current tools for data migration between documentoriented and relational databases have several disadvantages. We propose a new approach for data migration between documentoriented and relational databases. During data migration the relational schema of the target (relational database) is automatically created from collection of XML documents. Proposed approach is verified on data migration between document-oriented database IBM Lotus/ Notes Domino and relational database implemented in relational database management system (RDBMS) MySQL. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=data%20migration" title="data migration">data migration</a>, <a href="https://publications.waset.org/search?q=database" title=" database"> database</a>, <a href="https://publications.waset.org/search?q=document-oriented%20database" title=" document-oriented database"> document-oriented database</a>, <a href="https://publications.waset.org/search?q=XML" title=" XML"> XML</a>, <a href="https://publications.waset.org/search?q=relational%20schema" title=" relational schema"> relational schema</a> </p> <a href="https://publications.waset.org/4574/data-migration-between-document-oriented-and-relational-databases" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4574/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4574/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4574/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4574/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4574/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4574/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4574/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4574/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4574/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4574/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4574.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">3525</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">84</span> Traffic Load based Performance Analysis of DSR and STAR Routing Protocol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Rani%20Astya">Rani Astya</a>, <a href="https://publications.waset.org/search?q=S.C.%20Sharma"> S.C. Sharma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The wireless adhoc network is comprised of wireless node which can move freely and are connected among themselves without central infrastructure. Due to the limited transmission range of wireless interfaces, in most cases communication has to be relayed over intermediate nodes. Thus, in such multihop network each node (also called router) is independent, self-reliant and capable to route the messages over the dynamic network topology. Various protocols are reported in this field and it is very difficult to decide the best one. A key issue in deciding which type of routing protocol is best for adhoc networks is the communication overhead incurred by the protocol. In this paper STAR a table driven and DSR on demand protocols based on IEEE 802.11 are analyzed for their performance on different performance measuring metrics versus varying traffic CBR load using QualNet 5.0.2 network simulator. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Adhoc%20networks" title="Adhoc networks">Adhoc networks</a>, <a href="https://publications.waset.org/search?q=wireless%20networks" title=" wireless networks"> wireless networks</a>, <a href="https://publications.waset.org/search?q=CBR" title=" CBR"> CBR</a>, <a href="https://publications.waset.org/search?q=routingprotocols" title=" routingprotocols"> routingprotocols</a>, <a href="https://publications.waset.org/search?q=route%20discovery" title=" route discovery"> route discovery</a>, <a href="https://publications.waset.org/search?q=simulation" title=" simulation"> simulation</a>, <a href="https://publications.waset.org/search?q=performance%20evaluation" title=" performance evaluation"> performance evaluation</a>, <a href="https://publications.waset.org/search?q=MAC" title="MAC">MAC</a>, <a href="https://publications.waset.org/search?q=IEEE%20802.11" title=" IEEE 802.11"> IEEE 802.11</a>, <a href="https://publications.waset.org/search?q=STAR" title=" STAR"> STAR</a>, <a href="https://publications.waset.org/search?q=DSR" title=" DSR"> DSR</a> </p> <a href="https://publications.waset.org/3885/traffic-load-based-performance-analysis-of-dsr-and-star-routing-protocol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3885/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3885/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3885/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3885/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3885/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3885/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3885/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3885/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3885/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3885/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3885.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">1897</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">83</span> The Effect of User Comments on Traffic Application Usage</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=I.%20Gokasar">I. Gokasar</a>, <a href="https://publications.waset.org/search?q=G.%20Bakioglu"> G. Bakioglu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>With the unprecedented rates of technological improvements, people start to solve their problems with the help of technological tools. According to application stores and websites in which people evaluate and comment on the traffic apps, there are more than 100 traffic applications which have different features with respect to their purpose of usage ranging from the features of traffic apps for public transit modes to the features of traffic apps for private cars. This study focuses on the top 30 traffic applications which were chosen with respect to their download counts. All data about the traffic applications were obtained from related websites. The purpose of this study is to analyze traffic applications in terms of their categorical attributes with the help of developing a regression model. The analysis results suggest that negative interpretations (e.g., being deficient) does not lead to lower star ratings of the applications. However, those negative interpretations result in a smaller increase in star rate. In addition, women use higher star rates than men for the evaluation of traffic applications.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Traffic%20App" title="Traffic App">Traffic App</a>, <a href="https://publications.waset.org/search?q=real%E2%80%93time%20information" title=" real–time information"> real–time information</a>, <a href="https://publications.waset.org/search?q=traffic%20congestion" title=" traffic congestion"> traffic congestion</a>, <a href="https://publications.waset.org/search?q=regression%20analysis" title=" regression analysis"> regression analysis</a>, <a href="https://publications.waset.org/search?q=dummy%20variables." title=" dummy variables."> dummy variables.</a> </p> <a href="https://publications.waset.org/10005733/the-effect-of-user-comments-on-traffic-application-usage" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10005733/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10005733/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10005733/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10005733/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10005733/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10005733/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10005733/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10005733/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10005733/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10005733/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10005733.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">1178</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">82</span> Implementing a Database from a Requirement Specification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Omer">M. Omer</a>, <a href="https://publications.waset.org/search?q=D.%20Wilson"> D. Wilson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Creating a database scheme is essentially a manual process. From a requirement specification the information contained within has to be analyzed and reduced into a set of tables, attributes and relationships. This is a time consuming process that has to go through several stages before an acceptable database schema is achieved. The purpose of this paper is to implement a Natural Language Processing (NLP) based tool to produce a relational database from a requirement specification. The Stanford CoreNLP version 3.3.1 and the Java programming were used to implement the proposed model. The outcome of this study indicates that a first draft of a relational database schema can be extracted from a requirement specification by using NLP tools and techniques with minimum user intervention. Therefore this method is a step forward in finding a solution that requires little or no user intervention.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Information%20Extraction" title="Information Extraction">Information Extraction</a>, <a href="https://publications.waset.org/search?q=Natural%20Language%0D%0AProcessing" title=" Natural Language Processing"> Natural Language Processing</a>, <a href="https://publications.waset.org/search?q=Relation%20Extraction." title=" Relation Extraction."> Relation Extraction.</a> </p> <a href="https://publications.waset.org/10000138/implementing-a-database-from-a-requirement-specification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10000138/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10000138/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10000138/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10000138/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10000138/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10000138/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10000138/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10000138/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10000138/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10000138/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10000138.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">2228</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">81</span> Human Verification in a Video Surveillance System Using Statistical Features</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sanpachai%20Huvanandana">Sanpachai Huvanandana</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A human verification system is presented in this paper. The system consists of several steps: background subtraction, thresholding, line connection, region growing, morphlogy, star skelatonization, feature extraction, feature matching, and decision making. The proposed system combines an advantage of star skeletonization and simple statistic features. A correlation matching and probability voting have been used for verification, followed by a logical operation in a decision making stage. The proposed system uses small number of features and the system reliability is convincing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Human%20verification" title="Human verification">Human verification</a>, <a href="https://publications.waset.org/search?q=object%20recognition" title=" object recognition"> object recognition</a>, <a href="https://publications.waset.org/search?q=videounderstanding" title=" videounderstanding"> videounderstanding</a>, <a href="https://publications.waset.org/search?q=segmentation." title=" segmentation."> segmentation.</a> </p> <a href="https://publications.waset.org/3077/human-verification-in-a-video-surveillance-system-using-statistical-features" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3077/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3077/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3077/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3077/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3077/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3077/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3077/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3077/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3077/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3077/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3077.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">80</span> Reduction of Search Space by Applying Controlled Genetic Operators for Weight Constrained Shortest Path Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.K.M.%20Khaled%20Ahsan%20Talukder">A.K.M. Khaled Ahsan Talukder</a>, <a href="https://publications.waset.org/search?q=Taibun%20Nessa"> Taibun Nessa</a>, <a href="https://publications.waset.org/search?q=Kaushik%20Roy"> Kaushik Roy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The weight constrained shortest path problem (WCSPP) is one of most several known basic problems in combinatorial optimization. Because of its importance in many areas of applications such as computer science, engineering and operations research, many researchers have extensively studied the WCSPP. This paper mainly concentrates on the reduction of total search space for finding WCSP using some existing Genetic Algorithm (GA). For this purpose, some controlled schemes of genetic operators are adopted on list chromosome representation. This approach gives a near optimum solution with smaller elapsed generation than classical GA technique. From further analysis on the matter, a new generalized schema theorem is also developed from the philosophy of Holland-s theorem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20Algorithm" title="Genetic Algorithm">Genetic Algorithm</a>, <a href="https://publications.waset.org/search?q=Evolutionary%20Optimization" title=" Evolutionary Optimization"> Evolutionary Optimization</a>, <a href="https://publications.waset.org/search?q=Multi%20Objective%20Optimization" title="Multi Objective Optimization">Multi Objective Optimization</a>, <a href="https://publications.waset.org/search?q=Non-linear%20Schema%20Theorem" title=" Non-linear Schema Theorem"> Non-linear Schema Theorem</a>, <a href="https://publications.waset.org/search?q=WCSPP." title="WCSPP.">WCSPP.</a> </p> <a href="https://publications.waset.org/1984/reduction-of-search-space-by-applying-controlled-genetic-operators-for-weight-constrained-shortest-path-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1984/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1984/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1984/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1984/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1984/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1984/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1984/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1984/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1984/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1984/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1984.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1412</span> </span> </div> </div> <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=star%20schema&amp;page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=star%20schema&amp;page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=star%20schema&amp;page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=star%20schema&amp;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">&copy; 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">&times;</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>

Pages: 1 2 3 4 5 6 7 8 9 10