Search results for: splitting graph

Authors: Nazanin Naderi, Milton Smith

Abstract:

Since worldwide demand for renewable energy is increasing rapidly because of the climate problem and the limitation of fossil fuels, technologies of alternative energy sources have been developed and the electric power network now includes renewable energy resources such as wind energy. Because of the huge advantages that wind energy has, like reduction in natural gas use, price pressure, emissions of greenhouse gases and other atmospheric pollutants, electric sector water consumption and many other contributions to the nation’s economy like job creation it has got too much attention these days from different parts of the world especially in the United States which is trying to provide 20% of the nation’s energy from wind by 2030. This study is trying to evaluate the effect of splitting wind farms on power output. We are trying to find if we can get more output by installing wind turbines in different sites rather than installing all wind turbines in one site. Five potential sites in Texas have been selected as a case study and two years wind data has been gathered for these sites. Wind data are analyzed and effect of correlation between sites on power output has been evaluated. Standard deviation and autocorrelation effect has also been considered for this study. The paper has been organized as follows: After the introduction the second section gives a brief overview of wind analysis. The third section addresses the case study and evaluates correlation between sites, auto correlation of sites and standard deviation of power output. In section four we describe the results.

Keywords: auto correlation, correlation between sites, splitting wind farms, power output, standard deviation

Procedia PDF Downloads 572

Authors: Subhash Chandra Sharma, Mohammad Soleimani

Abstract:

Selection of the correct lubricant for the top of rail application is a complex process. In this paper, the selection of the proper lubricant for a Top-Of-Rail (TOR) lubrication system based on graph theory and matrix approach has been developed. Attributes influencing the selection process and their influence on each other has been represented through a digraph and an equivalent matrix. A matrix function which is called the Permanent Function is derived. By substituting the level of inherent contribution of the influencing parameters and their influence on each other qualitatively, a criterion called Suitability Index is derived. Based on these indices, lubricants can be ranked for their suitability. The proposed model can be useful for maintenance engineers in selecting the best lubricant for a TOR application. The proposed methodology is illustrated step–by-step through an example.

Keywords: lubricant selection, top of rail lubrication, graph-theory, Ranking of lubricants

Procedia PDF Downloads 272

Authors: E. R. Swart, S. J. Gismondi, N. R. Swart, C. E. Bell

Abstract:

We present an heuristic algorithm that decides graph non-Hamiltonicity. All graphs are directed, each undirected edge regarded as a pair of counter directed arcs. Each of the n! Hamilton cycles in a complete graph on n+1 vertices is mapped to an n-permutation matrix P where p(u,i)=1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n+1. We first create exclusion set E by noting all arcs (u, v) not in G, sufficient to code precisely all cycles excluded from G i.e. cycles not in G use at least one arc not in G. Members are pairs of components of P, {p(u,i),p(v,i+1)}, i=1, n-1. A doubly stochastic-like relaxed LP formulation of the Hamilton cycle decision problem is constructed. Each {p(u,i),p(v,i+1)} in E is coded as variable q(u,i,v,i+1)=0 i.e. shrinks the feasible region. We then implement the Weak Closure Algorithm (WCA) that tests necessary conditions of a matching, together with Boolean closure to decide 0/1 variable assignments. Each {p(u,i),p(v,j)} not in E is tested for membership in E, and if possible, added to E (q(u,i,v,j)=0) to iteratively maximize |E|. If the WCA constructs E to be maximal, the set of all {p(u,i),p(v,j)}, then G is decided non-Hamiltonian. Only non-Hamiltonian G share this maximal property. Ten non-Hamiltonian graphs (10 through 104 vertices) and 2000 randomized 31 vertex non-Hamiltonian graphs are tested and correctly decided non-Hamiltonian. For Hamiltonian G, the complement of E covers a matching, perhaps useful in searching for cycles. We also present an example where the WCA fails.

Keywords: Hamilton cycle decision problem, computational complexity theory, graph theory, theoretical computer science

