Search results for: neighborhood corona graph

Authors: Puttaswamy, Anwar Alwardi, Nayaka S. R.

Abstract:

One of the algebraic representation of a graph is the graph polynomial. In this article, we introduce the paired-domination polynomial of a graph G. The paired-domination polynomial of a graph G of order n is the polynomial Dp(G, x) with the coefficients dp(G, i) where dp(G, i) denotes the number of paired dominating sets of G of cardinality i and γpd(G) denotes the paired-domination number of G. We obtain some properties of Dp(G, x) and its coefficients. Further, we compute this polynomial for some families of standard graphs. Further, we obtain some characterization for some specific graphs.

Keywords: domination polynomial, paired dominating set, paired domination number, paired domination polynomial

Procedia PDF Downloads 232

Authors: T. Pathinathan, M. Peter

Abstract:

Fuzzy graphs incorporate concepts from graph theory with fuzzy principles. In this paper, we make a study on the properties of fuzzy graphs which are non-cyclic and are of two-dimensional in structure. In particular, this paper presents 2D structure or the structure of double layer for a non-cyclic fuzzy graph whose underlying crisp graph is non-cyclic. In any graph structure, introducing 2D structure may lead to an inherent cycle. We propose relevant conditions for 2D structured non-cyclic fuzzy graphs. These conditions are extended even to fuzzy graphs of the 3D structure. General theoretical properties that are studied for any fuzzy graph are verified to 2D structured or double layered fuzzy graphs. Concepts like Order, Degree, Strong and Size for a fuzzy graph are studied for 2D structured or double layered non-cyclic fuzzy graphs. Using different types of fuzzy graphs, the proposed concepts relating to 2D structured fuzzy graphs are verified.

Keywords: double layered fuzzy graph, double layered non–cyclic fuzzy graph, order, degree and size

Procedia PDF Downloads 402

Authors: Ezgi Kaya, A. Dilek Maden

Abstract:

A topological index is a number related to graph which is invariant under graph isomorphism. In theoretical chemistry, molecular structure descriptors (also called topological indices) are used for modeling physicochemical, pharmacologic, toxicologic, biological and other properties of chemical compounds. Let G be a graph with n vertices and m edges. For a given edge uv, the quantity nu(e) denotes the number of vertices closer to u than v, the quantity nv(e) is defined analogously. The vertex PI index defined as the sum of the nu(e) and nv(e). Here the sum is taken over all edges of G. The energy of a graph is defined as the sum of the eigenvalues of adjacency matrix of G and the Laplacian energy of a graph is defined as the sum of the absolute value of difference of laplacian eigenvalues and average degree of G. In theoretical chemistry, the π-electron energy of a conjugated carbon molecule, computed using the Hückel theory, coincides with the energy. Hence results on graph energy assume special significance. The Laplacian matrix of a graph G weighted by the vertex PI weighting is the Laplacian vertex PI matrix and the Laplacian vertex PI eigenvalues of a connected graph G are the eigenvalues of its Laplacian vertex PI matrix. In this study, Laplacian vertex PI energy of a graph is defined of G. We also give some bounds for the Laplacian vertex PI energy of graphs in terms of vertex PI index, the sum of the squares of entries in the Laplacian vertex PI matrix and the absolute value of the determinant of the Laplacian vertex PI matrix.

Keywords: energy, Laplacian energy, laplacian vertex PI eigenvalues, Laplacian vertex PI energy, vertex PI index

Procedia PDF Downloads 245

Authors: Stefan Wagenpfeil, Felix Engel, Paul McKevitt, Matthias Hemmje

Abstract:

Multimedia Indexing and Retrieval is generally designed and implemented by employing feature graphs. These graphs typically contain a significant number of nodes and edges to reflect the level of detail in feature detection. A higher level of detail increases the effectiveness of the results but also leads to more complex graph structures. However, graph-traversal-based algorithms for similarity are quite inefficient and computation intensive, especially for large data structures. To deliver fast and effective retrieval, an efficient similarity algorithm, particularly for large graphs, is mandatory. Hence, in this paper, we define a graph-projection into a 2D space (Graph Code) as well as the corresponding algorithms for indexing and retrieval. We show that calculations in this space can be performed more efficiently than graph-traversals due to a simpler processing model and a high level of parallelization. In consequence, we prove that the effectiveness of retrieval also increases substantially, as Graph Codes facilitate more levels of detail in feature fusion. Thus, Graph Codes provide a significant increase in efficiency and effectiveness (especially for Multimedia indexing and retrieval) and can be applied to images, videos, audio, and text information.

