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: Graph</title> <meta name="description" content="Search results for: Graph"> <meta name="keywords" content="Graph"> <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="Graph" 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="Graph"> <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> 458</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: Graph</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">278</span> Real-Time Network Anomaly Detection Systems Based on Machine-Learning Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zahra%20Ramezanpanah">Zahra Ramezanpanah</a>, <a href="https://publications.waset.org/abstracts/search?q=Joachim%20Carvallo"> Joachim Carvallo</a>, <a href="https://publications.waset.org/abstracts/search?q=Aurelien%20Rodriguez"> Aurelien Rodriguez</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper aims to detect anomalies in streaming data using machine learning algorithms. In this regard, we designed two separate pipelines and evaluated the effectiveness of each separately. The first pipeline, based on supervised machine learning methods, consists of two phases. In the first phase, we trained several supervised models using the UNSW-NB15 data-set. We measured the efficiency of each using different performance metrics and selected the best model for the second phase. At the beginning of the second phase, we first, using Argus Server, sniffed a local area network. Several types of attacks were simulated and then sent the sniffed data to a running algorithm at short intervals. This algorithm can display the results of each packet of received data in real-time using the trained model. The second pipeline presented in this paper is based on unsupervised algorithms, in which a Temporal Graph Network (TGN) is used to monitor a local network. The TGN is trained to predict the probability of future states of the network based on its past behavior. Our contribution in this section is introducing an indicator to identify anomalies from these predicted probabilities. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=temporal%20graph%20network" title="temporal graph network">temporal graph network</a>, <a href="https://publications.waset.org/abstracts/search?q=anomaly%20detection" title=" anomaly detection"> anomaly detection</a>, <a href="https://publications.waset.org/abstracts/search?q=cyber%20security" title=" cyber security"> cyber security</a>, <a href="https://publications.waset.org/abstracts/search?q=IDS" title=" IDS"> IDS</a> </p> <a href="https://publications.waset.org/abstracts/150847/real-time-network-anomaly-detection-systems-based-on-machine-learning-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/150847.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">103</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">277</span> Row Detection and Graph-Based Localization in Tree Nurseries Using a 3D LiDAR</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ionut%20Vintu">Ionut Vintu</a>, <a href="https://publications.waset.org/abstracts/search?q=Stefan%20Laible"> Stefan Laible</a>, <a href="https://publications.waset.org/abstracts/search?q=Ruth%20Schulz"> Ruth Schulz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Agricultural robotics has been developing steadily over recent years, with the goal of reducing and even eliminating pesticides used in crops and to increase productivity by taking over human labor. The majority of crops are arranged in rows. The first step towards autonomous robots, capable of driving in fields and performing crop-handling tasks, is for robots to robustly detect the rows of plants. Recent work done towards autonomous driving between plant rows offers big robotic platforms equipped with various expensive sensors as a solution to this problem. These platforms need to be driven over the rows of plants. This approach lacks flexibility and scalability when it comes to the height of plants or distance between rows. This paper proposes instead an algorithm that makes use of cheaper sensors and has a higher variability. The main application is in tree nurseries. Here, plant height can range from a few centimeters to a few meters. Moreover, trees are often removed, leading to gaps within the plant rows. The core idea is to combine row detection algorithms with graph-based localization methods as they are used in SLAM. Nodes in the graph represent the estimated pose of the robot, and the edges embed constraints between these poses or between the robot and certain landmarks. This setup aims to improve individual plant detection and deal with exception handling, like row gaps, which are falsely detected as an end of rows. Four methods were developed for detecting row structures in the fields, all using a point cloud acquired with a 3D LiDAR as an input. Comparing the field coverage and number of damaged plants, the method that uses a local map around the robot proved to perform the best, with 68% covered rows and 25% damaged plants. This method is further used and combined with a graph-based localization algorithm, which uses the local map features to estimate the robot’s position inside the greater field. Testing the upgraded algorithm in a variety of simulated fields shows that the additional information obtained from localization provides a boost in performance over methods that rely purely on perception to navigate. The final algorithm achieved a row coverage of 80% and an accuracy of 27% damaged plants. Future work would focus on achieving a perfect score of 100% covered rows and 0% damaged plants. The main challenges that the algorithm needs to overcome are fields where the height of the plants is too small for the plants to be detected and fields where it is hard to distinguish between individual plants when they are overlapping. The method was also tested on a real robot in a small field with artificial plants. The tests were performed using a small robot platform equipped with wheel encoders, an IMU and an FX10 3D LiDAR. Over ten runs, the system achieved 100% coverage and 0% damaged plants. The framework built within the scope of this work can be further used to integrate data from additional sensors, with the goal of achieving even better results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=3D%20LiDAR" title="3D LiDAR">3D LiDAR</a>, <a href="https://publications.waset.org/abstracts/search?q=agricultural%20robots" title=" agricultural robots"> agricultural robots</a>, <a href="https://publications.waset.org/abstracts/search?q=graph-based%20localization" title=" graph-based localization"> graph-based localization</a>, <a href="https://publications.waset.org/abstracts/search?q=row%20detection" title=" row detection"> row detection</a> </p> <a href="https://publications.waset.org/abstracts/98467/row-detection-and-graph-based-localization-in-tree-nurseries-using-a-3d-lidar" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/98467.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">139</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">276</span> A Study on the Computation of Gourava Indices for Poly-L Lysine Dendrimer and Its Biomedical Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Helen">M. Helen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Chemical graph serves as a convenient model for any real or abstract chemical system. Dendrimers are novel three dimensional hyper branched globular nanopolymeric architectures. Drug delivery scientists are especially enthusiastic about possible utility of dendrimers as drug delivery tool. Dendrimers like poly L lysine (PLL), poly-propylene imine (PPI) and poly-amidoamine (PAMAM), etc., are used as gene carrier in drug delivery system because of their chemical characteristics. These characteristics of chemical compounds are analysed using topological indices (invariants under graph isomorphism) such as Wiener index, Zagreb index, etc., Prof. V. R. Kulli motivated by the application of Zagreb indices in finding the total π energy and derived Gourava indices which is an improved version over Zagreb indices. In this paper, we study the structure of PLL-Dendrimer that has the following applications: reduction in toxicity, colon delivery, and topical delivery. Also, we determine first and second Gourava indices, first and second hyper Gourava indices, product and sum connectivity Gourava indices for PLL-Dendrimer. Gourava Indices have found applications in Quantitative Structure-Property Relationship (QSPR)/ Quantitative Structure-Activity Relationship (QSAR) studies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=connectivity%20Gourava%20indices" title="connectivity Gourava indices">connectivity Gourava indices</a>, <a href="https://publications.waset.org/abstracts/search?q=dendrimer" title=" dendrimer"> dendrimer</a>, <a href="https://publications.waset.org/abstracts/search?q=Gourava%20indices" title=" Gourava indices"> Gourava indices</a>, <a href="https://publications.waset.org/abstracts/search?q=hyper%20GouravaG%20indices" title=" hyper GouravaG indices"> hyper GouravaG indices</a> </p> <a href="https://publications.waset.org/abstracts/110831/a-study-on-the-computation-of-gourava-indices-for-poly-l-lysine-dendrimer-and-its-biomedical-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/110831.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">138</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">275</span> Toward an Understanding of the Neurofunctional Dissociation between Animal and Tool Concepts: A Graph Theoretical Analysis </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Skiker%20Kaoutar">Skiker Kaoutar</a>, <a href="https://publications.waset.org/abstracts/search?q=Mounir%20Maouene"> Mounir Maouene</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Neuroimaging studies have shown that animal and tool concepts rely on distinct networks of brain areas. Animal concepts depend predominantly on temporal areas while tool concepts rely on fronto-temporo-parietal areas. However, the origin of this neurofunctional distinction for processing animal and tool concepts remains still unclear. Here, we address this question from a network perspective suggesting that the neural distinction between animals and tools might reflect the differences in their structural semantic networks. We build semantic networks for animal and tool concepts derived from Mc Rae and colleagues’s behavioral study conducted on a large number of participants. These two networks are thus analyzed through a large number of graph theoretical measures for small-worldness: centrality, clustering coefficient, average shortest path length, as well as resistance to random and targeted attacks. The results indicate that both animal and tool networks have small-world properties. More importantly, the animal network is more vulnerable to targeted attacks compared to the tool network a result that correlates with brain lesions studies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=animals" title="animals">animals</a>, <a href="https://publications.waset.org/abstracts/search?q=tools" title=" tools"> tools</a>, <a href="https://publications.waset.org/abstracts/search?q=network" title=" network"> network</a>, <a href="https://publications.waset.org/abstracts/search?q=semantics" title=" semantics"> semantics</a>, <a href="https://publications.waset.org/abstracts/search?q=small-world" title=" small-world"> small-world</a>, <a href="https://publications.waset.org/abstracts/search?q=resilience%20to%20damage" title=" resilience to damage "> resilience to damage </a> </p> <a href="https://publications.waset.org/abstracts/17524/toward-an-understanding-of-the-neurofunctional-dissociation-between-animal-and-tool-concepts-a-graph-theoretical-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17524.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">547</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">274</span> Accessibility and Visibility through Space Syntax Analysis of the Linga Raj Temple in Odisha, India</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Pramanik">S. Pramanik</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Since the early ages, the Hindu temples have been interpreted through various <em>Vedic</em> philosophies. These temples are visited by pilgrims which demonstrate the rituals and religious belief of communities, reflecting a variety of actions and behaviors. <em>Darsana</em><em>—</em> a direct seeing, is a part of the pilgrimage activity. During the process of <em>Darsana, </em>a devotee is prepared for entry in the temple to realize the cognizing Truth culminating in visualizing the idol of God, placed at the <em>Garbhagriha</em> (sanctum sanctorum). For this, the pilgrim must pass through a sequential arrangement of spaces. During the process of progress, the pilgrims visualize the spaces differently from various points of views. The viewpoints create a variety of spatial patterns in the minds of pilgrims coherent to the Hindu philosophies. The space organization and its order are perceived by various techniques of spatial analysis. A temple, as examples of <em>Kalinga</em> stylistic variations, has been chosen for the study. This paper intends to demonstrate some visual patterns generated during the process of <em>Darsana</em> (visibility) and its accessibility by Point Isovist Studies and Visibility Graph Analysis from the entrance (<em>Simha Dwara) </em>to The Sanctum sanctorum<em> (Garbhagriha</em>). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hindu%20temple%20architecture" title="Hindu temple architecture">Hindu temple architecture</a>, <a href="https://publications.waset.org/abstracts/search?q=point%20isovist" title=" point isovist"> point isovist</a>, <a href="https://publications.waset.org/abstracts/search?q=space%20syntax%20analysis" title=" space syntax analysis"> space syntax analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=visibility%20graph%20analysis" title=" visibility graph analysis"> visibility graph analysis</a> </p> <a href="https://publications.waset.org/abstracts/112407/accessibility-and-visibility-through-space-syntax-analysis-of-the-linga-raj-temple-in-odisha-india" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/112407.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">120</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">273</span> Optimizing the Location of Parking Areas Adapted for Dangerous Goods in the European Road Transport Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mar%C3%ADa%20Dolores%20Caro">María Dolores Caro</a>, <a href="https://publications.waset.org/abstracts/search?q=Eugenio%20M.%20Fedriani"> Eugenio M. Fedriani</a>, <a href="https://publications.waset.org/abstracts/search?q=%C3%81ngel%20F.%20Tenorio"> Ángel F. Tenorio</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The transportation of dangerous goods by lorries throughout Europe must be done by using the roads conforming the European Road Transport Network. In this network, there are several parking areas where lorry drivers can park to rest according to the regulations. According to the "European Agreement concerning the International Carriage of Dangerous Goods by Road", parking areas where lorries transporting dangerous goods can park to rest, must follow several security stipulations to keep safe the rest of road users. At this respect, these lorries must be parked in adapted areas with strict and permanent surveillance measures. Moreover, drivers must satisfy several restrictions about resting and driving time. Under these facts, one may expect that there exist enough parking areas for the transport of this type of goods in order to obey the regulations prescribed by the European Union and its member countries. However, the already-existing parking areas are not sufficient to cover all the stops required by drivers transporting dangerous goods. Our main goal is, starting from the already-existing parking areas and the loading-and-unloading location, to provide an optimal answer to the following question: how many additional parking areas must be built and where must they be located to assure that lorry drivers can transport dangerous goods following all the stipulations about security and safety for their stops? The sense of the word “optimal” is due to the fact that we give a global solution for the location of parking areas throughout the whole European Road Transport Network, adjusting the number of additional areas to be as lower as possible. To do so, we have modeled the problem using graph theory since we are working with a road network. As nodes, we have considered the locations of each already-existing parking area, each loading-and-unloading area each road bifurcation. Each road connecting two nodes is considered as an edge in the graph whose weight corresponds to the distance between both nodes in the edge. By applying a new efficient algorithm, we have found the additional nodes for the network representing the new parking areas adapted for dangerous goods, under the fact that the distance between two parking areas must be less than or equal to 400 km. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=trans-european%20transport%20network" title="trans-european transport network">trans-european transport network</a>, <a href="https://publications.waset.org/abstracts/search?q=dangerous%20goods" title=" dangerous goods"> dangerous goods</a>, <a href="https://publications.waset.org/abstracts/search?q=parking%20areas" title=" parking areas"> parking areas</a>, <a href="https://publications.waset.org/abstracts/search?q=graph-based%20modeling" title=" graph-based modeling"> graph-based modeling</a> </p> <a href="https://publications.waset.org/abstracts/29859/optimizing-the-location-of-parking-areas-adapted-for-dangerous-goods-in-the-european-road-transport-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29859.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">280</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">272</span> Optimization of Feeder Bus Routes at Urban Rail Transit Stations Based on Link Growth Probability</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yu%20Song">Yu Song</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuefei%20Jin"> Yuefei Jin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Urban public transportation can be integrated when there is an efficient connection between urban rail lines, however, there are currently no effective or quick solutions being investigated for this connection. This paper analyzes the space-time distribution and travel demand of passenger connection travel based on taxi track data and data from the road network, excavates potential bus connection stations based on potential connection demand data, and introduces the link growth probability model in the complex network to solve the basic connection bus lines in order to ascertain the direction of the bus lines that are the most connected given the demand characteristics. Then, a tree view exhaustive approach based on constraints is suggested based on graph theory, which can hasten the convergence of findings while doing chain calculations. This study uses WEI QU NAN Station, the Xi'an Metro Line 2 terminal station in Shaanxi Province, as an illustration, to evaluate the model's and the solution method's efficacy. According to the findings, 153 prospective stations have been dug up in total, the feeder bus network for the entire line has been laid out, and the best route adjustment strategy has been found. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=feeder%20bus" title="feeder bus">feeder bus</a>, <a href="https://publications.waset.org/abstracts/search?q=route%20optimization" title=" route optimization"> route optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=link%20growth%20probability" title=" link growth probability"> link growth probability</a>, <a href="https://publications.waset.org/abstracts/search?q=the%20graph%20theory" title=" the graph theory"> the graph theory</a> </p> <a href="https://publications.waset.org/abstracts/163356/optimization-of-feeder-bus-routes-at-urban-rail-transit-stations-based-on-link-growth-probability" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/163356.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">77</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">271</span> Quantifying Multivariate Spatiotemporal Dynamics of Malaria Risk Using Graph-Based Optimization in Southern Ethiopia</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yonas%20Shuke%20Kitawa">Yonas Shuke Kitawa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Background: Although malaria incidence has substantially fallen sharply over the past few years, the rate of decline varies by district, time, and malaria type. Despite this turn-down, malaria remains a major public health threat in various districts of Ethiopia. Consequently, the present study is aimed at developing a predictive model that helps to identify the spatio-temporal variation in malaria risk by multiple plasmodium species. Methods: We propose a multivariate spatio-temporal Bayesian model to obtain a more coherent picture of the temporally varying spatial variation in disease risk. The spatial autocorrelation in such a data set is typically modeled by a set of random effects that assign a conditional autoregressive prior distribution. However, the autocorrelation considered in such cases depends on a binary neighborhood matrix specified through the border-sharing rule. Over here, we propose a graph-based optimization algorithm for estimating the neighborhood matrix that merely represents the spatial correlation by exploring the areal units as the vertices of a graph and the neighbor relations as the series of edges. Furthermore, we used aggregated malaria count in southern Ethiopia from August 2013 to May 2019. Results: We recognized that precipitation, temperature, and humidity are positively associated with the malaria threat in the area. On the other hand, enhanced vegetation index, nighttime light (NTL), and distance from coastal areas are negatively associated. Moreover, nonlinear relationships were observed between malaria incidence and precipitation, temperature, and NTL. Additionally, lagged effects of temperature and humidity have a significant effect on malaria risk by either species. More elevated risk of P. falciparum was observed following the rainy season, and unstable transmission of P. vivax was observed in the area. Finally, P. vivax risks are less sensitive to environmental factors than those of P. falciparum. Conclusion: The improved inference was gained by employing the proposed approach in comparison to the commonly used border-sharing rule. Additionally, different covariates are identified, including delayed effects, and elevated risks of either of the cases were observed in districts found in the central and western regions. As malaria transmission operates in a spatially continuous manner, a spatially continuous model should be employed when it is computationally feasible. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=disease%20mapping" title="disease mapping">disease mapping</a>, <a href="https://publications.waset.org/abstracts/search?q=MSTCAR" title=" MSTCAR"> MSTCAR</a>, <a href="https://publications.waset.org/abstracts/search?q=graph-based%20optimization%20algorithm" title=" graph-based optimization algorithm"> graph-based optimization algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20falciparum" title=" P. falciparum"> P. falciparum</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20vivax" title=" P. vivax"> P. vivax</a>, <a href="https://publications.waset.org/abstracts/search?q=waiting%20matrix" title=" waiting matrix"> waiting matrix</a> </p> <a href="https://publications.waset.org/abstracts/175859/quantifying-multivariate-spatiotemporal-dynamics-of-malaria-risk-using-graph-based-optimization-in-southern-ethiopia" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/175859.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">77</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">270</span> Visualizing the Commercial Activity of a City by Analyzing the Data Information in Layers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Taras%20Agryzkov">Taras Agryzkov</a>, <a href="https://publications.waset.org/abstracts/search?q=Jose%20L.%20Oliver"> Jose L. Oliver</a>, <a href="https://publications.waset.org/abstracts/search?q=Leandro%20Tortosa"> Leandro Tortosa</a>, <a href="https://publications.waset.org/abstracts/search?q=Jose%20Vicent"> Jose Vicent</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper aims to demonstrate how network models can be used to understand and to deal with some aspects of urban complexity. As it is well known, the Theory of Architecture and Urbanism has been using for decades’ intellectual tools based on the ‘sciences of complexity’ as a strategy to propose theoretical approaches about cities and about architecture. In this sense, it is possible to find a vast literature in which for instance network theory is used as an instrument to understand very diverse questions about cities: from their commercial activity to their heritage condition. The contribution of this research consists in adding one step of complexity to this process: instead of working with one single primal graph as it is usually done, we will show how new network models arise from the consideration of two different primal graphs interacting in two layers. When we model an urban network through a mathematical structure like a graph, the city is usually represented by a set of nodes and edges that reproduce its topology, with the data generated or extracted from the city embedded in it. All this information is normally displayed in a single layer. Here, we propose to separate the information in two layers so that we can evaluate the interaction between them. Besides, both layers may be composed of structures that do not have to coincide: from this bi-layer system, groups of interactions emerge, suggesting reflections and in consequence, possible actions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graphs" title="graphs">graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematics" title=" mathematics"> mathematics</a>, <a href="https://publications.waset.org/abstracts/search?q=networks" title=" networks"> networks</a>, <a href="https://publications.waset.org/abstracts/search?q=urban%20studies" title=" urban studies"> urban studies</a> </p> <a href="https://publications.waset.org/abstracts/97085/visualizing-the-commercial-activity-of-a-city-by-analyzing-the-data-information-in-layers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/97085.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">180</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">269</span> Parameter Estimation for Contact Tracing in Graph-Based Models</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Augustine%20Okolie">Augustine Okolie</a>, <a href="https://publications.waset.org/abstracts/search?q=Johannes%20M%C3%BCller"> Johannes Müller</a>, <a href="https://publications.waset.org/abstracts/search?q=Mirjam%20Kretzchmar"> Mirjam Kretzchmar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We adopt a maximum-likelihood framework to estimate parameters of a stochastic susceptible-infected-recovered (SIR) model with contact tracing on a rooted random tree. Given the number of detectees per index case, our estimator allows to determine the degree distribution of the random tree as well as the tracing probability. Since we do not discover all infectees via contact tracing, this estimation is non-trivial. To keep things simple and stable, we develop an approximation suited for realistic situations (contract tracing probability small, or the probability for the detection of index cases small). In this approximation, the only epidemiological parameter entering the estimator is the basic reproduction number R0. The estimator is tested in a simulation study and applied to covid-19 contact tracing data from India. The simulation study underlines the efficiency of the method. For the empirical covid-19 data, we are able to compare different degree distributions and perform a sensitivity analysis. We find that particularly a power-law and a negative binomial degree distribution meet the data well and that the tracing probability is rather large. The sensitivity analysis shows no strong dependency on the reproduction number. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=stochastic%20SIR%20model%20on%20graph" title="stochastic SIR model on graph">stochastic SIR model on graph</a>, <a href="https://publications.waset.org/abstracts/search?q=contact%20tracing" title=" contact tracing"> contact tracing</a>, <a href="https://publications.waset.org/abstracts/search?q=branching%20process" title=" branching process"> branching process</a>, <a href="https://publications.waset.org/abstracts/search?q=parameter%20inference" title=" parameter inference"> parameter inference</a> </p> <a href="https://publications.waset.org/abstracts/167983/parameter-estimation-for-contact-tracing-in-graph-based-models" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/167983.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">77</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">268</span> Language Development and Growing Spanning Trees in Children Semantic Network </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Somayeh%20Sadat%20Hashemi%20Kamangar">Somayeh Sadat Hashemi Kamangar</a>, <a href="https://publications.waset.org/abstracts/search?q=Fatemeh%20Bakouie"> Fatemeh Bakouie</a>, <a href="https://publications.waset.org/abstracts/search?q=Shahriar%20Gharibzadeh"> Shahriar Gharibzadeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, we target to exploit Maximum Spanning Trees (MST) of children's semantic networks to investigate their language development. To do so, we examine the graph-theoretic properties of word-embedding networks. The networks are made of words children learn prior to the age of 30 months as the nodes and the links which are built from the cosine vector similarity of words normatively acquired by children prior to two and a half years of age. These networks are weighted graphs and the strength of each link is determined by the numerical similarities of the two words (nodes) on the sides of the link. To avoid changing the weighted networks to the binaries by setting a threshold, constructing MSTs might present a solution. MST is a unique sub-graph that connects all the nodes in such a way that the sum of all the link weights is maximized without forming cycles. MSTs as the backbone of the semantic networks are suitable to examine developmental changes in semantic network topology in children. From these trees, several parameters were calculated to characterize the developmental change in network organization. We showed that MSTs provides an elegant method sensitive to capture subtle developmental changes in semantic network organization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=maximum%20spanning%20trees" title="maximum spanning trees">maximum spanning trees</a>, <a href="https://publications.waset.org/abstracts/search?q=word-embedding" title=" word-embedding"> word-embedding</a>, <a href="https://publications.waset.org/abstracts/search?q=semantic%20networks" title=" semantic networks"> semantic networks</a>, <a href="https://publications.waset.org/abstracts/search?q=language%20development" title=" language development"> language development</a> </p> <a href="https://publications.waset.org/abstracts/114481/language-development-and-growing-spanning-trees-in-children-semantic-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/114481.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">267</span> Game Structure and Spatio-Temporal Action Detection in Soccer Using Graphs and 3D Convolutional Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=J%C3%A9r%C3%A9mie%20Ochin">Jérémie Ochin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Soccer analytics are built on two data sources: the frame-by-frame position of each player on the terrain and the sequences of events, such as ball drive, pass, cross, shot, throw-in... With more than 2000 ball-events per soccer game, their precise and exhaustive annotation, based on a monocular video stream such as a TV broadcast, remains a tedious and costly manual task. State-of-the-art methods for spatio-temporal action detection from a monocular video stream, often based on 3D convolutional neural networks, are close to reach levels of performances in mean Average Precision (mAP) compatibles with the automation of such task. Nevertheless, to meet their expectation of exhaustiveness in the context of data analytics, such methods must be applied in a regime of high recall – low precision, using low confidence score thresholds. This setting unavoidably leads to the detection of false positives that are the product of the well documented overconfidence behaviour of neural networks and, in this case, their limited access to contextual information and understanding of the game: their predictions are highly unstructured. Based on the assumption that professional soccer players’ behaviour, pose, positions and velocity are highly interrelated and locally driven by the player performing a ball-action, it is hypothesized that the addition of information regarding surrounding player’s appearance, positions and velocity in the prediction methods can improve their metrics. Several methods are compared to build a proper representation of the game surrounding a player, from handcrafted features of the local graph, based on domain knowledge, to the use of Graph Neural Networks trained in an end-to-end fashion with existing state-of-the-art 3D convolutional neural networks. It is shown that the inclusion of information regarding surrounding players helps reaching higher metrics. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fine-grained%20action%20recognition" title="fine-grained action recognition">fine-grained action recognition</a>, <a href="https://publications.waset.org/abstracts/search?q=human%20action%20recognition" title=" human action recognition"> human action recognition</a>, <a href="https://publications.waset.org/abstracts/search?q=convolutional%20neural%20networks" title=" convolutional neural networks"> convolutional neural networks</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20neural%20networks" title=" graph neural networks"> graph neural networks</a>, <a href="https://publications.waset.org/abstracts/search?q=spatio-temporal%20action%20recognition" title=" spatio-temporal action recognition"> spatio-temporal action recognition</a> </p> <a href="https://publications.waset.org/abstracts/192167/game-structure-and-spatio-temporal-action-detection-in-soccer-using-graphs-and-3d-convolutional-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192167.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">23</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">266</span> High-Fidelity Materials Screening with a Multi-Fidelity Graph Neural Network and Semi-Supervised Learning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Akeel%20A.%20Shah">Akeel A. Shah</a>, <a href="https://publications.waset.org/abstracts/search?q=Tong%20Zhang"> Tong Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Computational approaches to learning the properties of materials are commonplace, motivated by the need to screen or design materials for a given application, e.g., semiconductors and energy storage. Experimental approaches can be both time consuming and costly. Unfortunately, computational approaches such as ab-initio electronic structure calculations and classical or ab-initio molecular dynamics are themselves can be too slow for the rapid evaluation of materials, often involving thousands to hundreds of thousands of candidates. Machine learning assisted approaches have been developed to overcome the time limitations of purely physics-based approaches. These approaches, on the other hand, require large volumes of data for training (hundreds of thousands on many standard data sets such as QM7b). This means that they are limited by how quickly such a large data set of physics-based simulations can be established. At high fidelity, such as configuration interaction, composite methods such as G4, and coupled cluster theory, gathering such a large data set can become infeasible, which can compromise the accuracy of the predictions - many applications require high accuracy, for example band structures and energy levels in semiconductor materials and the energetics of charge transfer in energy storage materials. In order to circumvent this problem, multi-fidelity approaches can be adopted, for example the Δ-ML method, which learns a high-fidelity output from a low-fidelity result such as Hartree-Fock or density functional theory (DFT). The general strategy is to learn a map between the low and high fidelity outputs, so that the high-fidelity output is obtained a simple sum of the physics-based low-fidelity and correction, Although this requires a low-fidelity calculation, it typically requires far fewer high-fidelity results to learn the correction map, and furthermore, the low-fidelity result, such as Hartree-Fock or semi-empirical ZINDO, is typically quick to obtain, For high-fidelity outputs the result can be an order of magnitude or more in speed up. In this work, a new multi-fidelity approach is developed, based on a graph convolutional network (GCN) combined with semi-supervised learning. The GCN allows for the material or molecule to be represented as a graph, which is known to improve accuracy, for example SchNet and MEGNET. The graph incorporates information regarding the numbers of, types and properties of atoms; the types of bonds; and bond angles. They key to the accuracy in multi-fidelity methods, however, is the incorporation of low-fidelity output to learn the high-fidelity equivalent, in this case by learning their difference. Semi-supervised learning is employed to allow for different numbers of low and high-fidelity training points, by using an additional GCN-based low-fidelity map to predict high fidelity outputs. It is shown on 4 different data sets that a significant (at least one order of magnitude) increase in accuracy is obtained, using one to two orders of magnitude fewer low and high fidelity training points. One of the data sets is developed in this work, pertaining to 1000 simulations of quinone molecules (up to 24 atoms) at 5 different levels of fidelity, furnishing the energy, dipole moment and HOMO/LUMO. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=.materials%20screening" title=".materials screening">.materials screening</a>, <a href="https://publications.waset.org/abstracts/search?q=computational%20materials" title=" computational materials"> computational materials</a>, <a href="https://publications.waset.org/abstracts/search?q=machine%20learning" title=" machine learning"> machine learning</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-fidelity" title=" multi-fidelity"> multi-fidelity</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20convolutional%20network" title=" graph convolutional network"> graph convolutional network</a>, <a href="https://publications.waset.org/abstracts/search?q=semi-supervised%20learning" title=" semi-supervised learning"> semi-supervised learning</a> </p> <a href="https://publications.waset.org/abstracts/188307/high-fidelity-materials-screening-with-a-multi-fidelity-graph-neural-network-and-semi-supervised-learning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/188307.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">40</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">265</span> Topological Language for Classifying Linear Chord Diagrams via Intersection Graphs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Michela%20Quadrini">Michela Quadrini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Chord diagrams occur in mathematics, from the study of RNA to knot theory. They are widely used in theory of knots and links for studying the finite type invariants, whereas in molecular biology one important motivation to study chord diagrams is to deal with the problem of RNA structure prediction. An RNA molecule is a linear polymer, referred to as the backbone, that consists of four types of nucleotides. Each nucleotide is represented by a point, whereas each chord of the diagram stands for one interaction for Watson-Crick base pairs between two nonconsecutive nucleotides. A chord diagram is an oriented circle with a set of n pairs of distinct points, considered up to orientation preserving diffeomorphisms of the circle. A linear chord diagram (LCD) is a special kind of graph obtained cutting the oriented circle of a chord diagram. It consists of a line segment, called its backbone, to which are attached a number of chords with distinct endpoints. There is a natural fattening on any linear chord diagram; the backbone lies on the real axis, while all the chords are in the upper half-plane. Each linear chord diagram has a natural genus of its associated surface. To each chord diagram and linear chord diagram, it is possible to associate the intersection graph. It consists of a graph whose vertices correspond to the chords of the diagram, whereas the chord intersections are represented by a connection between the vertices. Such intersection graph carries a lot of information about the diagram. Our goal is to define an LCD equivalence class in terms of identity of intersection graphs, from which many chord diagram invariants depend. For studying these invariants, we introduce a new representation of Linear Chord Diagrams based on a set of appropriate topological operators that permits to model LCD in terms of the relations among chords. Such set is composed of: crossing, nesting, and concatenations. The crossing operator is able to generate the whole space of linear chord diagrams, and a multiple context free grammar able to uniquely generate each LDC starting from a linear chord diagram adding a chord for each production of the grammar is defined. In other words, it allows to associate a unique algebraic term to each linear chord diagram, while the remaining operators allow to rewrite the term throughout a set of appropriate rewriting rules. Such rules define an LCD equivalence class in terms of the identity of intersection graphs. Starting from a modelled RNA molecule and the linear chord, some authors proposed a topological classification and folding. Our LCD equivalence class could contribute to the RNA folding problem leading to the definition of an algorithm that calculates the free energy of the molecule more accurately respect to the existing ones. Such LCD equivalence class could be useful to obtain a more accurate estimate of link between the crossing number and the topological genus and to study the relation among other invariants. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=chord%20diagrams" title="chord diagrams">chord diagrams</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20chord%20diagram" title=" linear chord diagram"> linear chord diagram</a>, <a href="https://publications.waset.org/abstracts/search?q=equivalence%20class" title=" equivalence class"> equivalence class</a>, <a href="https://publications.waset.org/abstracts/search?q=topological%20language" title=" topological language"> topological language</a> </p> <a href="https://publications.waset.org/abstracts/77566/topological-language-for-classifying-linear-chord-diagrams-via-intersection-graphs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/77566.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">201</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">264</span> Comparison of Unit Hydrograph Models to Simulate Flood Events at the Field Scale</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Imene%20Skhakhfa">Imene Skhakhfa</a>, <a href="https://publications.waset.org/abstracts/search?q=Lahbaci%20Ouerdachi"> Lahbaci Ouerdachi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> To ensure the overall coherence of simulated results, it is necessary to develop a robust validation process. In many applications, it is no longer content to calibrate and validate the model only in relation to the hydro graph measured at the outlet, but we try to better simulate the functioning of the watershed in space. Therefore the timing also performs compared to other variables such as water level measurements in intermediate stations or groundwater levels. As part of this work, we limit ourselves to modeling flood of short duration for which the process of evapotranspiration is negligible. The main parameters to identify the models are related to the method of unit hydro graph (HU). Three different models were tested: SNYDER, CLARK and SCS. These models differ in their mathematical structure and parameters to be calibrated while hydrological data are the same, the initial water content and precipitation. The models are compared on the basis of their performance in terms six objective criteria, three global criteria and three criteria representing volume, peak flow, and the mean square error. The first type of criteria gives more weight to strong events whereas the second considers all events to be of equal weight. The results show that the calibrated parameter values are dependent and also highlight the problems associated with the simulation of low flow events and intermittent precipitation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=model%20calibration" title="model calibration">model calibration</a>, <a href="https://publications.waset.org/abstracts/search?q=intensity" title=" intensity"> intensity</a>, <a href="https://publications.waset.org/abstracts/search?q=runoff" title=" runoff"> runoff</a>, <a href="https://publications.waset.org/abstracts/search?q=hydrograph" title=" hydrograph"> hydrograph</a> </p> <a href="https://publications.waset.org/abstracts/25170/comparison-of-unit-hydrograph-models-to-simulate-flood-events-at-the-field-scale" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25170.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">486</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">263</span> An Insite to the Probabilistic Assessment of Reserves in Conventional Reservoirs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sai%20%20Sudarshan">Sai Sudarshan</a>, <a href="https://publications.waset.org/abstracts/search?q=Harsh%20Vyas"> Harsh Vyas</a>, <a href="https://publications.waset.org/abstracts/search?q=Riddhiman%20%20Sherlekar"> Riddhiman Sherlekar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The oil and gas industry has been unwilling to adopt stochastic definition of reserves. Nevertheless, Monte Carlo simulation methods have gained acceptance by engineers, geoscientists and other professionals who want to evaluate prospects or otherwise analyze problems that involve uncertainty. One of the common applications of Monte Carlo simulation is the estimation of recoverable hydrocarbon from a reservoir.Monte Carlo Simulation makes use of random samples of parameters or inputs to explore the behavior of a complex system or process. It finds application whenever one needs to make an estimate, forecast or decision where there is significant uncertainty. First, the project focuses on performing Monte-Carlo Simulation on a given data set using U. S Department of Energy’s MonteCarlo Software, which is a freeware e&p tool. Further, an algorithm for simulation has been developed for MATLAB and program performs simulation by prompting user for input distributions and parameters associated with each distribution (i.e. mean, st.dev, min., max., most likely, etc.). It also prompts user for desired probability for which reserves are to be calculated. The algorithm so developed and tested in MATLAB further finds implementation in Python where existing libraries on statistics and graph plotting have been imported to generate better outcome. With PyQt designer, codes for a simple graphical user interface have also been written. The graph so plotted is then validated with already available results from U.S DOE MonteCarlo Software. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=simulation" title="simulation">simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=probability" title=" probability"> probability</a>, <a href="https://publications.waset.org/abstracts/search?q=confidence%20interval" title=" confidence interval"> confidence interval</a>, <a href="https://publications.waset.org/abstracts/search?q=sensitivity%20analysis" title=" sensitivity analysis"> sensitivity analysis</a> </p> <a href="https://publications.waset.org/abstracts/53559/an-insite-to-the-probabilistic-assessment-of-reserves-in-conventional-reservoirs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/53559.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">382</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">262</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">261</span> Domain specific Ontology-Based Knowledge Extraction Using R-GNN and Large Language Models</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Andrey%20Khalov">Andrey Khalov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The rapid proliferation of unstructured data in IT infrastructure management demands innovative approaches for extracting actionable knowledge. This paper presents a framework for ontology-based knowledge extraction that combines relational graph neural networks (R-GNN) with large language models (LLMs). The proposed method leverages the DOLCE framework as the foundational ontology, extending it with concepts from ITSMO for domain-specific applications in IT service management and outsourcing. A key component of this research is the use of transformer-based models, such as DeBERTa-v3-large, for automatic entity and relationship extraction from unstructured texts. Furthermore, the paper explores how transfer learning techniques can be applied to fine-tune large language models (LLaMA) for using to generate synthetic datasets to improve precision in BERT-based entity recognition and ontology alignment. The resulting IT Ontology (ITO) serves as a comprehensive knowledge base that integrates domain-specific insights from ITIL processes, enabling more efficient decision-making. Experimental results demonstrate significant improvements in knowledge extraction and relationship mapping, offering a cutting-edge solution for enhancing cognitive computing in IT service environments. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ontology%20mapping" title="ontology mapping">ontology mapping</a>, <a href="https://publications.waset.org/abstracts/search?q=R-GNN" title=" R-GNN"> R-GNN</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20extraction" title=" knowledge extraction"> knowledge extraction</a>, <a href="https://publications.waset.org/abstracts/search?q=large%20language%20models" title=" large language models"> large language models</a>, <a href="https://publications.waset.org/abstracts/search?q=NER" title=" NER"> NER</a>, <a href="https://publications.waset.org/abstracts/search?q=knowlege%20graph" title=" knowlege graph"> knowlege graph</a> </p> <a href="https://publications.waset.org/abstracts/192578/domain-specific-ontology-based-knowledge-extraction-using-r-gnn-and-large-language-models" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192578.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">16</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">260</span> Examining Social Connectivity through Email Network Analysis: Study of Librarians' Emailing Groups in Pakistan</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Arif%20Khan">Muhammad Arif Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Haroon%20Idrees"> Haroon Idrees</a>, <a href="https://publications.waset.org/abstracts/search?q=Imran%20Aziz"> Imran Aziz</a>, <a href="https://publications.waset.org/abstracts/search?q=Sidra%20Mushtaq"> Sidra Mushtaq</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Social platforms like online discussion and mailing groups are well aligned with academic as well as professional learning spaces. Professional communities are increasingly moving to online forums for sharing and capturing the intellectual abilities. This study investigated dynamics of social connectivity of yahoo mailing groups of Pakistani Library and Information Science (LIS) professionals using Graph Theory technique. Design/Methodology: Social Network Analysis is the increasingly concerned domain for scientists in identifying whether people grow together through online social interaction or, whether they just reflect connectivity. We have conducted a longitudinal study using Network Graph Theory technique to analyze the large data-set of email communication. The data was collected from three yahoo mailing groups using network analysis software over a period of six months i.e. January to June 2016. Findings of the network analysis were reviewed through focus group discussion with LIS experts and selected respondents of the study. Data were analyzed in Microsoft Excel and network diagrams were visualized using NodeXL and ORA-Net Scene package. Findings: Findings demonstrate that professionals and students exhibit intellectual growth the more they get tied within a network by interacting and participating in communication through online forums. The study reports on dynamics of the large network by visualizing the email correspondence among group members in a network consisting vertices (members) and edges (randomized correspondence). The model pair wise relationship between group members was illustrated to show characteristics, reasons, and strength of ties. Connectivity of nodes illustrated the frequency of communication among group members through examining node coupling, diffusion of networks, and node clustering has been demonstrated in-depth. Network analysis was found to be a useful technique in investigating the dynamics of the large network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=emailing%20networks" title="emailing networks">emailing networks</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20graph%20theory" title=" network graph theory"> network graph theory</a>, <a href="https://publications.waset.org/abstracts/search?q=online%20social%20platforms" title=" online social platforms"> online social platforms</a>, <a href="https://publications.waset.org/abstracts/search?q=yahoo%20mailing%20groups" title=" yahoo mailing groups"> yahoo mailing groups</a> </p> <a href="https://publications.waset.org/abstracts/60149/examining-social-connectivity-through-email-network-analysis-study-of-librarians-emailing-groups-in-pakistan" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/60149.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">259</span> Malware Beaconing Detection by Mining Large-scale DNS Logs for Targeted Attack Identification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Andrii%20Shalaginov">Andrii Shalaginov</a>, <a href="https://publications.waset.org/abstracts/search?q=Katrin%20Franke"> Katrin Franke</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiongwei%20Huang"> Xiongwei Huang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the leading problems in Cyber Security today is the emergence of targeted attacks conducted by adversaries with access to sophisticated tools. These attacks usually steal senior level employee system privileges, in order to gain unauthorized access to confidential knowledge and valuable intellectual property. Malware used for initial compromise of the systems are sophisticated and may target zero-day vulnerabilities. In this work we utilize common behaviour of malware called ”beacon”, which implies that infected hosts communicate to Command and Control servers at regular intervals that have relatively small time variations. By analysing such beacon activity through passive network monitoring, it is possible to detect potential malware infections. So, we focus on time gaps as indicators of possible C2 activity in targeted enterprise networks. We represent DNS log files as a graph, whose vertices are destination domains and edges are timestamps. Then by using four periodicity detection algorithms for each pair of internal-external communications, we check timestamp sequences to identify the beacon activities. Finally, based on the graph structure, we infer the existence of other infected hosts and malicious domains enrolled in the attack activities. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=malware%20detection" title="malware detection">malware detection</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20security" title=" network security"> network security</a>, <a href="https://publications.waset.org/abstracts/search?q=targeted%20attack" title=" targeted attack"> targeted attack</a>, <a href="https://publications.waset.org/abstracts/search?q=computational%20intelligence" title=" computational intelligence"> computational intelligence</a> </p> <a href="https://publications.waset.org/abstracts/44685/malware-beaconing-detection-by-mining-large-scale-dns-logs-for-targeted-attack-identification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/44685.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">263</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">258</span> The Malfatti’s Problem in Reuleaux Triangle</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ching-Shoei%20Chiang">Ching-Shoei Chiang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Malfatti’s Problem is to ask for fitting 3 circles into a right triangle such that they are tangent to each other, and each circle is also tangent to a pair of the triangle’s side. This problem has been extended to any triangle (called general Malfatti’s Problem). Furthermore, the problem has been extended to have 1+2+…+n circles, we call it extended general Malfatti’s problem, these circles whose tangency graph, using the center of circles as vertices and the edge connect two circles center if these two circles tangent to each other, has the structure as Pascal’s triangle, and the exterior circles of these circles tangent to three sides of the triangle. In the extended general Malfatti’s problem, there are closed-form solutions for n=1, 2, and the problem becomes complex when n is greater than 2. In solving extended general Malfatti’s problem (n>2), we initially give values to the radii of all circles. From the tangency graph and current radii, we can compute angle value between two vectors. These vectors are from the center of the circle to the tangency points with surrounding elements, and these surrounding elements can be the boundary of the triangle or other circles. For each circle C, there are vectors from its center c to its tangency point with its neighbors (count clockwise) pi, i=0, 1,2,..,n. We add all angles between cpi to cp(i+1) mod (n+1), i=0,1,..,n, call it sumangle(C) for circle C. Using sumangle(C), we can reduce/enlarge the radii for all circles in next iteration, until sumangle(C) is equal to 2πfor all circles. With a similar idea, this paper proposed an algorithm to find the radii of circles whose tangency has the structure of Pascal’s triangle, and the exterior circles of these circles are tangent to the unit Realeaux Triangle. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Malfatti%E2%80%99s%20problem" title="Malfatti’s problem">Malfatti’s problem</a>, <a href="https://publications.waset.org/abstracts/search?q=geometric%20constraint%20solver" title=" geometric constraint solver"> geometric constraint solver</a>, <a href="https://publications.waset.org/abstracts/search?q=computer-aided%20geometric%20design" title=" computer-aided geometric design"> computer-aided geometric design</a>, <a href="https://publications.waset.org/abstracts/search?q=circle%20packing" title=" circle packing"> circle packing</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20visualization" title=" data visualization"> data visualization</a> </p> <a href="https://publications.waset.org/abstracts/148477/the-malfattis-problem-in-reuleaux-triangle" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/148477.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">132</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">257</span> Brain Tumor Segmentation Based on Minimum Spanning Tree</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Simeon%20Mayala">Simeon Mayala</a>, <a href="https://publications.waset.org/abstracts/search?q=Ida%20Herdlev%C3%A6r"> Ida Herdlevær</a>, <a href="https://publications.waset.org/abstracts/search?q=Jonas%20Bull%20Haugs%C3%B8en"> Jonas Bull Haugsøen</a>, <a href="https://publications.waset.org/abstracts/search?q=Shamundeeswari%20Anandan"> Shamundeeswari Anandan</a>, <a href="https://publications.waset.org/abstracts/search?q=Sonia%20Gavasso"> Sonia Gavasso</a>, <a href="https://publications.waset.org/abstracts/search?q=Morten%20Brun"> Morten Brun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a minimum spanning tree-based method for segmenting brain tumors. The proposed method performs interactive segmentation based on the minimum spanning tree without tuning parameters. The steps involve preprocessing, making a graph, constructing a minimum spanning tree, and a newly implemented way of interactively segmenting the region of interest. In the preprocessing step, a Gaussian filter is applied to 2D images to remove the noise. Then, the pixel neighbor graph is weighted by intensity differences and the corresponding minimum spanning tree is constructed. The image is loaded in an interactive window for segmenting the tumor. The region of interest and the background are selected by clicking to split the minimum spanning tree into two trees. One of these trees represents the region of interest and the other represents the background. Finally, the segmentation given by the two trees is visualized. The proposed method was tested by segmenting two different 2D brain T1-weighted magnetic resonance image data sets. The comparison between our results and the standard gold segmentation confirmed the validity of the minimum spanning tree approach. The proposed method is simple to implement and the results indicate that it is accurate and efficient. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=brain%20tumor" title="brain tumor">brain tumor</a>, <a href="https://publications.waset.org/abstracts/search?q=brain%20tumor%20segmentation" title=" brain tumor segmentation"> brain tumor segmentation</a>, <a href="https://publications.waset.org/abstracts/search?q=minimum%20spanning%20tree" title=" minimum spanning tree"> minimum spanning tree</a>, <a href="https://publications.waset.org/abstracts/search?q=segmentation" title=" segmentation"> segmentation</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20processing" title=" image processing"> image processing</a> </p> <a href="https://publications.waset.org/abstracts/148591/brain-tumor-segmentation-based-on-minimum-spanning-tree" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/148591.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">122</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">256</span> A New Bound on the Average Information Ratio of Perfect Secret-Sharing Schemes for Access Structures Based on Bipartite Graphs of Larger Girth</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hui-Chuan%20Lu">Hui-Chuan Lu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In a perfect secret-sharing scheme, a dealer distributes a secret among a set of participants in such a way that only qualified subsets of participants can recover the secret and the joint share of the participants in any unqualified subset is statistically independent of the secret. The access structure of the scheme refers to the collection of all qualified subsets. In a graph-based access structures, each vertex of a graph G represents a participant and each edge of G represents a minimal qualified subset. The average information ratio of a perfect secret-sharing scheme realizing a given access structure is the ratio of the average length of the shares given to the participants to the length of the secret. The infimum of the average information ratio of all possible perfect secret-sharing schemes realizing an access structure is called the optimal average information ratio of that access structure. We study the optimal average information ratio of the access structures based on bipartite graphs. Based on some previous results, we give a bound on the optimal average information ratio for all bipartite graphs of girth at least six. This bound is the best possible for some classes of bipartite graphs using our approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=secret-sharing%20scheme" title="secret-sharing scheme">secret-sharing scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=average%20information%20ratio" title=" average information ratio"> average information ratio</a>, <a href="https://publications.waset.org/abstracts/search?q=star%20covering" title=" star covering"> star covering</a>, <a href="https://publications.waset.org/abstracts/search?q=deduction" title=" deduction"> deduction</a>, <a href="https://publications.waset.org/abstracts/search?q=core%20cluster" title=" core cluster"> core cluster</a> </p> <a href="https://publications.waset.org/abstracts/9671/a-new-bound-on-the-average-information-ratio-of-perfect-secret-sharing-schemes-for-access-structures-based-on-bipartite-graphs-of-larger-girth" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9671.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">362</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">255</span> Altered Network Organization in Mild Alzheimer's Disease Compared to Mild Cognitive Impairment Using Resting-State EEG</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chia-Feng%20Lu">Chia-Feng Lu</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuh-Jen%20Wang"> Yuh-Jen Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Shin%20Teng"> Shin Teng</a>, <a href="https://publications.waset.org/abstracts/search?q=Yu-Te%20Wu"> Yu-Te Wu</a>, <a href="https://publications.waset.org/abstracts/search?q=Sui-Hing%20Yan"> Sui-Hing Yan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Brain functional networks based on resting-state EEG data were compared between patients with mild Alzheimer’s disease (mAD) and matched patients with amnestic subtype of mild cognitive impairment (aMCI). We integrated the time–frequency cross mutual information (TFCMI) method to estimate the EEG functional connectivity between cortical regions and the network analysis based on graph theory to further investigate the alterations of functional networks in mAD compared with aMCI group. We aimed at investigating the changes of network integrity, local clustering, information processing efficiency, and fault tolerance in mAD brain networks for different frequency bands based on several topological properties, including degree, strength, clustering coefficient, shortest path length, and efficiency. Results showed that the disruptions of network integrity and reductions of network efficiency in mAD characterized by lower degree, decreased clustering coefficient, higher shortest path length, and reduced global and local efficiencies in the delta, theta, beta2, and gamma bands were evident. The significant changes in network organization can be used in assisting discrimination of mAD from aMCI in clinical. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=EEG" title="EEG">EEG</a>, <a href="https://publications.waset.org/abstracts/search?q=functional%20connectivity" title=" functional connectivity"> functional connectivity</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20theory" title=" graph theory"> graph theory</a>, <a href="https://publications.waset.org/abstracts/search?q=TFCMI" title=" TFCMI"> TFCMI</a> </p> <a href="https://publications.waset.org/abstracts/13268/altered-network-organization-in-mild-alzheimers-disease-compared-to-mild-cognitive-impairment-using-resting-state-eeg" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13268.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">431</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">254</span> Hybrid Collaborative-Context Based Recommendations for Civil Affairs Operations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Patrick%20Cummings">Patrick Cummings</a>, <a href="https://publications.waset.org/abstracts/search?q=Laura%20Cassani"> Laura Cassani</a>, <a href="https://publications.waset.org/abstracts/search?q=Deirdre%20Kelliher"> Deirdre Kelliher</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we present findings from a research effort to apply a hybrid collaborative-context approach for a system focused on Marine Corps civil affairs data collection, aggregation, and analysis called the Marine Civil Information Management System (MARCIMS). The goal of this effort is to provide operators with information to make sense of the interconnectedness of entities and relationships in their area of operation and discover existing data to support civil military operations. Our approach to build a recommendation engine was designed to overcome several technical challenges, including 1) ensuring models were robust to the relatively small amount of data collected by the Marine Corps civil affairs community; 2) finding methods to recommend novel data for which there are no interactions captured; and 3) overcoming confirmation bias by ensuring content was recommended that was relevant for the mission despite being obscure or less well known. We solve this by implementing a combination of collective matrix factorization (CMF) and graph-based random walks to provide recommendations to civil military operations users. We also present a method to resolve the challenge of computation complexity inherent from highly connected nodes through a precomputed process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Recommendation%20engine" title="Recommendation engine">Recommendation engine</a>, <a href="https://publications.waset.org/abstracts/search?q=collaborative%20filtering" title=" collaborative filtering"> collaborative filtering</a>, <a href="https://publications.waset.org/abstracts/search?q=context%20based%20recommendation" title=" context based recommendation"> context based recommendation</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20analysis" title=" graph analysis"> graph analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=coverage" title=" coverage"> coverage</a>, <a href="https://publications.waset.org/abstracts/search?q=civil%20affairs%20operations" title=" civil affairs operations"> civil affairs operations</a>, <a href="https://publications.waset.org/abstracts/search?q=Marine%20Corps" title=" Marine Corps"> Marine Corps</a> </p> <a href="https://publications.waset.org/abstracts/129398/hybrid-collaborative-context-based-recommendations-for-civil-affairs-operations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/129398.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">125</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">253</span> Optimal and Critical Path Analysis of State Transportation Network Using Neo4J</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pallavi%20Bhogaram">Pallavi Bhogaram</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiaolong%20Wu"> Xiaolong Wu</a>, <a href="https://publications.waset.org/abstracts/search?q=Min%20He"> Min He</a>, <a href="https://publications.waset.org/abstracts/search?q=Onyedikachi%20Okenwa"> Onyedikachi Okenwa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A transportation network is a realization of a spatial network, describing a structure which permits either vehicular movement or flow of some commodity. Examples include road networks, railways, air routes, pipelines, and many more. The transportation network plays a vital role in maintaining the vigor of the nation’s economy. Hence, ensuring the network stays resilient all the time, especially in the face of challenges such as heavy traffic loads and large scale natural disasters, is of utmost importance. In this paper, we used the Neo4j application to develop the graph. Neo4j is the world's leading open-source, NoSQL, a native graph database that implements an ACID-compliant transactional backend to applications. The Southern California network model is developed using the Neo4j application and obtained the most critical and optimal nodes and paths in the network using centrality algorithms. The edge betweenness centrality algorithm calculates the critical or optimal paths using Yen's <em>k</em>-shortest paths algorithm, and the node betweenness centrality algorithm calculates the amount of influence a node has over the network. The preliminary study results confirm that the Neo4j application can be a suitable tool to study the important nodes and the critical paths for the major congested metropolitan area. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=critical%20path" title="critical path">critical path</a>, <a href="https://publications.waset.org/abstracts/search?q=transportation%20network" title=" transportation network"> transportation network</a>, <a href="https://publications.waset.org/abstracts/search?q=connectivity%20reliability" title=" connectivity reliability"> connectivity reliability</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20model" title=" network model"> network model</a>, <a href="https://publications.waset.org/abstracts/search?q=Neo4j%20application" title=" Neo4j application"> Neo4j application</a>, <a href="https://publications.waset.org/abstracts/search?q=edge%20betweenness%20centrality%20index" title=" edge betweenness centrality index"> edge betweenness centrality index</a> </p> <a href="https://publications.waset.org/abstracts/127021/optimal-and-critical-path-analysis-of-state-transportation-network-using-neo4j" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/127021.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">134</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">252</span> Revolutionizing Financial Forecasts: Enhancing Predictions with Graph Convolutional Networks (GCN) - Long Short-Term Memory (LSTM) Fusion</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ali%20Kazemi">Ali Kazemi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Those within the volatile and interconnected international economic markets, appropriately predicting market trends, hold substantial fees for traders and financial establishments. Traditional device mastering strategies have made full-size strides in forecasting marketplace movements; however, monetary data's complicated and networked nature calls for extra sophisticated processes. This observation offers a groundbreaking method for monetary marketplace prediction that leverages the synergistic capability of Graph Convolutional Networks (GCNs) and Long Short-Term Memory (LSTM) networks. Our suggested algorithm is meticulously designed to forecast the traits of inventory market indices and cryptocurrency costs, utilizing a comprehensive dataset spanning from January 1, 2015, to December 31, 2023. This era, marked by sizable volatility and transformation in financial markets, affords a solid basis for schooling and checking out our predictive version. Our algorithm integrates diverse facts to construct a dynamic economic graph that correctly reflects market intricacies. We meticulously collect opening, closing, and high and low costs daily for key inventory marketplace indices (e.g., S&P 500, NASDAQ) and widespread cryptocurrencies (e.g., Bitcoin, Ethereum), ensuring a holistic view of marketplace traits. Daily trading volumes are also incorporated to seize marketplace pastime and liquidity, providing critical insights into the market's shopping for and selling dynamics. Furthermore, recognizing the profound influence of the monetary surroundings on financial markets, we integrate critical macroeconomic signs with hobby fees, inflation rates, GDP increase, and unemployment costs into our model. Our GCN algorithm is adept at learning the relational patterns amongst specific financial devices represented as nodes in a comprehensive market graph. Edges in this graph encapsulate the relationships based totally on co-movement styles and sentiment correlations, enabling our version to grasp the complicated community of influences governing marketplace moves. Complementing this, our LSTM algorithm is trained on sequences of the spatial-temporal illustration discovered through the GCN, enriched with historic fee and extent records. This lets the LSTM seize and expect temporal marketplace developments accurately. Inside the complete assessment of our GCN-LSTM algorithm across the inventory marketplace and cryptocurrency datasets, the version confirmed advanced predictive accuracy and profitability compared to conventional and opportunity machine learning to know benchmarks. Specifically, the model performed a Mean Absolute Error (MAE) of 0.85%, indicating high precision in predicting day-by-day charge movements. The RMSE was recorded at 1.2%, underscoring the model's effectiveness in minimizing tremendous prediction mistakes, which is vital in volatile markets. Furthermore, when assessing the model's predictive performance on directional market movements, it achieved an accuracy rate of 78%, significantly outperforming the benchmark models, averaging an accuracy of 65%. This high degree of accuracy is instrumental for techniques that predict the course of price moves. This study showcases the efficacy of mixing graph-based totally and sequential deep learning knowledge in economic marketplace prediction and highlights the fee of a comprehensive, records-pushed evaluation framework. Our findings promise to revolutionize investment techniques and hazard management practices, offering investors and economic analysts a powerful device to navigate the complexities of cutting-edge economic markets. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=financial%20market%20prediction" title="financial market prediction">financial market prediction</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20convolutional%20networks%20%28GCNs%29" title=" graph convolutional networks (GCNs)"> graph convolutional networks (GCNs)</a>, <a href="https://publications.waset.org/abstracts/search?q=long%20short-term%20memory%20%28LSTM%29" title=" long short-term memory (LSTM)"> long short-term memory (LSTM)</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptocurrency%20forecasting" title=" cryptocurrency forecasting"> cryptocurrency forecasting</a> </p> <a href="https://publications.waset.org/abstracts/184980/revolutionizing-financial-forecasts-enhancing-predictions-with-graph-convolutional-networks-gcn-long-short-term-memory-lstm-fusion" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/184980.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">66</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">251</span> Web Proxy Detection via Bipartite Graphs and One-Mode Projections</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhipeng%20Chen">Zhipeng Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Peng%20Zhang"> Peng Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Qingyun%20Liu"> Qingyun Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Li%20Guo"> Li Guo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> With the Internet becoming the dominant channel for business and life, many IPs are increasingly masked using web proxies for illegal purposes such as propagating malware, impersonate phishing pages to steal sensitive data or redirect victims to other malicious targets. Moreover, as Internet traffic continues to grow in size and complexity, it has become an increasingly challenging task to detect the proxy service due to their dynamic update and high anonymity. In this paper, we present an approach based on behavioral graph analysis to study the behavior similarity of web proxy users. Specifically, we use bipartite graphs to model host communications from network traffic and build one-mode projections of bipartite graphs for discovering social-behavior similarity of web proxy users. Based on the similarity matrices of end-users from the derived one-mode projection graphs, we apply a simple yet effective spectral clustering algorithm to discover the inherent web proxy users behavior clusters. The web proxy URL may vary from time to time. Still, the inherent interest would not. So, based on the intuition, by dint of our private tools implemented by WebDriver, we examine whether the top URLs visited by the web proxy users are web proxies. Our experiment results based on real datasets show that the behavior clusters not only reduce the number of URLs analysis but also provide an effective way to detect the web proxies, especially for the unknown web proxies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bipartite%20graph" title="bipartite graph">bipartite graph</a>, <a href="https://publications.waset.org/abstracts/search?q=one-mode%20projection" title=" one-mode projection"> one-mode projection</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering" title=" clustering"> clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20proxy%20detection" title=" web proxy detection"> web proxy detection</a> </p> <a href="https://publications.waset.org/abstracts/87483/web-proxy-detection-via-bipartite-graphs-and-one-mode-projections" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/87483.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">245</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">250</span> Quantum Graph Approach for Energy and Information Transfer through Networks of Cables</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mubarack%20Ahmed">Mubarack Ahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=Gabriele%20Gradoni"> Gabriele Gradoni</a>, <a href="https://publications.waset.org/abstracts/search?q=Stephen%20C.%20Creagh"> Stephen C. Creagh</a>, <a href="https://publications.waset.org/abstracts/search?q=Gregor%20Tanner"> Gregor Tanner</a> </p> <p class="card-text"><strong>Abstract:</strong></p> High-frequency cables commonly connect modern devices and sensors. Interestingly, the proportion of electric components is rising fast in an attempt to achieve lighter and greener devices. Modelling the propagation of signals through these cable networks in the presence of parameter uncertainty is a daunting task. In this work, we study the response of high-frequency cable networks using both Transmission Line and Quantum Graph (QG) theories. We have successfully compared the two theories in terms of reflection spectra using measurements on real, lossy cables. We have derived a generalisation of the vertex scattering matrix to include non-uniform networks – networks of cables with different characteristic impedances and propagation constants. The QG model implicitly takes into account the pseudo-chaotic behavior, at the vertices, of the propagating electric signal. We have successfully compared the asymptotic growth of eigenvalues of the Laplacian with the predictions of Weyl law. We investigate the nearest-neighbour level-spacing distribution of the resonances and compare our results with the predictions of Random Matrix Theory (RMT). To achieve this, we will compare our graphs with the generalisation of Wigner distribution for open systems. The problem of scattering from networks of cables can also provide an analogue model for wireless communication in highly reverberant environments. In this context, we provide a preliminary analysis of the statistics of communication capacity for communication across cable networks, whose eventual aim is to enable detailed laboratory testing of information transfer rates using software defined radio. We specialise this analysis in particular for the case of MIMO (Multiple-Input Multiple-Output) protocols. We have successfully validated our QG model with both TL model and laboratory measurements. The growth of Eigenvalues compares well with Weyl’s law and the level-spacing distribution agrees so well RMT predictions. The results we achieved in the MIMO application compares favourably with the prediction of a parallel on-going research (sponsored by NEMF21.) <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=eigenvalues" title="eigenvalues">eigenvalues</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple-input%20multiple-output" title=" multiple-input multiple-output"> multiple-input multiple-output</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20graph" title=" quantum graph"> quantum graph</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20matrix%20theory" title=" random matrix theory"> random matrix theory</a>, <a href="https://publications.waset.org/abstracts/search?q=transmission%20line" title=" transmission line"> transmission line</a> </p> <a href="https://publications.waset.org/abstracts/95020/quantum-graph-approach-for-energy-and-information-transfer-through-networks-of-cables" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/95020.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">173</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">249</span> Tool for Analysing the Sensitivity and Tolerance of Mechatronic Systems in Matlab GUI</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bohuslava%20Juhasova">Bohuslava Juhasova</a>, <a href="https://publications.waset.org/abstracts/search?q=Martin%20Juhas"> Martin Juhas</a>, <a href="https://publications.waset.org/abstracts/search?q=Renata%20Masarova"> Renata Masarova</a>, <a href="https://publications.waset.org/abstracts/search?q=Zuzana%20Sutova"> Zuzana Sutova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The article deals with the tool in Matlab GUI form that is designed to analyse a mechatronic system sensitivity and tolerance. In the analysed mechatronic system, a torque is transferred from the drive to the load through a coupling containing flexible elements. Different methods of control system design are used. The classic form of the feedback control is proposed using Naslin method, modulus optimum criterion and inverse dynamics method. The cascade form of the control is proposed based on combination of modulus optimum criterion and symmetric optimum criterion. The sensitivity is analysed on the basis of absolute and relative sensitivity of system function to the change of chosen parameter value of the mechatronic system, as well as the control subsystem. The tolerance is analysed in the form of determining the range of allowed relative changes of selected system parameters in the field of system stability. The tool allows to analyse an influence of torsion stiffness, torsion damping, inertia moments of the motor and the load and controller(s) parameters. The sensitivity and tolerance are monitored in terms of the impact of parameter change on the response in the form of system step response and system frequency-response logarithmic characteristics. The Symbolic Math Toolbox for expression of the final shape of analysed system functions was used. The sensitivity and tolerance are graphically represented as 2D graph of sensitivity or tolerance of the system function and 3D/2D static/interactive graph of step/frequency response. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mechatronic%20systems" title="mechatronic systems">mechatronic systems</a>, <a href="https://publications.waset.org/abstracts/search?q=Matlab%20GUI" title=" Matlab GUI"> Matlab GUI</a>, <a href="https://publications.waset.org/abstracts/search?q=sensitivity" title=" sensitivity"> sensitivity</a>, <a href="https://publications.waset.org/abstracts/search?q=tolerance" title=" tolerance"> tolerance</a> </p> <a href="https://publications.waset.org/abstracts/22534/tool-for-analysing-the-sensitivity-and-tolerance-of-mechatronic-systems-in-matlab-gui" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22534.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">433</span> </span> </div> </div> <ul class="pagination"> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Graph&page=6" rel="prev">&lsaquo;</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Graph&page=1">1</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Graph&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Graph&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Graph&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Graph&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Graph&page=6">6</a></li> <li class="page-item active"><span class="page-link">7</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Graph&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Graph&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Graph&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=Graph&page=15">15</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Graph&page=16">16</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=Graph&page=8" 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>