Procedia PDF Downloads 349

Authors: Ayşe Dilek Maden

Abstract:

For a given a simple connected graph, we present some new bounds via a new approach for a special topological index given by the sum of the real number power of the non-zero normalized Laplacian eigenvalues. To use this approach presents an advantage not only to derive old and new bounds on this topic but also gives an idea how some previous results in similar area can be developed.

Keywords: degree Kirchhoff index, normalized Laplacian eigenvalue, spanning tree, simple connected graph

Procedia PDF Downloads 346

Authors: Boumesbah Asma, Chergui Mohamed El-amine

Abstract:

Since it has been shown that the multi-objective minimum spanning tree problem (MOST) is NP-hard even with two criteria, we propose in this study a hybrid NSGA-II algorithm with an exact mutation operator, which is only used with low probability, to find an approximation to the Pareto front of the problem. In a connected graph G, a spanning tree T of G being a connected and cycle-free graph, if k edges of G\T are added to T, we obtain a partial graph H of G inducing a reduced size multi-objective spanning tree problem compared to the initial one. With a weak probability for the mutation operator, an exact method for solving the reduced MOST problem considering the graph H is then used to give birth to several mutated solutions from a spanning tree T. Then, the selection operator of NSGA-II is activated to obtain the Pareto front approximation. Finally, an adaptation of the VNS metaheuristic is called for further improvements on this front. It allows finding good individuals to counterbalance the diversification and the intensification during the optimization search process. Experimental comparison studies with an exact method show promising results and indicate that the proposed algorithm is efficient.

Keywords: minimum spanning tree, multiple objective linear optimization, combinatorial optimization, non-sorting genetic algorithm, variable neighborhood search

Procedia PDF Downloads 73

Authors: Itumeleng Phage

Abstract:

Students’ comprehension of graphs may be affected by the characteristics of the discipline in which the graph is used, the type of the task as well as the background of the students who are the readers or interpreters of the graph. This research study investigated these aspects of the graph comprehension of 152 first-year undergraduate physics students by comparing their responses to corresponding tasks in the mathematics and physics disciplines. The discipline characteristics were analysed for four task-related constructs namely coordinates, representations, area and slope. Students’ responses to corresponding visual decoding and judgement tasks set in mathematics and kinematics contexts were statistically compared. The effects of the participants’ gender, year of school completion and study course were determined as reader characteristics. The results of the empirical study indicated that participants generally transferred their mathematics knowledge on coordinates and representation of straight line graphs to the physics contexts, but not in the cases of parabolic and hyperbolic functions or area under graphs. Insufficient understanding of the slope concept contributed to weak performances on this construct in both mathematics and physics contexts. Discipline characteristics seem to play a vital role in students’ understanding, while reader characteristics had insignificant to medium effects on their responses.

Keywords: kinematics graph, discipline characteristics, constructs, coordinates, representations, area and slope

Procedia PDF Downloads 237

Authors: Zhengrong Wu, Haibo Yang

Abstract:

In the context of escalating global climate change and environmental degradation, the complexity and frequency of natural disasters are continually increasing. Confronted with an abundance of information regarding natural disasters, traditional knowledge graph construction methods, which heavily rely on grammatical rules and prior knowledge, demonstrate suboptimal performance in processing complex, multi-source disaster information. This study, drawing upon past natural disaster reports, disaster-related literature in both English and Chinese, and data from various disaster monitoring stations, constructs question-answer templates based on large language models. Utilizing the P-Tune method, the ChatGLM2-6B model is fine-tuned, leading to the development of a disaster knowledge graph based on large language models. This serves as a knowledge database support for disaster emergency response.

Keywords: large language model, knowledge graph, disaster, deep learning

Procedia PDF Downloads 31

Authors: Feng Fu, Maria Karli

Abstract:

In this paper, experimental studies were carried out to investigate the behaviour of recycled aggregate concrete (RAC). A number of compressive tests, tensile splitting tests, as well as impact tests were conducted. In the tests, different recycled aggregate replacement ratio, different mix design and different water to cement ratio have been chosen in the investigation. The behavior of the RAC concrete was investigated in detail. The results of the tests show that the water-cement ratio plays an important role in the strength of the concrete and RAC concrete exhibit sufficient strength in comparison to the normal aggregate concrete; the relevant design recommendations are also made.

Keywords: recycled aggregate concrete, compressive test, tensile splitting test, flexural strength test, impact test

Procedia PDF Downloads 366

Authors: Somyung Oh, Jeonghyeon Ha, Kyungwon Lee, Sejong Oh

Abstract:

Microarray is a general scheme to find differentially expressed genes for target concept. The output is expressed by heat map, and biologists analyze related terms of gene ontology to find some characteristics of differentially expressed genes. In this paper, we propose integrated visualization tool for heat map and gene ontology graph. Previous two methods are used by static manner and separated way. Proposed visualization tool integrates them and users can interactively manage it. Users may easily find and confirm related terms of gene ontology for given differentially expressed genes. Proposed tool also visualize connections between genes on heat map and gene ontology graph. We expect biologists to find new meaningful topics by proposed tool.

Keywords: heat map, gene ontology, microarray, differentially expressed gene

Procedia PDF Downloads 293

Authors: Manel Brichni, Abdelhak-Djamel Seriai

Abstract:

Systems are increasingly complex. To reduce their complexity, an abstract view of the system can simplify its development. To overcome this problem, we propose a method to decompose systems into subsystems while reducing their coupling. These subsystems represent components. Consisting of an existing object-oriented systems, the main idea of our approach is based on modelling as graphs all entities of an oriented object source code. Such modelling is easy to handle, so we can apply restructuring algorithms based on graph metrics. The particularity of our approach consists in integrating in addition to standard metrics, such as coupling and cohesion, some graph metrics giving more precision during the components identication. To treat this problem, we relied on the ROMANTIC approach that proposed a component-based software architecture recovery from an object oriented system.

Keywords: software reengineering, software component and interfaces, metrics, graphs

Procedia PDF Downloads 481

Authors: Jeffri Ramli, Brabha Nagaratnam, Keerthan Poologanathan, Wai Ming Cheung, Thadshajini Suntharalingham

Abstract:

Fiber-reinforced self-compacting concrete (FRSCC) combines the benefits of SCC of high flowability and randomly dispersed short fibres together in one single concrete. Fibres prevent brittle behaviour and improve several mechanical properties of SCC. In this paper, an experimental investigation of the effect of three-dimensional (3D) fibres on the mechanical properties of SCC has been conducted. Seven SCC mixtures, namely SCC with no fibres as a reference mix, and six 3D steel fibre reinforced SCC mixes were prepared. Two different sizes of 3D steel fibres with perimeters of 115 mm and 220 mm at different fibre contents of 1%, 2%, and 3% (by cement weight) were considered. The mechanical characteristics were obtained through compressive, splitting tensile, and flexural strength tests. The test results revealed that the addition of 3D fibres improves the mechanical properties of SCC.

Keywords: self-compacting concrete, three-dimensional steel fibres, mechanical properties, compressive strength, splitting tensile strength, flexural strength

Procedia PDF Downloads 130

Authors: P. W. Chen, C. T. Chang, Y. Peng, J. Y. Wu, D. J. Jan, Md. Manirul Ali

Abstract:

In the last decade, the nature of cathode spot splitting and the current per spot depended on an oblique magnetic field was investigated. This model for cathode current splitting is developed that we have investigated with relationship the magnetic pressures produced by kinetic pressure, self-magnetic pressure, and changed with an external magnetic field. We propose a theoretical model that has been established to an external magnetic field with components normal and tangential to the cathode surface influenced on magnetic pressure strength. We mainly focus on developed to understand the current per spot influenced with the tangential magnetic field strength and normal magnetic field strength.

Keywords: cathode spot, vacuum arc discharge, oblique magnetic field, tangential magnetic field

