Search results for: bond graph (BG)

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 150

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 517

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 141

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 345

Authors: Firas Al-Mahmoud, Jean-Michel Mechling, Mohamed Shaban

Abstract:

The long-term durability of fibre reinforced polymer (FRP) composites is often stated as being the main reason for the use of these materials. Indeed, structures externally or Near Surface Mounted (NSM) reinforced with Carbon Fibre Reinforcement Polymer CFRP are often in contact with temperature cycles and salt water immersion and other environmental conditions that reduce the expected durability of the system. Bond degradation is a frequent cause of premature failure of structural elements and environmental conditions are known to relate to such failures. The purpose of this study is to investigate the effect of environmental exposure on the bond for different CFRP strengthening systems. Bending tests were conducted to evaluate the bond with and without environmental exposure. The specimens were strengthened with CFRP sheets, CFRP plates and NSM CFRP rods embedded in two filling materials: epoxy resin and mortar. Then, they were exposed to up to 300 freeze–thaw cycles. One freeze–thaw cycle consisted of four stages according to ASTM or immersed in 3.5% salted tap water. A total of thirty-six specimens were prepared for this purpose. Results showed a decrease in ultimate bond strength for specimens strengthened by CFRP sheets that were immersed in salt water for 120 days, while a reduction was shown for CFRP sheet and plate bonded specimens that were subjected to 300 freeze–thaw cycles. Exposing NSM CFRP rod strengthened specimens, embedded in resin or mortar, to freeze–thaw cycles or to immersion in salt water does not affect the bond strength.

Keywords: durability, strengthening, FRP, bond, freeze–thaw

Procedia PDF Downloads 319

Authors: Deog-Gyu Seo, Jin-Soo Ahn

Abstract:

Objectives: Recently, the development of adhesive primers on stable bonding between zirconia and resin cement has been on the increase. The bond strength of zirconia-resin cement can be effectively increased with the treatment of primer composed of the adhesive monomer that can chemically bond with the oxide layer, which forms on the surface of zirconia. 10-methacryloyloxydecyl dihydrogen phosphate (10-MDP) that contains phosphate ester and acidic monomer 4-methacryloxyethyl trimellitic anhydride(4-META) have been suggested as monomers that can form chemical bond with the surface oxide layer of zirconia. Also, these suggested monomers have proved to be effective zirconia surface treatment for bonding to resin cement. The purpose of this study is to evaluate the effects of primer treatment on the bond strength of Zirconia-resin cement by using three different kinds of primers on the market. Methods: Zirconia blocks were prepared into 60 disk-shaped specimens by using a diamond saw. Specimens were divided into four different groups: first three groups were treated with zirconiaLiner(Sun Medical Co., Ltd., Furutaka-cho, Moriyama, Shiga, Japan), Alloy primer (Kuraray Noritake Dental Inc., Sakaju, Kurashiki, Okayama, Japan), and Universal primer (Tokuyama dental Corp., Taitou, Taitou-ku, Tokyo, Japan) respectively. The last group was the control with no surface treatment. Dual cured resin cement (Biscem, Bisco Inc., Schaumburg, IL, USA) was luted to each group of specimens. And then, shear bond strengths were measured by universal tesing machine. The significance of the result was statistically analyzed by one-way ANOVA and Tukey test. The failure sites in each group were inspected under a magnifier. Results: Mean shear bond strength were 0.60, 1.39, 1.03, 1.38 MPa for control, Zirconia Liner (ZL), Alloy primer (AP), Universal primer (UP), respectively. Groups with application of each of the three primers showed significantly higher shear bond strength compared to the control group (p < 0.05). Among the three groups with the treatment, ZL and UP showed significantly higher shear bond strength than AP (p < 0.05), and there were no significant differences in mean shear bond strength between ZL and UP (p < 0.05). While the most specimens of control groups showed adhesive failure (80%), the most specimens of three primer-treated groups showed cohesive or mixed failure (80%).

Keywords: primer, resin cement, shear bond strength, zirconia