Keywords: indexing, retrieval, multimedia, graph algorithm, graph code

Procedia PDF Downloads 161

Authors: Xianwei Zheng, Yuan Yan Tang

Abstract:

Classical window Fourier transform has been widely used in signal processing, image processing, machine learning and pattern recognition. The related Gabor transform is powerful enough to capture the texture information of any given dataset. Recently, in the emerging field of graph signal processing, researchers devoting themselves to develop a graph signal processing theory to handle the so-called graph signals. Among the new developing theory, windowed graph Fourier transform has been constructed to establish a time-frequency analysis framework of graph signals. The windowed graph Fourier transform is defined by using the translation and modulation operators of graph signals, following the similar calculations in classical windowed Fourier transform. Specifically, the translation and modulation operators of graph signals are defined by using the Laplacian eigenvectors as follows. For a given graph signal, its translation is defined by a similar manner as its definition in classical signal processing. Specifically, the translation operator can be defined by using the Fourier atoms; the graph signal translation is defined similarly by using the Laplacian eigenvectors. The modulation of the graph can also be established by using the Laplacian eigenvectors. The windowed graph Fourier transform based on these two operators has been applied to obtain time-frequency representations of graph signals. Fundamentally, the modulation operator is defined similarly to the classical modulation by multiplying a graph signal with the entries in each Fourier atom. However, a single Laplacian eigenvector entry cannot play a similar role as the Fourier atom. This definition ignored the relationship between the translation and modulation operators. In this paper, a new definition of the modulation operator is proposed and thus another time-frequency framework for graph signal is constructed. Specifically, the relationship between the translation and modulation operations can be established by the Fourier transform. Specifically, for any signal, the Fourier transform of its translation is the modulation of its Fourier transform. Thus, the modulation of any signal can be defined as the inverse Fourier transform of the translation of its Fourier transform. Therefore, similarly, the graph modulation of any graph signal can be defined as the inverse graph Fourier transform of the translation of its graph Fourier. The novel definition of the graph modulation operator established a relationship of the translation and modulation operations. The new modulation operation and the original translation operation are applied to construct a new framework of graph signal time-frequency analysis. Furthermore, a windowed graph Fourier frame theory is developed. Necessary and sufficient conditions for constructing windowed graph Fourier frames, tight frames and dual frames are presented in this paper. The novel graph signal time-frequency analysis framework is applied to signals defined on well-known graphs, e.g. Minnesota road graph and random graphs. Experimental results show that the novel framework captures new features of graph signals.

Keywords: graph signals, windowed graph Fourier transform, windowed graph Fourier frames, vertex frequency analysis

Procedia PDF Downloads 342

Authors: Zhihao Zheng, Zhilin Wang, Linxin Liu

Abstract:

In the research of automated knowledge question-answering systems, accuracy and efficiency are critical challenges. This paper proposes a knowledge graph-enhanced Retrieval-Augmented Generation (RAG) method, combined with a Graph Neural Network (GNN) structure, to automatically determine the correctness of knowledge competition questions. First, a domain-specific knowledge graph was constructed from a large corpus of academic journal literature, with key entities and relationships extracted using Natural Language Processing (NLP) techniques. Then, the RAG method's retrieval module was expanded to simultaneously query both text databases and the knowledge graph, leveraging the GNN to further extract structured information from the knowledge graph. During answer generation, contextual information provided by the knowledge graph and GNN is incorporated to improve the accuracy and consistency of the answers. Experimental results demonstrate that the knowledge graph and GNN-enhanced RAG method perform excellently in determining the correctness of questions, achieving an accuracy rate of 95%. Particularly in cases involving ambiguity or requiring contextual information, the structured knowledge provided by the knowledge graph and GNN significantly enhances the RAG method's performance. This approach not only demonstrates significant advantages in improving the accuracy and efficiency of automated knowledge question-answering systems but also offers new directions and ideas for future research and practical applications.

Keywords: knowledge graph, graph neural network, retrieval-augmented generation, NLP

Procedia PDF Downloads 41

Authors: Zainab Yasir Abed Al-Rekaby, Abdul Jalil M. Khalaf

Abstract:

Let the vertices of a graph such that every two adjacent vertices have different color is a very common problem in the graph theory. This is known as proper coloring of graphs. The possible number of different proper colorings on a graph with a given number of colors can be represented by a function called the chromatic polynomial. Two graphs G and H are said to be chromatically equivalent, if they share the same chromatic polynomial. A Graph G is chromatically unique, if G is isomorphic to H for any graph H such that G is chromatically equivalent to H. The study of chromatically equivalent and chromatically unique problems is called chromaticity. This paper shows that a wheel W12 is chromatically unique.

Keywords: chromatic polynomial, chromatically equivalent, chromatically unique, wheel

Procedia PDF Downloads 431

Authors: Omar Dib, Alexandre Caminada, Marie-Ange Manier

Abstract:

The purpose of this study is to introduce a novel approach to solve the one-to-one shortest path problem. A directed connected graph is assumed in which all edges’ weights are positive. Our method is based on a memetic algorithm in which we combine a genetic algorithm (GA) and a variable neighborhood search method (VNS). We compare our approximate method with two exact algorithms Dijkstra and Integer Programming (IP). We made experimentations using random generated, complete and real graph instances. In most case studies, numerical results show that our method outperforms exact methods with 5% average gap to the optimality. Our algorithm’s average speed is 20-times faster than Dijkstra and more than 1000-times compared to IP. The details of the experimental results are also discussed and presented in the paper.

Keywords: shortest path problem, Dijkstra’s algorithm, integer programming, memetic algorithm

Procedia PDF Downloads 467

Authors: Elif Aksel, Çagrı Imamoglu

Abstract:

This ongoing study aims to investigate the effects of neighborhood location on place attachment and residential satisfaction. Place attachment will be examined by comparing place of residence in different areas of the city. Furthermore, the relationship between neighborhood and residential satisfaction will be investigated in terms of physical and social aspects of the places influencing residential satisfaction. This study will be carried out in two different districts of Ankara which are Çankaya, located in the city center, and Sincan, a suburb. Two-hundred adult respondents will participate in this research; 100 men and 100 women aged between 18-65 years with different socio-economic status using snowball sampling. A place attachment scale and a questionnaire related with residential satisfaction, including open-ended questions and 7-point Likert type scale, will be used as instruments. Apart from these, demographic information of the participants such as gender, age, education, the length of residence will be collected. The findings of the study are expected to demonstrate that neighborhood is seen to be influential on place attachment by affecting the intensity of attachment. The level of place attachment is expected to be greater in areas far from the city compared to areas in the center of the city. Apart from this, the neighborhood is also effective in residential satisfaction. The residents living in these neighborhoods having strong physical and social opportunities will be expected to have higher residential satisfaction.

Keywords: neighborhood, neighborhood satisfaction, place attachment, residential satisfaction

Procedia PDF Downloads 317

Authors: Montaceur Zaghdoud, Mohamed Moussaoui, Jalel Akaichi

Abstract:

Frequent subgraph mining refers usually to graph matching and it is widely used in when analyzing big data with large graphs. A lot of research works dealt with structural exact or inexact graph matching but a little attention is paid to semantic matching when graph vertices and/or edges are attributed and typed. Therefore, it seems very interesting to integrate background knowledge into the analysis and that extracted frequent subgraphs should become more pruned by applying a new semantic filter instead of using only structural similarity in graph matching process. Consequently, this paper focuses on developing a new hybrid approximate structuralsemantic graph matching to discover a set of frequent subgraphs. It uses simultaneously an approximate structural similarity function based on graph edit distance function and a possibilistic vertices similarity function based on affinity function. Both structural and semantic filters contribute together to prune extracted frequent set. Indeed, new hybrid structural-semantic frequent subgraph mining approach searches will be suitable to be applied to several application such as community detection in social networks.

Keywords: approximate graph matching, hybrid frequent subgraph mining, graph mining, possibility theory

Procedia PDF Downloads 403

Authors: Saman Sobhani

Abstract:

Historical neighborhoods have special values inside them, and, in addition to inducing a sense of collective memories, they have to have some criteria in respect of achieving desirable environmental quality in order for citizens to live. From the perspective of urban planners and designers, a neighborhood as an urban space has to satisfy various needs of citizens in terms of activities as well as their spiritual requirements. In the research based on the component of environmental quality in one of the neighborhoods with historical value resulting from the theoretical model presented (functional-structural, physical-spatial, and substantive), integrated analysis has been performed on the Khajeh Khezr neighborhood in Kerman. Then, after studying the weaknesses and strengths points of it based on the AIDA model, some mechanisms have been presented to promote environmental quality based on neighborhood organization, and related urban design projects have been defined accordingly. Analyzing the findings shows that inhabitants in the Khajeh Khezr neighborhood are not much satisfied with the quality of the urban environment of the neighborhood. In the research, the descriptive-analytical method and review of texts have been used in the form of library studies, and case study has been applied as well as observation and questionnaire in the form of field studies.

Keywords: environmental quality, Kerman, Khajeh Khezr, neighborhood

Procedia PDF Downloads 85

Authors: Khaled M. Hama, Mohammed Al Magableh, Zaid Al Kuri, Ahmad Qayam

Abstract:

The study aimed to identify the role of academic leaders at Jerash University in crisis management from the faculty members' point of view, ‘the emerging Corona pandemic as a model’, as well as to identify the differences in the role of academic leaders at Jerash University in crisis management at the significance level (0.05 ≤ α) according to the study variables Gender Academic rank, years of experience, and identifying proposals that contribute to developing the performance of academic leaders at Jerash University in crisis management, ‘the Corona pandemic as a model’. The study was applied to a randomly selected sample of (72) faculty members at Jerash University, The researcher designed a tool for the study, which is the questionnaire, and it included two parts: the first part related to the personal data of the study sample members, and the second part was divided into five areas and (34) paragraphs to reveal the role of academic leaders at Jerash University in crisis management - the Corona pandemic as a model, it was confirmed From the validity and reliability of the tool, the study used the descriptive analytical method The study reached the following results: that the role of academic leaders at Jerash University in crisis management from the point of view of faculty members, ‘the emerging corona pandemic as a model’, came to a high degree, and there were no statistically significant differences at the level of statistical significance (α = 0.05) between the computational circles for the estimates of individuals The study sample for the role of academic leaders at Jerash University in crisis management is attributed to the study variables (gender, academic rank, and years of experience)

Keywords: academic leaders, crisis management, corona pandemic, Jerash University

Procedia PDF Downloads 55

Authors: Gholam Reza Mirzaei

Abstract:

This research aimed to investigate the effectiveness of acceptance and commitment therapy (ACT) in reducing corona disease anxiety in the staff working at Shahid Beheshti Hospital of Shiraz. The current research was a quasi-experimental study having pre-test and post-test with two experimental and control groups. The statistical population of the research included all the staff of Shahid Beheshti Hospital of Shiraz in 2021. From among the statistical population, 30 participants (N =15 in the experimental group and N =15 in the control group) were selected by available sampling. The materials used in the study comprised the Cognitive Emotion Regulation Questionnaire (CERQ) and Corona Disease Anxiety Scale (CDAS). Following data collection, the participants’ scores were analyzed using SPSS 20 at both descriptive (mean and standard deviation) and inferential (analysis of covariance) levels. The results of the analysis of covariance (ANCOVA) showed that acceptance and commitment therapy (ACT) is effective in reducing Corona disease anxiety (mental and physical symptoms) in the staff working at Shahid Beheshti Hospital of Shiraz. The effectiveness of acceptance and commitment therapy (ACT) on reducing mental symptoms was 25.5% and on physical symptoms was 13.8%. The mean scores of the experimental group in the sub-scales of Corona disease anxiety (mental and physical symptoms) in the post-test were lower than the mean scores of the control group.

Keywords: acceptance and commitment therapy, corona disease anxiety, hospital staff, Shiraz

Procedia PDF Downloads 42

Authors: Zainab Yasir Al-Rekaby, Abdul Jalil M. Khalaf

Abstract:

Coloring the vertices of a graph such that every two adjacent vertices have different color is a very common problem in the graph theory. This is known as proper coloring of graphs. The possible number of different proper colorings on a graph with a given number of colors can be represented by a function called the chromatic polynomial. Two graphs G and H are said to be chromatically equivalent, if they share the same chromatic polynomial. A Graph G is chromatically unique, if G is isomorphic to H for any graph H such that G is chromatically equivalent to H. The study of chromatically equivalent and chromatically unique problems is called chromaticity. This paper shows that a wheel W14 is chromatically unique.

Keywords: chromatic polynomial, chromatically Equivalent, chromatically unique, wheel

Procedia PDF Downloads 414

Authors: Kirstie Smith

Abstract:

This paper elucidates the value of neighborhood perception as it contributes to the advancement of well-being for individuals and families within a neighborhood. Through in-depth interviews with city residents, this paper examines the degree to which key stakeholders’ (residents) evaluate their neighborhood and perception of resources and identify, access, and utilize local assets existing in the community. Additionally, the research objective included conducting a community inventory that qualified the community assets and resources of lower-income neighborhoods of a medium-sized industrial city. Analysis of the community’s assets was compared with the interview results to allow for a better understanding of the community’s condition. Community mapping revealed the key informants’ reflections of assets were somewhat validated. In each neighborhood, there were more assets mapped than reported in the interviews. Another chief supposition drawn from this study was the identification of key development partners and social networks that offer the potential to facilitate locally-driven community development. Overall, the participants provided invaluable local knowledge of the perception of neighborhood assets, the well-being of residents, the condition of the community, and suggestions for responding to the challenges of the entire community in order to mobilize the present assets and networks.

Keywords: community mapping, family, resource allocation, social networks

Procedia PDF Downloads 353

Authors: Marie Oslène Honorat

Abstract:

Porto Belo is a neighborhood in the city of Foz do Iguaçu / PR, located in the Vila C region of Brazil. It is a project that addresses the question of the dirt generated by the neighborhood community about how they dispose and recycle domestic waste. This project aimed at raising awareness among residents, on how important it is to preserve the environment and take care, especially of the space in which we are located. Living this way manages to minimize the exploitation of natural resources, soil and water pollution. After collecting information about what one saw, we questioned some people in the neighborhood to find out about selective collection, recycling, and the separation and final destination of garbage. From the study, it was possible to verify the importance of placing more trash cans on neighborhood streets, where garbage is discarded, and the importance of promoting environmental education to improve the environment and quality of life. The methodology used in this research was a qualitative methodology that seeks the principle of transforming reality through investigation.

Keywords: awareness, recycling, selective collection, waste disposal

Procedia PDF Downloads 64

Authors: H. Nouri, A. Tabbel, N. Douib, H. Aitsaid, Y. Zebboudj

Abstract:

This study and the field test comparisons were carried out on the Algerian Derguna-Setif transmission systems. The transmission line of normal voltage 225 kV is 65 km long, transported and uses twin bundle conductors protected with two shield wires of transposed galvanized steel. An iterative finite-element method is used to solve Poisons equation. Two algorithms are proposed for satisfying the current continuity condition and updating the space-charge density. A new approach to the problem of corona discharge in transmission system has been described in this paper. The effect of varying the configurations and wires number is also investigated. The analysis of this steady is important in the design of HVDC transmission lines. The potential and electric field have been calculating in locations singular points of the system.

Keywords: corona discharge, finite element method, electric field, HVDC

Procedia PDF Downloads 414

Authors: Venkata Ravi Kumar Veluru

Abstract:

Indian traditional neighborhoods are socially active and sometimes intrusive communities, which are losing their qualities due to western influences, undermining the traditional Indian values by blind adaptation of western neighborhood concepts since the scale is not suitable to the Indian context. This paper aims to understand the qualities of Indian traditional neighborhoods by evaluating a traditional neighborhood of Jaipur, comparing it with a modern planned neighborhood of Chandigarh, designed by a foreign planner, in the neighborhood concept of the western world, to find out the special qualities of traditional Indian neighborhoods as compared to western concepts in terms of social spaces, by way of physical observation of selected neighborhoods and residents structured questionnaire survey. The combined analysis found that social spaces are abundantly available in traditional neighborhoods, which are missing in modern neighborhoods, which are the main qualities where interactions happen, aiming towards the formation of social capital. The qualities of traditional neighborhoods have to be considered while designing new neighborhoods in India.

Keywords: Indian neighborhoods, modern neighborhoods, neighborhood planning, social spaces, traditional neighborhoods

Procedia PDF Downloads 121

Authors: Junjie Zhong, Kai Hong, Lei Wang

Abstract:

