Search results for: graph diameter

Authors: Verónica Díaz

Abstract:

A Cartesian graph, as a mathematical object, becomes a tool for configuration of change. Its best comprehension is done through everyday life problem-solving associated with its representation. Despite this, the current educational framework favors general graphs, without consideration of their argumentation. Students are required to find the mathematical function without associating it to the development of graphical language. This research describes the use made by students of configurations made prior to Cartesian graphs with regards to an everyday life problem related to a time and distance variation phenomenon. The theoretical framework describes the function conditions of study and their modeling. This is a qualitative, descriptive study involving six undergraduate case studies that were carried out during the first term in 2016 at University of Los Lagos. The research problem concerned the graphic modeling of a real person’s movement phenomenon, and two levels of analysis were identified. The first level aims to identify local and global graph interpretations; a second level describes the iconicity and referentiality degree of an image. According to the results, students were able to draw no figures before the Cartesian graph, highlighting the need for students to represent the context and the movement of which causes the phenomenon change. From this, they managed Cartesian graphs representing changes in position, therefore, achieved an overall view of the graph. However, the local view only indicates specific events in the problem situation, using graphic and verbal expressions to represent movement. This view does not enable us to identify what happens on the graph when the movement characteristics change based on possible paths in the person’s walking speed.

Keywords: cartesian graphs, higher education, movement modeling, problem solving

Procedia PDF Downloads 198

Authors: M. Ezzat, Y. Zaghloul, T. Sorour, A. Hefny, M. Eid

Abstract:

Ultimate capacity of large diameter bored piles is usually determined from pile loading tests as recommended by several international codes and foundation design standards. However, loading of this type of piles till achieving apparent failure is practically seldom. In this paper, numerical analyses are carried out to simulate load test of a large diameter bored pile performed at the location of Alzey highway bridge project (Germany). Test results of pile load settlement relationship till failure as well as results of the base and shaft resistances are available. Apparent failure was indicated in this test by the significant increase of the induced settlement during the last load increment applied on the pile head. Measurements of this pile load test are used to assess the quality of the numerical models investigated. Three different material soil models are implemented in the analyses: Mohr coulomb (MC), Soft soil (SS), and Modified Mohr coulomb (MMC). Very good agreement is obtained between the field measured settlement and the calculated settlement using the MMC model. Results of analysis showed also that the MMC constitutive model is superior to MC, and SS models in predicting the ultimate base and shaft resistances of the large diameter bored pile. After calibrating the numerical model, behavior of large diameter bored piles under axial loads is discussed and the formation of the plastic zone around the pile is explored. Results obtained showed that the plastic zone below the base of the pile at failure extended laterally to about four times the pile diameter and vertically to about three times the pile diameter.

Keywords: ultimate capacity, large diameter bored piles, plastic zone, failure, pile load test

Procedia PDF Downloads 126

Authors: Mehmet Karaata

Abstract:

Given two distinct vertices (nodes) source s and target t of a graph G = (V, E), the two node-disjoint paths problem is to identify two node-disjoint paths between s ∈ V and t ∈ V . Two paths are node-disjoint if they have no common intermediate vertices. In this paper, we present an algorithm with O(m)-time complexity for finding two node-disjoint paths between s and t in arbitrary graphs where m is the number of edges. The proposed algorithm has a wide range of applications in ensuring reliability and security of sensor, mobile and fixed communication networks.

Keywords: disjoint paths, distributed systems, fault-tolerance, network routing, security

Procedia PDF Downloads 422

Authors: Luis Andrey Fajardo Fajardo

Abstract:

We are immersed in complex systems. The human brain, the galaxies, the snowflakes are examples of complex systems. An area of interest in Complex systems is the chaos theory. This revolutionary field of science presents different ways of study than determinism and reductionism. Here is where in junction with the Nonlinear DSP, chaos theory offer valuable techniques that establish a link between time series and complex theory in terms of complex networks, so that, the study of signals can be explored from the graph theory. Recently, some people had purposed a method to transform time series in graphs, but no one had developed a suitable implementation in Python with signals extracted from Chaotic Systems or Complex systems. That’s why the implementation in Python of an existing method to transform one dimensional chaotic signals from time domain to graph domain and some measures that may reveal information not extracted in the time domain is proposed.

Keywords: Python, complex systems, graph theory, dynamical systems