Procedia PDF Downloads 172

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 122

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 12

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 139

Authors: Jeong-Min Lee, Hyunwoo Song, Yonseok Kim, Junghan Yun, Jungin Byun, Jae-Mean Koo, Chang-Sung Seok

Abstract:

The Thermal Barrier Coating (TBC) prevents heat directly transferring from the high-temperature flame to the substrate. Top coat and bond coat compose the TBC and top coat consists of a ceramic and bond coat increases adhesion between the top coat and the substrate. The TBC technology drops the substrate surface temperature by about 150~200°C. In addition, the TBC system has a cooling system to lower the blade temperature by the air flow inside the blade. Then, as a result, the thermal gradient occurs inside the blade by cooling. Also, the internal stress occurs due to the difference in thermal expansion. In this paper, the finite element analyses (FEA) were performed and stress changes were derived according to the thermal gradient of the TBC system. The stress was increased due to the cooling, but difference of the stress between the top coat and bond coat was decreased. So, delamination in the interface between top coat and bond coat.

Keywords: gas turbine blade, Thermal Barrier Coating (TBC), thermal gradient, Finite Element Analysis (FEA)

Procedia PDF Downloads 579

Authors: Thomas Gerstner, Bastian von Harrach, Daniel Roth

Abstract:

The Monte Carlo pathwise sensitivities approach is well established for smooth payoff functions. In this work, we present a new Monte Carlo algorithm that is able to calculate the pathwise sensitivities for discontinuous payoff functions. Our main tool is the one-step survival idea of Glasserman and Staum. Although this technique yields to new terms per observation, while differentiating, the algorithm is still efficient. As an application, we use the results for a two-dimensional calibration of a Coco-Bond, which we model with different types of discretely monitored barrier options.

Keywords: Monte Carlo, discretely monitored barrier options, pathwise sensitivities, Coco-Bond

Procedia PDF Downloads 328

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 122

Authors: C. R. Danielle, S. Erik, T. Patrick, M. Hugh

Abstract:

In the last decade there has been an increase in demand for fine grinding due to the depletion of coarse-grained orebodies and an increase of processing fine disseminated minerals and complex orebodies. These ores have provided new challenges in concentrator design because fine and ultra-fine grinding is required to achieve acceptable recovery rates. Therefore, the correct design of a grinding circuit is important for minimizing unit costs and increasing product quality. The use of ball mills for grinding in fine size ranges is inefficient and, therefore, vertical stirred grinding mills are becoming increasingly popular in the mineral processing industry due to its already known high energy efficiency. This work presents a hypothesis of a methodology to predict the product size distribution of a vertical stirred mill using a Bond ball mill. The Population Balance Model (PBM) was used to empirically analyze the performance of a vertical mill and a Bond ball mill. The breakage parameters obtained for both grinding mills are compared to determine the possibility of predicting the product size distribution of a vertical mill based on the results obtained from the Bond ball mill. The biggest advantage of this methodology is that most of the minerals processing laboratories already have a Bond ball mill to perform the tests suggested in this study. Preliminary results show the possibility of predicting the performance of a laboratory vertical stirred mill using a Bond ball mill.

Keywords: bond ball mill, population balance model, product size distribution, vertical stirred mill

Procedia PDF Downloads 250

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 363

Authors: Rajkamal Kumar, Sudhir Mishra

Abstract:

The connections between various elements of concrete structures play a vital role in determining the durability of structures. These connections produce discontinuities and to ensure the monolithic behavior of structures, these connections should be carefully designed. The connections between concrete layers may occur in various situations such as structure repairing and rehabilitation or construction of huge structures with cast-in-situ or pre-cast elements, etc. Bond strength at the interface of these concrete layers should be able to prevent the progressive slip from taking place and it should also ensure satisfactory performance of the structure. Different approaches to enhance the bond strength at interface have been a major area of research. Nowadays, micro-concrete is getting popular as a repair material. Under this ambit, this paper aims to present the experimental results of connections between concrete layers of different age with artificial indentation at interface with two types of repair material: Concrete with same parent concrete composition and ready-mix mortar (micro-concrete), artificial indentations (grooves and holes) were made on the old layer of concrete to increase the bond strength. Curing plays an important role in determining the bond strength. Optimum duration for curing have also been discussed for each type of repair material. Different types of failure patterns have also been mentioned.