Passage Retrieval (PR) plays an important role in many Natural Language Processing (NLP) tasks. Traditional efficient retrieval models relying on exact term-matching, such as TF-IDF or BM25, have nowadays been exceeded by pre-trained language models which match by semantics. Though they gain effectiveness, deep language models often require large memory as well as time cost. To tackle the trade-off between efficiency and effectiveness in PR, this paper proposes Graph Passage Retriever (GraphPR), a graph-based model inspired by the development of graph learning techniques. Different from existing works, GraphPR is end-to-end and integrates both term-matching information and semantics. GraphPR constructs a passage-level graph from BM25 retrieval results and trains a GCN-like model on the graph with graph-based objectives. Passages were regarded as nodes in the constructed graph and were embedded in dense vectors. PR can then be implemented using embeddings and a fast vector-similarity search. Experiments on a variety of real-world retrieval datasets show that the proposed model outperforms related models in several evaluation metrics (e.g., mean reciprocal rank, accuracy, F1-scores) while maintaining a relatively low query latency and memory usage.

Keywords: efficiency, effectiveness, graph learning, language model, passage retrieval, term-matching model

Procedia PDF Downloads 151

Authors: Vasudha Saraogi

Abstract:

Heritage hotels are architectural marvels and embody a number of values of heritage discourses within them. The adaptive re-use of old structures to make them commercially viable as heritage hotels, not only boosts tourism and the local economy but also brings in development for the neighborhood in which it is located. This paper seeks to study the value created by heritage hotels in general and French Haveli (Ahmedabad) in particular using the single case study methodology. The paper draws upon the concept of the Italian model of Albergo Diffuso and its implementation via French Haveli, for value creation and development in Dhal Ni Pol (a historic neighborhood) while recognizing the importance of stakeholders to the process of the historic neighborhood upliftment.

Keywords: heritage discourses, historic neighborhoods, heritage hotel, Old City Ahmedabad

Procedia PDF Downloads 197

Authors: Shuo Liu

Abstract:

In Chinese text classification tasks, redundant words and phrases can interfere with the formation of extracted and analyzed text information, leading to a decrease in the accuracy of the classification model. To reduce irrelevant elements, extract and utilize text content information more efficiently and improve the accuracy of text classification models. In this paper, the text in the corpus is first extracted using the TextRank algorithm for abstraction, the words in the abstract are used as nodes to construct a text graph, and then the graph attention network (GAT) is used to complete the task of classifying the text. Testing on a Chinese dataset from the network, the classification accuracy was improved over the direct method of generating graph structures using text.

Keywords: Chinese natural language processing, text classification, abstract extraction, graph attention network

Procedia PDF Downloads 100

Authors: Mehrshad Khosraviani, Sepehr Najjarpour

Abstract:

Considering the usage of graph-based approaches in systems and synthetic biology, and the various types of ‎the graphs employed by them, a comprehensive graph library based ‎on the three-tier architecture (3TA) was previously introduced for full representation of the biological systems. Although proposing a 3TA-based graph library, three following reasons motivated us to redesign the graph ‎library based on the service-oriented architecture (SOA): (1) Maintaining the accuracy of the data related to an input graph (including its edges, its ‎vertices, its topology, etc.) without involving the end user:‎ Since, in the case of using 3TA, the library files are available to the end users, they may ‎be utilized incorrectly, and consequently, the invalid graph data will be provided to the ‎computer algorithms. However, considering the usage of the SOA, the operation of the ‎graph registration is specified as a service by encapsulation of the library files. In other words, overall control operations needed for registration of the valid data will be the ‎responsibility of the services. (2) Partitioning of the library product into some different parts: Considering 3TA, a whole library product was provided in general. While here, the product ‎can be divided into smaller ones, such as an AND/OR graph drawing service, and each ‎one can be provided individually. As a result, the end user will be able to select any ‎parts of the library product, instead of all features, to add it to a project. (3) Reduction of the complexities: While using 3TA, several other libraries must be needed to add for connecting to the ‎database, responsibility of the provision of the needed library resources in the SOA-‎based graph library is entrusted with the services by themselves. Therefore, the end user ‎who wants to use the graph library is not involved with its complexity. In the end, in order to ‎make ‎the library easier to control in the system, and to restrict the end user from accessing the files, ‎it was preferred to use the service-oriented ‎architecture ‎‎(SOA) over the three-tier architecture (3TA) and to redevelop the previously proposed graph library based on it‎.

Keywords: Bio-Design Automation, Biological System, Graph Library, Service-Oriented Architecture, Systems and Synthetic Biology

Procedia PDF Downloads 311

Authors: Al-Tammar M. Shahah

Abstract:

Background and Objective: A novel pneumonia caused by coronavirus disease 2019 (COVID-19), which is spreading domestically and internationally, has been identified by the Chinese city of Wuhan since the end of December 2019. Limited studies examined the psychological experience such as anxiety, depression, and stress during Corona pandemic. Moreover, to the best of author's knowledge, there is no study to date has examined the psychological resilience and mental health during Corona pandemic in Kuwait. Therefore, the present research investigates the role of psychological resilience in predicting psychological distress among Kuwaiti adults during Corona pandemic. Method: Kuwaiti citizens (N = 735) completed an online survey, which includes four scales the Hospital Anxiety and Depression Scale HADS (anxiety and depression), the Connor-Davidson Resilience Scale (CD-RISC-25), and the Perceived Stress Scale (PSS). A cross-sectional correlational design was used. Results: A high level of stress was observed, with 59% reported moderate to severe stress. In contrast, low levels of anxiety and depression were observed; with 70% reporting no anxiety symptoms and 74% report no depression symptoms. Psychological resilience was negatively correlated with anxiety, depression, and stress, consistent with previous studies. As expected, resilience was found to account for significant variance in anxiety and stress after controlling for quarantine variables and demographic variables. Conclusion: The findings suggest that increasing psychological resilience might help reduce psychological distress after confronting with stressful live events in Kuwaiti citizen.

Keywords: anxiety, corona, depression, psychological resilience, stress

Procedia PDF Downloads 123

Authors: Shaowei Sun

Abstract:

Let G be a graph with vertex set V(G)={v_1,v_2,...,v_n} and edge set E(G). For any vertex v belong to V(G), let d_v denote the degree of v. The normalized Laplacian matrix of the graph G is the matrix where the non-diagonal (i,j)-th entry is -1/(d_id_j) when vertex i is adjacent to vertex j and 0 when they are not adjacent, and the diagonal (i,i)-th entry is the di. In this paper, we discuss some bounds on the largest and the second smallest normalized Laplacian eigenvalue of trees and graphs. As following, we found some new bounds on the second smallest normalized Laplacian eigenvalue of tree T in terms of graph parameters. Moreover, we use Sage to give some conjectures on the second largest and the third smallest normalized eigenvalues of graph.

Keywords: graph, normalized Laplacian eigenvalues, normalized Laplacian matrix, tree

Procedia PDF Downloads 328

Authors: Alfi Y. Zakiyyah, Hanni Garminia, M. Salman, A. N. Irawati

Abstract:

In the terminology of the hypergraph, there is a relation with the terminology graph. In the theory of graph, the edges connected two vertices. In otherwise, in hypergraph, the edges can connect more than two vertices. There is representation matrix of a graph such as adjacency matrix, Laplacian matrix, and incidence matrix. The adjacency matrix is symmetry matrix so that all eigenvalues is real. This matrix is a nonnegative matrix. The all diagonal entry from adjacency matrix is zero so that the trace is zero. Another representation matrix of the graph is the Laplacian matrix. Laplacian matrix is symmetry matrix and semidefinite positive so that all eigenvalues are real and non-negative. According to the spectral study in the graph, some that result is generalized to hypergraph. A hypergraph can be represented by a matrix such as adjacency, incidence, and Laplacian matrix. Throughout for this term, we use Laplacian matrix to represent a complete tripartite hypergraph. The aim from this research is to determine second smallest eigenvalues from this matrix and find a relation this eigenvalue with the connectivity of that hypergraph.

Keywords: connectivity, graph, hypergraph, Laplacian matrix

Procedia PDF Downloads 489

Authors: Walaa Obaidallah Alqarafi, Wafaa Mohammed Fakieh, Alaa Abdallah Altassan

Abstract:

Algebraic graph theory is defined as a bridge between algebraic structures and graphs. It has several uses in many fields, including chemistry, physics, and computer science. The prime graph is a type of graph associated with a ring R, where the vertex set is the whole ring R, and two vertices x and y are adjacent if either xRy=0 or yRx=0. However, the investigation of the prime graph over rings remains relatively limited. The behavior of this graph in extended rings, like R[x] and R[[x]], where R is a non-commutative ring, deserves more attention because of the wider applicability in algebra and other mathematical fields. To study the prime graphs over polynomials and power series rings, we used a combination of ring-theoretic and graph-theoretic techniques. This paper focuses on two invariants: the diameter and the girth of these graphs. Furthermore, the work discusses how the graph structures change when passing from R to R[x] and R[[x]]. In our study, we found that the set of strong zero-divisors of ring R represents the set of vertices in prime graphs. Based on this discovery, we redefined the vertices of prime graphs using the definition of strong zero divisors. Additionally, our results show that although the prime graphs of R[x] and R[[x]] are comparable to the graph of R, they have different combinatorial characteristics since these extensions contain new strong zero-divisors. In particular, we find conditions in which the diameter and girth of the graphs, as they expand from R to R[x] and R[[x]], do not change or do change. In conclusion, this study shows how extending a non-commutative ring R to R[x] and R[[x]] affects the structure of their prime graphs, particularly in terms of diameter and girth. These findings enhance the understanding of the relationship between ring extensions and graph properties.