Procedia PDF Downloads 492

Authors: L. Achou, A. Doghmane

Abstract:

Elastic performances, as an essential property of nanowires (NWs), play a significant role in the design and fabrication of modern nanodevices. In this paper, our interest is focused on ZnO NWs to investigate wire diameter (D_wire ≤ 400 nm) effects on elastic properties. The plotted data reveal that a strong size dependence of the elastic constants exists when the wire diameter is smaller than ~ 100 nm. For larger diameters (D_wire > 100 nm), these ones approach their corresponding bulk values. To enrich this study, we make use of the scanning acoustic microscopy simulation technique. The calculation methodology consists of several steps: determination of longitudinal and transverse wave velocities, calculation of refection coefficients, calculation of acoustic signatures and Rayleigh velocity determination. Quantitatively, it was found that changes in ZnO diameters over the ranges 1 nm ≤ D_wire ≤ 100 nm lead to similar exponential variations, for all elastic parameters, of the from: A = a + b exp(-D_wire/c) where a, b, and c are characteristic constants of a given parameter. The developed relation can be used to predict elastic properties of such NW by just knowing its diameter and vice versa.

Keywords: elastic properties, nanowires, semiconductors, theoretical model, ZnO

Procedia PDF Downloads 144

Authors: Arya Pirooz

Abstract:

Air and fuel must be mixed correctly so that there is perfect combustion, which calls for fuel atomization by injection. In this study, the effects of different parameters such as number of orifices, length and diameter of orifices, diameter of nozzle sac and the angle of needle seat in injectors were investigated with the use of rate of injection and sac pressure. The unit pump of the OM-457 diesel engine was modelled on Avl-Hydsim. The results illustrate that the sac pressure decreased by 46% when the number of holes were doubled, although the rate of injection had an immense change. Also, the sac pressure increased up to 60% when the diameter of orifices decreased by 40% in spite of the semi-constant injection rate.

Keywords: injection, OM-457 engine, nozzle geometry, atomization

Procedia PDF Downloads 478

Authors: Tomáš Bublík, Miroslav Virius

Abstract:

This paper presents general results on the Java source code snippet detection problem. We propose the tool which uses graph and sub graph isomorphism detection. A number of solutions for all of these tasks have been proposed in the literature. However, although that all these solutions are really fast, they compare just the constant static trees. Our solution offers to enter an input sample dynamically with the Scripthon language while preserving an acceptable speed. We used several optimizations to achieve very low number of comparisons during the matching algorithm.

Keywords: AST, Java, tree matching, scripthon source code recognition

Procedia PDF Downloads 407

Authors: S. Sadallah

Abstract:

In this paper, dynamic programming is used to determine the optimal management of financial resources in company. Solution of the problem by consider into simpler substructures is constructed. The optimal management of internal capital of company are simulated. The tools applied in this development are based on graph theory. The software of given problems is built by using greedy algorithm. The obtained model and program maintenance enable us to define the optimal version of management of proper financial flows by using visual diagram on each level of investment.

Keywords: management, software, optimal, greedy algorithm, graph-diagram

Procedia PDF Downloads 267

Authors: Karunambigai Mevani Govindasamy, Sathishkumar Ayyappan

Abstract:

In this paper, we formulate the algorithm to find out the dominating function parameters of Intuitionistic Fuzzy Graphs(IFG). The methodology we adopted here is converting any physical problem into an IFG, and that has been transformed into Intuitionistic Fuzzy Matrix. Using Linear Program Solver software (LiPS), we found the defined parameters for the given IFG. We obtained these parameters for a path and cycle IFG. This study can be extended to other varieties of IFG. In particular, we obtain the definition of edge dominating function, minimal edge dominating function, fractional edge domination number (γ_if^') and upper fractional edge domination number (Γ_if^') of an intuitionistic fuzzy graph. Also, we formulated an algorithm which is appropriate to work on LiPS to find fractional edge domination number and upper fractional edge domination number of an IFG.

Keywords: fractional edge domination number, intuitionistic fuzzy cycle, intuitionistic fuzzy graph, intuitionistic fuzzy path

Procedia PDF Downloads 147

Authors: Sabiha Sahin, Kursad Bora Carman, Coskun Yarar

Abstract:

Introduction: Measuring the diameter of the optic nerve sheath is a noninvasive and easy to use imaging technique to predict intracranial pressure in children and adults. The aim was to measure the diameter of the optic nerve sheath in pediatric head trauma. Methods: The study group consisted of 40 children with healthy and 40 patients with head trauma. Transorbital sonographic measurement of the optic nerve sheath diameter was performed. Conclusion: The mean diameters of the optic nerve sheath of right and left eyes were 0.408 ± 0.064 mm and 0.417 ± 0.065 mm, respectively, in the trauma group. These results were higher in patients than in control group. There was a negative correlation between optic nerve sheath diameters and Glasgow Coma Scales in patients with head trauma (p < 0.05). There was a positive correlation between optic nerve sheath diameters and positive CT findings, systolic blood pressure in patients with head trauma. The clinical status of the patients at admission, blood pH and lactate level were related to the optic nerve sheath diameter. Conclusion: Measuring the diameter of the optic nerve sheath is not an invasive technique and can be easily used to predict increased intracranial pressure and to prevent secondary brain injury.

Keywords: head trauma, intracranial pressure, optic nerve, sonography

Procedia PDF Downloads 134

Authors: Kiurski S. Jelena, Ranogajec G. Jonjaua, Oros B. Ivana, Kecić S. Vesna

Abstract:

The adsorption efficiency of fired clayey pellets of 5 and 8 mm diameter size for Cu(II) and Zn(II) ions removal from a waste printing developer was studied. In order to investigate the influence of contact time, adsorbent mass and pellet size on the adsorption efficiency the batch mode was carried out. Faster uptake of copper ions was obtained with the fired clay pellets of 5 mm diameter size within 30 minutes. The pellets of 8 mm diameter size showed the higher equilibrium time (60 to 75 minutes) for copper and zinc ions. The results pointed out that adsorption efficiency increases with the increase of adsorbent mass. The maximal efficiency is different for Cu(II) and Zn(II) ions due to the pellet size. Therefore, the fired clay pellets of 5 mm diameter size present an effective adsorbent for Cu(II) ions removal (adsorption efficiency is 63.6%), whereas the fired clay pellets of 8 mm diameter size are the best alternative for Zn(II) ions removal (adsorption efficiency is 92.8%) from a waste printing developer.

Keywords: adsorption efficiency, clayey pellet, metal ions, waste printing developer

Procedia PDF Downloads 276

Authors: Paolo Fantozzi, Luigi Laura, Umberto Nanni

Abstract:

The problem of Entity relation discovery in structured data, a well covered topic in literature, consists in searching within unstructured sources (typically, text) in order to find connections among entities. These can be a whole dictionary, or a specific collection of named items. In many cases machine learning and/or text mining techniques are used for this goal. These approaches might be unfeasible in computationally challenging problems, such as processing massive data streams. A faster approach consists in collecting the cooccurrences of any two words (entities) in order to create a graph of relations - a cooccurrence graph. Indeed each cooccurrence highlights some grade of semantic correlation between the words because it is more common to have related words close each other than having them in the opposite sides of the text. Some authors have used sliding windows for such problem: they count all the occurrences within a sliding windows running over the whole text. In this paper we generalise such technique, coming up to a Weighted-Distance Sliding Window, where each occurrence of two named items within the window is accounted with a weight depending on the distance between items: a closer distance implies a stronger evidence of a relationship. We develop an experiment in order to support this intuition, by applying this technique to a data set consisting in the text of the Bible, split into verses.

Keywords: cooccurrence graph, entity relation graph, unstructured text, weighted distance

Procedia PDF Downloads 126

Authors: Ahlem Abid, Farah Jemili

Abstract:

Intrusion detection has been the subject of numerous studies in industry and academia, but cyber security analysts always want greater precision and global threat analysis to secure their systems in cyberspace. To improve intrusion detection system, the visualisation of the security events in form of graphs and diagrams is important to improve the accuracy of alerts. In this paper, we propose an approach of an IDS based on cloud computing, big data technique and using a machine learning graph algorithm which can detect in real time different attacks as early as possible. We use the MAWILab intrusion detection dataset . We choose Microsoft Azure as a unified cloud environment to load our dataset on. We implement the k2 algorithm which is a graphical machine learning algorithm to classify attacks. Our system showed a good performance due to the graphical machine learning algorithm and spark structured streaming engine.

