Search results for: graph angle
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 1818

Search results for: graph angle

1758 The Correlation between Head of Bed Angle and IntraAbdominal Pressure of Intubated Patients; a Pre-Post Clinical Trial

Authors: Sedigheh Samimian, Sadra Ashrafi, Tahereh Khaleghdoost Mohammadi, Mohammad Reza Yeganeh, Ali Ashraf, Hamideh Hakimi, Maryam Dehghani

Abstract:

Introduction: The recommended position for measuring Intra-Abdominal Pressure (IAP) is the supine position. However, patients put in this position are prone to Ventilator-associated pneumonia. This study was done to evaluate the relationship between bed head angle and IAP measurements of intubated patients in the intensive care unit. Methods: In this clinical trial, seventy-six critically ill patients under mechanical ventilation were enrolled. IAP measurement was performed every 8 hours for 24 hours using the KORN method in three different degrees of the head of bed (HOB) elevation (0°, 15°, and 30°). Bland-Altman analysis was performed to identify the bias and limits of agreement among the three HOBs. According to World Society of the Abdominal Compartment Syndrome (WSACS), we can consider two IAP techniques equivalent if a bias of <1 mmHg and limits of agreement of - 4 to +4 were found between them. Data were analyzed using SPSS statistical software (v. 19), and the significance level was considered as 0.05. Results: The prevalence of intra-abdominal hypertension was 18.42%. Mean ± standard deviation (SD) of IAP were 8.44 ± 4.02 mmHg for HOB angle 0°, 9.58 ± 4.52 for HOB angle 15°, and 11.10 ± 4.73 for HOB angle 30o (p = 0.0001). The IAP measurement bias between HOB angle 0◦ and HOB angle 15° was 1.13 mmHg. This bias was 2.66 mmHg between HOB angle 0° and HOB angle 30°. Conclusion: Elevation of HOB angle from 0 to 30 degree significantly increases IAP. It seems that the measurement of IAP at HOB angle 15° was more reliable than 30°.

Keywords: pressure, intra-abdominal hypertension, head of bed, critical care, compartment syndrome, supine position

Procedia PDF Downloads 22
1757 Research on Knowledge Graph Inference Technology Based on Proximal Policy Optimization

Authors: Yihao Kuang, Bowen Ding

Abstract:

With the increasing scale and complexity of knowledge graph, modern knowledge graph contains more and more types of entity, relationship, and attribute information. Therefore, in recent years, it has been a trend for knowledge graph inference to use reinforcement learning to deal with large-scale, incomplete, and noisy knowledge graph and improve the inference effect and interpretability. The Proximal Policy Optimization (PPO) algorithm utilizes a near-end strategy optimization approach. This allows for more extensive updates of policy parameters while constraining the update extent to maintain training stability. This characteristic enables PPOs to converge to improve strategies more rapidly, often demonstrating enhanced performance early in the training process. Furthermore, PPO has the advantage of offline learning, effectively utilizing historical experience data for training and enhancing sample utilization. This means that even with limited resources, PPOs can efficiently train for reinforcement learning tasks. Based on these characteristics, this paper aims to obtain better and more efficient inference effect by introducing PPO into knowledge inference technology.

Keywords: reinforcement learning, PPO, knowledge inference, supervised learning

Procedia PDF Downloads 31
1756 The Wear Recognition on Guide Surface Based on the Feature of Radar Graph

Authors: Youhang Zhou, Weimin Zeng, Qi Xie

Abstract:

Abstract: In order to solve the wear recognition problem of the machine tool guide surface, a new machine tool guide surface recognition method based on the radar-graph barycentre feature is presented in this paper. Firstly, the gray mean value, skewness, projection variance, flat degrees and kurtosis features of the guide surface image data are defined as primary characteristics. Secondly, data Visualization technology based on radar graph is used. The visual barycentre graphical feature is demonstrated based on the radar plot of multi-dimensional data. Thirdly, a classifier based on the support vector machine technology is used, the radar-graph barycentre feature and wear original feature are put into the classifier separately for classification and comparative analysis of classification and experiment results. The calculation and experimental results show that the method based on the radar-graph barycentre feature can detect the guide surface effectively.

Keywords: guide surface, wear defects, feature extraction, data visualization

Procedia PDF Downloads 472
1755 Pythagorean-Platonic Lattice Method for Finding all Co-Prime Right Angle Triangles

Authors: Anthony Overmars, Sitalakshmi Venkatraman

Abstract:

This paper presents a method for determining all of the co-prime right angle triangles in the Euclidean field by looking at the intersection of the Pythagorean and Platonic right angle triangles and the corresponding lattice that this produces. The co-prime properties of each lattice point representing a unique right angle triangle are then considered. This paper proposes a conjunction between these two ancient disparaging theorists. This work has wide applications in information security where cryptography involves improved ways of finding tuples of prime numbers for secure communication systems. In particular, this paper has direct impact in enhancing the encryption and decryption algorithms in cryptography.

Keywords: Pythagorean triples, platonic triples, right angle triangles, co-prime numbers, cryptography

Procedia PDF Downloads 193
1754 Matching on Bipartite Graphs with Applications to School Course Registration Systems

Authors: Zhihan Li

Abstract:

Nowadays, most universities use the course enrollment system considering students’ registration orders. However, the students’ preference level to certain courses is also one important factor to consider. In this research, the possibility of applying a preference-first system has been discussed and analyzed compared to the order-first system. A bipartite graph is applied to resemble the relationship between students and courses they tend to register. With the graph set up, we apply Ford-Fulkerson (F.F.) Algorithm to maximize parings between two sets of nodes, in our case, students and courses. Two models are proposed in this paper: the one considered students’ order first, and the one considered students’ preference first. By comparing and contrasting the two models, we highlight the usability of models which potentially leads to better designs for school course registration systems.

Keywords: bipartite graph, Ford-Fulkerson (F.F.) algorithm, graph theory, maximum matching

Procedia PDF Downloads 81
1753 MhAGCN: Multi-Head Attention Graph Convolutional Network for Web Services Classification

Authors: Bing Li, Zhi Li, Yilong Yang

Abstract:

Web classification can promote the quality of service discovery and management in the service repository. It is widely used to locate developers desired services. Although traditional classification methods based on supervised learning models can achieve classification tasks, developers need to manually mark web services, and the quality of these tags may not be enough to establish an accurate classifier for service classification. With the doubling of the number of web services, the manual tagging method has become unrealistic. In recent years, the attention mechanism has made remarkable progress in the field of deep learning, and its huge potential has been fully demonstrated in various fields. This paper designs a multi-head attention graph convolutional network (MHAGCN) service classification method, which can assign different weights to the neighborhood nodes without complicated matrix operations or relying on understanding the entire graph structure. The framework combines the advantages of the attention mechanism and graph convolutional neural network. It can classify web services through automatic feature extraction. The comprehensive experimental results on a real dataset not only show the superior performance of the proposed model over the existing models but also demonstrate its potentially good interpretability for graph analysis.

Keywords: attention mechanism, graph convolutional network, interpretability, service classification, service discovery

Procedia PDF Downloads 106
1752 DTI Connectome Changes in the Acute Phase of Aneurysmal Subarachnoid Hemorrhage Improve Outcome Classification

Authors: Sarah E. Nelson, Casey Weiner, Alexander Sigmon, Jun Hua, Haris I. Sair, Jose I. Suarez, Robert D. Stevens

Abstract:

Graph-theoretical information from structural connectomes indicated significant connectivity changes and improved acute prognostication in a Random Forest (RF) model in aneurysmal subarachnoid hemorrhage (aSAH), which can lead to significant morbidity and mortality and has traditionally been fraught by poor methods to predict outcome. This study’s hypothesis was that structural connectivity changes occur in canonical brain networks of acute aSAH patients, and that these changes are associated with functional outcome at six months. In a prospective cohort of patients admitted to a single institution for management of acute aSAH, patients underwent diffusion tensor imaging (DTI) as part of a multimodal MRI scan. A weighted undirected structural connectome was created of each patient’s images using Constant Solid Angle (CSA) tractography, with 176 regions of interest (ROIs) defined by the Johns Hopkins Eve atlas. ROIs were sorted into four networks: Default Mode Network, Executive Control Network, Salience Network, and Whole Brain. The resulting nodes and edges were characterized using graph-theoretic features, including Node Strength (NS), Betweenness Centrality (BC), Network Degree (ND), and Connectedness (C). Clinical (including demographics and World Federation of Neurologic Surgeons scale) and graph features were used separately and in combination to train RF and Logistic Regression classifiers to predict two outcomes: dichotomized modified Rankin Score (mRS) at discharge and at six months after discharge (favorable outcome mRS 0-2, unfavorable outcome mRS 3-6). A total of 56 aSAH patients underwent DTI a median (IQR) of 7 (IQR=8.5) days after admission. The best performing model (RF) combining clinical and DTI graph features had a mean Area Under the Receiver Operator Characteristic Curve (AUROC) of 0.88 ± 0.00 and Area Under the Precision Recall Curve (AUPRC) of 0.95 ± 0.00 over 500 trials. The combined model performed better than the clinical model alone (AUROC 0.81 ± 0.01, AUPRC 0.91 ± 0.00). The highest-ranked graph features for prediction were NS, BC, and ND. These results indicate reorganization of the connectome early after aSAH. The performance of clinical prognostic models was increased significantly by the inclusion of DTI-derived graph connectivity metrics. This methodology could significantly improve prognostication of aSAH.