Keywords: prime graph, diameter, girth, polynomial ring, power series ring

Procedia PDF Downloads 18

Authors: Margarita Mayoral-Villa, J. Klapp, L. Di G. Sigalotti, J. E. V. Guzmán

Abstract:

Automated learning techniques are widely applied in the energy sector to address challenging problems from a practical point of view. To this end, we discuss the implementation of a Message Passing algorithm (MPNN)within a Graph Neural Network(GNN)to leverage the neighborhood of a set of nodes during the aggregation process. This approach enables the characterization of multiphase diffusion processes in the reservoir, such that the flow paths underlying the interconnections between multiple wells may be inferred from previously available data on flow rates and bottomhole pressures. The results thus obtained compare favorably with the predictions produced by the Reduced Order Capacitance-Resistance Models (CRM) and suggest the potential of MPNNs to enhance the robustness of the forecasts while improving the computational efficiency.

Keywords: multiphase diffusion, message passing neural network, well interconnection, interwell connectivity, graph neural network, capacitance-resistance models

Procedia PDF Downloads 149

Authors: Shin-Shin Kao, Yuan-Kang Shih, Hsun Su

Abstract:

In this paper, we show that the conjecture of Chv tal, which states that any 1-tough graph is either a Hamiltonian graph or its complement contains a specific graph denoted by F, does not hold in general. More precisely, it is true only for graphs with six or seven vertices, and is false for graphs with eight or more vertices. A theorem is derived as a correction for the conjecture.

Keywords: complement, degree sum, hamiltonian, tough

Procedia PDF Downloads 289

Authors: Wan Jiun Tin

Abstract:

Neighborhood regeneration has gained its popularity despite market-led urban redevelopment is still the main strategy in most of the countries in Asia. Area-based approach of neighborhood regeneration with the focus on people, place and system which covers the main sustainable aspects shall be studied as part of the solution. Project implementation in small scale without fully depending on the financial support from the government and main stakeholders is the advantage of neighborhood regeneration. This enables the improving and upgrading of living conditions to be ongoing even during the economy downturn. In addition to that, there will be no specific selection on the development areas as the entire nation share the similar opportunity to upgrade and to improve their neighborhood. This is important to narrow the income disparities in urban. The objective of this paper is to review and to summarize the urban regeneration in developed countries with the focus on Korea, Singapore and Hong Kong. The aim is to determine the direction of sustainable urban regeneration in Malaysia for post-Vision 2020 through the introduction of neighborhood regeneration. This paper is conducted via literature review and observations in those selected countries. In conclusion, neighborhood regeneration shall be one of the approach of sustainable urban regeneration in Malaysia. A few criteria have been identified and to be recommended for the adaptation in Malaysia.

Keywords: area-based regeneration, public participation, sustainable urban regeneration, urban redevelopment

Procedia PDF Downloads 276

Authors: Kay Thi Yar, Khin Mar Lar Tun

Abstract:

Nowadays, social networks are so popular and widely used in all over the world. In addition, searching personal information of each person and searching connection between them (peoples’ relation in real world) becomes interesting issue in our society. In this paper, we propose a framework with three portions for exploring peoples’ relations from their connected information. The first portion focuses on the Graph database structure to store the connected data of peoples’ information. The second one proposes the graph database searching algorithm, the Modified-SoS-ACO (Sense of Smell-Ant Colony Optimization). The last portion proposes the Deductive Reasoning Algorithm to define two persons’ relationship. This study reveals the proper storage structure for connected information, graph searching algorithm and deductive reasoning algorithm to predict and analyze the personnel relationship from peoples’ relation in their connected information.

Keywords: personnel information, graph storage structure, graph searching algorithm, deductive reasoning algorithm

Procedia PDF Downloads 450