Keywords: Apache Spark Streaming, Graph, Intrusion detection, k2 algorithm, Machine Learning, MAWILab, Microsoft Azure Cloud

Procedia PDF Downloads 121

Authors: M. E. Abalaka, O. A. Falusi, M. Galadima, D. Damisa

Abstract:

The antimicrobial activity of aqueous, ethanolic and methanolic extracts of Chromolaena odorata (Siam weed) was evaluated against four wound isolates: Staphylococcus aureus, Escherichia coli, Pseudomonas aeruginosa and Klebsiella pneumoniae at the concentrations of 200mg/ml, 100mg/ml, 50mg/ml and 25mg/ml respectively. S. aureus and E. coli showed high susceptibility to the various extracts than the other test isolates. The aqueous extract showed activity against Staphylococcus aureus with a mean diameter of zone of inhibition of 16 ± 3.00 at concentration of 200mg/ml and as low as 8 ± 0.00 at concentration of 25mg/ml; E. coli showed susceptibility with a mean diameter of zone of inhibition of 18 ± 2.00 and 10 ± 0.00 at a concentration of 200mg/ml and 25mg/ml respectively. Pseudomonas aeruginosa and Klebsiella pneumoniae were resistant to the aqueous extract. Methanol extract showed activity against Staphylococcus aureus with a mean diameter of zone of inhibition at 28 ± 4.00 and 12 ± 2.30 at a concentration of 200mg/ml and 25mg/ml respectively; while E. coli was susceptible with mean diameter of zone of inhibition of 18 ± 2.00 and as low as 12 ± 0.00 at a concentration of 200mg/ml and 50mg/ml respectively, Pseudomonas aeruginosa showed considerable susceptibility with mean diameter of zone of inhibition of 13 ± 1.00 and 12 ± 0.00 at a concentration of 200mg/ml and 100mg/ml respectively. The ethanol extract showed activity against S. aureus with a mean diameter zone of inhibition of 15 ± 2.00 and 9 ± 0.00 at a concentration of 200mg/ml and 25mg/ml respectively: E. coli showed susceptibility with a mean diameter zone of inhibition of 20 ± 4.00 and 13 ± 2.00 at a concentration of 200mg/ml and 25mg/ml respectively. Pseudomonas aeruginosa showed considerable susceptibility with a mean diameter zone of inhibition of 13 ± 1.00 and 9 ± 0.00 at a concentration of 200mg/ml and 100mg/ml respectively. The results above indicate the efficacy and potency of the crude extracts of Chromolaena odorata leaf on the tested wound isolates.

Keywords: antibacterial, Chromolaena odorata, leaf extracts, test isolates

Procedia PDF Downloads 337

Authors: Seyed Ahmad Mojallal

Abstract:

Let G be a connected threshold graph of order n with m edges and trace T. In this talk we give a lower bound on Laplacian energy in terms of n, m, and T of G. From this we determine the threshold graphs with the first four minimal Laplacian energies. We also list the first 20 minimal Laplacian energies among threshold graphs. Let σ=σ(G) be the number of Laplacian eigenvalues greater than or equal to average degree of graph G. Using this concept, we obtain the threshold graphs with the largest and the second largest Laplacian energies.

Keywords: Laplacian eigenvalues, Laplacian energy, threshold graphs, extremal graphs

Procedia PDF Downloads 361

Authors: Amir Doustgani

Abstract:

Melt electrospinning is a safe and simple technique for the production of micro and nanofibers which can be an alternative to conventional solvent electrospinning. The effects of various melt-electrospinning parameters, including molecular weight, electric field strength, flow rate and temperature on the morphology and fiber diameter of polylactic acid were studied. It was shown that molecular weight was the predominant factor in determining the obtainable fiber diameter of the collected fibers. An orthogonal design was used to examine process parameters. Results showed that molecular weight is the most effective parameter on the average fiber diameter of melt electrospun PLA nanofibers and the flow rate has the less important impact. Mean fiber diameter increased by increasing MW and flow rate, but decreased by increasing electric field strength and temperature. MFD of optimized fibers was below 100 nm and the result of software was in good agreement with the experimental condition.

Keywords: fiber formation, processing, spinning, melt blowing

Procedia PDF Downloads 420

Authors: Qin Long, Li Xiaoge

Abstract:

The Knowledge Graphs have now become a new form of knowledge representation. However, there is no consensus in regard to a plausible and definition of entities and relationships in the domain-specific knowledge graph. Further, in conjunction with several limitations and deficiencies, various domain-specific entities and relationships recognition approaches are far from perfect. Specifically, named entity recognition in Chinese domain is a critical task for the natural language process applications. However, a bottleneck problem with Chinese named entity recognition in new domains is the lack of annotated data. To address this challenge, a domain distant supervised named entity recognition framework is proposed. The framework is divided into two stages: first, the distant supervised corpus is generated based on the entity linking model of graph attention neural network; secondly, the generated corpus is trained as the input of the distant supervised named entity recognition model to train to obtain named entities. The link model is verified in the ccks2019 entity link corpus, and the F1 value is 2% higher than that of the benchmark method. The re-pre-trained BERT language model is added to the benchmark method, and the results show that it is more suitable for distant supervised named entity recognition tasks. Finally, it is applied in the computer field, and the results show that this framework can obtain domain named entities.

Keywords: distant named entity recognition, entity linking, knowledge graph, graph attention neural network

Procedia PDF Downloads 75

Authors: J. C. Valenzuela-Tripodoro, P. Álvarez-Ruíz, M. A. Mateos-Camacho, M. Cera

Abstract:

In 2004, it was introduced the concept of Roman domination in graphs. This concept was initially inspired and related to the defensive strategy of the Roman Empire. An undefended place is a city so that no legions are established on it, whereas a strong place is a city in which two legions are deployed. This situation may be modeled by labeling the vertices of a finite simple graph with labels {0, 1, 2}, satisfying the condition that any 0-vertex must be adjacent to, at least, a 2-vertex. Roman domination in graphs is a variant of classic domination. Clearly, the main aim is to obtain such labeling of the vertices of the graph with minimum cost, that is to say, having minimum weight (sum of all vertex labels). Formally, a function f: V (G) → {0, 1, 2} is a Roman dominating function (RDF) in the graph G = (V, E) if f(u) = 0 implies that f(v) = 2 for, at least, a vertex v which is adjacent to u. The weight of an RDF is the positive integer w(f)= ∑_(v∈V)▒〖f(v)〗. The Roman domination number, γ_R (G), is the minimum weight among all the Roman dominating functions? Obviously, the set of vertices with a positive label under an RDF f is a dominating set in the graph, and hence γ(G)≤γ_R (G). In this work, we start the study of a generalization of RDF in which we consider that any undefended place should be defended from a sudden attack by, at least, k legions. These legions can be deployed in the city or in any of its neighbours. A function f: V → {0, 1, . . . , k + 1} such that f(N[u]) ≥ k + |AN(u)| for all vertex u with f(u) < k, where AN(u) represents the set of active neighbours (i.e., with a positive label) of vertex u, is called a [k]-multiple Roman dominating functions and it is denoted by [k]-MRDF. The minimum weight of a [k]-MRDF in the graph G is the [k]-multiple Roman domination number ([k]-MRDN) of G, denoted by γ_[kR] (G). First, we prove that the [k]-multiple Roman domination decision problem is NP-complete even when restricted to bipartite and chordal graphs. A problem that had been resolved for other variants and wanted to be generalized. We know the difficulty of calculating the exact value of the [k]-MRD number, even for families of particular graphs. Here, we present several upper and lower bounds for the [k]-MRD number that permits us to estimate it with as much precision as possible. Finally, some graphs with the exact value of this parameter are characterized.

Keywords: multiple roman domination function, decision problem np-complete, bounds, exact values

Procedia PDF Downloads 89

Authors: Scott N. Gerard, Aliza Heching, Susann M. Keohane, Samuel S. Adams

Abstract:

The world-wide population of people over 60 years of age is growing rapidly. The explosion is placing increasingly onerous demands on individual families, multiple industries and entire countries. Current, human-intensive approaches to eldercare are not sustainable, but IoT and AI technologies can help. The Knowledge Reactor (KR) is a contextual, data fusion engine built to address this and other similar problems. It fuses and centralizes IoT and System of Record/Engagement data into a reactive knowledge graph. Cognitive applications and services are constructed with its multiagent architecture. The KR can scale-up and scaledown, because it exploits container-based, horizontally scalable services for graph store (JanusGraph) and pub-sub (Kafka) technologies. While the KR can be applied to many domains that require IoT and AI technologies, this paper describes how the KR specifically supports the challenging domain of cognitive eldercare. Rule- and machine learning-based analytics infer activities of daily living from IoT sensor readings. KR scalability, adaptability, flexibility and usability are demonstrated.