Keywords: adhesion, cohesion, compressive stress, micro-concrete, shear stress, slant shear test

Procedia PDF Downloads 304

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 110

Authors: Ziba Talaeizadeh, Taghi Ebadi

Abstract:

Hospitals and medical centers generate a wide array of infectious waste on a daily basis, leading to pressing environmental concerns associated with proper disposal. Disposable plastic items and spun-bond clothing, commonly made from polypropylene, pose a significant risk of disease transmission, necessitating specialized waste management strategies. Incorporating these materials into bituminous asphalt production offers a potential solution, as it can modify asphalt mixtures and reduce susceptibility to cracking. This study aims to assess the crack resistance of asphalt mixtures modified with hospital spun-bond waste. Asphalt mixtures were prepared using the Marshall method, with spun-bond waste added in varying proportions (5% to 20%). The Semi-Circular Bending (SCB) test was conducted to evaluate asphalt fracture behavior under Mode I loading at controlled speeds of 5, 20, and 50 millimeters per minute and an average temperature of 25°C. Parameters such as fracture energy (FE) and Crack Resistance Index (CRI) were quantified. The results indicate that the addition of 10% to 15% spun-bond polypropylene polymer enhances the performance of the modified mixture, resulting in an 18% increase in fracture energy and an 11% reduction in cracking stiffness compared to the control sample. Further investigations involving factors like compaction level, bitumen type, and aggregate grading are recommended to address medical waste management and mitigate asphalt pavement cracking issues.

Keywords: asphalt cracking, hospital waste, semi-circular bending test, spun-bond

Procedia PDF Downloads 36

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 graphs 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 improved 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 a better and more efficient inference effect by introducing PPO into knowledge inference technology.

Keywords: reinforcement learning, PPO, knowledge inference

Procedia PDF Downloads 198

Authors: Hoda Ghavamipoor, S. Alireza Hashemi Golpayegani

Abstract:

An approach to model the customer interaction with e-commerce websites is presented. Considering the service quality level as a predictive feature, we offer an improved method based on the Customer Behavior Model Graph (CBMG), a state-transition graph model. To derive the Quality of Service sensitive-CBMG (QoS-CBMG) model, process-mining techniques is applied to pre-processed website server logs which are categorized as ‘buy’ or ‘visit’. Experimental results on an e-commerce website data confirmed that the proposed method outperforms CBMG based method.

Keywords: customer behavior model, electronic commerce, quality of service, customer behavior model graph, process mining

Procedia PDF Downloads 380

Authors: Benny Benyamin Nasution, Rahmat Widia Sembiring, Abdul Rahman Dalimunthe, Nursiah Mustari, Nisfan Bahri, Berta br Ginting, Riadil Akhir Lubis, Rita Tavip Megawati, Indri Dithisari

Abstract:

The earth coordinate system is an important part of an attempt for earthquake forecasting, such as the one using Single Layer Hierarchical Graph Neuron (SLHGN). However, there are a number of problems that need to be worked out before the coordinate system can be utilized for the forecaster. One example of those is that SLHGN requires that the focused area of an earthquake must be constructed in a grid-like form. In fact, within the current earth coordinate system, the same longitude-difference would produce different distances. This can be observed at the distance on the Equator compared to distance at both poles. To deal with such a problem, a coordinate system has been developed, so that it can be used to support the ongoing earthquake forecasting using SLHGN. Two important issues have been developed in this system: 1) each location is not represented through two-value (longitude and latitude), but only a single value, 2) the conversion of the earth coordinate system to the x-y cartesian system requires no angular formulas, which is therefore fast. The accuracy and the performance have not been measured yet, since earthquake data is difficult to obtain. However, the characteristics of the SLHGN results show a very promising answer.

