CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: CD-ROM databases</title> <meta name="description" content="Search results for: CD-ROM databases"> <meta name="keywords" content="CD-ROM databases"> <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="CD-ROM databases" 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/abstracts/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="CD-ROM databases"> <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> 836</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: CD-ROM databases</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">836</span> Assessment of Image Databases Used for Human Skin Detection Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Saleh%20Alshehri">Saleh Alshehri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Human skin detection is a vital step in many applications. Some of the applications are critical especially those related to security. This leverages the importance of a high-performance detection algorithm. To validate the accuracy of the algorithm, image databases are usually used. However, the suitability of these image databases is still questionable. It is suggested that the suitability can be measured mainly by the span the database covers of the color space. This research investigates the validity of three famous image databases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20databases" title="image databases">image databases</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20processing" title=" image processing"> image processing</a>, <a href="https://publications.waset.org/abstracts/search?q=pattern%20recognition" title=" pattern recognition"> pattern recognition</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20networks" title=" neural networks"> neural networks</a> </p> <a href="https://publications.waset.org/abstracts/87836/assessment-of-image-databases-used-for-human-skin-detection-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/87836.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">271</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">835</span> Enhance Security in XML Databases: XLog File for Severity-Aware Trust-Based Access Control</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A%3A%20Asmawi">A: Asmawi</a>, <a href="https://publications.waset.org/abstracts/search?q=L.%20S.%20Affendey"> L. S. Affendey</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20I.%20Udzir"> N. I. Udzir</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Mahmod"> R. Mahmod</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The topic of enhancing security in XML databases is important as it includes protecting sensitive data and providing a secure environment to users. In order to improve security and provide dynamic access control for XML databases, we presented XLog file to calculate user trust values by recording users’ bad transaction, errors and query severities. Severity-aware trust-based access control for XML databases manages the access policy depending on users' trust values and prevents unauthorized processes, malicious transactions and insider threats. Privileges are automatically modified and adjusted over time depending on user behaviour and query severity. Logging in database is an important process and is used for recovery and security purposes. In this paper, the Xlog file is presented as a dynamic and temporary log file for XML databases to enhance the level of security. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=XML%20database" title="XML database">XML database</a>, <a href="https://publications.waset.org/abstracts/search?q=trust-based%20access%20control" title=" trust-based access control"> trust-based access control</a>, <a href="https://publications.waset.org/abstracts/search?q=severity-aware" title=" severity-aware"> severity-aware</a>, <a href="https://publications.waset.org/abstracts/search?q=trust%20values" title=" trust values"> trust values</a>, <a href="https://publications.waset.org/abstracts/search?q=log%20file" title=" log file"> log file</a> </p> <a href="https://publications.waset.org/abstracts/11637/enhance-security-in-xml-databases-xlog-file-for-severity-aware-trust-based-access-control" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/11637.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">300</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">834</span> Perceptions of Academic Staff on the Influences of Librarians and Working Colleagues Towards the Awareness and Use of Electronic Databases in Umaru Musa Yar’adua University, Katsina</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lawal%20Kado">Lawal Kado</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper investigates the perceptions of academic staff at Umaru Musa Yar’adua University regarding the influences of librarians and working colleagues on the awareness and use of electronic databases. The study aims to provide insights into the effectiveness of these influences and suggest strategies to improve the usage of electronic databases. Research aim: The aim of this study is to determine the perceptions of academic staff on the influence of librarians and working colleagues towards the awareness and use of electronic databases in Umaru Musa Yar’adua University, Katsina. Methodology: The study adopts a quantitative method and survey research design. The survey questionnaire is distributed to 110 respondents selected through simple random sampling from a population of 523 academic staff. The collected data is analyzed using the Statistical Package for Social Sciences (SPSS) version 23. Findings: The study reveals a high level of general awareness of electronic databases in the university, largely influenced by librarians and colleagues. Librarians have played a crucial role in making academic staff aware of the available databases. The sources of information for awareness include colleagues, social media, e-mails from the library, and internet searching. Theoretical importance: This study contributes to the literature by examining the perceptions of academic staff, which can inform policymakers and stakeholders in developing strategies to maximize the use of electronic databases. Data collection and analysis procedures: The data is collected through a survey questionnaire that utilizes the Likert scaling technique. The closed-ended questions are analyzed using SPSS 23. Question addressed: The paper addresses the question of how librarians and working colleagues influence the awareness and use of electronic databases among academic staff. Conclusion: The study concludes that the influence of librarians and working colleagues significantly contributes to the awareness and use of electronic databases among academic staff. The paper recommends the establishment of dedicated departments or units for marketing library resources to further promote the usage of electronic databases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=awareness" title="awareness">awareness</a>, <a href="https://publications.waset.org/abstracts/search?q=electronic%20databases" title=" electronic databases"> electronic databases</a>, <a href="https://publications.waset.org/abstracts/search?q=academic%20staff" title=" academic staff"> academic staff</a>, <a href="https://publications.waset.org/abstracts/search?q=unified%20theory%20of%20acceptance%20and%20use%20of%20technology" title=" unified theory of acceptance and use of technology"> unified theory of acceptance and use of technology</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20influence" title=" social influence"> social influence</a> </p> <a href="https://publications.waset.org/abstracts/178313/perceptions-of-academic-staff-on-the-influences-of-librarians-and-working-colleagues-towards-the-awareness-and-use-of-electronic-databases-in-umaru-musa-yaradua-university-katsina" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/178313.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">89</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">833</span> Comparison between RILM, JSTOR, and WorldCat Used to Search for Secondary Literature</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Stacy%20Jarvis">Stacy Jarvis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Databases such as JSTOR, RILM and WorldCat have been the main source and storage of literature in the music orb. The Reference Index to Music Literature is a bibliographic database of over 2.6 million citations to writings about music from over 70 countries. The Research Institute produces RILM for the Study of Music at the University of Buffalo. JSTOR is an e-library of academic journals, books, and primary sources. Database JSTOR helps scholars find, utilise, and build upon a vast range of literature through a powerful teaching and research platform. Another database, WorldCat, is the world's biggest library catalogue, assisting scholars in finding library materials online. An evaluation of these databases in the music sphere is conducted by looking into the description and intended use and finding similarities and differences among them. Through comparison, it is found that these aim to serve different purposes, though they have the same goal of providing and storing literature. Also, since each database has different parts of literature that it majors on, the intended use of the three databases is evaluated. This can be found in the description, scope, and intended uses section. These areas are crucial to the research as it addresses the functional or literature differences among the three databases. It is also found that these databases have different quantitative potentials. This is determined by addressing the year each database began collecting literature and the number of articles, periodicals, albums, conference proceedings, music, dissertations, digital media, essays collections, journal articles, monographs, online resources, reviews, and reference materials that can be found in each one of them. This can be found in the sections- description, scope and intended uses and the importance of the database in identifying literature on different topics. To compare the delivery of services to the users, the importance of databases in identifying literature on different topics is also addressed in the section -the importance of databases in identifying literature on different topics. Even though these databases are used in research, they all have disadvantages and advantages. This is addressed in the sections on advantages and disadvantages. This will be significant in determining which of the three is the best. Also, it will help address how the shortcomings of one database can be addressed by utilising two databases together while conducting research. It is addressed in the section- a combination of RILM and JSTOR. All this information revolves around the idea that a huge amount of quantitative and qualitative data can be found in the presented databases on music and digital content; however, each of the given databases has a different construction and material features contributing to the musical scholarship in its way. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=RILM" title="RILM">RILM</a>, <a href="https://publications.waset.org/abstracts/search?q=JSTOR" title=" JSTOR"> JSTOR</a>, <a href="https://publications.waset.org/abstracts/search?q=WorldCat" title=" WorldCat"> WorldCat</a>, <a href="https://publications.waset.org/abstracts/search?q=database" title=" database"> database</a>, <a href="https://publications.waset.org/abstracts/search?q=literature" title=" literature"> literature</a>, <a href="https://publications.waset.org/abstracts/search?q=research" title=" research"> research</a> </p> <a href="https://publications.waset.org/abstracts/160019/comparison-between-rilm-jstor-and-worldcat-used-to-search-for-secondary-literature" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/160019.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">83</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">832</span> A Method for Reduction of Association Rules in Data Mining</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Diego%20De%20Castro%20Rodrigues">Diego De Castro Rodrigues</a>, <a href="https://publications.waset.org/abstracts/search?q=Marcelo%20Lisboa%20Rocha"> Marcelo Lisboa Rocha</a>, <a href="https://publications.waset.org/abstracts/search?q=Daniela%20M.%20De%20Q.%20Trevisan"> Daniela M. De Q. Trevisan</a>, <a href="https://publications.waset.org/abstracts/search?q=Marcos%20Dias%20Da%20Conceicao"> Marcos Dias Da Conceicao</a>, <a href="https://publications.waset.org/abstracts/search?q=Gabriel%20Rosa"> Gabriel Rosa</a>, <a href="https://publications.waset.org/abstracts/search?q=Rommel%20M.%20Barbosa"> Rommel M. Barbosa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The use of association rules algorithms within data mining is recognized as being of great value in the knowledge discovery in databases. Very often, the number of rules generated is high, sometimes even in databases with small volume, so the success in the analysis of results can be hampered by this quantity. The purpose of this research is to present a method for reducing the quantity of rules generated with association algorithms. Therefore, a computational algorithm was developed with the use of a Weka Application Programming Interface, which allows the execution of the method on different types of databases. After the development, tests were carried out on three types of databases: synthetic, model, and real. Efficient results were obtained in reducing the number of rules, where the worst case presented a gain of more than 50%, considering the concepts of support, confidence, and lift as measures. This study concluded that the proposed model is feasible and quite interesting, contributing to the analysis of the results of association rules generated from the use of algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title="data mining">data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=association%20rules" title=" association rules"> association rules</a>, <a href="https://publications.waset.org/abstracts/search?q=rules%20reduction" title=" rules reduction"> rules reduction</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20intelligence" title=" artificial intelligence"> artificial intelligence</a> </p> <a href="https://publications.waset.org/abstracts/110517/a-method-for-reduction-of-association-rules-in-data-mining" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/110517.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">161</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">831</span> Building an Integrated Relational Database from Swiss Nutrition National Survey and Swiss Health Datasets for Data Mining Purposes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ilona%20Mewes">Ilona Mewes</a>, <a href="https://publications.waset.org/abstracts/search?q=Helena%20Jenzer"> Helena Jenzer</a>, <a href="https://publications.waset.org/abstracts/search?q=Farshideh%20Einsele"> Farshideh Einsele</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Objective: The objective of the study was to integrate two big databases from Swiss nutrition national survey (menuCH) and Swiss health national survey 2012 for data mining purposes. Each database has a demographic base data. An integrated Swiss database is built to later discover critical food consumption patterns linked with lifestyle diseases known to be strongly tied with food consumption. Design: Swiss nutrition national survey (menuCH) with approx. 2000 respondents from two different surveys, one by Phone and the other by questionnaire along with Swiss health national survey 2012 with 21500 respondents were pre-processed, cleaned and finally integrated to a unique relational database. Results: The result of this study is an integrated relational database from the Swiss nutritional and health databases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=health%20informatics" title="health informatics">health informatics</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=nutritional%20and%20health%20databases" title=" nutritional and health databases"> nutritional and health databases</a>, <a href="https://publications.waset.org/abstracts/search?q=nutritional%20and%20chronical%20databases" title=" nutritional and chronical databases"> nutritional and chronical databases</a> </p> <a href="https://publications.waset.org/abstracts/132719/building-an-integrated-relational-database-from-swiss-nutrition-national-survey-and-swiss-health-datasets-for-data-mining-purposes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/132719.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">112</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">830</span> Utilization of CD-ROM Database as a Storage and Retrieval System by Students of Nasarawa State University Keffi</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Suleiman%20Musa">Suleiman Musa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The utilization of CD-ROM as a storage and retrieval system by Nasarawa State University Keffi (NSUK) Library is crucial in preserving and dissemination of information to students and staff. This study investigated the utilization of CD-ROM Database storage and retrieval system by students of NUSK. Data was generated using structure questionnaire. One thousand and fifty two (1052) respondents were randomly selected among post-graduate and under-graduate students. Eight hundred and ten (810) questionnaires were returned, but only five hundred and ninety three (593) questionnaires were well completed and useful. The study found that post-graduate students use CD-ROM Databases more often than the under-graduate students in NSUK. The result of the study revealed that knowledge about CD-ROM Database 33.22% got it through library staff. 29.69% use CD-ROM once a month. Large number of users 45.70% purposely uses CD-ROM Databases for study and research. In fact, lack of users’ orientation amount to 58.35% of problems faced, while 31.20% lack of trained staff make it more difficult for utilization of CD-ROM Database. Major numbers of users 38.28% are neither satisfied nor dissatisfied, while a good number of them 27.99% are satisfied. Then 1.52% is highly dissatisfied but could not give reasons why. However, to ensure effective utilization of CD-ROM Database storage and retrieval system by students of NSUK, the following recommendations are made: effort should be made to encourage under-graduate in using CD-ROM Database. The institution should conduct orientation/induction course for students on CD-ROM Databases in the library. There is need for NSUK to produce in house databases on their CD-ROM for easy access by users. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=utilization" title="utilization">utilization</a>, <a href="https://publications.waset.org/abstracts/search?q=CD-ROM%20databases" title=" CD-ROM databases"> CD-ROM databases</a>, <a href="https://publications.waset.org/abstracts/search?q=storage" title=" storage"> storage</a>, <a href="https://publications.waset.org/abstracts/search?q=retrieval" title=" retrieval"> retrieval</a>, <a href="https://publications.waset.org/abstracts/search?q=students" title=" students"> students</a> </p> <a href="https://publications.waset.org/abstracts/14420/utilization-of-cd-rom-database-as-a-storage-and-retrieval-system-by-students-of-nasarawa-state-university-keffi" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14420.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">446</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">829</span> Cleaning of Scientific References in Large Patent Databases Using Rule-Based Scoring and Clustering </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Emiel%20Caron">Emiel Caron</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Patent databases contain patent related data, organized in a relational data model, and are used to produce various patent statistics. These databases store raw data about scientific references cited by patents. For example, Patstat holds references to tens of millions of scientific journal publications and conference proceedings. These references might be used to connect patent databases with bibliographic databases, e.g. to study to the relation between science, technology, and innovation in various domains. Problematic in such studies is the low data quality of the references, i.e. they are often ambiguous, unstructured, and incomplete. Moreover, a complete bibliographic reference is stored in only one attribute. Therefore, a computerized cleaning and disambiguation method for large patent databases is developed in this work. The method uses rule-based scoring and clustering. The rules are based on bibliographic metadata, retrieved from the raw data by regular expressions, and are transparent and adaptable. The rules in combination with string similarity measures are used to detect pairs of records that are potential duplicates. Due to the scoring, different rules can be combined, to join scientific references, i.e. the rules reinforce each other. The scores are based on expert knowledge and initial method evaluation. After the scoring, pairs of scientific references that are above a certain threshold, are clustered by means of single-linkage clustering algorithm to form connected components. The method is designed to disambiguate all the scientific references in the Patstat database. The performance evaluation of the clustering method, on a large golden set with highly cited papers, shows on average a 99% precision and a 95% recall. The method is therefore accurate but careful, i.e. it weighs precision over recall. Consequently, separate clusters of high precision are sometimes formed, when there is not enough evidence for connecting scientific references, e.g. in the case of missing year and journal information for a reference. The clusters produced by the method can be used to directly link the Patstat database with bibliographic databases as the Web of Science or Scopus. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=clustering" title="clustering">clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20cleaning" title=" data cleaning"> data cleaning</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20disambiguation" title=" data disambiguation"> data disambiguation</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=patent%20analysis" title=" patent analysis"> patent analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=scientometrics" title=" scientometrics"> scientometrics</a> </p> <a href="https://publications.waset.org/abstracts/80011/cleaning-of-scientific-references-in-large-patent-databases-using-rule-based-scoring-and-clustering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80011.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">194</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">828</span> Recommender System Based on Mining Graph Databases for Data-Intensive Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mostafa%20Gamal">Mostafa Gamal</a>, <a href="https://publications.waset.org/abstracts/search?q=Hoda%20K.%20Mohamed"> Hoda K. Mohamed</a>, <a href="https://publications.waset.org/abstracts/search?q=Islam%20El-Maddah"> Islam El-Maddah</a>, <a href="https://publications.waset.org/abstracts/search?q=Ali%20Hamdi"> Ali Hamdi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years, many digital documents on the web have been created due to the rapid growth of ’social applications’ communities or ’Data-intensive applications’. The evolution of online-based multimedia data poses new challenges in storing and querying large amounts of data for online recommender systems. Graph data models have been shown to be more efficient than relational data models for processing complex data. This paper will explain the key differences between graph and relational databases, their strengths and weaknesses, and why using graph databases is the best technology for building a realtime recommendation system. Also, The paper will discuss several similarity metrics algorithms that can be used to compute a similarity score of pairs of nodes based on their neighbourhoods or their properties. Finally, the paper will discover how NLP strategies offer the premise to improve the accuracy and coverage of realtime recommendations by extracting the information from the stored unstructured knowledge, which makes up the bulk of the world’s data to enrich the graph database with this information. As the size and number of data items are increasing rapidly, the proposed system should meet current and future needs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph%20databases" title="graph databases">graph databases</a>, <a href="https://publications.waset.org/abstracts/search?q=NLP" title=" NLP"> NLP</a>, <a href="https://publications.waset.org/abstracts/search?q=recommendation%20systems" title=" recommendation systems"> recommendation systems</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20metrics" title=" similarity metrics"> similarity metrics</a> </p> <a href="https://publications.waset.org/abstracts/163018/recommender-system-based-on-mining-graph-databases-for-data-intensive-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/163018.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">104</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">827</span> A Novel Framework for User-Friendly Ontology-Mediated Access to Relational Databases</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Efthymios%20Chondrogiannis">Efthymios Chondrogiannis</a>, <a href="https://publications.waset.org/abstracts/search?q=Vassiliki%20Andronikou"> Vassiliki Andronikou</a>, <a href="https://publications.waset.org/abstracts/search?q=Efstathios%20Karanastasis"> Efstathios Karanastasis</a>, <a href="https://publications.waset.org/abstracts/search?q=Theodora%20Varvarigou"> Theodora Varvarigou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A large amount of data is typically stored in relational databases (DB). The latter can efficiently handle user queries which intend to elicit the appropriate information from data sources. However, direct access and use of this data requires the end users to have an adequate technical background, while they should also cope with the internal data structure and values presented. Consequently the information retrieval is a quite difficult process even for IT or DB experts, taking into account the limited contributions of relational databases from the conceptual point of view. Ontologies enable users to formally describe a domain of knowledge in terms of concepts and relations among them and hence they can be used for unambiguously specifying the information captured by the relational database. However, accessing information residing in a database using ontologies is feasible, provided that the users are keen on using semantic web technologies. For enabling users form different disciplines to retrieve the appropriate data, the design of a Graphical User Interface is necessary. In this work, we will present an interactive, ontology-based, semantically enable web tool that can be used for information retrieval purposes. The tool is totally based on the ontological representation of underlying database schema while it provides a user friendly environment through which the users can graphically form and execute their queries. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ontologies" title="ontologies">ontologies</a>, <a href="https://publications.waset.org/abstracts/search?q=relational%20databases" title=" relational databases"> relational databases</a>, <a href="https://publications.waset.org/abstracts/search?q=SPARQL" title=" SPARQL"> SPARQL</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20interface" title=" web interface"> web interface</a> </p> <a href="https://publications.waset.org/abstracts/21795/a-novel-framework-for-user-friendly-ontology-mediated-access-to-relational-databases" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21795.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">272</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">826</span> An Analysis of Sequential Pattern Mining on Databases Using Approximate Sequential Patterns</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=J.%20Suneetha">J. Suneetha</a>, <a href="https://publications.waset.org/abstracts/search?q=Vijayalaxmi"> Vijayalaxmi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Sequential Pattern Mining involves applying data mining methods to large data repositories to extract usage patterns. Sequential pattern mining methodologies used to analyze the data and identify patterns. The patterns have been used to implement efficient systems can recommend on previously observed patterns, in making predictions, improve usability of systems, detecting events, and in general help in making strategic product decisions. In this paper, identified performance of approximate sequential pattern mining defines as identifying patterns approximately shared with many sequences. Approximate sequential patterns can effectively summarize and represent the databases by identifying the underlying trends in the data. Conducting an extensive and systematic performance over synthetic and real data. The results demonstrate that ApproxMAP effective and scalable in mining large sequences databases with long patterns. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multiple%20data" title="multiple data">multiple data</a>, <a href="https://publications.waset.org/abstracts/search?q=performance%20analysis" title=" performance analysis"> performance analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20pattern" title=" sequential pattern"> sequential pattern</a>, <a href="https://publications.waset.org/abstracts/search?q=sequence%20database%20scalability" title=" sequence database scalability"> sequence database scalability</a> </p> <a href="https://publications.waset.org/abstracts/46782/an-analysis-of-sequential-pattern-mining-on-databases-using-approximate-sequential-patterns" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46782.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">344</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">825</span> Database Playlists: Croatia's Popular Music in the Mirror of Collective Memory</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Diana%20Grguric">Diana Grguric</a>, <a href="https://publications.waset.org/abstracts/search?q=Robert%20Svetlacic"> Robert Svetlacic</a>, <a href="https://publications.waset.org/abstracts/search?q=Vladimir%20Simovic"> Vladimir Simovic</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Scientific research analytically explores database playlists by studying the memory culture through Croatian popular radio music. The research is based on the scientific analysis of databases developed on the basis of the playlist of ten Croatian radio stations. The most recent Croatian song on Statehood Day 2008-2013 is analyzed in order to gain insight into their (memory) potential in terms of storing, interpreting and presenting a national identity. The research starts with the general assumption that popular music is an efficient identifier, transmitter, and promoter of national identity. The aim of the scientific research of the database was to analytically reveal specific titles of Croatian popular songs that participate in marking memories and analyzing their symbolic capital to gain insight into the popular music experience of the past and to develop a new method of scientifically based analysis of specific databases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=specific%20databases" title="specific databases">specific databases</a>, <a href="https://publications.waset.org/abstracts/search?q=popular%20radio%20music" title=" popular radio music"> popular radio music</a>, <a href="https://publications.waset.org/abstracts/search?q=collective%20memory" title=" collective memory"> collective memory</a>, <a href="https://publications.waset.org/abstracts/search?q=national%20identity" title=" national identity"> national identity</a> </p> <a href="https://publications.waset.org/abstracts/76007/database-playlists-croatias-popular-music-in-the-mirror-of-collective-memory" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/76007.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">356</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">824</span> Ontology-Driven Knowledge Discovery and Validation from Admission Databases: A Structural Causal Model Approach for Polytechnic Education in Nigeria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bernard%20Igoche%20Igoche">Bernard Igoche Igoche</a>, <a href="https://publications.waset.org/abstracts/search?q=Olumuyiwa%20Matthew"> Olumuyiwa Matthew</a>, <a href="https://publications.waset.org/abstracts/search?q=Peter%20Bednar"> Peter Bednar</a>, <a href="https://publications.waset.org/abstracts/search?q=Alexander%20Gegov"> Alexander Gegov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study presents an ontology-driven approach for knowledge discovery and validation from admission databases in Nigerian polytechnic institutions. The research aims to address the challenges of extracting meaningful insights from vast amounts of admission data and utilizing them for decision-making and process improvement. The proposed methodology combines the knowledge discovery in databases (KDD) process with a structural causal model (SCM) ontological framework. The admission database of Benue State Polytechnic Ugbokolo (Benpoly) is used as a case study. The KDD process is employed to mine and distill knowledge from the database, while the SCM ontology is designed to identify and validate the important features of the admission process. The SCM validation is performed using the conditional independence test (CIT) criteria, and an algorithm is developed to implement the validation process. The identified features are then used for machine learning (ML) modeling and prediction of admission status. The results demonstrate the adequacy of the SCM ontological framework in representing the admission process and the high predictive accuracies achieved by the ML models, with k-nearest neighbors (KNN) and support vector machine (SVM) achieving 92% accuracy. The study concludes that the proposed ontology-driven approach contributes to the advancement of educational data mining and provides a foundation for future research in this domain. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=admission%20databases" title="admission databases">admission databases</a>, <a href="https://publications.waset.org/abstracts/search?q=educational%20data%20mining" title=" educational data mining"> educational data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=machine%20learning" title=" machine learning"> machine learning</a>, <a href="https://publications.waset.org/abstracts/search?q=ontology-driven%20knowledge%20discovery" title=" ontology-driven knowledge discovery"> ontology-driven knowledge discovery</a>, <a href="https://publications.waset.org/abstracts/search?q=polytechnic%20education" title=" polytechnic education"> polytechnic education</a>, <a href="https://publications.waset.org/abstracts/search?q=structural%20causal%20model" title=" structural causal model"> structural causal model</a> </p> <a href="https://publications.waset.org/abstracts/184064/ontology-driven-knowledge-discovery-and-validation-from-admission-databases-a-structural-causal-model-approach-for-polytechnic-education-in-nigeria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/184064.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">64</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">823</span> Analysis of Cyber Activities of Potential Business Customers Using Neo4j Graph Databases</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Suglo%20Tohari%20Luri">Suglo Tohari Luri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Data analysis is an important aspect of business performance. With the application of artificial intelligence within databases, selecting a suitable database engine for an application design is also very crucial for business data analysis. The application of business intelligence (BI) software into some relational databases such as Neo4j has proved highly effective in terms of customer data analysis. Yet what remains of great concern is the fact that not all business organizations have the neo4j business intelligence software applications to implement for customer data analysis. Further, those with the BI software lack personnel with the requisite expertise to use it effectively with the neo4j database. The purpose of this research is to demonstrate how the Neo4j program code alone can be applied for the analysis of e-commerce website customer visits. As the neo4j database engine is optimized for handling and managing data relationships with the capability of building high performance and scalable systems to handle connected data nodes, it will ensure that business owners who advertise their products at websites using neo4j as a database are able to determine the number of visitors so as to know which products are visited at routine intervals for the necessary decision making. It will also help in knowing the best customer segments in relation to specific goods so as to place more emphasis on their advertisement on the said websites. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data" title="data">data</a>, <a href="https://publications.waset.org/abstracts/search?q=engine" title=" engine"> engine</a>, <a href="https://publications.waset.org/abstracts/search?q=intelligence" title=" intelligence"> intelligence</a>, <a href="https://publications.waset.org/abstracts/search?q=customer" title=" customer"> customer</a>, <a href="https://publications.waset.org/abstracts/search?q=neo4j" title=" neo4j"> neo4j</a>, <a href="https://publications.waset.org/abstracts/search?q=database" title=" database"> database</a> </p> <a href="https://publications.waset.org/abstracts/141336/analysis-of-cyber-activities-of-potential-business-customers-using-neo4j-graph-databases" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/141336.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">193</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">822</span> A Framework for SQL Learning: Linking Learning Taxonomy, Cognitive Model and Cross Cutting Factors</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Huda%20Al%20Shuaily">Huda Al Shuaily</a>, <a href="https://publications.waset.org/abstracts/search?q=Karen%20Renaud"> Karen Renaud</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Databases comprise the foundation of most software systems. System developers inevitably write code to query these databases. The de facto language for querying is SQL and this, consequently, is the default language taught by higher education institutions. There is evidence that learners find it hard to master SQL, harder than mastering other programming languages such as Java. Educators do not agree about explanations for this seeming anomaly. Further investigation may well reveal the reasons. In this paper, we report on our investigations into how novices learn SQL, the actual problems they experience when writing SQL, as well as the differences between expert and novice SQL query writers. We conclude by presenting a model of SQL learning that should inform the instructional material design process better to support the SQL learning process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pattern" title="pattern">pattern</a>, <a href="https://publications.waset.org/abstracts/search?q=SQL" title=" SQL"> SQL</a>, <a href="https://publications.waset.org/abstracts/search?q=learning" title=" learning"> learning</a>, <a href="https://publications.waset.org/abstracts/search?q=model" title=" model"> model</a> </p> <a href="https://publications.waset.org/abstracts/53944/a-framework-for-sql-learning-linking-learning-taxonomy-cognitive-model-and-cross-cutting-factors" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/53944.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">255</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">821</span> Formulation of a Rapid Earthquake Risk Ranking Criteria for National Bridges in the National Capital Region Affected by the West Valley Fault Using GIS Data Integration</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=George%20Mariano%20Soriano">George Mariano Soriano</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, a Rapid Earthquake Risk Ranking Criteria was formulated by integrating various existing maps and databases by the Department of Public Works and Highways (DPWH) and Philippine Institute of Volcanology and Seismology (PHIVOLCS). Utilizing Geographic Information System (GIS) software, the above-mentioned maps and databases were used in extracting seismic hazard parameters and bridge vulnerability characteristics in order to rank the seismic damage risk rating of bridges in the National Capital Region. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bridge" title="bridge">bridge</a>, <a href="https://publications.waset.org/abstracts/search?q=earthquake" title=" earthquake"> earthquake</a>, <a href="https://publications.waset.org/abstracts/search?q=GIS" title=" GIS"> GIS</a>, <a href="https://publications.waset.org/abstracts/search?q=hazard" title=" hazard"> hazard</a>, <a href="https://publications.waset.org/abstracts/search?q=risk" title=" risk"> risk</a>, <a href="https://publications.waset.org/abstracts/search?q=vulnerability" title=" vulnerability"> vulnerability</a> </p> <a href="https://publications.waset.org/abstracts/60021/formulation-of-a-rapid-earthquake-risk-ranking-criteria-for-national-bridges-in-the-national-capital-region-affected-by-the-west-valley-fault-using-gis-data-integration" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/60021.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">409</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">820</span> JREM: An Approach for Formalising Models in the Requirements Phase with JSON and NoSQL Databases</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aitana%20Alonso-Nogueira">Aitana Alonso-Nogueira</a>, <a href="https://publications.waset.org/abstracts/search?q=Helia%20Est%C3%A9vez-Fern%C3%A1ndez"> Helia Estévez-Fernández</a>, <a href="https://publications.waset.org/abstracts/search?q=Isa%C3%ADas%20Garc%C3%ADa"> Isaías García</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an approach to reduce some of its current flaws in the requirements phase inside the software development process. It takes the software requirements of an application, makes a conceptual modeling about it and formalizes it within JSON documents. This formal model is lodged in a NoSQL database which is document-oriented, that is, MongoDB, because of its advantages in flexibility and efficiency. In addition, this paper underlines the contributions of the detailed approach and shows some applications and benefits for the future work in the field of automatic code generation using model-driven engineering tools. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conceptual%20modelling" title="conceptual modelling">conceptual modelling</a>, <a href="https://publications.waset.org/abstracts/search?q=JSON" title=" JSON"> JSON</a>, <a href="https://publications.waset.org/abstracts/search?q=NoSQL%20databases" title=" NoSQL databases"> NoSQL databases</a>, <a href="https://publications.waset.org/abstracts/search?q=requirements%20engineering" title=" requirements engineering"> requirements engineering</a>, <a href="https://publications.waset.org/abstracts/search?q=software%20development" title=" software development"> software development</a> </p> <a href="https://publications.waset.org/abstracts/58140/jrem-an-approach-for-formalising-models-in-the-requirements-phase-with-json-and-nosql-databases" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58140.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">378</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">819</span> Knowledge Discovery from Production Databases for Hierarchical Process Control</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pavol%20Tanuska">Pavol Tanuska</a>, <a href="https://publications.waset.org/abstracts/search?q=Pavel%20Vazan"> Pavel Vazan</a>, <a href="https://publications.waset.org/abstracts/search?q=Michal%20Kebisek"> Michal Kebisek</a>, <a href="https://publications.waset.org/abstracts/search?q=Dominika%20Jurovata"> Dominika Jurovata</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper gives the results of the project that was oriented on the usage of knowledge discoveries from production systems for needs of the hierarchical process control. One of the main project goals was the proposal of knowledge discovery model for process control. Specifics data mining methods and techniques was used for defined problems of the process control. The gained knowledge was used on the real production system, thus, the proposed solution has been verified. The paper documents how it is possible to apply new discovery knowledge to be used in the real hierarchical process control. There are specified the opportunities for application of the proposed knowledge discovery model for hierarchical process control. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20process%20control" title="hierarchical process control">hierarchical process control</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20discovery%20from%20databases" title=" knowledge discovery from databases"> knowledge discovery from databases</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20network" title=" neural network"> neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=process%20control" title=" process control"> process control</a> </p> <a href="https://publications.waset.org/abstracts/2816/knowledge-discovery-from-production-databases-for-hierarchical-process-control" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2816.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">481</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">818</span> De-Novo Structural Elucidation from Mass/NMR Spectra</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ismael%20Zamora">Ismael Zamora</a>, <a href="https://publications.waset.org/abstracts/search?q=Elisabeth%20Ortega"> Elisabeth Ortega</a>, <a href="https://publications.waset.org/abstracts/search?q=Tatiana%20Radchenko"> Tatiana Radchenko</a>, <a href="https://publications.waset.org/abstracts/search?q=Guillem%20Plasencia"> Guillem Plasencia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The structure elucidation based on Mass Spectra (MS) data of unknown substances is an unresolved problem that affects many different fields of application. The recent overview of software available for structure elucidation of small molecules has shown the demand for efficient computational tool that will be able to perform structure elucidation of unknown small molecules and peptides. We developed an algorithm for De-Novo fragment analysis based on MS data that proposes a set of scored and ranked structures that are compatible with the MS and MSMS spectra. Several different algorithms were developed depending on the initial set of fragments and the structure building processes. Also, in all cases, several scores for the final molecule ranking were computed. They were validated with small and middle databases (DB) with the eleven test set compounds. Similar results were obtained from any of the databases that contained the fragments of the expected compound. We presented an algorithm. Or De-Novo fragment analysis based on only mass spectrometry (MS) data only that proposed a set of scored/ranked structures that was validated on different types of databases and showed good results as proof of concept. Moreover, the solutions proposed by Mass Spectrometry were submitted to the prediction of NMR spectra in order to elucidate which of the proposed structures was compatible with the NMR spectra collected. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=De%20Novo" title="De Novo">De Novo</a>, <a href="https://publications.waset.org/abstracts/search?q=structure%20elucidation" title=" structure elucidation"> structure elucidation</a>, <a href="https://publications.waset.org/abstracts/search?q=mass%20spectrometry" title=" mass spectrometry"> mass spectrometry</a>, <a href="https://publications.waset.org/abstracts/search?q=NMR" title=" NMR"> NMR</a> </p> <a href="https://publications.waset.org/abstracts/58568/de-novo-structural-elucidation-from-massnmr-spectra" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58568.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">296</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">817</span> Integrating a Universal Forensic DNA Database: Anticipated Deterrent Effects</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Karen%20Fang">Karen Fang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Investigative genetic genealogy has attracted much interest in both the field of ethics and the public eye due to its global application in criminal cases. Arguments have been made regarding privacy and informed consent, especially with law enforcement using consumer genetic testing results to convict individuals. In the case of public interest, DNA databases have the strong potential to significantly reduce crime, which in turn leads to safer communities and better futures. With the advancement of genetic technologies, the integration of a universal forensic DNA database in violent crimes, crimes against children, and missing person cases is expected to deter crime while protecting one’s privacy. Rather than collecting whole genomes from the whole population, STR profiles can be used to identify unrelated individuals without compromising personal information such as physical appearance, disease risk, and geographical origin, and additionally, reduce cost and storage space. STR DNA profiling is already used in the forensic science field and going a step further benefits several areas, including the reduction in recidivism, improved criminal court case turnaround time, and just punishment. Furthermore, adding individuals to the database as early as possible prevents young offenders and first-time offenders from participating in criminal activity. It is important to highlight that DNA databases should be inclusive and tightly governed, and the misconception on the use of DNA based on crime television series and other media sources should be addressed. Nonetheless, deterrent effects have been observed in countries like the US and Denmark with DNA databases that consist of serious violent offenders. Fewer crimes were reported, and fewer people were convicted of those crimes- a favorable outcome, not even the death penalty could provide. Currently, there is no better alternative than a universal forensic DNA database made up of STR profiles. It can open doors for investigative genetic genealogy and fostering better communities. Expanding the appropriate use of DNA databases is ethically acceptable and positively impacts the public. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bioethics" title="bioethics">bioethics</a>, <a href="https://publications.waset.org/abstracts/search?q=deterrent%20effects" title=" deterrent effects"> deterrent effects</a>, <a href="https://publications.waset.org/abstracts/search?q=DNA%20database" title=" DNA database"> DNA database</a>, <a href="https://publications.waset.org/abstracts/search?q=investigative%20genetic%20genealogy" title=" investigative genetic genealogy"> investigative genetic genealogy</a>, <a href="https://publications.waset.org/abstracts/search?q=privacy" title=" privacy"> privacy</a>, <a href="https://publications.waset.org/abstracts/search?q=public%20interest" title=" public interest"> public interest</a> </p> <a href="https://publications.waset.org/abstracts/143388/integrating-a-universal-forensic-dna-database-anticipated-deterrent-effects" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/143388.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">149</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">816</span> Autonomic Threat Avoidance and Self-Healing in Database Management System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wajahat%20Munir">Wajahat Munir</a>, <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Haseeb"> Muhammad Haseeb</a>, <a href="https://publications.waset.org/abstracts/search?q=Adeel%20Anjum"> Adeel Anjum</a>, <a href="https://publications.waset.org/abstracts/search?q=Basit%20Raza"> Basit Raza</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmad%20Kamran%20Malik"> Ahmad Kamran Malik</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Databases are the key components of the software systems. Due to the exponential growth of data, it is the concern that the data should be accurate and available. The data in databases is vulnerable to internal and external threats, especially when it contains sensitive data like medical or military applications. Whenever the data is changed by malicious intent, data analysis result may lead to disastrous decisions. Autonomic self-healing is molded toward computer system after inspiring from the autonomic system of human body. In order to guarantee the accuracy and availability of data, we propose a technique which on a priority basis, tries to avoid any malicious transaction from execution and in case a malicious transaction affects the system, it heals the system in an isolated mode in such a way that the availability of system would not be compromised. Using this autonomic system, the management cost and time of DBAs can be minimized. In the end, we test our model and present the findings. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=autonomic%20computing" title="autonomic computing">autonomic computing</a>, <a href="https://publications.waset.org/abstracts/search?q=self-healing" title=" self-healing"> self-healing</a>, <a href="https://publications.waset.org/abstracts/search?q=threat%20avoidance" title=" threat avoidance"> threat avoidance</a>, <a href="https://publications.waset.org/abstracts/search?q=security" title=" security"> security</a> </p> <a href="https://publications.waset.org/abstracts/71728/autonomic-threat-avoidance-and-self-healing-in-database-management-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/71728.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">504</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">815</span> Extracting the Coupled Dynamics in Thin-Walled Beams from Numerical Data Bases</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20A.%20Bani-Khaled">Mohammad A. Bani-Khaled</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work we use the Discrete Proper Orthogonal Decomposition transform to characterize the properties of coupled dynamics in thin-walled beams by exploiting numerical simulations obtained from finite element simulations. The outcomes of the will improve our understanding of the linear and nonlinear coupled behavior of thin-walled beams structures. Thin-walled beams have widespread usage in modern engineering application in both large scale structures (aeronautical structures), as well as in nano-structures (nano-tubes). Therefore, detailed knowledge in regard to the properties of coupled vibrations and buckling in these structures are of great interest in the research community. Due to the geometric complexity in the overall structure and in particular in the cross-sections it is necessary to involve computational mechanics to numerically simulate the dynamics. In using numerical computational techniques, it is not necessary to over simplify a model in order to solve the equations of motions. Computational dynamics methods produce databases of controlled resolution in time and space. These numerical databases contain information on the properties of the coupled dynamics. In order to extract the system dynamic properties and strength of coupling among the various fields of the motion, processing techniques are required. Time- Proper Orthogonal Decomposition transform is a powerful tool for processing databases for the dynamics. It will be used to study the coupled dynamics of thin-walled basic structures. These structures are ideal to form a basis for a systematic study of coupled dynamics in structures of complex geometry. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=coupled%20dynamics" title="coupled dynamics">coupled dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=geometric%20complexity" title=" geometric complexity"> geometric complexity</a>, <a href="https://publications.waset.org/abstracts/search?q=proper%20orthogonal%20decomposition%20%28POD%29" title=" proper orthogonal decomposition (POD)"> proper orthogonal decomposition (POD)</a>, <a href="https://publications.waset.org/abstracts/search?q=thin%20walled%20beams" title=" thin walled beams"> thin walled beams</a> </p> <a href="https://publications.waset.org/abstracts/22175/extracting-the-coupled-dynamics-in-thin-walled-beams-from-numerical-data-bases" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22175.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">418</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">814</span> Speech Emotion Recognition with Bi-GRU and Self-Attention based Feature Representation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bubai%20Maji">Bubai Maji</a>, <a href="https://publications.waset.org/abstracts/search?q=Monorama%20Swain"> Monorama Swain</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Speech is considered an essential and most natural medium for the interaction between machines and humans. However, extracting effective features for speech emotion recognition (SER) is remains challenging. The present studies show that the temporal information captured but high-level temporal-feature learning is yet to be investigated. In this paper, we present an efficient novel method using the Self-attention (SA) mechanism in a combination of Convolutional Neural Network (CNN) and Bi-directional Gated Recurrent Unit (Bi-GRU) network to learn high-level temporal-feature. In order to further enhance the representation of the high-level temporal-feature, we integrate a Bi-GRU output with learnable weights features by SA, and improve the performance. We evaluate our proposed method on our created SITB-OSED and IEMOCAP databases. We report that the experimental results of our proposed method achieve state-of-the-art performance on both databases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bi-GRU" title="Bi-GRU">Bi-GRU</a>, <a href="https://publications.waset.org/abstracts/search?q=1D-CNNs" title=" 1D-CNNs"> 1D-CNNs</a>, <a href="https://publications.waset.org/abstracts/search?q=self-attention" title=" self-attention"> self-attention</a>, <a href="https://publications.waset.org/abstracts/search?q=speech%20emotion%20recognition" title=" speech emotion recognition"> speech emotion recognition</a> </p> <a href="https://publications.waset.org/abstracts/148332/speech-emotion-recognition-with-bi-gru-and-self-attention-based-feature-representation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/148332.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">113</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">813</span> Applying Spanning Tree Graph Theory for Automatic Database Normalization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chetneti%20Srisa-an">Chetneti Srisa-an</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In Knowledge and Data Engineering field, relational database is the best repository to store data in a real world. It has been using around the world more than eight decades. Normalization is the most important process for the analysis and design of relational databases. It aims at creating a set of relational tables with minimum data redundancy that preserve consistency and facilitate correct insertion, deletion, and modification. Normalization is a major task in the design of relational databases. Despite its importance, very few algorithms have been developed to be used in the design of commercial automatic normalization tools. It is also rare technique to do it automatically rather manually. Moreover, for a large and complex database as of now, it make even harder to do it manually. This paper presents a new complete automated relational database normalization method. It produces the directed graph and spanning tree, first. It then proceeds with generating the 2NF, 3NF and also BCNF normal forms. The benefit of this new algorithm is that it can cope with a large set of complex function dependencies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=relational%20database" title="relational database">relational database</a>, <a href="https://publications.waset.org/abstracts/search?q=functional%20dependency" title=" functional dependency"> functional dependency</a>, <a href="https://publications.waset.org/abstracts/search?q=automatic%20normalization" title=" automatic normalization"> automatic normalization</a>, <a href="https://publications.waset.org/abstracts/search?q=primary%20key" title=" primary key"> primary key</a>, <a href="https://publications.waset.org/abstracts/search?q=spanning%20tree" title=" spanning tree"> spanning tree</a> </p> <a href="https://publications.waset.org/abstracts/8250/applying-spanning-tree-graph-theory-for-automatic-database-normalization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8250.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">353</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">812</span> BiLex-Kids: A Bilingual Word Database for Children 5-13 Years Old</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aris%20R.%20Terzopoulos">Aris R. Terzopoulos</a>, <a href="https://publications.waset.org/abstracts/search?q=Georgia%20Z.%20Niolaki"> Georgia Z. Niolaki</a>, <a href="https://publications.waset.org/abstracts/search?q=Lynne%20G.%20Duncan"> Lynne G. Duncan</a>, <a href="https://publications.waset.org/abstracts/search?q=Mark%20A.%20J.%20Wilson"> Mark A. J. Wilson</a>, <a href="https://publications.waset.org/abstracts/search?q=Antonios%20Kyparissiadis"> Antonios Kyparissiadis</a>, <a href="https://publications.waset.org/abstracts/search?q=Jackie%20Masterson"> Jackie Masterson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As word databases for bilingual children are not available, researchers, educators and textbook writers must rely on monolingual databases. The aim of this study is thus to develop a bilingual word database, BiLex-kids, an online open access developmental word database for 5-13 year old bilingual children who learn Greek as a second language and have English as their dominant one. BiLex-kids is compiled from 120 Greek textbooks used in Greek-English bilingual education in the UK, USA and Australia, and provides word translations in the two languages, pronunciations in Greek, and psycholinguistic variables (e.g. Zipf, Frequency per million, Dispersion, Contextual Diversity, Neighbourhood size). After clearing the textbooks of non-relevant items (e.g. punctuation), algorithms were applied to extract the psycholinguistic indices for all words. As well as one total lexicon, the database produces values for all ages (one lexicon for each age) and for three age bands (one lexicon per age band: 5-8, 9-11, 12-13 years). BiLex-kids provides researchers with accurate figures for a wide range of psycholinguistic variables, making it a useful and reliable research tool for selecting stimuli to examine lexical processing among bilingual children. In addition, it offers children the opportunity to study word spelling, learn translations and listen to pronunciations in their second language. It further benefits educators in selecting age-appropriate words for teaching reading and spelling, while special educational needs teachers will have a resource to control the content of word lists when designing interventions for bilinguals with literacy difficulties. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bilingual%20children" title="bilingual children">bilingual children</a>, <a href="https://publications.waset.org/abstracts/search?q=psycholinguistics" title=" psycholinguistics"> psycholinguistics</a>, <a href="https://publications.waset.org/abstracts/search?q=vocabulary%20development" title=" vocabulary development"> vocabulary development</a>, <a href="https://publications.waset.org/abstracts/search?q=word%20databases" title=" word databases"> word databases</a> </p> <a href="https://publications.waset.org/abstracts/70529/bilex-kids-a-bilingual-word-database-for-children-5-13-years-old" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/70529.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">312</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">811</span> Algorithm for Information Retrieval Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kehinde%20K.%20Agbele">Kehinde K. Agbele</a>, <a href="https://publications.waset.org/abstracts/search?q=Kehinde%20Daniel%20Aruleba"> Kehinde Daniel Aruleba</a>, <a href="https://publications.waset.org/abstracts/search?q=Eniafe%20F.%20Ayetiran"> Eniafe F. Ayetiran</a> </p> <p class="card-text"><strong>Abstract:</strong></p> When using Information Retrieval Systems (IRS), users often present search queries made of ad-hoc keywords. It is then up to the IRS to obtain a precise representation of the user’s information need and the context of the information. This paper investigates optimization of IRS to individual information needs in order of relevance. The study addressed development of algorithms that optimize the ranking of documents retrieved from IRS. This study discusses and describes a Document Ranking Optimization (DROPT) algorithm for information retrieval (IR) in an Internet-based or designated databases environment. Conversely, as the volume of information available online and in designated databases is growing continuously, ranking algorithms can play a major role in the context of search results. In this paper, a DROPT technique for documents retrieved from a corpus is developed with respect to document index keywords and the query vectors. This is based on calculating the weight ( <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=information%20retrieval" title="information retrieval">information retrieval</a>, <a href="https://publications.waset.org/abstracts/search?q=document%20relevance" title=" document relevance"> document relevance</a>, <a href="https://publications.waset.org/abstracts/search?q=performance%20measures" title=" performance measures"> performance measures</a>, <a href="https://publications.waset.org/abstracts/search?q=personalization" title=" personalization"> personalization</a> </p> <a href="https://publications.waset.org/abstracts/40905/algorithm-for-information-retrieval-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40905.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">241</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">810</span> Dynamic Environmental Impact Study during the Construction of the French Nuclear Power Plants</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Er-Raki">A. Er-Raki</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20Hartmann"> D. Hartmann</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20P.%20Belaud"> J. P. Belaud</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Negny"> S. Negny </a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper has a double purpose: firstly, a literature review of the life cycle analysis (LCA) and secondly a comparison between conventional (static) LCA and multi-level dynamic LCA on the following items: (i) inventories evolution with time (ii) temporal evolution of the databases. The first part of the paper summarizes the state of the art of the static LCA approach. The different static LCA limits have been identified and especially the non-consideration of the spatial and temporal evolution in the inventory, for the characterization factors (FCs) and into the databases. Then a description of the different levels of integration of the notion of temporality in life cycle analysis studies was made. In the second part, the dynamic inventory has been evaluated firstly for a single nuclear plant and secondly for the entire French nuclear power fleet by taking into account the construction durations of all the plants. In addition, the databases have been adapted by integrating the temporal variability of the French energy mix. Several iterations were used to converge towards the real environmental impact of the energy mix. Another adaptation of the databases to take into account the temporal evolution of the market data of the raw material was made. An identification of the energy mix of the time studied was based on an extrapolation of the production reference values of each means of production. An application to the construction of the French nuclear power plants from 1971 to 2000 has been performed, in which a dynamic inventory of raw material has been evaluated. Then the impacts were characterized by the ILCD 2011 characterization method. In order to compare with a purely static approach, a static impact assessment was made with the V 3.4 Ecoinvent data sheets without adaptation and a static inventory considering that all the power stations would have been built at the same time. Finally, a comparison between static and dynamic LCA approaches was set up to determine the gap between them for each of the two levels of integration. The results were analyzed to identify the contribution of the evolving nuclear power fleet construction to the total environmental impacts of the French energy mix during the same period. An equivalent strategy using a dynamic approach will further be applied to identify the environmental impacts that different scenarios of the energy transition could bring, allowing to choose the best energy mix from an environmental viewpoint. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=LCA" title="LCA">LCA</a>, <a href="https://publications.waset.org/abstracts/search?q=static" title=" static"> static</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic" title=" dynamic"> dynamic</a>, <a href="https://publications.waset.org/abstracts/search?q=inventory" title=" inventory"> inventory</a>, <a href="https://publications.waset.org/abstracts/search?q=construction" title=" construction"> construction</a>, <a href="https://publications.waset.org/abstracts/search?q=nuclear%20energy" title=" nuclear energy"> nuclear energy</a>, <a href="https://publications.waset.org/abstracts/search?q=energy%20mix" title=" energy mix"> energy mix</a>, <a href="https://publications.waset.org/abstracts/search?q=energy%20transition" title=" energy transition"> energy transition</a> </p> <a href="https://publications.waset.org/abstracts/108601/dynamic-environmental-impact-study-during-the-construction-of-the-french-nuclear-power-plants" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/108601.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">105</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">809</span> A NoSQL Based Approach for Real-Time Managing of Robotics's Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gueidi%20Afef">Gueidi Afef</a>, <a href="https://publications.waset.org/abstracts/search?q=Gharsellaoui%20Hamza"> Gharsellaoui Hamza</a>, <a href="https://publications.waset.org/abstracts/search?q=Ben%20Ahmed%20Samir"> Ben Ahmed Samir</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with the secret of the continual progression data that new data management solutions have been emerged: The NoSQL databases. They crossed several areas like personalization, profile management, big data in real-time, content management, catalog, view of customers, mobile applications, internet of things, digital communication and fraud detection. Nowadays, these database management systems are increasing. These systems store data very well and with the trend of big data, a new challenge’s store demands new structures and methods for managing enterprise data. The new intelligent machine in the e-learning sector, thrives on more data, so smart machines can learn more and faster. The robotics are our use case to focus on our test. The implementation of NoSQL for Robotics wrestle all the data they acquire into usable form because with the ordinary type of robotics; we are facing very big limits to manage and find the exact information in real-time. Our original proposed approach was demonstrated by experimental studies and running example used as a use case. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=NoSQL%20databases" title="NoSQL databases">NoSQL databases</a>, <a href="https://publications.waset.org/abstracts/search?q=database%20management%20systems" title=" database management systems"> database management systems</a>, <a href="https://publications.waset.org/abstracts/search?q=robotics" title=" robotics"> robotics</a>, <a href="https://publications.waset.org/abstracts/search?q=big%20data" title=" big data"> big data</a> </p> <a href="https://publications.waset.org/abstracts/65886/a-nosql-based-approach-for-real-time-managing-of-roboticss-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/65886.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">355</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">808</span> Ontology-Based Backpropagation Neural Network Classification and Reasoning Strategy for NoSQL and SQL Databases</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hao-Hsiang%20Ku">Hao-Hsiang Ku</a>, <a href="https://publications.waset.org/abstracts/search?q=Ching-Ho%20Chi"> Ching-Ho Chi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Big data applications have become an imperative for many fields. Many researchers have been devoted into increasing correct rates and reducing time complexities. Hence, the study designs and proposes an Ontology-based backpropagation neural network classification and reasoning strategy for NoSQL big data applications, which is called ON4NoSQL. ON4NoSQL is responsible for enhancing the performances of classifications in NoSQL and SQL databases to build up mass behavior models. Mass behavior models are made by MapReduce techniques and Hadoop distributed file system based on Hadoop service platform. The reference engine of ON4NoSQL is the ontology-based backpropagation neural network classification and reasoning strategy. Simulation results indicate that ON4NoSQL can efficiently achieve to construct a high performance environment for data storing, searching, and retrieving. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hadoop" title="Hadoop">Hadoop</a>, <a href="https://publications.waset.org/abstracts/search?q=NoSQL" title=" NoSQL"> NoSQL</a>, <a href="https://publications.waset.org/abstracts/search?q=ontology" title=" ontology"> ontology</a>, <a href="https://publications.waset.org/abstracts/search?q=back%20propagation%20neural%20network" title=" back propagation neural network"> back propagation neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=high%20distributed%20file%20system" title=" high distributed file system"> high distributed file system</a> </p> <a href="https://publications.waset.org/abstracts/79907/ontology-based-backpropagation-neural-network-classification-and-reasoning-strategy-for-nosql-and-sql-databases" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/79907.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">262</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">807</span> Anomaly Detection with ANN and SVM for Telemedicine Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Edward%20Guill%C3%A9n">Edward Guillén</a>, <a href="https://publications.waset.org/abstracts/search?q=Jeisson%20S%C3%A1nchez"> Jeisson Sánchez</a>, <a href="https://publications.waset.org/abstracts/search?q=Carlos%20Omar%20Ramos"> Carlos Omar Ramos</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years, a wide variety of applications are developed with Support Vector Machines -SVM- methods and Artificial Neural Networks -ANN-. In general, these methods depend on intrusion knowledge databases such as KDD99, ISCX, and CAIDA among others. New classes of detectors are generated by machine learning techniques, trained and tested over network databases. Thereafter, detectors are employed to detect anomalies in network communication scenarios according to user’s connections behavior. The first detector based on training dataset is deployed in different real-world networks with mobile and non-mobile devices to analyze the performance and accuracy over static detection. The vulnerabilities are based on previous work in telemedicine apps that were developed on the research group. This paper presents the differences on detections results between some network scenarios by applying traditional detectors deployed with artificial neural networks and support vector machines. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=anomaly%20detection" title="anomaly detection">anomaly detection</a>, <a href="https://publications.waset.org/abstracts/search?q=back-propagation%20neural%20networks" title=" back-propagation neural networks"> back-propagation neural networks</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20intrusion%20detection%20systems" title=" network intrusion detection systems"> network intrusion detection systems</a>, <a href="https://publications.waset.org/abstracts/search?q=support%20vector%20machines" title=" support vector machines"> support vector machines</a> </p> <a href="https://publications.waset.org/abstracts/42120/anomaly-detection-with-ann-and-svm-for-telemedicine-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42120.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">358</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/abstracts/search?q=CD-ROM%20databases&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=CD-ROM%20databases&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=CD-ROM%20databases&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=CD-ROM%20databases&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=CD-ROM%20databases&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=CD-ROM%20databases&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=CD-ROM%20databases&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=CD-ROM%20databases&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=CD-ROM%20databases&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=CD-ROM%20databases&page=27">27</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=CD-ROM%20databases&page=28">28</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=CD-ROM%20databases&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>