Keywords: ambient sensing, AI, artificial intelligence, eldercare, IoT, internet of things, knowledge graph

Procedia PDF Downloads 153

Authors: Yan Li

Abstract:

Purpose: There is a lack of suitable recommendation systems to assist engineering teaching. The existing traditional engineering pedagogies lack learning interests for postgraduate students. The knowledge graph-based recommender system aims to enhance postgraduate students’ programming skills, with a focus on programming courses. Design/methodology/approach: The case study will be used as a major research method, and the two case studies will be taken in both two teaching styles of the universities (Zhejiang University and the University of Nottingham Ningbo China), followed by the interviews. Quantitative and qualitative research methods will be combined in this study. Research limitations/implications: The case studies were only focused on two teaching styles universities, which is not comprehensive enough. The subject was limited to postgraduate students. Originality/value: The study collected and analyzed the data from two teaching styles of universities’ perspectives. It explored the challenges of Engineering education and tried to seek potential enhancement.

Keywords: knowledge graph and recommender system, engineering pedagogy, programming skills, postgraduate students

Procedia PDF Downloads 51

Authors: Aman Berhe, Camille Guinaudeau, Claude Barras

Abstract:

In order to facilitate information seeking in large collections of multimedia documents with long and progressive content (such as broadcast news or TV series), one can extract the semantic links that exist between semantically coherent parts of documents, i.e., scenes. The links can then create a coherent collection of scenes from which it is easier to perform content analysis, topic extraction, or information retrieval. In this paper, we focus on TV series structuring and propose two approaches for scene linking at different levels of granularity (episode and season): a fuzzy online clustering technique and a graph-based community detection algorithm. When evaluated on the two first seasons of the TV series Game of Thrones, we found that the fuzzy online clustering approach performed better compared to graph-based community detection at the episode level, while graph-based approaches show better performance at the season level.

Keywords: multimedia collection structuring, progressive content, scene linking, fuzzy clustering, community detection

Procedia PDF Downloads 75

Authors: Gabriele Borg, Alexei Debono, Charlie Abela

Abstract:

There on a constant rise in the availability of high volumes of data gathered from multiple sources, resulting in an abundance of unprocessed information that can be used to monitor patterns and trends in user behaviour. Similarly, year after year, Malta is also constantly experiencing ongoing population growth and an increase in mobilization demand. This research takes advantage of data which is continuously being sourced and converting it into useful information related to the traffic problem on the Maltese roads. The scope of this paper is to provide a methodology to create a custom dataset (MalTra - Malta Traffic) compiled from multiple participants from various locations across the island to identify the most common routes taken to expose the main areas of activity. This use of big data is seen being used in various technologies and is referred to as ITSs (Intelligent Transportation Systems), which has been concluded that there is significant potential in utilising such sources of data on a nationwide scale. Furthermore, a series of traffic prediction graph neural network models are conducted to compare MalTra to large-scale traffic datasets.

Keywords: graph neural networks, traffic management, big data, mobile data patterns

Procedia PDF Downloads 107

Authors: Carolina Senabre, Sergio Valero, Emilio Velasco

Abstract:

The brake systems of vehicles are tested periodically by a “brake tester” at Ministry of Transport (MOT) stations. This tester measures the effectiveness of vehicle. This parameter is established by the International Committee of Vehicle Inspection (CITA). In this paper, we present an investigation of the influence of the tire size on the measurements of brake force on three MOT brake testers. We performed an analysis of the vehicle braking capacity test at MOT stations. The influence of varying wheel diameter and width on the measurement of braking at MOT stations has been analyzed. Thereby, the MOT brake tester as a verification system for a vehicle has been evaluated.

Keywords: brake tester, ministry of transport facilities, wheel diameter, efficiency

Procedia PDF Downloads 355

Authors: Amadou Fall Dia, Maurras Ulbricht Togbe, Aliou Boly, Zakia Kazi Aoul, Elisabeth Metais

Abstract:

Existing RDF (Resource Description Framework) Stream Processing (RSP) systems allow continuous processing of RDF data issued from different application domains such as weather station measuring phenomena, geolocation, IoT applications, drinking water distribution management, and so on. However, processing window phase often expires before finishing the entire session and RSP systems immediately delete data streams after each processed window. Such mechanism does not allow optimized exploitation of the RDF data streams as the most relevant and pertinent information of the data is often not used in a due time and almost impossible to be exploited for further analyzes. It should be better to keep the most informative part of data within streams while minimizing the memory storage space. In this work, we propose an RDF graph summarization system based on an explicit and implicit expressed needs through three main approaches: (1) an approach for user queries (SPARQL) in order to extract their needs and group them into a more global query, (2) an extension of the closeness centrality measure issued from Social Network Analysis (SNA) to determine the most informative parts of the graph and (3) an RDF graph summarization technique combining extracted user query needs and the extended centrality measure. Experiments and evaluations show efficient results in terms of memory space storage and the most expected approximate query results on summarized graphs compared to the source ones.

Keywords: centrality measures, RDF graphs summary, RDF graphs stream, SPARQL query

Procedia PDF Downloads 173

Authors: Sepehr Moradi

Abstract:

The physical and mechanical property parameters, inter-relation of key dimensional and distribution profile of raw Australia Superfine Merino Wool (ASFW) and Inner Mongolia Cashmere (IMC) fibres have been studied. The relationship between the properties of these fibres is assessed using fit transformation functions obtained through correlation coefficient analysis. ASFW and IMC fibre properties are found to be both positively skewed and asymmetric in nature. Whilst fibre diameter varies along its length and both ends have a tapering shape. The basic physical features, namely linear density, true local diameter, true length and breaking load are positively correlated while their tenacity is negatively correlated. The tenacity and true length follow a second order polynomial while the true local diameter is linearly correlated. Assessment of the diameter and length is sufficient to estimate the evaluation of quality for commercial grade ASFW and IMC fibres.

Keywords: Australia Superfine Merino Wool fibre, Inner Mongolia Cashmere fibre, distribution profile, physical properties

Procedia PDF Downloads 143

Authors: Leyla Noroozbabaee, David Nickerson

Abstract:

We introduce a modular, consistent, reusable bond graph model of the renal nephron’s proximal convoluted tubule (PCT), which can reproduce biological behaviour. In this work, we focus on ion and volume transport in the proximal convoluted tubule of the renal nephron. Modelling complex systems requires complex modelling problems to be broken down into manageable pieces. This can be enabled by developing models of subsystems that are subsequently coupled hierarchically. Because they are based on a graph structure. In the current work, we define two modular subsystems: the resistive module representing the membrane and the capacitive module representing solution compartments. Each module is analyzed based on thermodynamic processes, and all the subsystems are reintegrated into circuit theory in network thermodynamics. The epithelial transport system we introduce in the current study consists of five transport membranes and four solution compartments. Coupled dissipations in the system occur in the membrane subsystems and coupled free-energy increasing, or decreasing processes appear in solution compartment subsystems. These structural subsystems also consist of elementary thermodynamic processes: dissipations, free-energy change, and power conversions. We provide free and open access to the Python implementation to ensure our model is accessible, enabling the reader to explore the model through setting their simulations and reproducibility tests.

Keywords: Bond Graph, Epithelial Transport, Water Transport, Mathematical Modeling

Procedia PDF Downloads 66

Authors: Noureddine Henka, Sami Tazi, Mohamad Assaad

Abstract:

The electrical grid is a highly intricate system designed to transfer electricity from production areas to consumption areas. The Transmission System Operator (TSO) is responsible for ensuring the efficient distribution of electricity and maintaining the grid's safety and quality. However, due to the increasing integration of intermittent renewable energy sources, there is a growing level of uncertainty, which requires a faster responsive approach. A potential solution involves the use of electrical segmentation, which involves creating coherence zones where electrical disturbances mainly remain within the zone. Indeed, by means of coherent electrical zones, it becomes possible to focus solely on the sub-zone, reducing the range of possibilities and aiding in managing uncertainty. It allows faster execution of operational processes and easier learning for supervised machine learning algorithms. Electrical segmentation can be applied to various applications, such as electrical control, minimizing electrical loss, and ensuring voltage stability. Since the electrical grid can be modeled as a graph, where the vertices represent electrical buses and the edges represent electrical lines, identifying coherent electrical zones can be seen as a clustering task on graphs, generally called community detection. Nevertheless, a critical criterion for the zones is their ability to remain resilient to the electrical evolution of the grid over time. This evolution is due to the constant changes in electricity generation and consumption, which are reflected in graph structure variations as well as line flow changes. One approach to creating a resilient segmentation is to design robust zones under various circumstances. This issue can be represented through a multiplex graph, where each layer represents a specific situation that may arise on the grid. Consequently, resilient segmentation can be achieved by conducting community detection on this multiplex graph. The multiplex graph is composed of multiple graphs, and all the layers share the same set of vertices. Our proposal involves a model that utilizes a unified representation to compute a flattening of all layers. This unified situation can be penalized to obtain (K) connected components representing the robust electrical segmentation clusters. We compare our robust segmentation to the segmentation based on a single reference situation. The robust segmentation proves its relevance by producing clusters with high intra-electrical perturbation and low variance of electrical perturbation. We saw through the experiences when robust electrical segmentation has a benefit and in which context.

Keywords: community detection, electrical segmentation, multiplex graph, power grid

Procedia PDF Downloads 54

Authors: Joseph Gear, Yue Xu, Ernest Foo, Praveen Gauravaran, Zahra Jadidi, Leonie Simpson

Abstract:

Deep learning methods have been seeing an increasing application to the long-standing security research goal of automatic vulnerability detection for source code. Attention, however, must still be paid to the task of producing vector representations for source code (code embeddings) as input for these deep learning models. Graphical representations of code, most predominantly Abstract Syntax Trees and Code Property Graphs, have received some use in this task of late; however, for very large graphs representing very large code snip- pets, learning becomes prohibitively computationally expensive. This expense may be reduced by intelligently pruning this input to only vulnerability-relevant information; however, little research in this area has been performed. Additionally, most existing work comprehends code based solely on the structure of the graph at the expense of the information contained by the node in the graph. This paper proposes Semantic-enhanced Code Embedding for Vulnerability Discovery (SCEVD), a deep learning model which uses semantic-based feature selection for its vulnerability classification model. It uses information from the nodes as well as the structure of the code graph in order to select features which are most indicative of the presence or absence of vulnerabilities. This model is implemented and experimentally tested using the SARD Juliet vulnerability test suite to determine its efficacy. It is able to improve on existing code graph feature selection methods, as demonstrated by its improved ability to discover vulnerabilities.

Keywords: code representation, deep learning, source code semantics, vulnerability discovery

Procedia PDF Downloads 135

Authors: Natasha Sharma, Kulbhushan Agnihotri

Abstract:

Cellular Automata are discrete dynamical systems which are based on local character and spatial disparateness of the spreading process. These factors are generally neglected by traditional models based on differential equations for epidemic spread. The aim of this work is to introduce an SEIR model based on cellular automata on graphs to imitate epidemic spreading. Distinctively, it is an SEIR-type model where the population is divided into susceptible, exposed, infected and recovered individuals. The results obtained from simulations are in accordance with the spreading behavior of a real time epidemics.

Keywords: cellular automata, epidemic spread, graph, susceptible

Procedia PDF Downloads 440

Authors: Gaye Ibrahima, Mendy Gervais, Seck Diaraf, Ouya Samuel

Abstract:

In this paper, we consider the influence maximization in social networks. Here we give importance to initial diffuser called the seeds. The goal is to find efficiently a subset of k elements in the social network that will begin and maximize the information diffusion process. A new approach which treats the social network before to determine the seeds, is proposed. This treatment eliminates the information feedback toward a considered element as seed by extracting an acyclic spanning social network. At first, we propose two algorithm versions called SCG − algoritm (v1 and v2) (Spanning Connected Graphalgorithm). This algorithm takes as input data a connected social network directed or no. And finally, a generalization of the SCG − algoritm is proposed. It is called SG − algoritm (Spanning Graph-algorithm) and takes as input data any graph. These two algorithms are effective and have each one a polynomial complexity. To show the pertinence of our approach, two seeds set are determined and those given by our approach give a better results. The performances of this approach are very perceptible through the simulation carried out by the R software and the igraph package.

Keywords: acyclic spanning graph, centrality measures, information feedback, influence maximization, social network

Procedia PDF Downloads 224