Procedia PDF Downloads 302

Authors: Jerry Hu

Abstract:

Let G = (V, E) with V = {1, 2, ..., k} be a graph, the k positive integers a₁, a₂, ..., ak are G-wise relatively prime if (aᵢ, aⱼ ) = 1 for {i, j} ∈ E. We use an inductive approach to give an asymptotic formula for the number of k-tuples of integers that are G-wise relatively prime. An exact formula is obtained for the probability that k positive integers are G-wise relatively prime. As a corollary, we also provide an exact formula for the probability that k positive integers have exactly r relatively prime pairs.

Keywords: graph, independent set, G-wise relatively prime, probability

Procedia PDF Downloads 72

Authors: YingWei Tan, XueFeng Ding

Abstract:

Attention-based voice activity detection models have gained significant attention in recent years due to their fast training speed and ability to capture a wide contextual range. The inclusion of multi-head style and position embedding in the attention architecture are crucial. Having multiple attention heads allows for differential focus on different parts of the sequence, while position embedding provides guidance for modeling dependencies between elements at various positions in the input sequence. In this work, we propose an approach by considering each head as a node, enabling the application of graph neural networks (GNN) to identify correlations among the different nodes. In addition, we adopt an implementation named rotary position embedding (RoPE), which encodes absolute positional information into the input sequence by a rotation matrix, and naturally incorporates explicit relative position information into a self-attention module. We evaluate the effectiveness of our method on a synthetic dataset, and the results demonstrate its superiority over the baseline CRNN in scenarios with low signal-to-noise ratio and noise, while also exhibiting robustness across different noise types. In summary, our proposed framework effectively combines the strengths of CNN and RNN (LSTM), and further enhances detection performance through the integration of graph neural networks and rotary position embedding.

Keywords: voice activity detection, CRNN, graph neural networks, rotary position embedding

Procedia PDF Downloads 41

Authors: Feng Fu, Ahmad Bazgir

Abstract:

This study aimed to investigate and examine the structural behaviour of steel fibre reinforced concrete slabs when subjected to impact loading using drop weight method. A number of compressive tests, tensile splitting tests, as well as impact tests were conducted. The experimental work consists of testing both conventional reinforced slabs and SFRC slabs. Parameters to be considered for carrying out the test will consist of the volume fraction of steel fibre, type of steel fibres, drop weight height and number of blows. Energy absorption of slabs under impact loading and failure modes were examined in-depth and compared with conventional reinforced concrete slab are investigated.

Keywords: steel fibre reinforce concrete, compressive test, tensile splitting test, impact test

Procedia PDF Downloads 403

Authors: S. Wesebaum, S. Willeke

Abstract:

Production companies are faced with an increasingly turbulent business environment, which demands very high production volumes- and delivery date flexibility. If a decoupling by storage stages is not possible (e.g. at a contract manufacturing company) or undesirable from a logistical point of view, load scattering effects the production processes. ‘Load’ characterizes timing and quantity incidence of production orders (e.g. in work content hours) to workstations in the production, which results in specific capacity requirements. Insufficient coordination between load (demand capacity) and capacity supply results in heavy load scattering, which can be described by deviations and uncertainties in the input behavior of a capacity unit. In order to respond to fluctuating loads, companies try to implement consistent and realizable input behavior using the capacity supply available. For example, a uniform and high level of equipment capacity utilization keeps production costs down. In contrast, strong load scattering at workstations leads to performance loss or disproportionately fluctuating WIP, whereby the logistics objectives are affected negatively. Options for reducing load scattering are e.g. shifting the start and end dates of orders, batch splitting and outsourcing of operations or shifting to other workstations. This leads to an adjustment of load to capacity supply, and thus to a reduction of load scattering. If the adaptation of load to capacity cannot be satisfied completely, possibly flexible capacity must be used to ensure that the performance of a workstation does not decrease for a given load. Where the use of flexible capacities normally raises costs, an adjustment of load to capacity supply reduces load scattering and, in consequence, costs. In the literature you mostly find qualitative statements for describing load scattering. Quantitative evaluation methods that describe load mathematically are rare. In this article the authors discuss existing approaches for calculating load scattering and their various disadvantages such as lack of opportunity for normalization. These approaches are the basis for the development of our mathematical quantification approach for describing load scattering that compensates the disadvantages of the current quantification approaches. After presenting our mathematical quantification approach, the method of batch splitting will be described. Batch splitting allows the adaptation of load to capacity to reduce load scattering. After describing the method, it will be explicitly analyzed in the context of the logistic curve theory by Nyhuis using the stretch factor α1 in order to evaluate the impact of the method of batch splitting on load scattering and on logistic curves. The conclusion of this article will be to show how the methods and approaches presented can help companies in a turbulent environment to quantify the occurring work load scattering accurately and apply an efficient method for adjusting work load to capacity supply. In this way, the achievements of the logistical objectives are increased without causing additional costs.