Keywords: hierarchical graph neuron, multidimensional hierarchical graph neuron, single layer hierarchical graph neuron, natural disaster forecasting, earthquake forecasting, earth coordinate system

Procedia PDF Downloads 191

Authors: Zou Xuan, Liu Hongchen

Abstract:

The ideal dentin desensitizing agent should not only have good biological safety, simple clinical operation mode, the superior treatment effect, but also should have a durable effect to resist the oral environmental temperature change and oral mechanical abrasion, so as to achieve a persistent desensitization effect. Also, when using desensitizing agent to prevent the post-operative hypersensitivity, we should not only prevent it from affecting crowns’ retention, but must understand its effects on bond strength of dentin adhesives. There are various of desensitizers and dentin adhesives in clinical treatment. They have different chemical or physical properties. Whether the use of desensitizing agent would affect the bond strength of dentin adhesives still need further research. In this in vitro study, we built the hypersensitive dentin model and post-operative dentin model, to evaluate the sealing effects and durability on exposed tubule by three different dentin desensitizers and to evaluate the sealing effects and the bond strength of dentin adhesives after using three different dentin desensitizers on post-operative dentin. The result of this study could provide some important references for clinical use of dentin desensitizing agent. 1. As to the three desensitizers, the hypersensitive dentin model was built to evaluate their sealing effects on exposed tubule by SEM observation and dentin permeability analysis. All of them could significantly reduce the dentin permeability. 2. Test specimens of three groups treated by desensitizers were subjected to aging treatment with 5000 times thermal cycling and toothbrush abrasion, and then dentin permeability was measured to evaluate the sealing durability of these three desensitizers on exposed tubule. The sealing durability of three groups were different. 3. The post-operative dentin model was built to evaluate the sealing effects of the three desensitizers on post-operative dentin by SEM and methylene blue. All of three desensitizers could reduce the dentin permeability significantly. 4. The influences of three desensitizers on the bonding efficiency of total-etch and self-etch adhesives were evaluated with the micro-tensile bond strength study and bond interface morphology observation. The dentin bond strength for Green or group was significantly lower than the other two groups (P<0.05).

Keywords: dentin, desensitizer, dentin permeability, thermal cycling, micro-tensile bond strength

Procedia PDF Downloads 369

Authors: Lin Cheng, Zijiang Yang

Abstract:

Program synthesis is the task to automatically generate programs based on user specification. In this paper, we present a framework that synthesizes programs from flow charts that serve as accurate and intuitive specification. In order doing so, we propose a deep neural network called GRCNN that recognizes graph structure from its image. GRCNN is trained end-to-end, which can predict edge and node information of the flow chart simultaneously. Experiments show that the accuracy rate to synthesize a program is 66.4%, and the accuracy rates to recognize edge and node are 94.1% and 67.9%, respectively. On average, it takes about 60 milliseconds to synthesize a program.

Keywords: program synthesis, flow chart, specification, graph recognition, CNN

Procedia PDF Downloads 96

Authors: Jongho Park, Taekyun Kim, Jinwoong Choi, Sungnam Hong, Sun-Kyu Park

Abstract:

Recently, the climate change is the one of the main problems. This abnormal phenomenon is consisted of the scorching heat, heavy rain and snowfall, and cold wave that will be enlarged abnormal climate change repeatedly. Accordingly, the width of temperature change is increased more and more by abnormal climate, and it is the main factor of cracking in the reinforced concrete. The crack of the reinforced concrete will affect corrosion of steel re-bar which can decrease durability of the structure easily. Hence, the elimination of the durability weakening factor (steel re-bar) is needed. Textile which weaves the carbon, AR-glass and aramid fiber has been studied actively for exchanging the steel re-bar in the Europe for about 15 years because of its good durability. To apply textile as the concrete reinforcement, the bond strength between concrete and textile will be investigated closely. Therefore, in this paper, pull-out test was performed with change of development length of textile. Significant load and stress was increasing at D80. But, bond stress decreased by increasing development length.

Keywords: bond strength, climate change, pull-out test, substitution of reinforcement material, textile

