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: relation database</title> <meta name="description" content="Search results for: relation database"> <meta name="keywords" content="relation database"> <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="relation database" 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="relation database"> <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> 4292</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: relation database</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4292</span> A Survey on Concurrency Control Methods in Distributed Database</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seyed%20Mohsen%20Jameii">Seyed Mohsen Jameii</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the last years, remarkable improvements have been made in the ability of distributed database systems performance. A distributed database is composed of some sites which are connected to each other through network connections. In this system, if good harmonization is not made between different transactions, it may result in database incoherence. Nowadays, because of the complexity of many sites and their connection methods, it is difficult to extend different models in distributed database serially. The principle goal of concurrency control in distributed database is to ensure not interfering in accessibility of common database by different sites. Different concurrency control algorithms have been suggested to use in distributed database systems. In this paper, some available methods have been introduced and compared for concurrency control in distributed database. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20database" title="distributed database">distributed database</a>, <a href="https://publications.waset.org/abstracts/search?q=two%20phase%20locking%20protocol" title=" two phase locking protocol"> two phase locking protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=transaction" title=" transaction"> transaction</a>, <a href="https://publications.waset.org/abstracts/search?q=concurrency" title=" concurrency"> concurrency</a> </p> <a href="https://publications.waset.org/abstracts/69917/a-survey-on-concurrency-control-methods-in-distributed-database" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/69917.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">352</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">4291</span> Implementing a Database from a Requirement Specification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Omer">M. Omer</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20Wilson"> D. Wilson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Creating a database scheme is essentially a manual process. From a requirement specification, the information contained within has to be analyzed and reduced into a set of tables, attributes and relationships. This is a time-consuming process that has to go through several stages before an acceptable database schema is achieved. The purpose of this paper is to implement a Natural Language Processing (NLP) based tool to produce a from a requirement specification. The Stanford CoreNLP version 3.3.1 and the Java programming were used to implement the proposed model. The outcome of this study indicates that the first draft of a relational database schema can be extracted from a requirement specification by using NLP tools and techniques with minimum user intervention. Therefore, this method is a step forward in finding a solution that requires little or no user intervention. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=information%20extraction" title="information extraction">information extraction</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20language%20processing" title=" natural language processing"> natural language processing</a>, <a href="https://publications.waset.org/abstracts/search?q=relation%20extraction" title=" relation extraction"> relation extraction</a> </p> <a href="https://publications.waset.org/abstracts/11073/implementing-a-database-from-a-requirement-specification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/11073.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">261</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">4290</span> Predictive Analysis of Personnel Relationship in Graph Database</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kay%20Thi%20Yar">Kay Thi Yar</a>, <a href="https://publications.waset.org/abstracts/search?q=Khin%20Mar%20Lar%20Tun"> Khin Mar Lar Tun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, social networks are so popular and widely used in all over the world. In addition, searching personal information of each person and searching connection between them (peoples’ relation in real world) becomes interesting issue in our society. In this paper, we propose a framework with three portions for exploring peoples’ relations from their connected information. The first portion focuses on the Graph database structure to store the connected data of peoples’ information. The second one proposes the graph database searching algorithm, the Modified-SoS-ACO (Sense of Smell-Ant Colony Optimization). The last portion proposes the Deductive Reasoning Algorithm to define two persons’ relationship. This study reveals the proper storage structure for connected information, graph searching algorithm and deductive reasoning algorithm to predict and analyze the personnel relationship from peoples’ relation in their connected information. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=personnel%20information" title="personnel information">personnel information</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20storage%20structure" title=" graph storage structure"> graph storage structure</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20searching%20algorithm" title=" graph searching algorithm"> graph searching algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=deductive%20reasoning%20algorithm" title=" deductive reasoning algorithm"> deductive reasoning algorithm</a> </p> <a href="https://publications.waset.org/abstracts/15187/predictive-analysis-of-personnel-relationship-in-graph-database" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15187.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">450</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">4289</span> Metric Suite for Schema Evolution of a Relational Database</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Ravichandra">S. Ravichandra</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20V.%20L.%20N.%20Somayajulu"> D. V. L. N. Somayajulu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Requirement of stakeholders for adding more details to the database is the main cause of the schema evolution in the relational database. Further, this schema evolution causes the instability to the database. Hence, it is aimed to define a metric suite for schema evolution of a relational database. The metric suite will calculate the metrics based on the features of the database, analyse the queries on the database and measures the coupling, cohesion and component dependencies of the schema for existing and evolved versions of the database. This metric suite will also provide an indicator for the problems related to the stability and usability of the evolved database. The degree of change in the schema of a database is presented in the forms of graphs that acts as an indicator and also provides the relations between various parameters (metrics) related to the database architecture. The acquired information is used to defend and improve the stability of database architecture. The challenges arise in incorporating these metrics with varying parameters for formulating a suitable metric suite are discussed. To validate the proposed metric suite, an experimentation has been performed on publicly available datasets. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cohesion" title="cohesion">cohesion</a>, <a href="https://publications.waset.org/abstracts/search?q=coupling" title=" coupling"> coupling</a>, <a href="https://publications.waset.org/abstracts/search?q=entropy" title=" entropy"> entropy</a>, <a href="https://publications.waset.org/abstracts/search?q=metric%20suite" title=" metric suite"> metric suite</a>, <a href="https://publications.waset.org/abstracts/search?q=schema%20evolution" title=" schema evolution"> schema evolution</a> </p> <a href="https://publications.waset.org/abstracts/54754/metric-suite-for-schema-evolution-of-a-relational-database" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54754.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">451</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">4288</span> New Approach for Constructing a Secure Biometric Database</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Kebbeb">A. Kebbeb</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Mostefai"> M. Mostefai</a>, <a href="https://publications.waset.org/abstracts/search?q=F.%20Benmerzoug"> F. Benmerzoug</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.%20Chahir"> Y. Chahir</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The multimodal biometric identification is the combination of several biometric systems. The challenge of this combination is to reduce some limitations of systems based on a single modality while significantly improving performance. In this paper, we propose a new approach to the construction and the protection of a multimodal biometric database dedicated to an identification system. We use a topological watermarking to hide the relation between face image and the registered descriptors extracted from other modalities of the same person for more secure user identification. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=biometric%20databases" title="biometric databases">biometric databases</a>, <a href="https://publications.waset.org/abstracts/search?q=multimodal%20biometrics" title=" multimodal biometrics"> multimodal biometrics</a>, <a href="https://publications.waset.org/abstracts/search?q=security%20authentication" title=" security authentication"> security authentication</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20watermarking" title=" digital watermarking"> digital watermarking</a> </p> <a href="https://publications.waset.org/abstracts/3126/new-approach-for-constructing-a-secure-biometric-database" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3126.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">390</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">4287</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">4286</span> Medical and Surgical Nursing Care</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nassim%20Salmi">Nassim Salmi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Postoperative mobilization is an important part of fundamental care. Increased mobilization has a positive effect on recovery, but immobilization is still a challenge in postoperative care. Aims: To report how the establishment of a national nursing database was used to measure postoperative mobilization in patients undergoing surgery for ovarian cancer. Mobilization was defined as at least 3 hours out of bed on postoperative day 1, with the goal set at achieving this in 60% of patients. Clinical nurses on 4400 patients with ovarian cancer performed data entry. Findings: 46.7% of patients met the goal for mobilization on the first postoperative day, but variations in duration and type of mobilization were observed. Of those mobilized, 51.8% had been walking in the hallway. A national nursing database creates opportunities to optimize fundamental care. By comparing nursing data with oncological, surgical, and pathology data, it became possible to study mobilization in relation to cancer stage, comorbidity, treatment, and extent of surgery. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=postoperative%20care" title="postoperative care">postoperative care</a>, <a href="https://publications.waset.org/abstracts/search?q=gynecology" title=" gynecology"> gynecology</a>, <a href="https://publications.waset.org/abstracts/search?q=nursing%20documentation" title=" nursing documentation"> nursing documentation</a>, <a href="https://publications.waset.org/abstracts/search?q=database" title=" database"> database</a> </p> <a href="https://publications.waset.org/abstracts/157726/medical-and-surgical-nursing-care" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/157726.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">116</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">4285</span> Dynamic Store Procedures in Database</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammet%20Dursun%20Kaya">Muhammet Dursun Kaya</a>, <a href="https://publications.waset.org/abstracts/search?q=Hasan%20Asil"> Hasan Asil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years, different methods have been proposed to optimize question processing in database. Although different methods have been proposed to optimize the query, but the problem which exists here is that most of these methods destroy the query execution plan after executing the query. This research attempts to solve the above problem by using a combination of methods of communicating with the database (the present questions in the programming code and using store procedures) and making query processing adaptive in database, and proposing a new approach for optimization of query processing by introducing the idea of dynamic store procedures. This research creates dynamic store procedures in the database according to the proposed algorithm. This method has been tested on applied software and results shows a significant improvement in reducing the query processing time and also reducing the workload of DBMS. Other advantages of this algorithm include: making the programming environment a single environment, eliminating the parametric limitations of the stored procedures in the database, making the stored procedures in the database dynamic, etc. <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=agent" title=" agent"> agent</a>, <a href="https://publications.waset.org/abstracts/search?q=query%20processing" title=" query processing"> query processing</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptable" title=" adaptable"> adaptable</a>, <a href="https://publications.waset.org/abstracts/search?q=communication%20with%20the%20database" title=" communication with the database"> communication with the database</a> </p> <a href="https://publications.waset.org/abstracts/35023/dynamic-store-procedures-in-database" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35023.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">371</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">4284</span> Programming Language Extension Using Structured Query Language for Database Access</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chapman%20Eze%20Nnadozie">Chapman Eze Nnadozie</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Relational databases constitute a very vital tool for the effective management and administration of both personal and organizational data. Data access ranges from a single user database management software to a more complex distributed server system. This paper intends to appraise the use a programming language extension like structured query language (SQL) to establish links to a relational database (Microsoft Access 2013) using Visual C++ 9 programming language environment. The methodology used involves the creation of tables to form a database using Microsoft Access 2013, which is Object Linking and Embedding (OLE) database compliant. The SQL command is used to query the tables in the database for easy extraction of expected records inside the visual C++ environment. The findings of this paper reveal that records can easily be accessed and manipulated to filter exactly what the user wants, such as retrieval of records with specified criteria, updating of records, and deletion of part or the whole records in a table. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data%20access" title="data access">data access</a>, <a href="https://publications.waset.org/abstracts/search?q=database" title=" database"> database</a>, <a href="https://publications.waset.org/abstracts/search?q=database%20management%20system" title=" database management system"> database management system</a>, <a href="https://publications.waset.org/abstracts/search?q=OLE" title=" OLE"> OLE</a>, <a href="https://publications.waset.org/abstracts/search?q=programming%20language" title=" programming language"> programming language</a>, <a href="https://publications.waset.org/abstracts/search?q=records" title=" records"> records</a>, <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=software" title=" software"> software</a>, <a href="https://publications.waset.org/abstracts/search?q=SQL" title=" SQL"> SQL</a>, <a href="https://publications.waset.org/abstracts/search?q=table" title=" table"> table</a> </p> <a href="https://publications.waset.org/abstracts/83796/programming-language-extension-using-structured-query-language-for-database-access" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/83796.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">187</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">4283</span> Deploying a Platform as a Service Cloud Solution to Support Student Learning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jiangping%20Wang">Jiangping Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This presentation describes the design and implementation of PaaS (platform as a service) cloud-based labs that are used in database-related courses to teach students practical skills. Traditionally, all labs are implemented in a desktop-based environment where students have to install heavy client software to access database servers. In order to release students from that burden, we have successfully deployed the cloud-based solution to support database-related courses, from which students and teachers can practice and learn database topics in various database courses via cloud access. With its development environment, execution runtime, web server, database server, and collaboration capability, it offers a shared pool of configurable computing resources and comprehensive environment that supports students’ needs without the complexity of maintaining the infrastructure. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=PaaS" title="PaaS">PaaS</a>, <a href="https://publications.waset.org/abstracts/search?q=database%20environment" title=" database environment"> database environment</a>, <a href="https://publications.waset.org/abstracts/search?q=e-learning" title=" e-learning"> e-learning</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20server" title=" web server"> web server</a> </p> <a href="https://publications.waset.org/abstracts/84830/deploying-a-platform-as-a-service-cloud-solution-to-support-student-learning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/84830.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">268</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">4282</span> An Optimized Association Rule Mining Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Archana%20Singh">Archana Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Jyoti%20Agarwal"> Jyoti Agarwal</a>, <a href="https://publications.waset.org/abstracts/search?q=Ajay%20Rana"> Ajay Rana</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Data Mining is an efficient technology to discover patterns in large databases. Association Rule Mining techniques are used to find the correlation between the various item sets in a database, and this co-relation between various item sets are used in decision making and pattern analysis. In recent years, the problem of finding association rules from large datasets has been proposed by many researchers. Various research papers on association rule mining (ARM) are studied and analyzed first to understand the existing algorithms. Apriori algorithm is the basic ARM algorithm, but it requires so many database scans. In DIC algorithm, less amount of database scan is needed but complex data structure lattice is used. The main focus of this paper is to propose a new optimized algorithm (Friendly Algorithm) and compare its performance with the existing algorithms A data set is used to find out frequent itemsets and association rules with the help of existing and proposed (Friendly Algorithm) and it has been observed that the proposed algorithm also finds all the frequent itemsets and essential association rules from databases as compared to existing algorithms in less amount of database scan. In the proposed algorithm, an optimized data structure is used i.e. Graph and Adjacency Matrix. <p class="card-text"><strong>Keywords:</strong> <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=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20item%20set%20counting" title=" dynamic item set counting"> dynamic item set counting</a>, <a href="https://publications.waset.org/abstracts/search?q=FP-growth" title=" FP-growth"> FP-growth</a>, <a href="https://publications.waset.org/abstracts/search?q=friendly%20algorithm" title=" friendly algorithm"> friendly algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=graph" title=" graph"> graph</a> </p> <a href="https://publications.waset.org/abstracts/2437/an-optimized-association-rule-mining-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2437.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">420</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">4281</span> Development of Database for Risk Assessment Appling to Ballast Water Managements</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Eun-Chan%20Kim">Eun-Chan Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Jeong-Hwan%20Oh"> Jeong-Hwan Oh</a>, <a href="https://publications.waset.org/abstracts/search?q=Seung-Guk%20Lee"> Seung-Guk Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Billions of tones of ballast water including various aquatic organisms are being carried around the world by ships. When the ballast water is discharged into new environments, some aquatic organisms discharged with ballast water may become invasive and severely disrupt the native ecology. Thus, International Maritime Organization (IMO) adopted the Ballast Water Management Convention in 2004. Regulation A-4 of the convention states that a government in waters under their jurisdiction may grant exemptions to any requirements to ballast water management, but only when they are granted to a ship or ships on a voyage or voyages between specified ports or locations, or to a ship which operates exclusively between specified ports or locations. In order to grant exemptions, risk assessment should be conducted based on the guidelines for risk assessment developed by the IMO. For the risk assessment, it is essential to collect the relevant information and establish a database system. This paper studies the database system for ballast water risk assessment. This database consists of the shipping database, ballast water database, port environment database and species database. The shipping database has been established based on the data collected from the port management information system of Korea Government. For the ballast water database, ballast water discharge has only been estimated by the loading/unloading of the cargoes as the convention has not come into effect yet. The port environment database and species database are being established based on the reference documents, and existing and newly collected monitoring data. This database system has been approved to be a useful system, capable of appropriately analyzing the risk assessment in the all ports of Korea. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ballast%20water" title="ballast water">ballast water</a>, <a href="https://publications.waset.org/abstracts/search?q=IMO" title=" IMO"> IMO</a>, <a href="https://publications.waset.org/abstracts/search?q=risk%20assessment" title=" risk assessment"> risk assessment</a>, <a href="https://publications.waset.org/abstracts/search?q=shipping" title=" shipping"> shipping</a>, <a href="https://publications.waset.org/abstracts/search?q=environment" title=" environment"> environment</a>, <a href="https://publications.waset.org/abstracts/search?q=species" title=" species"> species</a> </p> <a href="https://publications.waset.org/abstracts/14757/development-of-database-for-risk-assessment-appling-to-ballast-water-managements" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14757.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">520</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">4280</span> Performance-Based Quality Evaluation of Database Conceptual Schemas</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Janusz%20Getta">Janusz Getta</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhaoxi%20Pan"> Zhaoxi Pan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Performance-based quality evaluation of database conceptual schemas is an important aspect of database design process. It is evident that different conceptual schemas provide different logical schemas and performance of user applications strongly depends on logical and physical database structures. This work presents the entire process of performance-based quality evaluation of conceptual schemas. First, we show format. Then, the paper proposes a new specification of object algebra for representation of conceptual level database applications. Transformation of conceptual schemas and expression of object algebra into implementation schema and implementation in a particular database system allows for precise estimation of the processing costs of database applications and as a consequence for precise evaluation of performance-based quality of conceptual schemas. Then we describe an experiment as a proof of concept for the evaluation procedure presented in the paper. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conceptual%20schema" title="conceptual schema">conceptual schema</a>, <a href="https://publications.waset.org/abstracts/search?q=implementation%20schema" title=" implementation schema"> implementation schema</a>, <a href="https://publications.waset.org/abstracts/search?q=logical%20schema" title=" logical schema"> logical schema</a>, <a href="https://publications.waset.org/abstracts/search?q=object%20algebra" title=" object algebra"> object algebra</a>, <a href="https://publications.waset.org/abstracts/search?q=performance%20evaluation" title=" performance evaluation"> performance evaluation</a>, <a href="https://publications.waset.org/abstracts/search?q=query%20processing" title=" query processing"> query processing</a> </p> <a href="https://publications.waset.org/abstracts/71218/performance-based-quality-evaluation-of-database-conceptual-schemas" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/71218.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">292</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">4279</span> Causal Relation Identification Using Convolutional Neural Networks and Knowledge Based Features</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tharini%20N.%20de%20Silva">Tharini N. de Silva</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiao%20Zhibo"> Xiao Zhibo</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhao%20Rui"> Zhao Rui</a>, <a href="https://publications.waset.org/abstracts/search?q=Mao%20Kezhi"> Mao Kezhi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Causal relation identification is a crucial task in information extraction and knowledge discovery. In this work, we present two approaches to causal relation identification. The first is a classification model trained on a set of knowledge-based features. The second is a deep learning based approach training a model using convolutional neural networks to classify causal relations. We experiment with several different convolutional neural networks (CNN) models based on previous work on relation extraction as well as our own research. Our models are able to identify both explicit and implicit causal relations as well as the direction of the causal relation. The results of our experiments show a higher accuracy than previously achieved for causal relation identification tasks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=causal%20realtion%20extraction" title="causal realtion extraction">causal realtion extraction</a>, <a href="https://publications.waset.org/abstracts/search?q=relation%20extracton" title=" relation extracton"> relation extracton</a>, <a href="https://publications.waset.org/abstracts/search?q=convolutional%20neural%20network" title=" convolutional neural network"> convolutional neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=text%20representation" title=" text representation"> text representation</a> </p> <a href="https://publications.waset.org/abstracts/61573/causal-relation-identification-using-convolutional-neural-networks-and-knowledge-based-features" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/61573.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">732</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">4278</span> Presentation of International Military Intervention Correlates (IMIC) Database</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Daniil%20Chernov">Daniil Chernov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the modern world, the number of conventional interstate wars is declining while the number of military interventions is rising. States no longer initiate conflicts by declaring war but actively intervene in existing military confrontations, often using a comparable number of coercive means. According to existing scholarly understanding, the decision to use force in international relations (in any form) is influenced by roughly the same set of factors: the dynamics of domestic political processes, national interests, international law, and ethical considerations. In the database on armed intervention to be presented in the report, the multifactor model of decision-making is developed. The database describes more than 200 different parameters for armed interventions between 1992 and 2022. The report will present the structure of the database, descriptive statistics, and its key advantages over other sources. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conflict%20resolution" title="conflict resolution">conflict resolution</a>, <a href="https://publications.waset.org/abstracts/search?q=international%20relations" title=" international relations"> international relations</a>, <a href="https://publications.waset.org/abstracts/search?q=military%20intervention" title=" military intervention"> military intervention</a>, <a href="https://publications.waset.org/abstracts/search?q=database" title=" database"> database</a> </p> <a href="https://publications.waset.org/abstracts/188881/presentation-of-international-military-intervention-correlates-imic-database" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/188881.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">34</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">4277</span> The Video Database for Teaching and Learning in Football Refereeing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Armenteros">M. Armenteros</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Dom%C3%ADnguez"> A. Domínguez</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Fern%C3%A1ndez"> M. Fernández</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20J.%20Ben%C3%ADtez"> A. J. Benítez</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The following paper describes the video database tool used by the Fédération Internationale de Football Association (FIFA) as part of the research project developed in collaboration with the Carlos III University of Madrid. The database project began in 2012, with the aim of creating an educational tool for the training of instructors, referees and assistant referees, and it has been used in all FUTURO III courses since 2013. The platform now contains 3,135 video clips of different match situations from FIFA competitions. It has 1,835 users (FIFA instructors, referees and assistant referees). In this work, the main features of the database are described, such as the use of a search tool and the creation of multimedia presentations and video quizzes. The database has been developed in MySQL, ActionScript, Ruby on Rails and HTML. This tool has been rated by users as "very good" in all courses, which prompt us to introduce it as an ideal tool for any other sport that requires the use of video analysis. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=assistants%20referees" title="assistants referees">assistants referees</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title=" cloud computing"> cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=e-learning" title=" e-learning"> e-learning</a>, <a href="https://publications.waset.org/abstracts/search?q=instructors" title=" instructors"> instructors</a>, <a href="https://publications.waset.org/abstracts/search?q=FIFA" title=" FIFA"> FIFA</a>, <a href="https://publications.waset.org/abstracts/search?q=referees" title=" referees"> referees</a>, <a href="https://publications.waset.org/abstracts/search?q=soccer" title=" soccer"> soccer</a>, <a href="https://publications.waset.org/abstracts/search?q=video%20database" title=" video database"> video database</a> </p> <a href="https://publications.waset.org/abstracts/49511/the-video-database-for-teaching-and-learning-in-football-refereeing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49511.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">439</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">4276</span> A Query Optimization Strategy for Autonomous Distributed Database Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dina%20K.%20Badawy">Dina K. Badawy</a>, <a href="https://publications.waset.org/abstracts/search?q=Dina%20M.%20Ibrahim"> Dina M. Ibrahim</a>, <a href="https://publications.waset.org/abstracts/search?q=Alsayed%20A.%20Sallam"> Alsayed A. Sallam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Distributed database is a collection of logically related databases that cooperate in a transparent manner. Query processing uses a communication network for transmitting data between sites. It refers to one of the challenges in the database world. The development of sophisticated query optimization technology is the reason for the commercial success of database systems, which complexity and cost increase with increasing number of relations in the query. Mariposa, query trading and query trading with processing task-trading strategies developed for autonomous distributed database systems, but they cause high optimization cost because of involvement of all nodes in generating an optimal plan. In this paper, we proposed a modification on the autonomous strategy K-QTPT that make the seller’s nodes with the lowest cost have gradually high priorities to reduce the optimization time. We implement our proposed strategy and present the results and analysis based on those results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=autonomous%20strategies" title="autonomous strategies">autonomous strategies</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20database%20systems" title=" distributed database systems"> distributed database systems</a>, <a href="https://publications.waset.org/abstracts/search?q=high%20priority" title=" high priority"> high priority</a>, <a href="https://publications.waset.org/abstracts/search?q=query%20optimization" title=" query optimization"> query optimization</a> </p> <a href="https://publications.waset.org/abstracts/81476/a-query-optimization-strategy-for-autonomous-distributed-database-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/81476.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">524</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">4275</span> A Comparative Study of GTC and PSP Algorithms for Mining Sequential Patterns Embedded in Database with Time Constraints</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Safa%20Adi">Safa Adi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper will consider the problem of sequential mining patterns embedded in a database by handling the time constraints as defined in the GSP algorithm (level wise algorithms). We will compare two previous approaches GTC and PSP, that resumes the general principles of GSP. Furthermore this paper will discuss PG-hybrid algorithm, that using PSP and GTC. The results show that PSP and GTC are more efficient than GSP. On the other hand, the GTC algorithm performs better than PSP. The PG-hybrid algorithm use PSP algorithm for the two first passes on the database, and GTC approach for the following scans. Experiments show that the hybrid approach is very efficient for short, frequent sequences. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=database" title="database">database</a>, <a href="https://publications.waset.org/abstracts/search?q=GTC%20algorithm" title=" GTC algorithm"> GTC algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=PSP%20algorithm" title=" PSP algorithm"> PSP algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20patterns" title=" sequential patterns"> sequential patterns</a>, <a href="https://publications.waset.org/abstracts/search?q=time%20constraints" title=" time constraints"> time constraints</a> </p> <a href="https://publications.waset.org/abstracts/97812/a-comparative-study-of-gtc-and-psp-algorithms-for-mining-sequential-patterns-embedded-in-database-with-time-constraints" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/97812.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">390</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">4274</span> Local Boundary Analysis for Generative Theory of Tonal Music: From the Aspect of Classic Music Melody Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Po-Chun%20Wang">Po-Chun Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Yan-Ru%20Lai"> Yan-Ru Lai</a>, <a href="https://publications.waset.org/abstracts/search?q=Sophia%20I.%20C.%20Lin"> Sophia I. C. Lin</a>, <a href="https://publications.waset.org/abstracts/search?q=Alvin%20W.%20Y.%20Su"> Alvin W. Y. Su</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Generative Theory of Tonal Music (GTTM) provides systematic approaches to recognizing local boundaries of music. The rules have been implemented in some automated melody segmentation algorithms. Besides, there are also deep learning methods with GTTM features applied to boundary detection tasks. However, these studies might face constraints such as a lack of or inconsistent label data. The GTTM database is currently the most widely used GTTM database, which includes manually labeled GTTM rules and local boundaries. Even so, we found some problems with these labels. They are sometimes discrepancies with GTTM rules. In addition, since it is labeled at different times by multiple musicians, they are not within the same scope in some cases. Therefore, in this paper, we examine this database with musicians from the aspect of classical music and relabel the scores. The relabeled database - GTTM Database v2.0 - will be released for academic research usage. Despite the experimental and statistical results showing that the relabeled database is more consistent, the improvement in boundary detection is not substantial. It seems that we need more clues than GTTM rules for boundary detection in the future. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dataset" title="dataset">dataset</a>, <a href="https://publications.waset.org/abstracts/search?q=GTTM" title=" GTTM"> GTTM</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20boundary" title=" local boundary"> local boundary</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20network" title=" neural network"> neural network</a> </p> <a href="https://publications.waset.org/abstracts/156472/local-boundary-analysis-for-generative-theory-of-tonal-music-from-the-aspect-of-classic-music-melody-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/156472.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">145</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">4273</span> Formalizing the Sense Relation of Hyponymy from Logical Point of View: A Study of Mathematical Linguistics in Farsi</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maryam%20Ramezankhani">Maryam Ramezankhani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The present research tries to study the possibility of formalizing the sense relation of hyponymy. It applied mathematical tools and also uses mathematical logic concepts especially those from propositional logic. In order to do so, firstly, it goes over the definitions of hyponymy presented in linguistic dictionaries and semantic textbooks. Then, it introduces a formal translation of the sense relation of hyponymy. Lastly, it examines the efficiency of the suggested formula by some examples of natural language. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=sense%20relations" title="sense relations">sense relations</a>, <a href="https://publications.waset.org/abstracts/search?q=hyponymy" title=" hyponymy"> hyponymy</a>, <a href="https://publications.waset.org/abstracts/search?q=formalizing" title=" formalizing"> formalizing</a>, <a href="https://publications.waset.org/abstracts/search?q=words%E2%80%99%20sense%20relation" title=" words’ sense relation"> words’ sense relation</a>, <a href="https://publications.waset.org/abstracts/search?q=formalizing%20sense%20relations" title=" formalizing sense relations"> formalizing sense relations</a> </p> <a href="https://publications.waset.org/abstracts/76340/formalizing-the-sense-relation-of-hyponymy-from-logical-point-of-view-a-study-of-mathematical-linguistics-in-farsi" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/76340.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">239</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">4272</span> Solving Definition and Relation Problems in English Navigation Terminology</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ay%C5%9Fe%20Yurdakul">Ayşe Yurdakul</a>, <a href="https://publications.waset.org/abstracts/search?q=Eckehard%20Schnieder"> Eckehard Schnieder</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Because of the growing multidisciplinarity and multilinguality, communication problems in different technical fields grows more and more. Therefore, each technical field has its own specific language, terminology which is characterised by the different definition of terms. In addition to definition problems, there are also relation problems between terms. Among these problems of relation, there are the synonymy, antonymy, hypernymy/hyponymy, ambiguity, risk of confusion, and translation problems etc. Thus, the terminology management system iglos of the Institute for Traffic Safety and Automation Engineering of the Technische Universität Braunschweig has the target to solve these problems by a methodological standardisation of term definitions with the aid of the iglos sign model and iglos relation types. The focus of this paper should be on solving definition and relation problems between terms in English navigation terminology. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=iglos" title="iglos">iglos</a>, <a href="https://publications.waset.org/abstracts/search?q=iglos%20sign%20model" title=" iglos sign model"> iglos sign model</a>, <a href="https://publications.waset.org/abstracts/search?q=methodological%20resolutions" title=" methodological resolutions"> methodological resolutions</a>, <a href="https://publications.waset.org/abstracts/search?q=navigation%20terminology" title=" navigation terminology"> navigation terminology</a>, <a href="https://publications.waset.org/abstracts/search?q=common%20language" title=" common language"> common language</a>, <a href="https://publications.waset.org/abstracts/search?q=technical%20language" title=" technical language"> technical language</a>, <a href="https://publications.waset.org/abstracts/search?q=positioning" title=" positioning"> positioning</a>, <a href="https://publications.waset.org/abstracts/search?q=definition%20problems" title=" definition problems"> definition problems</a>, <a href="https://publications.waset.org/abstracts/search?q=relation%20problems" title=" relation problems"> relation problems</a> </p> <a href="https://publications.waset.org/abstracts/3199/solving-definition-and-relation-problems-in-english-navigation-terminology" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3199.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">333</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">4271</span> Railway Accidents: Using the Global Railway Accident Database and Evaluation for Risk Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mathias%20Linden">Mathias Linden</a>, <a href="https://publications.waset.org/abstracts/search?q=Andr%C3%A9%20Schneider"> André Schneider</a>, <a href="https://publications.waset.org/abstracts/search?q=Harald%20F.%20O.%20von%20Korflesch"> Harald F. O. von Korflesch</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The risk of train accidents is an ongoing concern for railway organizations, governments, insurance companies and other depended sectors. Safety technologies are installed to reduce and to prevent potential damages of train accidents. Since the budgetary for the safety of railway organizations is limited, it is necessary not only to achieve a high availability and high safety standard but also to be cost effective. Therefore, an economic assessment of safety technologies is fundamental to create an accurate risk analysis. In order to conduct an economical assessment of a railway safety technology and a quantification of the costs of the accident causes, the Global Railway Accident Database & Evaluation (GRADE) has been developed. The aim of this paper is to describe the structure of this accident database and to show how it can be used for risk analyses. A number of risk analysis methods, such as the probabilistic safety assessment method (PSA), was used to demonstrate this accident database’s different possibilities of risk analysis. In conclusion, it can be noted that these analyses would not be as accurate without GRADE. The information gathered in the accident database was not available in this way before. Our findings are relevant for railway operators, safety technology suppliers, assurances, governments and other concerned railway organizations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=accident%20causes" title="accident causes">accident causes</a>, <a href="https://publications.waset.org/abstracts/search?q=accident%20costs" title=" accident costs"> accident costs</a>, <a href="https://publications.waset.org/abstracts/search?q=accident%20database" title=" accident database"> accident database</a>, <a href="https://publications.waset.org/abstracts/search?q=global%20railway%20accident%20database%20%26%20evaluation" title=" global railway accident database & evaluation"> global railway accident database & evaluation</a>, <a href="https://publications.waset.org/abstracts/search?q=GRADE" title=" GRADE"> GRADE</a>, <a href="https://publications.waset.org/abstracts/search?q=probabilistic%20safety%20assessment" title=" probabilistic safety assessment"> probabilistic safety assessment</a>, <a href="https://publications.waset.org/abstracts/search?q=PSA" title=" PSA"> PSA</a>, <a href="https://publications.waset.org/abstracts/search?q=railway%20accidents" title=" railway accidents"> railway accidents</a>, <a href="https://publications.waset.org/abstracts/search?q=risk%20analysis" title=" risk analysis"> risk analysis</a> </p> <a href="https://publications.waset.org/abstracts/68572/railway-accidents-using-the-global-railway-accident-database-and-evaluation-for-risk-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/68572.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">359</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">4270</span> Relation Between Traffic Mix and Traffic Accidents in a Mixed Industrial Urban Area</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Michelle%20Eliane%20Hern%C3%A1ndez-Garc%C3%ADa">Michelle Eliane Hernández-García</a>, <a href="https://publications.waset.org/abstracts/search?q=Ang%C3%A9lica%20Lozano"> Angélica Lozano</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The traffic accidents study usually contemplates the relation between factors such as the type of vehicle, its operation, and the road infrastructure. Traffic accidents can be explained by different factors, which have a greater or lower relevance. Two zones are studied, a mixed industrial zone and the extended zone of it. The first zone has mainly residential (57%), and industrial (23%) land uses. Trucks are mainly on the roads where industries are located. Four sensors give information about traffic and speed on the main roads. The extended zone (which includes the first zone) has mainly residential (47%) and mixed residential (43%) land use, and just 3% of industrial use. The traffic mix is composed mainly of non-trucks. 39 traffic and speed sensors are located on main roads. The traffic mix in a mixed land use zone, could be related to traffic accidents. To understand this relation, it is required to identify the elements of the traffic mix which are linked to traffic accidents. Models that attempt to explain what factors are related to traffic accidents have faced multiple methodological problems for obtaining robust databases. Poisson regression models are used to explain the accidents. The objective of the Poisson analysis is to estimate a vector to provide an estimate of the natural logarithm of the mean number of accidents per period; this estimate is achieved by standard maximum likelihood procedures. For the estimation of the relation between traffic accidents and the traffic mix, the database is integrated of eight variables, with 17,520 observations and six vectors. In the model, the dependent variable is the occurrence or non-occurrence of accidents, and the vectors that seek to explain it, correspond to the vehicle classes: C1, C2, C3, C4, C5, and C6, respectively, standing for car, microbus, and van, bus, unitary trucks (2 to 6 axles), articulated trucks (3 to 6 axles) and bi-articulated trucks (5 to 9 axles); in addition, there is a vector for the average speed of the traffic mix. A Poisson model is applied, using a logarithmic link function and a Poisson family. For the first zone, the Poisson model shows a positive relation among traffic accidents and C6, average speed, C3, C2, and C1 (in a decreasing order). The analysis of the coefficient shows a high relation with bi-articulated truck and bus (C6 and the C3), indicating an important participation of freight trucks. For the expanded zone, the Poisson model shows a positive relation among traffic accidents and speed average, biarticulated truck (C6), and microbus and vans (C2). The coefficients obtained in both Poisson models shows a higher relation among freight trucks and traffic accidents in the first industrial zone than in the expanded zone. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=freight%20transport" title="freight transport">freight transport</a>, <a href="https://publications.waset.org/abstracts/search?q=industrial%20zone" title=" industrial zone"> industrial zone</a>, <a href="https://publications.waset.org/abstracts/search?q=traffic%20accidents" title=" traffic accidents"> traffic accidents</a>, <a href="https://publications.waset.org/abstracts/search?q=traffic%20mix" title=" traffic mix"> traffic mix</a>, <a href="https://publications.waset.org/abstracts/search?q=trucks" title=" trucks"> trucks</a> </p> <a href="https://publications.waset.org/abstracts/147496/relation-between-traffic-mix-and-traffic-accidents-in-a-mixed-industrial-urban-area" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/147496.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">129</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">4269</span> Algorithms used in Spatial Data Mining GIS</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vahid%20Bairami%20Rad">Vahid Bairami Rad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Extracting knowledge from spatial data like GIS data is important to reduce the data and extract information. Therefore, the development of new techniques and tools that support the human in transforming data into useful knowledge has been the focus of the relatively new and interdisciplinary research area ‘knowledge discovery in databases’. Thus, we introduce a set of database primitives or basic operations for spatial data mining which are sufficient to express most of the spatial data mining algorithms from the literature. This approach has several advantages. Similar to the relational standard language SQL, the use of standard primitives will speed-up the development of new data mining algorithms and will also make them more portable. We introduced a database-oriented framework for spatial data mining which is based on the concepts of neighborhood graphs and paths. A small set of basic operations on these graphs and paths were defined as database primitives for spatial data mining. Furthermore, techniques to efficiently support the database primitives by a commercial DBMS were presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=spatial%20data%20base" title="spatial data base">spatial data base</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20discovery%20database" title=" knowledge discovery database"> knowledge discovery database</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=spatial%20relationship" title=" spatial relationship"> spatial relationship</a>, <a href="https://publications.waset.org/abstracts/search?q=predictive%20data%20mining" title=" predictive data mining"> predictive data mining</a> </p> <a href="https://publications.waset.org/abstracts/29004/algorithms-used-in-spatial-data-mining-gis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29004.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">460</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">4268</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">4267</span> Exergy Losses Relation with Driving Forces in Heat Transfer Process</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Ali%20Ashrafizadeh">S. Ali Ashrafizadeh</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Amidpour"> M. Amidpour</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Hedayat"> N. Hedayat </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Driving forces along with transfer coefficient affect on heat transfer rate, on the other hand, with regard to the relation of these forces with irriversibilities they are effective on exergy losses. Therefore, the driving forces can be used as a relation between heat transfer rate, transfer coefficients and exergy losses. In this paper, first, the relation of the exergetic efficiency and resistant forces is obtained, next the relation between exergy efficiency, relative driving force, heat transfer rate and heat resistances is considered. In all cases, results are argued graphically. Finally, a case study inspected by obtained results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=heat%20transfer" title="heat transfer">heat transfer</a>, <a href="https://publications.waset.org/abstracts/search?q=exergy%20losses" title=" exergy losses"> exergy losses</a>, <a href="https://publications.waset.org/abstracts/search?q=exergetic%20efficiency" title=" exergetic efficiency"> exergetic efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=driving%20forces" title=" driving forces"> driving forces</a> </p> <a href="https://publications.waset.org/abstracts/30134/exergy-losses-relation-with-driving-forces-in-heat-transfer-process" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30134.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">604</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">4266</span> Developing a Rational Database Management System (RDBMS) Supporting Product Life Cycle Appications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yusri%20Yusof">Yusri Yusof</a>, <a href="https://publications.waset.org/abstracts/search?q=Chen%20Wong%20Keong"> Chen Wong Keong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the implementation details of a Relational Database Management System of a STEP-technology product model repository. It is able support the implementation of any EXPRESS language schema, although it has been primarily implemented to support mechanical product life cycle applications. This database support the input of STEP part 21 file format from CAD in geometrical and topological data format and support a range of queries for mechanical product life cycle applications. This proposed relational database management system uses entity-to-table method (R1) rather than type-to-table method (R4). The two mapping methods have their own strengths and drawbacks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=RDBMS" title="RDBMS">RDBMS</a>, <a href="https://publications.waset.org/abstracts/search?q=CAD" title=" CAD"> CAD</a>, <a href="https://publications.waset.org/abstracts/search?q=ISO%2010303" title=" ISO 10303"> ISO 10303</a>, <a href="https://publications.waset.org/abstracts/search?q=part-21%20file" title=" part-21 file"> part-21 file</a> </p> <a href="https://publications.waset.org/abstracts/45421/developing-a-rational-database-management-system-rdbms-supporting-product-life-cycle-appications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45421.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">536</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">4265</span> Content Based Face Sketch Images Retrieval in WHT, DCT, and DWT Transform Domain</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=W.%20S.%20Besbas">W. S. Besbas</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20A.%20Artemi"> M. A. Artemi</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20M.%20Salman"> R. M. Salman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Content based face sketch retrieval can be used to find images of criminals from their sketches for 'Crime Prevention'. This paper investigates the problem of CBIR of face sketch images in transform domain. Face sketch images that are similar to the query image are retrieved from the face sketch database. Features of the face sketch image are extracted in the spectrum domain of a selected transforms. These transforms are Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT), and Walsh Hadamard Transform (WHT). For the performance analyses of features selection methods three face images databases are used. These are 'Sheffield face database', 'Olivetti Research Laboratory (ORL) face database', and 'Indian face database'. The City block distance measure is used to evaluate the performance of the retrieval process. The investigation concludes that, the retrieval rate is database dependent. But in general, the DCT is the best. On the other hand, the WHT is the best with respect to the speed of retrieving images. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Content%20Based%20Image%20Retrieval%20%28CBIR%29" title="Content Based Image Retrieval (CBIR)">Content Based Image Retrieval (CBIR)</a>, <a href="https://publications.waset.org/abstracts/search?q=face%20sketch%20image%20retrieval" title=" face sketch image retrieval"> face sketch image retrieval</a>, <a href="https://publications.waset.org/abstracts/search?q=features%20selection%20for%20CBIR" title=" features selection for CBIR"> features selection for CBIR</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20retrieval%20in%20transform%20domain" title=" image retrieval in transform domain"> image retrieval in transform domain</a> </p> <a href="https://publications.waset.org/abstracts/8251/content-based-face-sketch-images-retrieval-in-wht-dct-and-dwt-transform-domain" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8251.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">493</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">4264</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">4263</span> Linguistic Analysis of the Concept ‘Relation’ in Russian and English Languages</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nadezhda%20Obvintceva">Nadezhda Obvintceva</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The article gives the analysis of the concept ‘relation’ from the point of view of its realization in Russian and English languages on the basis of dictionaries articles. The analysis reveals the main difference of representation of this concept in both languages. It is the number of lexemes that express its general meanings. At the end of the article the author gives an explanation of possible causes of the difference and touches upon the issue about analytical phenomena in the vocabulary. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=concept" title="concept">concept</a>, <a href="https://publications.waset.org/abstracts/search?q=comparison" title=" comparison"> comparison</a>, <a href="https://publications.waset.org/abstracts/search?q=lexeme" title=" lexeme"> lexeme</a>, <a href="https://publications.waset.org/abstracts/search?q=meaning" title=" meaning"> meaning</a>, <a href="https://publications.waset.org/abstracts/search?q=relation" title=" relation"> relation</a>, <a href="https://publications.waset.org/abstracts/search?q=semantics" title=" semantics"> semantics</a> </p> <a href="https://publications.waset.org/abstracts/13604/linguistic-analysis-of-the-concept-relation-in-russian-and-english-languages" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13604.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">498</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=relation%20database&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=relation%20database&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=relation%20database&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=relation%20database&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=relation%20database&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=relation%20database&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=relation%20database&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=relation%20database&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=relation%20database&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=relation%20database&page=143">143</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=relation%20database&page=144">144</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=relation%20database&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>