Keywords: batch splitting, production logistics, production planning and control, quantification, load scattering

Procedia PDF Downloads 378

Authors: Arjun, A. D. Singh

Abstract:

The purpose of this study is to resolve the solid waste problems caused by plastics and concrete demolition as well. In order to that mechanical properties of polymer concrete; in particular, polymer concrete made of unsaturated polyester resins from recycled polyethylene terephthalate (PET) plastic waste and recycled concrete aggregates is carried out. Properly formulated unsaturated polyester based on recycled PET is mixed with inorganic aggregates to produce polymer concrete. Apart from low manufacturing cost, polymer concrete blend has acceptable properties, to go through it. The prior objectives of the paper is to investigate the mechanical properties, i.e. compressive strength, splitting tensile strength, and the flexural strength of polymer concrete blend using an unsaturated polyester resin based on recycled PET. The relationships between the mechanical properties are also analyzed.

Keywords: polyethylene terephthalate (PET), concrete aggregates, compressive strength, splitting tensile strength

Procedia PDF Downloads 542

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: 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: Anung Style Bukhori, Ani Dijah Rahajoe

Abstract:

Poverty poses a significant challenge in Indonesia, requiring an effective analytical approach to understand and address this issue. In this research, we applied the Naïve Bayes classification method to examine and classify poverty data in Indonesia. The main focus is on classifying data using RapidMiner, a powerful data analysis platform. The analysis process involves data splitting to train and test the classification model. First, we collected and prepared a poverty dataset that includes various factors such as education, employment, and health..The experimental results indicate that the Naïve Bayes classification model can provide accurate predictions regarding the risk of poverty. The use of RapidMiner in the analysis process offers flexibility and efficiency in evaluating the model's performance. The classification produces several values to serve as the standard for classifying poverty data in Indonesia using Naive Bayes. The accuracy result obtained is 40.26%, with a moderate recall result of 35.94%, a high recall result of 63.16%, and a low recall result of 38.03%. The precision for the moderate class is 58.97%, for the high class is 17.39%, and for the low class is 58.70%. These results can be seen from the graph below.

Keywords: poverty, classification, naïve bayes, Indonesia

Procedia PDF Downloads 34

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: 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: 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: Ehsan Atefi, Michael Grigware

Abstract:

Respiratory failure secondary to surfactant deficiency resulting from respiratory distress syndrome is considered one major cause of morbidity in preterm infants. Surfactant replacement treatment (SRT) is considered an effective treatment for this disease. Here, we introduce an AI-mediated approach for estimating the distribution of surfactant in the lung airway of a newborn infant during SRT. Our approach implements machine learning to precisely estimate the splitting ratio of a liquid drop during bifurcation at different injection velocities and patient orientations. This technique can be used to calculate the surfactant residue remaining on the airway wall during the surfactant injection process. Our model works by minimizing the pressure drop difference between the two airway branches at each generation, subject to mass and momentum conservation. Our platform can be used to generate feedback for immediately adjusting the velocity of injection and patient orientation during SRT.