Procedia PDF Downloads 451

Authors: Nasser Ghassembaglou, Abdullah Bolek, Oktay Yilmaz, Ertan Oznergiz, Hikmet Kocabas, Safak Yilmaz

Abstract:

Nanofibers are effective material which have frequently been investigated to produce high quality air filters. As an environmental approach our aim is to achieve nanofibers by melting. In spun-bond systems extruder, spin-pump, nozzle package and attenuator are used. Molten polymer which flows from extruder is made steady by spin-pump. Regular melt passes through nozzle holes and forms fibers under high pressure. The fibers pulled from nozzle are shrunk to micron size by an attenuator, after solidification they are collected on a conveyor. In this research different designs of attenuator system have been studied and also CFD analysis have been done on them. Afterwards, one of these designs tested and finally some optimizations have been done to reduce pressure loss and increase air velocity.

Keywords: attenuator, nanofiber, spun-bond, extruder

Procedia PDF Downloads 386

Authors: Rashini Maduka, C. R. Wijesinghe, A. R. Weerasinghe

Abstract:

Drug-drug interactions (DDIs) can happen when two or more drugs are taken together. Today DDIs have become a serious health issue due to adverse drug effects. In vivo and in vitro methods for identifying DDIs are time-consuming and costly. Therefore, in-silico-based approaches are preferred in DDI identification. Most machine learning models for DDI prediction are used chemical and biological drug properties as features. However, some drug features are not available and costly to extract. Therefore, it is better to make automatic feature engineering. Furthermore, people who have diabetes already suffer from other diseases and take more than one medicine together. Then adverse drug effects may happen to diabetic patients and cause unpleasant reactions in the body. In this study, we present a model with a graph convolutional autoencoder and a graph decoder using a dataset from DrugBank version 5.1.3. The main objective of the model is to identify unknown interactions between antidiabetic drugs and the drugs taken by diabetic patients for other diseases. We considered automatic feature engineering and used Known DDIs only as the input for the model. Our model has achieved 0.86 in AUC and 0.86 in AP.

Keywords: drug-drug interaction prediction, graph embedding, graph convolutional networks, adverse drug effects

Procedia PDF Downloads 63

Authors: Masoumeh Ali Pouri, Hamid Haj Seyyed Javadi

Abstract:

Nowadays, cloud processing is one of the important issues in information technology. Since scheduling of tasks graph is an NP-hard problem, considering approaches based on undeterminisitic methods such as evolutionary processing, mostly genetic and cuckoo algorithms, will be effective. Therefore, an efficient algorithm has been proposed for scheduling of tasks graph to obtain an appropriate scheduling with minimum time. In this algorithm, the new approach is based on making the length of the critical path shorter and reducing the cost of communication. Finally, the results obtained from the implementation of the presented method show that this algorithm acts the same as other algorithms when it faces graphs without communication cost. It performs quicker and better than some algorithms like DSC and MCP algorithms when it faces the graphs involving communication cost.

Keywords: cloud computing, scheduling, tasks graph, chakoos algorithm

Procedia PDF Downloads 30

Authors: Benniche Omar

Abstract:

We are concerned with abstract fully nonlinear differential equations having the form y’(t)=Ay(t)+f(t,y(t)) where A is an m—dissipative operator (possibly multi—valued) defined on a subset D(A) of a Banach space X with values in X and f is a given function defined on I×X with values in X. We consider a graph K in I×X. We recall that K is said to be viable with respect to the above abstract differential equation if for each initial data in K there exists at least one trajectory starting from that initial data and remaining in K at least for a short time. The viability problem has been studied by many authors by using various techniques and frames. If K is closed, it is shown that a tangency condition, which is mainly linked to the dynamic, is crucial for viability. In the case when X is infinite dimensional, compactness and convexity assumptions are needed. In this paper, we are concerned with the notion of near viability for a given graph K with respect to y’(t)=Ay(t)+f(t,y(t)). Roughly speaking, the graph K is said to be near viable with respect to y’(t)=Ay(t)+f(t,y(t)), if for each initial data in K there exists at least one trajectory remaining arbitrary close to K at least for short time. It is interesting to note that the near viability is equivalent to an appropriate tangency condition under mild assumptions on the dynamic. Adding natural convexity and compactness assumptions on the dynamic, we may recover the (exact) viability. Here we investigate near viability for a graph K in I×X with respect to y’(t)=Ay(t)+f(t,y(t)) where A and f are as above. We emphasis that the t—dependence on the perturbation f leads us to introduce a new tangency concept. In the base of a tangency conditions expressed in terms of that tangency concept, we formulate criteria for K to be near viable with respect to y’(t)=Ay(t)+f(t,y(t)). As application, an abstract null—controllability theorem is given.