Keywords: connectomics, diffusion tensor imaging, graph theory, machine learning, subarachnoid hemorrhage

Procedia PDF Downloads 156
1751 Holomorphic Prioritization of Sets within Decagram of Strategic Decision Making of POSM Using Operational Research (OR): Analytic Hierarchy Process (AHP) Analysis

Authors: Elias Ogutu Azariah Tembe, Hussain Abdullah Habib Al-Salamin

Abstract:

There is decagram of strategic decisions of operations and production/service management (POSM) within operational research (OR) which must collate, namely: design, inventory, quality, location, process and capacity, layout, scheduling, maintain ace, and supply chain. This paper presents an architectural configuration conceptual framework of a decagram of sets decisions in a form of mathematical complete graph and abelian graph. Mathematically, a complete graph is undirected (UDG), and directed (DG) a relationship where every pair of vertices are connected, collated, confluent, and holomorphic. There has not been any study conducted which, however, prioritizes the holomorphic sets which of POMS within OR field of study. The study utilizes OR structured technique known as The Analytic Hierarchy Process (AHP) analysis for organizing, sorting and prioritizing (ranking) the sets within the decagram of POMS according to their attribution (propensity), and provides an analysis how the prioritization has real-world application within the 21st century.

Keywords: holomorphic, decagram, decagon, confluent, complete graph, AHP analysis, SCM, HRM, OR, OM, abelian graph

Procedia PDF Downloads 374
1750 Zero Divisor Graph of a Poset with Respect to Primal Ideals

Authors: Hossein Pourali

Abstract:

In this paper, we extend the concepts of primal and weakly primal ideals for posets. Further, the diameter of the zero divisor graph of a poset with respect to a non-primal ideal is determined. The relation between primary and primal ideals in posets is also studied.

Keywords: ‎associated prime ideal, ‎‎ideal, ‎‎primary ideal, primal ideal‎, prime‎ ‎ideal, semiprime ideal, ‎weakly primal ideal, zero divisors graph

Procedia PDF Downloads 227
1749 Relationship Between Dynamic Balance, Jumping Performance and Q-angle in Soccer Players

Authors: Tarik Ozmen

Abstract:

The soccer players need good dynamic balance and jumping performance for dribbling, crossing rival, and to be effective in high balls during soccer game. The quadriceps angle (Q-angle) is used to assess biomechanics of the patellofemoral joint in the musculoskeletal medicine. The Q angle is formed by the intersection of two lines drawing from the anterior superior iliac spine to the centre of the patella and to the midline of the tibia tuberosity. Studies have shown that the Q angle is inversely associated with quadriceps femoris strength. The purpose of this study was to investigate relationship between dynamic balance, jumping performance and Q-angle in soccer players. Thirty male soccer players (mean ± SD: age, 15.23 ± 0.56 years, height, 170 ± 8.37 cm, weight, 61.36 ± 6.04 kg) participated as volunteer in this study. Dynamic balance of the participants were evaluated at directions of anterior (A), posteromedial (PM) and posterolateral (PL) with Star Excursion Balance Test (SEBT). Each participant was instructed to reach as far as with the non-dominant leg in each of the 3 directions while maintaining dominant leg stance. Leg length was used to normalize excursion distances by dividing the distance reached by leg length and then multiplying the result by 100. The jumping performance was evaluated by squat jump using a contact mat. A universal (standard) goniometer was used to measure the Q angle in standing position. The Q angle was not correlated with directions of SEBT (A: p = 0.32, PM: p = 0.06, PL: p = 0.37). The squat jump height was not correlated with Q-angle (p = 0.21). The findings of this study suggest that there are no significant relationships between dynamic balance, jumping performance and Q-angle in soccer players. Further studies should investigate relationship between balance ability, athletic performance and Q-angle with larger sample size in soccer players.

Keywords: balance, jump height, Q angle, soccer