Keywords: respiratory failure, surfactant deficiency, surfactant replacement, machine learning

Procedia PDF Downloads 105

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: 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: Sultan Husein Bayqra, Ali Mardani Aghabaglou, Zia Ahmad Faqiri, Hassane Amidou Ouedraogo

Abstract:

In this study, the effect of shape and size of the concrete specimen on the compressive and splitting tensile strength of the concrete mixtures in the absence and presence of steel fiber was investigated. For this aim, ten different concrete mixtures having w/c ratio of 0.3, 0.4, 0.5, 0.6 and 0.7 with and without fiber were prepared. In the mixtures containing steel fibers having aspect ratio (L/D) of 64 were used by 1% of the total mixture volume. In all concrete mixtures, CEM I 42,5R type Portland cement and crushed Lime-stone aggregates having different aggregate size fractions were used. The combined aggregate was obtained by mixing %40 0-5 mm, %30 5-12 mm and %30 12-22 mm aggregate size fraction. The slump values of concrete mixtures were kept constant as 17 ± 2 cm. To provide the desired slump value, a polycarboxylate ether-based high range water reducing admixture was used. In order to investigate the effect of size and shape of concrete specimen on strength properties 10 cm, 15 cm cubic specimens and 10×20 cm, 15×30 cm cylindrical specimens were prepared for each mixture. The specimens were cured under standard conditions until testing days. The 7- and 28-day compressive and splitting tensile strengths of mixtures were determined. The results obtained from the experimental study showed that the strength ratio between the cylinder and the cube specimens increased with the increase of the strength of the concrete. Regardless of the fiber utilization and specimen shape, strength values of concrete mixtures were increased by decreasing specimen size. However, the mentioned behaviour was not observed for the case that the mixtures having high W/C ratio and containing fiber. The compressive strength of cube specimens containing fiber was less affected by the size of the specimen compared to that of cube specimens containing no fibers.

Keywords: compressive strength, splitting tensile strength, fiber reinforced concrete, size effect, shape effect

Procedia PDF Downloads 162

Authors: Wilman Septina, Rajiv R. Prabhakar, Thomas Moehl, David Tilley

Abstract:

Cupric oxide (CuO) is a promising absorber material for the fabrication of scalable, low cost solar energy conversion devices, due to the high abundance and low toxicity of copper. It is a p-type semiconductor with a band gap of around 1.5 eV, absorbing a significant portion of the solar spectrum. One of the main challenges in using CuO as solar absorber in an aqueous system is its tendency towards photocorrosion, generating Cu2O and metallic Cu. Although there have been several reports of CuO as a photocathode for hydrogen production, it is unclear how much of the observed current actually corresponds to H2 evolution, as the inevitability of photocorrosion is usually not addressed. In this research, we investigated the effect of the deposition of overlayers onto CuO thin films for the purpose of enhancing its photostability as well as performance for water splitting applications. CuO thin film was fabricated by galvanic electrodeposition of metallic copper onto gold-coated FTO substrates, followed by annealing in air at 600 °C. Photoelectrochemical measurement of the bare CuO film using 1 M phosphate buffer (pH 6.9) under simulated AM 1.5 sunlight showed a current density of ca. 1.5 mA cm-2 (at 0.4 VRHE), which photocorroded to Cu metal upon prolonged illumination. This photocorrosion could be suppressed by deposition of 50 nm-thick TiO2, deposited by atomic layer deposition. In addition, we found that insertion of an n-type CdS layer, deposited by chemical bath deposition, between the CuO and TiO2 layers was able to enhance significantly the photocurrent compared to without the CdS layer. A photocurrent of over 2 mA cm-2 (at 0 VRHE) was observed using the photocathode stack FTO/Au/CuO/CdS/TiO2/Pt. Structural, electrochemical, and photostability characterizations of the photocathode as well as results on various overlayers will be presented.

Keywords: CuO, hydrogen, photoelectrochemical, photostability, water splitting

Procedia PDF Downloads 199