Keywords: abstract differential equation, graph, tangency condition, viability

Procedia PDF Downloads 116

Authors: Jake Gonzalez, Tommy Dang

Abstract:

This paper proposes a temporal graph approach to visualize and analyze the evolution of gene relationships and nomenclature over time. An interactive web-based tool implements this temporal graph, enabling researchers to traverse a timeline and observe coupled dynamics in network topology and naming conventions. Analysis of a real human genomic dataset reveals the emergence of densely interconnected functional modules over time, representing groups of genes involved in key biological processes. For example, the antimicrobial peptide DEFA1A3 shows increased connections to related alpha-defensins involved in infection response. Tracking degree and betweenness centrality shifts over timeline iterations also quantitatively highlight the reprioritization of certain genes’ topological importance as knowledge advances. Examination of the CNR1 gene encoding the cannabinoid receptor CB1 demonstrates changing synonymous relationships and consolidating naming patterns over time, reflecting its unique functional role discovery. The integrated framework interconnecting these topological and nomenclature dynamics provides richer contextual insights compared to isolated analysis methods. Overall, this temporal graph approach enables a more holistic study of knowledge evolution to elucidate complex biology.

Keywords: temporal graph, gene relationships, nomenclature evolution, interactive visualization, biological insights

Procedia PDF Downloads 32

Authors: Yangsu Kwon, Hyo-Gyoung Kwak

Abstract:

Nonlinear tendon constitutive model for nonlinear analysis of pre-stressed concrete structures are presented. Since the post-cracking behavior of concrete structures, in which bonded reinforcements such as tendons and/or reinforcing steels are embedded, depends on many influencing factors(the tensile strength of concrete, anchorage length of reinforcements, concrete cover, and steel spacing) that are deeply related to the bond characteristics between concrete and reinforcements, consideration of the tension stiffening effect on the basis of the bond-slip mechanism is necessary to evaluate ultimate resisting capacity of structures. In this paper, an improved tendon model, which considering the slip effect between concrete and tendon, and effect of tension stiffening, is suggested. The validity of the proposed models is established by comparing between the analytical results and experimental results in pre-stressed concrete beams.

Keywords: bond-slip, prestressed concrete, tendon, ultimate strength

Procedia PDF Downloads 469

Authors: Yaw-Ling Lin

Abstract:

A de Bruijn graph of order k is a graph whose vertices representing all length-k sequences with edges joining pairs of vertices whose sequences have maximum possible overlap (length k−1). Every Hamiltonian cycle of this graph defines a distinct, minimum length de Bruijn sequence containing all k-mers exactly once. A Kautz sequence is the minimal generating sequence so as the sequence of minimal length that produces all possible length-k sequences with the restriction that every two consecutive alphabets in the sequences must be different. A collection of de Bruijn/Kautz sequences are orthogonal if any two sequences are of maximally differ in sequence composition; that is, the maximum length of their common substring is k. In this paper, we discuss how such a collection of (maximal) orthogonal de Bruijn/Kautz sequences can be made and use the algorithm to build up a web application service for the synthesized DNA and other related biomolecular sequences.

Keywords: biomolecular sequence synthesis, de Bruijn sequences, Eulerian cycle, Hamiltonian cycle, Kautz sequences, orthogonal sequences

Procedia PDF Downloads 125