Procedia PDF Downloads 429
1748 Location-Domination on Join of Two Graphs and Their Complements

Authors: Analen Malnegro, Gina Malacas

Abstract:

Dominating sets and related topics have been studied extensively in the past few decades. A dominating set of a graph G is a subset D of V such that every vertex not in D is adjacent to at least one member of D. The domination number γ(G) is the number of vertices in a smallest dominating set for G. Some problems involving detection devices can be modeled with graphs. Finding the minimum number of devices needed according to the type of devices and the necessity of locating the object gives rise to locating-dominating sets. A subset S of vertices of a graph G is called locating-dominating set, LD-set for short, if it is a dominating set and if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. The location-domination number λ(G) is the minimum cardinality of an LD-set for G. The complement of a graph G is a graph Ḡ on same vertices such that two distinct vertices of Ḡ are adjacent if and only if they are not adjacent in G. An LD-set of a graph G is global if it is an LD-set of both G and its complement Ḡ. The global location-domination number λg(G) is defined as the minimum cardinality of a global LD-set of G. In this paper, global LD-sets on the join of two graphs are characterized. Global location-domination numbers of these graphs are also determined.

Keywords: dominating set, global locating-dominating set, global location-domination number, locating-dominating set, location-domination number

Procedia PDF Downloads 150
1747 Neural Graph Matching for Modification Similarity Applied to Electronic Document Comparison

Authors: Po-Fang Hsu, Chiching Wei

Abstract:

In this paper, we present a novel neural graph matching approach applied to document comparison. Document comparison is a common task in the legal and financial industries. In some cases, the most important differences may be the addition or omission of words, sentences, clauses, or paragraphs. However, it is a challenging task without recording or tracing the whole edited process. Under many temporal uncertainties, we explore the potentiality of our approach to proximate the accurate comparison to make sure which element blocks have a relation of edition with others. In the beginning, we apply a document layout analysis that combines traditional and modern technics to segment layouts in blocks of various types appropriately. Then we transform this issue into a problem of layout graph matching with textual awareness. Regarding graph matching, it is a long-studied problem with a broad range of applications. However, different from previous works focusing on visual images or structural layout, we also bring textual features into our model for adapting this domain. Specifically, based on the electronic document, we introduce an encoder to deal with the visual presentation decoding from PDF. Additionally, because the modifications can cause the inconsistency of document layout analysis between modified documents and the blocks can be merged and split, Sinkhorn divergence is adopted in our neural graph approach, which tries to overcome both these issues with many-to-many block matching. We demonstrate this on two categories of layouts, as follows., legal agreement and scientific articles, collected from our real-case datasets.

Keywords: document comparison, graph matching, graph neural network, modification similarity, multi-modal

Procedia PDF Downloads 146
1746 The Influence of Winding Angle on Functional Failure of FRP Pipes

Authors: Roham Rafiee, Hadi Hesamsadat

Abstract:

In this study, a parametric finite element modeling is developed to analyze failure modes of FRP pipes subjected to internal pressure. First-ply failure pressure and functional failure pressure was determined by a progressive damage modeling and then it is validated using experimental observations. The influence of both winding angle and fiber volume fraction is studied on the functional failure of FRP pipes and it corresponding pressure. It is observed that despite the fact that increasing fiber volume fraction will enhance the mechanical properties, it will be resulted in lower values for functional failure pressure. This shortcoming can be compensated by modifying the winding angle in angle plies of pipe wall structure.

Keywords: composite pipe, functional failure, progressive modeling, winding angle

Procedia PDF Downloads 517
1745 Reductions of Control Flow Graphs

Authors: Robert Gold

Abstract:

Control flow graphs are a well-known representation of the sequential control flow structure of programs with a multitude of applications. Not only single functions but also sets of functions or complete programs can be modelled by control flow graphs. In this case the size of the graphs can grow considerably and thus makes it difficult for software engineers to analyse the control flow. Graph reductions are helpful in this situation. In this paper we define reductions to subsets of nodes. Since executions of programs are represented by paths through the control flow graphs, paths should be preserved. Furthermore, the composition of reductions makes a stepwise analysis approach possible.

Keywords: control flow graph, graph reduction, software engineering, software applications

Procedia PDF Downloads 514
1744 Graph Cuts Segmentation Approach Using a Patch-Based Similarity Measure Applied for Interactive CT Lung Image Segmentation

Authors: Aicha Majda, Abdelhamid El Hassani

Abstract:

Lung CT image segmentation is a prerequisite in lung CT image analysis. Most of the conventional methods need a post-processing to deal with the abnormal lung CT scans such as lung nodules or other lesions. The simplest similarity measure in the standard Graph Cuts Algorithm consists of directly comparing the pixel values of the two neighboring regions, which is not accurate because this kind of metrics is extremely sensitive to minor transformations such as noise or other artifacts problems. In this work, we propose an improved version of the standard graph cuts algorithm based on the Patch-Based similarity metric. The boundary penalty term in the graph cut algorithm is defined Based on Patch-Based similarity measurement instead of the simple intensity measurement in the standard method. The weights between each pixel and its neighboring pixels are Based on the obtained new term. The graph is then created using theses weights between its nodes. Finally, the segmentation is completed with the minimum cut/Max-Flow algorithm. Experimental results show that the proposed method is very accurate and efficient, and can directly provide explicit lung regions without any post-processing operations compared to the standard method.

Keywords: graph cuts, lung CT scan, lung parenchyma segmentation, patch-based similarity metric

Procedia PDF Downloads 137
1743 Elemental Graph Data Model: A Semantic and Topological Representation of Building Elements

Authors: Yasmeen A. S. Essawy, Khaled Nassar

Abstract:

With the rapid increase of complexity in the building industry, professionals in the A/E/C industry were forced to adopt Building Information Modeling (BIM) in order to enhance the communication between the different project stakeholders throughout the project life cycle and create a semantic object-oriented building model that can support geometric-topological analysis of building elements during design and construction. This paper presents a model that extracts topological relationships and geometrical properties of building elements from an existing fully designed BIM, and maps this information into a directed acyclic Elemental Graph Data Model (EGDM). The model incorporates BIM-based search algorithms for automatic deduction of geometrical data and topological relationships for each building element type. Using graph search algorithms, such as Depth First Search (DFS) and topological sortings, all possible construction sequences can be generated and compared against production and construction rules to generate an optimized construction sequence and its associated schedule. The model is implemented in a C# platform.

Keywords: building information modeling (BIM), elemental graph data model (EGDM), geometric and topological data models, graph theory

Procedia PDF Downloads 343
1742 Tensile Properties of 3D Printed PLA under Unidirectional and Bidirectional Raster Angle: A Comparative Study

Authors: Shilpesh R. Rajpurohit, Harshit K. Dave

Abstract:

Fused deposition modeling (FDM) gains popularity in recent times, due to its capability to create prototype as well as functional end use product directly from CAD file. Parts fabricated using FDM process have mechanical properties comparable with those of injection-molded parts. However, performance of the FDM part is severally affected by the poor mechanical properties of the part due to nature of layered structure of printed part. Mechanical properties of the part can be improved by proper selection of process variables. In the present study, a comparative study between unidirectional and bidirectional raster angle has been carried out at a combination of different layer height and raster width. Unidirectional raster angle varied at five different levels, and bidirectional raster angle has been varied at three different levels. Fabrication of tensile specimen and tensile testing of specimen has been conducted according to ASTM D638 standard. From the results, it can be observed that higher tensile strength has been obtained at 0° raster angle followed by 45°/45° raster angle, while lower tensile strength has been obtained at 90° raster angle. Analysis of fractured surface revealed that failure takes place along with raster deposition direction for unidirectional and zigzag failure can be observed for bidirectional raster angle.

Keywords: additive manufacturing, fused deposition modeling, unidirectional, bidirectional, raster angle, tensile strength

Procedia PDF Downloads 149
1741 Robust Diagnosis of an Electro-Mechanical Actuators, Bond Graph LFT Approach

Authors: A. Boulanoir, B. Ould Bouamama, A. Debiane, N. Achour

Abstract:

The paper deals with robust Fault Detection and isolation with respect to parameter uncertainties based on linear fractional transformation form (LFT) Bond graph. The innovative interest of the proposed methodology is the use only one representation for systematic generation of robust analytical redundancy relations and adaptive residual thresholds for sensibility analysis. Furthermore, the parameter uncertainties are introduced graphically in the bond graph model. The methodology applied to the nonlinear industrial Electro-Mechanical Actuators (EMA) used in avionic systems, has determined first the structural monitorability analysis (which component can be monitored) with given instrumentation architecture with any need of complex calculation and secondly robust fault indicators for online supervision.

Keywords: bond graph (BG), electro mechanical actuators (EMA), fault detection and isolation (FDI), linear fractional transformation (LFT), mechatronic systems, parameter uncertainties, avionic system

