Search results for: middle graph
1971 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 2491970 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 1791969 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 1691968 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 5391967 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 1631966 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 3731965 Ex-Post Export Data for Differentiated Products Revealing the Existence of Productcycles
Authors: Ranajoy Bhattcharyya
Abstract:
We estimate international product cycles as shifting product spaces by using 1976 to 2010 UN Comtrade data on all differentiated tradable products in all countries. We use a product space approach to identify the representative product baskets of high-, middle and low-income countries and then use these baskets to identify the patterns of change in comparative advantage of countries over time. We find evidence of a product cycle in two senses: First, high-, middle- and low-income countries differ in comparative advantage, and high-income products migrate to the middle-income basket. A similar pattern is observed for middle- and low-income countries. Our estimation of the lag shows that middle-income countries tend to quickly take up the products of high-income countries, but low-income countries take a longer time absorbing these products. Thus, the gap between low- and middle-income countries is considerably higher than that between middle- and high-income nations.Keywords: product cycle, comparative advantage, representative product basket, ex-post data
Procedia PDF Downloads 4111964 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 3421963 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 1441962 China's Middle East Policy and the Competition with the United States
Authors: Shabnam Dadparvar, Laijin Shen
Abstract:
This paper focuses on China’s policy in the Middle East and the rivalry with the U.S. The question is that what are the main factors on China’s Middle East policy and its competition with the U.S? The hypothesis regards to three effective factors: 'China’s energy dependency' on the Middle East, 'economy' and support for 'stability' in the Middle East. What is important in China’s competition with the U.S regarding to its Middle East policy is the substantial difference in ways of treating the countries of the region; China is committed to Westphalia model based on non-interference in internal affairs of the countries and respect the sovereignty of the governments. However, after 9/11, the U.S is seeking a balance between stability and change through intervention in the international affairs and in some cases is looking for a regime change. From the other hand, China, due to its dependency on the region’s energy welcomes America’s military presence in the region for providing stability. The authors by using a descriptive analytical method try to explain the situation of rivalry between China and the United States in Middle East. China is an 'emerging power' with high economic growth and in demand of more energy supply. The problem is that a rising power in the region is often a source of concern for hegemony.Keywords: China's foreign policy, energy, hegemony, the Middle East
Procedia PDF Downloads 3431961 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 351960 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 1631959 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 1471958 Middle Management Practices and Leadership in Higher Education, Comparative Case Studies of Two Selected Post-1992 UK Universities
Authors: Thouraya Eshami
Abstract:
The aim of this study is to understand, interpret and describe the dynamics of the management and leadership practices with its diverse constituents within the middle management cadre in two selected post-1992 UK universities. The information will be gleaned from interviews conducted with academics who became middle-managers (an AD, SGL and TL) in two selected case Higher Education Institutes. The term middle management is used to describe personnel occupying positions at the level of assistant deans, dean (which also referred to as associate deans), and team leaders.Keywords: academic manager, associate dean, higher education, middle manager, post 1992 universities
Procedia PDF Downloads 4251957 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 3861956 Middle-Level Management Involvement in Strategy Process, and Organizational Performance
Authors: Mazyar Taghavi
Abstract:
This research examines middle-level managers’ involvement in strategy process in 15 manufacturing and service companies in Iran. We considered two dominant theoretical arguments for expecting a positive association. According to the first direction involvement improves organizational performance by improving the quality of strategic decisions. According to the second track, middle managers contribute to increased levels of performance through strategic consensus among them. Results indicate that involvement in the strategy is related to organizational performance. Involvement is associated with consensus (i.e. strategic understanding and commitment) among middle-level managers. However, findings indicate that consensus is not related to the organizational performance.Keywords: middle-level management, strategy process, organizational performance, strategy consensus
Procedia PDF Downloads 4311955 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 1301954 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 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 2271953 QoS-CBMG: A Model for e-Commerce Customer Behavior
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 4051952 The Problems of Current Earth Coordinate System for Earthquake Forecasting Using Single Layer Hierarchical Graph Neuron
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 2081951 GRCNN: Graph Recognition Convolutional Neural Network for Synthesizing Programs from Flow Charts
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 1151950 Mostar Type Indices and QSPR Analysis of Octane Isomers
Authors: B. Roopa Sri, Y Lakshmi Naidu
Abstract:
Chemical Graph Theory (CGT) is the branch of mathematical chemistry in which molecules are modeled to study their physicochemical properties using molecular descriptors. Amongst these descriptors, topological indices play a vital role in predicting the properties by defining the graph topology of the molecule. Recently, the bond-additive topological index known as the Mostar index has been proposed. In this paper, we compute the Mostar-type indices of octane isomers and use the data obtained to perform QSPR analysis. Furthermore, we show the correlation between the Mostar type indices and the properties.Keywords: chemical graph theory, mostar type indices, octane isomers, qspr analysis, topological index
Procedia PDF Downloads 1231949 Mythological Influences on the Works of J. R. R. Tolkien: A Scrutiny of Middle-Earth Stories
Authors: Ali Mohammadi
Abstract:
The present study is an attempt to investigate the influence of mythology on J.R.R. Tolkien's literary works in general and on Middle-Earth in particular. Moreover, despite the fact that mythology is usually regarded as a thing of the past predominantly found in the early works of literature, this inquiry reveals that how modern literary works can artistically benefit from mythological elements of Old English Era so as to enrich their content and stand out as innovative masterpieces. Indeed, having been a philologist and well-acquainted with mythological literature, Tolkien paved the way for a novel understanding of literature by bridging the gap between the old and the new. In the end, it was concluded that had mythology not been utilised by Tolkien, his works, and on top of all, Middle-Earth, would not have turned into a modern literary showpiece.Keywords: literature, Middle-Earth, mythology, Tolkien
Procedia PDF Downloads 1661948 The Language Use of Middle Eastern Freedom Activists' Speeches: A Gender Perspective
Authors: Sulistyaningtyas
Abstract:
Examining the role of Middle Eastern freedom activists’ speech based on gender perspective is considered noteworthy because the society in the Middle East is patriarchal. This research aims to examine the language use of the Middle Eastern freedom activists’ speeches through gender perspective. The data sources are from male and female Middle Eastern freedom activists’ speech videos. In analyzing the data, the theories employed are about Language Style from Gender Perspective and The Language for Speech. The result reveals that there are sets of spoken language differences between male and female speakers. In using the language for speech, both male and female speakers produce metaphor, euphemism, the ‘rule of three’, parallelism, and pronouns in random frequency of production, which cannot be separated by genders. Moreover, it cannot be concluded that one gender is more potential than the other to influence the audience in delivering speech. There are other factors, particularly non-verbal factors, existing to give impacts on how a speech can influence the audience.Keywords: gender perspective, language use, Middle Eastern freedom activists, speech
Procedia PDF Downloads 4131947 China and the Middle East in the 21st Century: From Political Mediation to Economic Expansionism
Authors: Ali Asghar Sotoudeh
Abstract:
Mediation Diplomacy has emerged as one of the main pillars of China's foreign policy goals and practices, and Beijing has established itself as a peacekeeping force in regional conflicts and crises such as Afghanistan, Syria, Sudan, Yemen, and the Arab-Israeli peace process. China is deepening and intensifying its diplomatic interventions in the Middle East and trying to shape the security and political developments in the Middle East. On the other hand, economically, China has become one of the most important trading partners with Middle Eastern governments. China is also seeking to expand its foreign policy and economic interests in the Middle East through the New Silk Road initiative and has signed cooperation agreements with 17 Arab countries. In this regard, due to the importance of the subject, this research focuses on answering this question; what is the basis of China's political mediation and economic expansionism in the Middle East? In parallel with this question, this study follows the hypothesis that the mediating role of peace is a legitimate way for China to intervene in Middle East political crises, Without causing China to deviate from its traditional guiding principles based on non-interference in the internal affairs of other actors in the international system. This policy also promotes the security of economic interests and increases the country's political influence in the Middle East. The research method is descriptive-analytical based on the qualitative method, and the data collection method is library and internet resources.Keywords: China, middle east, political mediation, economic expansionism
Procedia PDF Downloads 1371946 Drug-Drug Interaction Prediction in Diabetes Mellitus
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 911945 Scheduling in Cloud Networks Using Chakoos Algorithm
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 531944 Nonlinear Evolution on Graphs
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 1381943 Application of Metric Dimension of Graph in Unraveling the Complexity of Hyperacusis
Authors: Hassan Ibrahim
Abstract:
The prevalence of hyperacusis, an auditory condition characterized by heightened sensitivity to sounds, continues to rise, posing challenges for effective diagnosis and intervention. It is believed that this work deepens will deepens the understanding of hyperacusis etiology by employing graph theory as a novel analytical framework. We constructed a comprehensive graph wherein nodes represent various factors associated with hyperacusis, including aging, head or neck trauma, infection/virus, depression, migraines, ear infection, anxiety, and other potential contributors. Relationships between factors are modeled as edges, allowing us to visualize and quantify the interactions within the etiological landscape of hyperacusis. it employ the concept of the metric dimension of a connected graph to identify key nodes (landmarks) that serve as critical influencers in the interconnected web of hyperacusis causes. This approach offers a unique perspective on the relative importance and centrality of different factors, shedding light on the complex interplay between physiological, psychological, and environmental determinants. Visualization techniques were also employed to enhance the interpretation and facilitate the identification of the central nodes. This research contributes to the growing body of knowledge surrounding hyperacusis by offering a network-centric perspective on its multifaceted causes. The outcomes hold the potential to inform clinical practices, guiding healthcare professionals in prioritizing interventions and personalized treatment plans based on the identified landmarks within the etiological network. Through the integration of graph theory into hyperacusis research, the complexity of this auditory condition was unraveled and pave the way for more effective approaches to its management.Keywords: auditory condition, connected graph, hyperacusis, metric dimension
Procedia PDF Downloads 231942 Modeling and Simulation of a Cycloconverter with a Bond Graph Approach
Authors: Gerardo Ayala-Jaimes, Gilberto Gonzalez-Avalos, Allen A. Castillo, Alejandra Jimenez
Abstract:
The modeling of a single-phase cycloconverter in Bond Graph is presented, which includes an alternating current power supply, hybrid dynamics, switch control, and resistive load; this approach facilitates the integration of systems across different energy domains and structural analysis. Cycloconverters, used in motor control, demonstrate the viability of graphical modeling. The use of Bonds is proposed to model the hybrid interaction of the system, and the results are displayed through simulations using 20Sim and Multisim software. The motivation behind developing these models with a graphical approach is to design and build low-cost energy converters, thereby making the main contribution of this document the modeling and simulation of a single-phase cycloconverter.Keywords: bond graph, hybrid system, rectifier, cycloconverter, modelling
Procedia PDF Downloads 22