Procedia PDF Downloads 321
1740 Neighborhood Graph-Optimized Preserving Discriminant Analysis for Image Feature Extraction

Authors: Xiaoheng Tan, Xianfang Li, Tan Guo, Yuchuan Liu, Zhijun Yang, Hongye Li, Kai Fu, Yufang Wu, Heling Gong

Abstract:

The image data collected in reality often have high dimensions, and it contains noise and redundant information. Therefore, it is necessary to extract the compact feature expression of the original perceived image. In this process, effective use of prior knowledge such as data structure distribution and sample label is the key to enhance image feature discrimination and robustness. Based on the above considerations, this paper proposes a local preserving discriminant feature learning model based on graph optimization. The model has the following characteristics: (1) Locality preserving constraint can effectively excavate and preserve the local structural relationship between data. (2) The flexibility of graph learning can be improved by constructing a new local geometric structure graph using label information and the nearest neighbor threshold. (3) The L₂,₁ norm is used to redefine LDA, and the diagonal matrix is introduced as the scale factor of LDA, and the samples are selected, which improves the robustness of feature learning. The validity and robustness of the proposed algorithm are verified by experiments in two public image datasets.

Keywords: feature extraction, graph optimization local preserving projection, linear discriminant analysis, L₂, ₁ norm

Procedia PDF Downloads 117
1739 GraphNPP: A Graphormer-Based Architecture for Network Performance Prediction in Software-Defined Networking

Authors: Hanlin Liu, Hua Li, Yintan AI

Abstract:

Network performance prediction (NPP) is essential for the management and optimization of software-defined networking (SDN) and contributes to improving the quality of service (QoS) in SDN to meet the requirements of users. Although current deep learning-based methods can achieve high effectiveness, they still suffer from some problems, such as difficulty in capturing global information of the network, inefficiency in modeling end-to-end network performance, and inadequate graph feature extraction. To cope with these issues, our proposed Graphormer-based architecture for NPP leverages the powerful graph representation ability of Graphormer to effectively model the graph structure data, and a node-edge transformation algorithm is designed to transfer the feature extraction object from nodes to edges, thereby effectively extracting the end-to-end performance characteristics of the network. Moreover, routing oriented centrality measure coefficient for nodes and edges is proposed respectively to assess their importance and influence within the graph. Based on this coefficient, an enhanced feature extraction method and an advanced centrality encoding strategy are derived to fully extract the structural information of the graph. Experimental results on three public datasets demonstrate that the proposed GraphNPP architecture can achieve state-of-the-art results compared to current NPP methods.

Keywords: software-defined networking, network performance prediction, Graphormer, graph neural network

Procedia PDF Downloads 6
1738 BodeACD: Buffer Overflow Vulnerabilities Detecting Based on Abstract Syntax Tree, Control Flow Graph, and Data Dependency Graph

Authors: Xinghang Lv, Tao Peng, Jia Chen, Junping Liu, Xinrong Hu, Ruhan He, Minghua Jiang, Wenli Cao

Abstract:

As one of the most dangerous vulnerabilities, effective detection of buffer overflow vulnerabilities is extremely necessary. Traditional detection methods are not accurate enough and consume more resources to meet complex and enormous code environment at present. In order to resolve the above problems, we propose the method for Buffer overflow detection based on Abstract syntax tree, Control flow graph, and Data dependency graph (BodeACD) in C/C++ programs with source code. Firstly, BodeACD constructs the function samples of buffer overflow that are available on Github, then represents them as code representation sequences, which fuse control flow, data dependency, and syntax structure of source code to reduce information loss during code representation. Finally, BodeACD learns vulnerability patterns for vulnerability detection through deep learning. The results of the experiments show that BodeACD has increased the precision and recall by 6.3% and 8.5% respectively compared with the latest methods, which can effectively improve vulnerability detection and reduce False-positive rate and False-negative rate.

Keywords: vulnerability detection, abstract syntax tree, control flow graph, data dependency graph, code representation, deep learning

Procedia PDF Downloads 135
1737 Extracting the Failure Criterion to Evaluate the Strength of Cracked Drills under Torque Caused by Drilling

Authors: A. Falsafi, M. Dadkhah, S. Shahidi

Abstract:

The destruction and defeat of drill pipes and drill rigs in oil wells often combined with a combination of shear modulus II and III. In such a situation, the strength and load bearing capacity of the drill are evaluated based on the principles of fracture mechanics and crack growth criteria. In this paper, using the three-dimensional stress equations around the Turkish frontier, the relations of the tense-tense criterion (MTS) are extracted for the loading of the combined II and III modulus. It is shown that in crisp deflection under loading of combination II and III, the level of fracture is characterized by two different angles: the longitudinal angle of deflection θ and the angle of the deflection of the alpha. Based on the relationships obtained from the MTS criterion, the failure criteria, the longitudinal angle of the theta failure and the lateral angle of the failure of the alpha are presented. Also, the role of Poisson's coefficient on these parameters is investigated in these graphs.

Keywords: most tangential tension criterion, longitudinal angle of failure, side angle of fracture, drills crack

Procedia PDF Downloads 101
1736 Computational Fluid Dynamics Analysis of an RC Airplane Wing Using a NACA 2412 Profile at Different Angle of Attacks

Authors: Huseyin Gokberk, Shian Gao

Abstract:

CFD analysis of the relationship between the coefficients of lift and drag with respect to the angle of attack on a NACA 2412 wing section of an RC plane is conducted. Both the 2D and 3D models are investigated with the turbulence model. The 2D analysis has a free stream velocity of 10m/s at different AoA of 0°, 2°, 5°, 10°, 12°, and 15°. The induced drag and drag coefficient increased throughout the changes in angles even after the critical angle had been exceeded, whereas the lift force and coefficient of lift increased but had a limit at the critical stall angle, which results in values to reduce sharply. Turbulence flow characteristics are analysed around the aerofoil with the additions caused due to a finite 3D model. 3D results highlight how wing tip vortexes develop and alter the flow around the wing with the effects of the tapered configuration.

Keywords: CFD, turbulence modelling, aerofoil, angle of attack

Procedia PDF Downloads 166
1735 Required SNR for PPM in Downlink Gamma-Gamma Turbulence Channel

Authors: Selami Şahin

Abstract:

In this paper, in order to achieve sufficient bit error rate (BER) according to zenith angle of the satellite to ground station, SNR requirement is investigated utilizing pulse position modulation (PPM). To realize explicit results, all parameters such as link distance, Rytov variance, scintillation index, wavelength, aperture diameter of the receiver, Fried's parameter and zenith angle have been taken into account. Results indicate that after some parameters are determined since the constraints of the system, to achieve desired BER, required SNR values are in wide range while zenith angle changes from small to large values. Therefore, in order not to utilize high link margin, either SNR should adjust according to zenith angle or link should establish with predetermined intervals of the zenith angle.

Keywords: Free-space optical communication, optical downlink channel, atmospheric turbulence, wireless optical communication

Procedia PDF Downloads 368
1734 The Vertex Degree Distance of One Vertex Union of the Cycle and the Star

Authors: Ying Wang, Haiyan Xie, Aoming Zhang

Abstract:

The degree distance of a graph is a graph invariant that is more sensitive than the Wiener index. In this paper, we calculate the vertex degree distances of one vertex union of the cycle and the star, and the degree distance of one vertex union of the cycle and the star. These results lay a foundation for further study on the extreme value of the vertex degree distances, and the distribution of the vertices with the extreme value in one vertex union of the cycle and the star.

Keywords: degree distance, vertex-degree-distance, one vertex union of a cycle and a star, graph

Procedia PDF Downloads 120
1733 Determination of Optimum Fin Wave Angle and Its Effect on the Performance of an Intercooler

Authors: Mahdi Hamzehei, Seyyed Amin Hakim, Nahid Taherian

Abstract:

Fins play an important role in increasing the efficiency of compact shell and tube heat exchangers by increasing heat transfer. The objective of this paper is to determine the optimum fin wave angle, as one of the geometric parameters affecting the efficiency of the heat exchangers. To this end, finite volume method is used to model and simulate the flow in heat exchanger. In this study, computational fluid dynamics simulations of wave channel are done. The results show that the wave angle affects the temperature output of the heat exchanger.

Keywords: fin wave angle, tube, intercooler, optimum, performance

Procedia PDF Downloads 342
1732 Minimum Vertices Dominating Set Algorithm for Secret Sharing Scheme

Authors: N. M. G. Al-Saidi, K. A. Kadhim, N. A. Rajab

Abstract:

Over the past decades, computer networks and data communication system has been developing fast, so, the necessity to protect a transmitted data is a challenging issue, and data security becomes a serious problem nowadays. A secret sharing scheme is a method which allows a master key to be distributed among a finite set of participants, in such a way that only certain authorized subsets of participants to reconstruct the original master key. To create a secret sharing scheme, many mathematical structures have been used; the most widely used structure is the one that is based on graph theory (graph access structure). Subsequently, many researchers tried to find efficient schemes based on graph access structures. In this paper, we propose a novel efficient construction of a perfect secret sharing scheme for uniform access structure. The dominating set of vertices in a regular graph is used for this construction in the following way; each vertex represents a participant and each minimum independent dominating subset represents a minimal qualified subset. Some relations between dominating set, graph order and regularity are achieved, and can be used to demonstrate the possibility of using dominating set to construct a secret sharing scheme. The information rate that is used as a measure for the efficiency of such systems is calculated to show that the proposed method has some improved values.

Keywords: secret sharing scheme, dominating set, information rate, access structure, rank

Procedia PDF Downloads 361
1731 Effect of Rolling Parameters on Thin Strip Profile in Cold Rolling

Authors: H. B. Tibar, Z. Y. Jiang

Abstract:

In this study, the influence of rolling process parameters such as the work roll cross angle and work roll shifting value on the strip shape and profile of aluminum have been investigated under dry conditions at a speed ratio of 1.3 using Hille 100 experimental mill. The strip profile was found to improve significantly with increase in work roll cross angle from 0o to 1o, with an associated decrease in rolling force. The effect of roll shifting (from 0 to 8mm) was not as significant as the roll cross angle. However, an increase in work roll shifting value achieved a similar decrease in rolling force as that of work roll cross angle. The effect of work roll shifting was also found to be maximum at an optimum roll speed of 0.0986 m/s for the desired thickness. Of all these parameters, the most significant effect of the strip shape profile was observed with variation of work roll cross angle. However, the rolling force can be a significantly reduced by either increasing the the work roll cross angle or work roll shifting.

Keywords: rolling speed ratio, strip shape, work roll cross angle, work roll shifting

Procedia PDF Downloads 381
1730 Application of Directed Acyclic Graphs for Threat Identification Based on Ontologies

Authors: Arun Prabhakar

Abstract:

Threat modeling is an important activity carried out in the initial stages of the development lifecycle that helps in building proactive security measures in the product. Though there are many techniques and tools available today, one of the common challenges with the traditional methods is the lack of a systematic approach in identifying security threats. The proposed solution describes an organized model by defining ontologies that help in building patterns to enumerate threats. The concepts of graph theory are applied to build the pattern for discovering threats for any given scenario. This graph-based solution also brings in other benefits, making it a customizable and scalable model.

Keywords: directed acyclic graph, ontology, patterns, threat identification, threat modeling

Procedia PDF Downloads 107
1729 128-Multidetector CT for Assessment of Optimal Depth of Electrode Array Insertion in Cochlear Implant Operations

Authors: Amina Sultan, Mohamed Ghonim, Eman Oweida, Aya Abdelaziz

Abstract:

Objective: To assess the diagnostic reliability of multi-detector CT in pre and post-operative evaluation of cochlear implant candidates. Material and Methods: The study includes 40 patients (18 males and 22 females); mean age 5.6 years. They were classified into two groups: Group A (20 patients): cochlear implant device was Nucleus-22 and Group B (20 patients): the device was MED-EL. Cochlear length (CL) and cochlear height (CH) were measured pre-operatively by 128-multidetector CT. Electrode length (EL) and insertion depth angle (α) were measured post-operatively by MDCT. Results: For Group A mean CL was 9.1 mm ± 0.4 SD; mean CH was 4.1 ± 0.3 SD; mean EL was 18 ± 2.7 SD; mean α angle was 299.05 ± 37 SD. Significant statistical correlation (P < 0.05) was found between preoperative CL and post-operative EL (r²=0.6); as well as EL and α angle (r²=0.7). Group B's mean CL was 9.1 mm ± 0.3 SD; mean CH was 4.1 ± 0.4 SD; mean EL was 27 ± 2.1 SD; mean α angle was 287.6 ± 41.7 SD. Significant statistical correlation was found between CL and EL (r²= 0.6) and α angle (r²=0.5). Also, a strong correlation was found between EL and α angle (r²=0.8). Significant statistical difference was detected between the two devices as regards to the electrode length. Conclusion: Multidetector CT is a reliable tool for preoperative planning and post-operative evaluation of the outcomes of cochlear implant operations. Cochlear length is a valuable prognostic parameter for prediction of the depth of electrode array insertion which can influence criteria of device selection.

Keywords: angle of insertion (α angle), cochlear implant (CI), cochlear length (CL), Multidetector Computed Tomography (MDCT)

Procedia PDF Downloads 167