Graph visualization has evolved significantly over time, offering various methods to effectively represent complex data structures. This study introduces a novel force-directed algorithm for 3D data visualization, specifically tailored for commonly used datasets in linked data visualization. Leveraging the power of graph theory and methods, the algorithm aims to address the challenge of creating visually appealing and easily interpretable visualizations, which often necessitate advanced user interaction. By utilizing 3D space and the Unity Engine, the research successfully visualizes data and develops interactive visualizations, overcoming limitations of basic force-directed implementations. The main contribution of presented research is in the force-directed algorithm with springs and controlled placement as a visualization technique that combines the use of springs and attractive forces to stabilize a graph in a 3D environment. The combination of these two techniques also helps prevent the formation of a single large cluster within the graph, enhancing the overall visualization quality.

This paper presents a theory on graph topological structure and graph coloring, proving that for any N-order graph structure (with a topological structure similar to ), the maximum number of colors required for coloring is less than or equal to . The Four Color Theorem is just one special case of this theory, with the maximum structure size for a four-color graph being a 4-order structure graph, hence requiring only a maximum of 4 colors for coloring.

With recent advancements in network technology and spread of Internet, use of social network services and Internet of Things devices has flourished, leading to a continuous generation of large volumes of graph stream data, where changes, such as additions or deletions of vertices and edges occur over time. Additionally, owing to the need for efficient use of storage space and security requirements, graph stream data compression has become essential in various applications. Even though various studies on graph compression methods have been conducted, most of them do not fully reflect the dynamic characteristics of graph streams and complexity of large graphs. In this paper, we propose a compression scheme using provenance data to efficiently process and analyze large graph stream data. It obtains provenance data by analyzing graph stream data and builds a pattern dictionary based on this to perform dictionary-based compression. By improving the existing dictionary-based graph compression methods, it enables more efficient dictionary management through tracking pattern changes and evaluating their importance using provenance. Furthermore, it considers the relationships among sub-patterns using an FP-tree and performs pattern dictionary management that updates pattern scores based on time. Our experiments show that the proposed scheme outperforms existing graph compression methods in key performance metrics, such as compression rate and processing time.

Being able to express broad families of equivariant or invariant attributed graph functions is a popular measuring stick of whether graph neural networks should be employed in practical applications. However, it is equally important to learn deep local minima of losses (i.e., with much smaller loss values than other minima), even when architectures cannot express global minima. In this work we introduce the architectural property of attracting GNN optimization trajectories to local minima as a means of achieving smaller losses. We take first steps in satisfying this property for losses defined over attributed undirected unweighted graphs with a novel architecture, called Universal Local Attractor (ULA). The latter refines each dimension of end-to-end trained node feature embeddings based on graph structure to track the optimization trajectories of losses satisfying some mild conditions. The refined dimensions are then linearly pooled to create predictions. We experiment on 10 tasks, from node classification to clique detection, on which ULA is comparable with or significantly outperforms popular alternatives of similar or greater theoretical expressive power.

P versus NP is considered as one of the most fundamental open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? It was essentially mentioned in 1955 from a letter written by John Nash to the United States National Security Agency. However, a precise statement of the P versus NP problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. Another major complexity class is NP-complete. It is well-known that P is equal to NP under the assumption of the existence of a polynomial time algorithm for some NP-complete. We show that the Monotone Weighted Xor 2-satisfiability problem (MWX2SAT) is NP-complete and P at the same time. Certainly, we make a polynomial time reduction from every directed graph and positive integer k in the K-CLOSURE problem to an instance of MWX2SAT. In this way, we show that MWX2SAT is also an NP-complete problem. Moreover, we create and implement a polynomial time algorithm which decides the instances of MWX2SAT. Consequently, we prove that P = NP.

One of the industries with the fastest rate of growth is healthcare, and this industry's enormous data requires extensive cloud storage. The cloud may offer some protection, but there is no assurance that data owners can rely on it for refuge and privacy amenities. Therefore, it is essential to offer security and privacy protection. Increased customer satisfaction with security and privacy preservation is crucial since healthcare big data and its sources are stored in the cloud and contain increasingly private and sensitive information. However, maintaining privacy and security in an untrusted green cloud environment is difficult, thus the data owner should have complete data control. A new work SecPri-BGMPOP(security and privacy of Boost graph Convolutional Network -Pinpointing-Optimization Performance) is suggested that can offer a solution that involves several different steps in order to handle the numerous problems relating to security and protecting privacy. Initially Boost Graph Convolutional Network Clustering (BGCNC) algorithm, which reduces computational complexity in terms of time and memory measurements, is first applied to the input dataset to begin the clustering process. Second, enlarge by employing a piece of the magnifying bit string to generate a safe key, pinpointing based encryption avoids amplify leakage even if a rival or attacker decrypts the key or asymmetric encryption. Finally, to determine the accuracy of the method, an optimal key was created using a meta-heuristic algorithmic framework called Hybrid fragment horde bland lobo Optimization (HFHBLO). Our proposed method currently kept in a cloud environment, allowing analytics users to utilize it without risking their privacy or security.

Despite the partial disclosure of driving scenario knowledge graphs, they still fail to meet the comprehensive needs of intelligent connected vehicles for driving knowledge. Current issues include the high complexity of pattern layer construction, insufficient accuracy of information extraction and fusion, and limited performance of knowledge reasoning models. To address these challenges, a hybrid knowledge graph method was adopted in the construction of the Driving Scenario Knowledge Graph (DSKG). Firstly, core concepts in the field were systematically sorted and classified, laying the foundation for the construction of a multi-level classified knowledge graph top-level ontology. Subsequently, by deeply exploring and analyzing the Traffic Genome data, 34 entities and 51 relations were extracted and integrated with the ontology layer, achieving the expansion and updating of the knowledge graph. Then, in terms of knowledge reasoning models, an analysis of the training results of the TransE, Complex, Distmult, and Rotate models in the entity linking prediction task of DSKG revealed that the Distmult model performed the best in metrics such as hit rate, making it more suitable for inference in DSKG. Finally, a standardized and widely applicable Driving Scenario Knowledge Graph was proposed. The DSKG and related materials have been publicly released for use by industry and academia.

Graph databases (GDBs) are becoming increasingly popular across scientific disciplines, being highly suitable to store and connect complex heterogeneous data. In systems biology, they are used as a backend solution for biological data repositories, ontologies, networks, pathways, and knowledge graph (KG) databases. In this review, we analyse all publications using or mentioning graph databases retrieved from PubMed and PubMed Central full-text search, focusing on the top 16 available GDB technologies. Relevant publications are then categorised according to their domain and application. We detail different approaches and highlight advantages of outstanding resources, such as UniProtKB, Disease Ontology, and Reactome, which provide graph-based solutions. We discuss ongoing efforts of the systems biology community to standardise and harmonise KG creation and the maintenance of integrated resources. Outlining prospects, including the use of GDBs as a way of communication between biological data repositories, we conclude that efficient design, querying, and maintenance of GDBs will be key for knowledge generation in systems biology and other research fields with heterogeneous data.

Diabetes management requires constant monitoring and individualized adjustments. This study proposes a novel approach that leverages digital twins and Personal Health Knowledge Graphs (PHKGs) to revolutionize diabetes care. Our key contribution lies in developing a real-time, patient-centric digital twin framework built on PHKGs. This framework integrates data from diverse sources, adhering to HL7 standards and enabling seamless information access and exchange. PHKGs offer a flexible and efficient format that supports various applications. As new knowledge about the patient becomes available, the PHKG can be easily extended to incorporate it. This dynamic approach fosters continuous improvement and facilitates the development of new applications. As proof of concept, we have demonstrated the versatility of our digital twin by applying it to different use cases in diabetes management. These include predicting glucose levels, optimizing insulin dosage, providing personalized lifestyle recommendations, and visualizing health data. By enabling real-time, patient-specific care, this research paves the way for more precise and personalized healthcare interventions, potentially improving long-term diabetes management outcomes.

This study introduces a novel computational approach for testing conditional independence (BB CI test) within causal Directed Acyclic Graphs (DAGs), leveraging Bayesian non-parametric bootstrap and machine learning techniques. Our method offers an alternative for validating the assumptions underpinning causal DAGs. Through simulation studies and an industrial case analysis, we demonstrate the test procedure in accurately assessing conditional independence, comparing it with the Generalized Covariance Measure (GCM) test. Our findings suggest that the BB CI test is advantageous in scenarios where existing methods may falter due to violations of model assumptions. This research contributes to the causal inference literature by providing a computational tool for researchers and practitioners to validate causal models.

Weight thresholding (WT) is a method intended to decrease the number of links within weighted networks that may otherwise be excessively dense for network science applications. WT aims to remove links to simplify the networks by holding most of the features of the original network. Here, we test the robustness and the efficacy of the node attack strategies on real-world networks subjected to WT that remove links of higher weight (strong links). We measure the network robustness along node removal with the largest connected component (LCC). We find that the real-world networks under study are generally stable in terms of robustness when subjected to WT. Nonetheless, WT by strong link removal changes the efficacy of the attack strategies and the rank of node centralities. Also, WT by strong link removal may trigger a greater change in node centrality rank than WT by removing weak links. Network science research finding important/influential nodes in the network has to consider that simplifying the network with WT methodologies may change the node centrality.

Human action recognition (HAR) based on skeleton data is a challenging yet important technique because of its wide range of applications in many fields, including patient monitoring, security surveillance, and observing human-machine interactions. Many algorithms that attempt to distinguish between many types of activities have been proposed. However, most practical applications require highly accurate detection of specific types of activities. In this study, a novel and highly accurate spatiotemporal graph autoencoder network for HAR based on skeleton data is proposed. Furthermore, an extensive study was conducted using different modalities. For this purpose, a spatiotemporal graph autoencoder that automatically learns spatial as well as temporal patterns from human skeleton datasets was built. The powerful graph convolutional network named GA-GCN, developed in this study, notably outperforms most of the existing state-of-the-art methods based on two common datasets, namely NTU RGB+D and NTU RGB+D 120 . On the first dataset, we achieved an accuracy of 92.3% and 96.7% based on the cross-subject and cross-view evaluations, respectively. On the other more challenging dataset (i.e. NTU RGB+D 120), GA-GCN achieved 88.8% and 90.4% based on the cross-subject and cross-set evaluation, respectively.

Identifying influential actors within social networks is pivotal for optimizing information flow and mitigating the spread of both rumors and diseases. Several methods have emerged to pinpoint these influential entities in networks that are represented as graphs. In these graphs, nodes corre-spond to individuals and edges indicate their connections. This study focuses on centrality measures, prized for their straightforwardness and effectiveness. We categorize structural central-ity into two: local, considering a node's immediate vicinity, and global, accounting for overarching path structures. Some techniques blend both centralities to highlight nodes influential at both mi-cro and macro levels. Our paper presents a novel centrality measure, accentuating node degree and incorporating the network's broader features, especially paths of different lengths. Through Spearman and Pearson's correlations tested on seven standard datasets, our method proves its merit against traditional centrality measures. Additionally, we employ the SIR model, portraying disease spread, to further validate our approach. The ultimate influential node is gauged by its capacity to infect the most nodes during the SIR model's progression. Our results indicate a nota-ble correlative efficacy across various real-world networks relative to other centrality metrics.

This review underscores the critical significance of incorporating network perspectives in epidemiology. Classic compartmental models (CM) employed to describe epidemic spreading often fail to capture the intricacies of real disease dynamics. Rooted in the mean-field assumption, CM models oversimplify by assuming that every individual has the potential to "infect" any other, neglecting the inherent complexity of underlying network structures. Given that social interactions follow a networked pattern with specific links between individuals based on social behaviors, the amalgamation of classic CM and network science in epidemiology becomes essential for a more authentic portrayal of epidemic spreading. This review delves into noteworthy research studies that, from various perspectives, elucidate how the synergy between networks and CM can enhance the accuracy of epidemic descriptions. In conclusion, we explore research prospects aimed at further elevating the integration of networks within the realm of epidemiology, recognizing its pivotal role in refining our understanding of disease dynamics.

This paper offers a novel geometric and visual approach to the renowned Four Color Map Theorem and K5 non-planarity problem while unveiling their profound connection to the "kissing number" problem in 2D. We represent planar graphs through circles and tangents, simplifying complex structures and shedding light on these classic problems. Our proofs by contradiction, rooted in the kissing number concept, reveal that both the Four Color Map Theorem and K5 non-planarity are fundamentally linked, as they pivot around the concept of coloring. This study bridges the realms of geometry and graph theory, providing fresh insights and emphasizing the significance of the kissing number problem in various fields.

This paper is motivated by three main assumptions: (1) The currently dominant forms of knowledge representation (natural language text, formulas, graphics) are suboptimal to facilitate knowledge transfer between control engineering sub-fields and into potential application domains. (2) Formal knowledge representation (in general) is a promising supplementary approach, but (3) the established technologies so far have failed to be significantly adopted for formal representation of control engineering knowledge. Thus, after briefly reviewing existing representation methods, we introduce our own approach: The Python based imperative representation of knowledge (PyIRK) and its application to formulate the Ontology of Control Systems Engineering (OCSE). One of its main features is the possibility to represent the actual content of definitions and theorems as nodes and edges of a knowledge graph, which is demonstrated by selected elements from Lyapunov theory. While the approach is still experimental, the formalization already allows to apply methods of automated quality assurance and a semantic search mechanism. The current feature set of the framework is demonstrated on various examples before directions for further developments are discussed.

This paper presents a novel approach to demonstrate the Collatz Conjecture, an unsolved problem in mathematics stating that all positive integers will eventually converge to 1 when subjected to a recursive sequence of operations. We introduce Algebraic Inverse Trees (AITs), innovative data structures that characterize relationships within the Collatz sequence by tracing inverse transformations back to the origin. Leveraging properties unveiled through this inverted representation, including absence of non-trivial cycles and guaranteed convergence of paths, we construct a topological framework to formally prove that all trajectories invariably lead to 1 under the Collatz iterative process. This modern technique provides not only the machinery to manifest a rigorous proof, but also grants intuitive insights into the deep complexity of this notorious yet elementary conjecture.

Symmetry, as a key concept in geometry and the foundational principle of mathematical concepts, is a fundamental part of geometry and nature, creating patterns that help us conceptually organize our world. It is often linked with aesthetic beauty and can be observed in both natural phenomena and human-made objects, such as artworks and manufactured products, across the globe. The automorphism group of a graph is a mathematical structure that captures all the symmetries of the graph. symmetry refers to the property of a graph, indicating that it can be transformed without changing its structure, while the automorphism group is the collection of all permutations of the vertices that preserve the graph's adjacency relationships. In graph theory, the concepts of symmetry group and automorphism group play fundamental roles in understanding the symmetries and structural properties of graphs. This paper aims to explore the relationship between symmetry groups and automorphism groups, shedding light on their interconnected nature and their significance in graph theory. We delve into the definitions and properties of both symmetry groups and automorphism groups, highlighting their similarities and distinctions. Furthermore, we discuss their applications in various fields, including computer science, chemistry, and network analysis. Through this exploration, we aim to provide a comprehensive understanding of the relationship between symmetry groups and automorphism groups, deepening our comprehension of the symmetries and structures inherent in graphs.

The study introduces a novel method to identify potential citation manipulation in academic papers using perturbations of a deep embedding model, incorporating Graph Masked Autoencoders. This approach integrates textual information with graph connectivity evidence, resulting in a more sophisticated model of citation distribution. By training a deep network using partial data and reconstructing masked connections, the method leverages the inherent characteristics of central connections under network perturbations. Quantitative evaluations demonstrate its remarkable ability to pinpoint trustworthy citations in the analyzed data and raise concerns about potentially unreliable references due to potential manipulation.

In the realm of artificial intelligence, knowledge graphs have become a fascinating area of research. Relationships between entities are depicted through a structural framework in knowledge graphs. In this paper, we propose to build a domain-specific medicine dictionary (DSMD) based on the principles of knowledge graphs. Our dictionary is composed of structured triples, where each entity is defined as a concept, and these concepts are interconnected through relationships. This comprehensive dictionary boasts more than 348,000 triples, encompassing over 20,000 medicine brands and 1,500 generic medicines. It offers a groundbreaking approach to storing and accessing medical data. Our dictionary facilitates various functionalities, including medicine brand information extraction, brand-specific queries, as well as queries involving two words or question answering. We anticipate that our dictionary will serve a broad spectrum of users, catering to both human users, such as diverse range of healthcare professionals as well as AI applications.

Activities of daily living (ADLs) are fundamental routine tasks that the majority of physically and mentally healthy people can independently execute. In this paper, we present a Semantic Framework for detecting problems in ADLs execution, monitored through Smart Home sensors. In the context of this work, we conducted a pilot study, gathering raw data from various sensors and devices installed in a smart home environment. The proposed Framework combines multiple Semantic Web technologies (i.e. ontology, RDF, triplestore) to handle and transform these raw data into meaningful representations forming a Knowledge Graph. Subsequently, SPARQL queries are used to define and construct explicit rules to detect problematic behaviours in ADLs execution, a procedure that leads to generating new implicit knowledge. Finally, all available results are visualized in a clinician dashboard. The proposed framework can monitor the deterioration of ADLs performance for people in the spectrum of dementia, by offering a comprehensive way for clinicians to describe problematic behaviors in the every-day life of an individual.

The real-time Railway Traffic Management Problem (rtRTMP) is discussed in the field of railway transportation. In this paper, rtRTMP is considered for planning shunting routes based on the use of routing methods on a spatial-temporal graph. An approach and algorithm of Spatial-Temporal Graph formation for rail yard transportation network is proposed. The idea is to construct an undirected loop-free Double Vertex Graph for determining optimal shunting routes consisting of several half-runs for several trains shunting under draw-out tracks capacity constraints. Experimental results on the rail yard simulation model are presented.

It is essential to deal with data scattered among heterogeneous information sources, which can be structured, semi-structured, or unstructured, to give consumers a cohesive perspective of the data. Information gathering is challenging as a result, and one of the major causes of this is that data sources are developed to support specific applications. A method to simplify this procedure is to use ontology representation as an intermediate step. An ontology represents a knowledge structure that reasonably reflects the real world's complexity and is ideally used in many industries today. This research aims to enhance the functionality of a global ontology system by implementing and integrating a natural language query system. Leveraging NLP-based approaches, we constructed SPARQL queries for our ontologies to facilitate natural language translation into a well-structured query format. A dedicated query component was developed to transform natural language questions into SPARQL queries, with the selection of the optimal query graph to generate the final queries. In the subsequent phase, we explored the integration of distinct sentence encoders to improve latent sentence representations during query construction. The generated SPARQL queries were executed on the global ontology output and then translated into source-specific questions. This innovative approach enables unified access to heterogeneous data sources through a user-friendly natural language querying interface.

The purpose of water treatment through ultraviolet (UV) radiation is to interrupt the development and multiplication of microorganisms by preventing their growth and reproduction.Ultraviolet treatment has become a very affordable solution to produce clean water of optimal quality in regions where access to drinking water is essential. The experimental water treatment unit is powered by a photovoltaic (PV) source. It incorporates a discharge lamp used to generate ultraviolet radiation, which is harnessed to address bacteriological issues related to water quality. This lamp is continuously powered by a photovoltaic (PV) source through an inverter and an electronic ballast. The water treatment system also includes a motor pump designed to draw contaminated water from the input reservoir, a flow control valve to adjust flow rates as needed, and a filter aimed at enhancing the quality of the contaminated water. The water circulates between the input reservoir (contaminated water) and the output reservoir (treated water) through the UV lamp. The relationship between the intensity of the UV lamp and the water flow rate can ensure an adequate water quality.

The article outlines a creative approach by fusing ideas from fuzzy contractions, graph mappings, and Kannan mappings to create a brand-new notion known as "Kannan-graph-fuzzy contraction." This combination of concepts makes it possible to create a unique framework for resolving real-world issues controlled by nonlinear models. It is anticipated that using Kannan-graph-fuzzy contractions will offer a fresh approach to discussing solution existence in situations where these ideas overlap. This strategy might have a significant impact on a lot of real-world applications, proving how practical multidisciplinary techniques are for tackling issues in the real world originating from technology and engineering. The article includes several illustrated examples based on computer simulations, making the results more explicit.

In recent years, there has been significant growth in the ubiquity and popularity of three dimensional(3D) point clouds, with an increasing focus on the classification of 3D point clouds. To extract richer features from point clouds, many researchers have turned their attention to various point set regions and channels within irregular point clouds. However, this approach has limited capability in attending to crucial regions of interest in 3D point clouds and may overlook valuable information from neighboring features during feature aggregation. Therefore, this paper proposes a novel 3D point cloud classification method based on global attention and adaptive graph convolution. The method consists of two main branches: the first branch com-putes attention masks for each point, while the second branch employs adaptive graph convolu-tion to extract global features from the point set. It dynamically learns features based on point interactions, generating adaptive kernels to effectively and precisely capture diverse relationships among points from different semantic parts. Experimental results demonstrate that the proposed model achieves 93.8% in overall accuracy and 90.8% in average accuracy on the ModeNet40 dataset.

This article combines the traditional definition of portfolio risk with minimum spanning tree based “interconnectedness risk" to improve the equal risk contribution portfolio performance. We use betweenness centrality to measure an asset’s importance in a market graph (network). After filtering the complete correlation network to a minimum spanning tree, we calculate the centrality score and convert it to a centrality heuristic. We develop an adjusted variance-covariance matrix using the centrality heuristic, to bias the model to assign peripheral assets in the minimum spanning tree higher weights. We test this methodology using the constituents of the S&P 100 index. The results show that the centrality equal risk portfolio can improve upon the base equal risk portfolio returns, with a similar level of risk. We observe that during bear markets, the centrality-based portfolio can surpass the base equal risk portfolio risk.

This paper presents the Advanced Syntactic-Graph Convolutional Model (ASGCM), a pioneering approach in Aspect-Based Sentiment Analysis (ABSA) that integrates syntactic dependency features within a graph convolution framework. ASGCM stands out for its novel use of dependency edge encoding and tag-based graph convolutions, providing a fine-grained analysis of sentiments associated with specific aspects in text. This model meticulously captures the intricacies of syntactic structures, thereby offering enhanced precision in sentiment analysis. Notably, ASGCM incorporates a dual-layer graph convolution system: one layer processes syntactic dependencies (edges), while the other interprets semantic roles (tags), ensuring a comprehensive understanding of both structural and contextual elements in text. We rigorously tested ASGCM on multiple datasets, including both English and Chinese languages, and our findings reveal a significant improvement in sentiment classification accuracy compared to existing models. The versatility of ASGCM makes it a robust tool for diverse linguistic environments, setting a new standard for ABSA methodologies.

In this paper, we present a groundbreaking methodology in the realm of aspect-level sentiment analysis, which capitalizes on the advanced capabilities of graph-based neural networks. Our approach, distinguished as the Aspect Correlation Graph Network (ACGN), represents a significant departure from conventional models. These traditional models often analyze aspects in isolation, failing to capture the intricate web of sentiment relationships that may exist within a single sentence. ACGN, however, is designed to address this gap by employing a sophisticated bidirectional attention mechanism, integrated with positional encoding. This unique combination not only enhances the model's ability to focus on relevant parts of the sentence but also aids in constructing detailed, aspect-focused representations. These representations are particularly crucial for understanding the nuanced interplay of sentiments associated with different aspects. Central to our model's architecture is the incorporation of a graph convolutional network. This network serves as a pivotal component in mapping and analyzing the complex network of sentiment correlations that can exist among various aspects within sentences. Through this integration, ACGN is able to unearth and interpret the subtle and often overlooked sentiment dynamics that traditional models might miss. Our comprehensive evaluations of the Aspect Correlation Graph Network, conducted using the SemEval 2014 datasets, have yielded promising results. These findings demonstrate a clear and significant advancement over the capabilities of existing models. Particularly, the results underscore the critical importance and utility of recognizing and understanding the connections between sentiments of different aspects in text analysis. This insight opens new avenues in the field of sentiment analysis, suggesting a broader application potential of ACGN in various contexts where understanding nuanced sentiment relationships is key. Overall, our study not only introduces a novel approach in aspect-level sentiment analysis but also sets a new standard for future research in this area. By highlighting the integral role of inter-aspect sentiment connections, ACGN paves the way for more sophisticated and accurate sentiment analysis tools, capable of handling the complexities of natural language with greater finesse and precision.

The paper illustrates a general framework in which a neural network application can be easily integrated and proposes a traffic forecasting approach that uses neural networks based on graphs. The method minimizes the communication network (between vehicles and the database servers) load and represents a reasonable trade-off between communication network load and forecasting accuracy. Traffic prediction leads to the choice of less congested routes and therefore to the reduction of energy consumption. The traffic is forecasting using a LTSM neural network with a regression layer. The inputs of the neural network are sequences - obtained from graph that represent the road network - at specific moments of time that are read from traffic sensors or the outputs of neural network (forecasting sequences). The input sequences can be filtered to improve the forecasting accuracy. This general framework is based on Contiki IoT operating system that ensure support for wireless communication and efficient implementation of processes in a resource constrained system and it is particularized to implement a graph neural network. Two cases are studied: one case in which the traffic sensors are periodically read and the other case in which the traffic sensors are read when their values changes are detected. A comparison between the cases is made and the influence of filtering is evaluated. The obtained accuracy is very good, very close to the accuracy obtained in infinite precision simulation, and the computation time is low enough and the system can work in real time.

In the intricate domain of text analysis, syntactic dependency trees play a crucial role in unraveling the web of relations among entities embedded in the text. These trees provide a structural roadmap, guiding us through the complex syntax to pinpoint the interactions and connections between different entities. However, the challenge lies in sifting through this intricate structure to extract relevant information, a task that requires precision and discernment. Traditional approaches often rely on rule-based pruning methods to simplify these dependency structures, focusing on certain parts while discarding others. Yet, this approach has its pitfalls, as it can overlook critical nuances and connections that are vital for a comprehensive understanding of the text. Addressing this gap, our research introduces the Syntactic Dependency-Aware Neural Networks (SDANNs), a groundbreaking model designed to harness the full power of the entire dependency tree. This approach marks a significant departure from the conventional methods. Instead of the rigid rule-based pruning, SDANNs implement a more flexible and dynamic 'soft-pruning' technique. This method allows the model to adaptively focus on the sub-structures within the dependency tree that are most relevant for understanding the relationships between entities. By doing so, it ensures that no vital information is overlooked, and all potential connections are considered. The efficacy of SDANNs is not just theoretical but has been empirically validated through extensive testing and evaluations across a wide range of tasks. These tasks include the extraction of complex relations spanning multiple sentences, as well as detailed analyses at the sentence level. In each of these scenarios, SDANNs have demonstrated a remarkable ability to leverage the full structural complexity of dependency trees. This capability sets them apart from existing models, enabling a more nuanced and comprehensive analysis of textual relations. The results of these evaluations consistently show that SDANNs not only meet but significantly exceed the performance of prior models. This superiority is evident in the way SDANNs handle the multifaceted and often subtle interactions within the text, offering insights that were previously inaccessible with conventional methods. In summary, the Syntactic Dependency-Aware Neural Networks represent a significant advancement in the field of text analysis. By fully embracing the complexity of syntactic dependency trees and employing a sophisticated 'soft-pruning' approach, SDANNs open new avenues for exploring and understanding the intricate relationships that exist within written language. This model stands as a testament to the potential of combining advanced neural network architectures with a deep understanding of linguistic structures, paving the way for more accurate, nuanced, and comprehensive analyses of text.

In this paper, we delve into the realm of aspect-level sentiment analysis, a sophisticated analytical task focused on pinpointing and interpreting the sentiment directed towards specific elements within a sentence. Traditional methods in this domain, primarily based on neural networks, have often overlooked the critical role of syntactic structures in sentences. To bridge this gap, we have developed the Syntax-Enhanced Sentiment Graph Network (SentiSyn). This pioneering model represents a significant step forward in aspect-level sentiment analysis, bringing to the forefront the utilization of word dependency relationships to enrich sentiment analysis. SentiSyn stands out by its innovative use of a dependency graph, a tool that meticulously maps out the intricate web of syntactic relationships surrounding a target aspect in a sentence. This approach allows SentiSyn to effectively capture and channel sentiment-related characteristics that are deeply rooted in the syntactic context of the aspect target. By doing so, SentiSyn unlocks a deeper understanding of sentiment dynamics in textual content, enabling a more nuanced and accurate sentiment analysis. Our comprehensive experimental evaluation of SentiSyn showcases its remarkable capabilities. When combined with advanced embedding techniques like GloVe and BERT, SentiSyn demonstrates a superior performance edge over several existing sentiment analysis methods. This performance leap is not just incremental; it represents a significant enhancement in the field of sentiment analysis, underscoring the importance of syntactic context in understanding sentiments. Furthermore, our analysis delves into how SentiSyn effectively leverages these embeddings to gain a more profound and contextually rich insight into sentiment dynamics. The results from our tests indicate that SentiSyn, with its unique approach to integrating syntactic structures and advanced embeddings, sets a new benchmark in aspect-level sentiment analysis, offering both enhanced accuracy and deeper sentiment understanding.

Traffic congestion and frequent traffic accidents have become main problems affecting urban traffic. Effective location prediction of vehicle trajectory can help alleviate traffic congestion, reduce the occurrence of traffic accidents, and optimize the urban traffic system. Vehicle trajectory is closely related to the surrounding Points of Interest (POI). POI can be considered as the spatial feature and can be fused with trajectory points to improve prediction accuracy. A Local Dynamic Graph Spatiotemporal- Long Short-Term Memory (LDGST-LSTM) is proposed in this paper to extract and fuse the POI knowledge and realize next location prediction. POI semantic information is learned by constructing the traffic knowledge graph, and spatial and temporal features are extracted by combining Graph Attention Network (GAT) and temporal attention mechanism. Moreover, the weights of POI that influence location prediction are visualized to improve the interpretability of the proposed model. The effectiveness of LDGST-LSTM is verified on two datasets, including Chengdu taxi trajectory data in October 2018 and August 2014. The accuracy and robustness of the proposed model are significantly improved compared with the benchmark models.

In this work, a modeling technique utilizing the P-Graph framework was used for a case 1 study involving biomass-based local energy production. In recent years, distributed energy systems 2 gained attention. These systems aim at satisfying energy supply demands, supporting the local 3 economy, decreasing transportation needs and dependence on imports, and in general obtaining a 4 more sustainable energy production process. Designing such systems is a challenge, for which novel 5 optimization approaches were developed to help decision-making. Previous work used the P-Graph 6 framework to optimize energy production in a small rural area, involving manure, intercrops, grass, 7 and corn silage as inputs, and fermenters. Biogas is produced in fermenters, and Combined Heat 8 and Power (CHP) plants provide heat and electricity. A more recent result introduced the concept of 9 operations with flexible inputs in the P-Graph framework. In this work, the concept of flexible inputs 10 was applied to model fermenters in the original case study. A new implementation of the original 11 decision problem was made both as a Mixed-Integer Linear Programming (MILP) model and as a 12 purely P-Graph model by using the flexible input technique. Both approaches provided the same 13 optimal solution, with a 31% larger profit than originally reported.

Air quality is one of the most concerning problems in major industrialized cities in the world. Prediction of future air quality is highly relevant to public health. In some big cities, multiple air quality measurement stations are deployed at different locations to monitor air pollutants, such as NO2, CO, PM 2.5 and PM 10, over time. At every monitoring time stamp t, we observe one station×feature matrix xt of the pollutant data, which represents a spatio–temporal process. Traditional methods on prediction of air quality typically use data from one station or can only predict a single pollutant (such as PM 2.5) at a time, which ignores the spatial correlation among different stations. Moreover, the air pollution data are typically highly nonstationary, We propose a de-trending graph convolutional LSTM (long short term memory) to continuously predict the whole station×feature matrix in the next 1 to 48 hours, which not only captures the spatial dependency among multiple stations by replacing an inner product with convolution, but also incorporates the de-trending signals (transform a nonstationary process to a stationary one by differencing the data) into our model. Experiments on the air quality data of the city Chengdu and multiple major cities in China demonstrate the feasibility of our method and show promising results.

In large-scale parallel computing and communication systems, an interconnect network structure is usually modeled as a graph, in which vertices and edges correspond to processors and communication links, respectively. In a graph, the vertices and edges are likely to fail, so we must think about the fault tolerance of a graph. Connectivity is an important parameter in the study of faulty tolerance for a graph. In this paper, we study a special class of connectivity: $m$-component connectivity, this is a natural generalization of the classical connectivity of graphs defined in terms of the minimum vertex-cut. Let $F$ is a vertex set of $G$ $(i.e, F\subseteq V(G))$, if the following conditions are satisfied, we say $F$ is a $m$-component cut: $(1)$ $G-F$ is disconnected; $(2)$ the number of components in $G-F$ is greater than or equal to $m$. In another word, the $m$-component connectivity $c\kappa_{m}(G)$ is defined as $min\{|F|~|~F\subseteq V(G)$ and $F$ is a $m$-component cut$\}$. Determining $m$-component connectivity is still unsolved in most interconnection networks even for small $m'$s. Leaf-sort graph is a special Cayley graph, it has many special properties that are different from other Cayley graphs. So we need to pay attention to some of it's special properties when we study it. In this paper, we can get the values: $c\kappa_{3}(CF_{n})=3n-6$ $(n$ is odd$)$ and $c\kappa_{3}(CF_{n})=3n-7$ $(n$ is even$)$ for $n\geq3$; $c\kappa_{4}(CF_{n})=\frac{9n-21}{2}$ $(n$ is odd$)$ and $c\kappa_{4}(CF_{n})=\frac{9n-24}{2}$ $(n$ is even$)$ for $n\geq4$; $c\kappa_{5}(CF_{n})=6n-16$ $(n$ is odd$)$ and $c\kappa_{5}(CF_{n})=6n-18$ $(n$ is even$)$ for $n\geq5$.

The idea of strong and weak adjacencies between vertices has been generalized into fuzzy graphs and intuitionistic fuzzy graphs (IFGs) and it is an important part of making decisions. However, one or two membership degrees are not always sufficient for making decisions on real-world problems that need an answer of types “yes, neutral, and no". Consequently, in previous work, we generalized the concept into picture fuzzy graphs (PFGs) where each element in the PFG has membership, neutral, and non-membership degrees. Moreover, we constructed the notion of the coloring of PFGs based on strong and weak adjacencies between vertices. In this paper, we investigate some properties of the chromatic number of PFGs based on the concept of strong and weak adjacencies between vertices. According to the properties, we construct an algorithm to find the chromatic number of PFGs. The algorithm is usefull when we work with large PFGs. Further, we improve the method to implement the PFG’s coloring for determining traffic signal phasing at an intersection. A case study has also been done to evaluate the method.

In different fields in our life, like physics, coding theory and computer science, graph labeling dramas an vital role and appears in many applications. A labeling of a graph is a map which assign each element in with a positive integer number. An edge irregular total -labeling is a function such that where and are weights for any two distinct edges. In this case, has total edge irregularity strength (TEIS) if is minimum. In our paper, we defined a new type of graphs called a triple star snake graph and star snake graph . Also, we investigated TEIS for a triple star snake graph . After that, we generalized the results for star snake graph .

Based on the teaching material of "Robotics" course, this paper studied the automatic knowledge graph construction, including knowledge points extraction and knowledge point relation extraction. We proposed a new method of extracting the first-level, second-level, and third-level knowledge points as well as their prerequisite relations of knowledge points in the textbook. For the problem of insufficient knowledge of the pre-trained language model in the specific field, methods such as incremental pre-training and optimization of cost functions are employed to integrate subject knowledge into the pre-trained language model, thus improving its effectiveness. To overcome the problem that the traditional method of relationship extraction can not be applied directly to the extraction of teaching materials, a new scheme for knowledge point relationship extraction based on keyword relationship is proposed. The experimental data from textbooks shows that the F1 score of knowledge point extraction reaches 93%, considerably improved compared to the traditional model. Consequently, the knowledge point entity extraction and relationship extraction methods based on the pre-trained model can effectively extract structured information and facilitate the automatic construction of knowledge graphs.

Next-generation cancer and oncology research needs to take full advantage of the multi-modal structured, or graph, information, with the graph datatypes ranging from molecular structures to spatially resolved imaging and digital pathology to biological networks to knowledge graphs. Graph Neural Networks (GNNs) efficiently combine the graph structure representations with the high predictive performance of deep learning, especially on the large multi-modal datasets. In this review article, we survey the landscape of recent (2020-present) GNN applications in the context of cancer and oncology research, and delineate six currently predominant research areas. Subsequently, we identify the most promising directions for future research. We compare GNNs with graphical models and "non-structured" deep learning, and devise the guidelines for cancer and oncology researchers or physician-scientists asking the question of whether they should adopt the GNN methodology in their research pipelines.

Drug-target affinity (DTA) prediction is crucial for understanding molecular interactions and aiding drug discovery and development. While various computational methods have been proposed for DTA prediction, their predictive accuracy remains limited, failing to delve into the structural nuances of interactions. With increasingly accurate and accessible structure prediction of targets, we developed a novel deep learning model, named S2DTA, to accurately predict DTA by fusing sequence and structural knowledge of drugs, targets, and pockets using heterogeneous models based on graph and semantic networks. Experimental findings underscored that complex feature representations imparted negligible enhancements to the model’s performance. However, the integration of heterogeneous models demonstrably bolstered predictive accuracy. In comparison to three state-of-the-art methodologies, the supremacy of S2DTA became strikingly apparent. It showcased a noteworthy 25.2% reduction in Mean Absolute Error (MAE) and an impressive 20.1% decrease in Root Mean Square Error (RMSE). Furthermore, S2DTA exhibited substantial advancements in other pivotal metrics, including Pearson Correlation Coefficient (PCC), Spearman, Concordance Index (CI), and R2. These metrics experienced remarkable increments of at least 19.6%, 17.5%, 8.1%, and a remarkable 49.4%, respectively. Finally, we conducted interpretability analysis on the effectiveness of S2DTA by bidirectional self-attention mechanism, fully proving that S2DTA is a valuable and accurate tool for predicting DTA. For further exploration, the source data and code repository can be accessed at https://github.com/dldxzx/S2DTA.

In this research, we present a comprehensive methodology to categorize perfumes based on their fragrance profiles and subsequently aid in creating innovative odoriferous molecules using advanced neural networks. Drawing from data on Parfumo and the Good Scents Company webpage (Parfumo, 2008; The Good Scents Company, 2021), the study employs sophisticated web scraping techniques to gather diverse perfume attributes. Following this, a k-means algorithm is applied for perfume clustering, paving the way for recommending similar scents to consumers. The process then bridges customer preferences to molecular design by incorporating their feedback into generating new molecules via graph neural networks (GNNs). Through converting the Simple Molecular Input Line Entry System (SMILES) representation into graph structures, the GNN facilitates the creation of new molecular designs attuned to consumer desires. The proposed approach offers promising avenues for consumers to pinpoint similar perfume choices, incorporating feedback, and for manufacturers to conceptualize new fragrant molecules with a high likelihood of market resonance.

We address the problem of finding a unique graph embedding that best describes a graph's "topology". This issue is of particular interest in the chemistry of materials. Graphs that admit a tiling in 3-dimensional Euclidean space are termed tessellate, those that do not decussate. We give examples of decussate and tessellate graphs that are finite and 3-periodic. We conjecture that a graph has at most one tessellate embedding. We give reasons for considering this the default "topology" of periodic graphs.

Network neuroscience delves into comprehending the intricate arrangement and interactions within the neural networks of the brain. By merging insights from both neuroscience and network theory, it investigates the brain's structure and function through the lens of interconnected nodes (symbolizing brain regions) and edges (symbolizing the connections among these regions) forming a dynamic network. Graph metrics play a pivotal role in neuroscience by providing quantifiable insights into the intricate connectivity patterns within the brain's neural networks. Frequently, nodes are extracted from functional or structural atlases, which can lead to diverse shapes and sizes. Nevertheless, our understanding of how these differing node characteristics and definitions impact the computed graph metrics in neuroimaging data remains limited. This study adopts a data-driven methodology to delineate functional nodes, subsequently examining the influence of their sizes on resultant graph metrics. By employing the Neuromark framework, an entirely automated independent component analysis (ICA) is applied to resting state fMRI data. Through this, functional network connectivity (FNC) matrices are computed—capturing Pearson correlations between component-time courses—while employing a proportional threshold to streamline node connections based on these correlations. Subsequently, various global and local graph metrics are computed, offering insights into network characteristics. Global metrics provide an overarching summary of the network structure, while local measures delve into structural intricacies at the individual component level. Node sizes are computed based on voxel counts surpassing a designated threshold. Next, we calculated the Pearson correlation between the obtained node sizes and the graph metrics, which we term 'node-metric coupling' (NMC). Our findings revealed consistent and noteworthy correlations between the values of graph metrics and the dimensions of brain nodes. To delve deeper into the implications of this correlation, we examined the node-metric coupling within a dataset comprising Alzheimer's disease, mild cognitive impairment, and control subjects. The disparities observed in node-metric coupling among these groups underscore the necessity of accounting for this factor during analysis. The two principal outcomes of this study are as follows: Firstly, the substantial interplay between varying node sizes within a given atlas and the resultant graph metrics; and secondly, the potential utility of node-metric coupling as a viable biomarker for brain disorders. These discoveries hold significant ramifications. While comparing studies employing diverse atlases is already a challenge, our work highlights an additional, critical source of variability: accounting for node sizes. Consequently, the association between intra-atlas node size and graph metric should be thoughtfully acknowledged in future neuroimaging investigations.

A signed graph is an undirected graph such that all of its edges are labeled positive or negative. Let D be an embedding of a signed graph G in the Euclidean line. If in D for all of the vertices their positive neighbors are closer than the negative neighbors, then D is called a valid drawing of G. In this paper we show that signed trees, unicyclic graphs, and ladder graphs have a valid drawing in the Euclidean line.

An important indicator of human-related pollution in watersheds is dissolved oxygen (DO). The DO is highly dependent on both space and time characteristics of the watershed and is directly linked to eutrophication, which impairs the development of both the aquatic fauna and flora, also negatively impacting the water quality. Aspiring to reach a more accurate and precise forecasting approach to predict levels of DO, the present work proposes new graph-based and transformer-based deep learning models. The models were trained and validated for the Credit River Watershed, and the results were compared with both benchmarking and literature-found approaches. The proposed Graph Neural Network Sample and Aggregate (GNN-SAGE) model was the best-performing approach, reaching coefficient of determination (R2) and Root Mean Squared Error (RMSE) values of 97% and 0.34 ppm, respectively. The findings from the Shapley additive explanations (SHAP) indicated that the GNN-SAGE benefited from spatiotemporal information from the surrounding stations, improving the model’s results, and that temperature is a major input attribute for determining future DO levels. The results established that the proposed GNN-SAGE model stands as a state-of-the-art solution for DO forecasting, with potential for real-time water quality applications.

This paper initiates the study of the mathematical aspects of the ad-hoc Lanzhou index. If G is a graph with the vertex set {x1,⋯,xn}, then the ad-hoc Lanzhou index of G is defined by Lz¯(G)=∑i=1ndi(n−1−di)2, where di represents the degree of the vertex xi. Several identities for the ad-hoc Lanzhou index, involving some existing topological indices are established. The problems of finding graphs with the extremum values of the ad-hoc Lanzhou index from the following sets of graphs are also attacked: (i) set of all connected ξ-cyclic graphs of a fixed order, (ii) set of all connected molecular ξ-cyclic graphs of a fixed order, (iii) set of all graphs of a fixed order, (iv) set of all connected molecular graphs of a fixed order.

The graph model enables a broad range of analysis, thus graph processing is an invaluable tool in data analytics. At the heart of every graph processing system lies a concurrent graph data structure that stores the graph. Such a data structure needs to be highly efficient for both graph algorithms and queries. Due to the continuous evolution, the sparsity, and the scale-free nature of real-world graphs, graph processing systems face the challenge of providing an appropriate graph data structure that enables both fast analytical workloads and low-memory fast graph mutations. Existing graph structures offer a hard tradeoff between read-only performance, update friendliness, and memory consumption upon updates. In this paper, we introduce CSR++, a new graph data structure that removes these tradeoffs and enables both fast read-only analytics and quick and memory-friendly mutations. CSR++ combines ideas from CSR, the fastest read-only data structure, and adjacency lists to achieve the best of both worlds. We compare CSR++ to CSR, adjacency lists from the Boost Graph Library, as well as state-of-the-art update-friendly graph structures: LLAMA, STINGER, GraphOne, and Teseo. In our evaluation, which is based on popular graph processing algorithms executed over real-world graphs, we show that CSR++ remains close to CSR in read-only concurrent performance (within 10% on average), while significantly outperforming CSR (by an order of magnitude) and LLAMA (by almost 2×) with frequent updates. We also show that both CSR++’s update throughput and analytics performance exceed that of several state-of-the-art graph structures, while maintaining low memory consumption when the workload includes updates.

The technical capabilities of modern Industry 4.0 and Industry 5.0 are rather vast and growing exponentially daily. The present-day Industrial Internet of Things (IIoT) combines manifold underlying technologies that require real-time interconnections and communications among heterogeneous devices. Smart cities are established with sophisticated designs and control for seamless Machine-to-Machine (M2M) communication to optimize resources, costs, performances, and energy distribution. All the sensory devices within a building interact to maintain a sustainable climate for residents and intuitively optimize the energy distribution to optimize energy production. However, it encompasses quite a few challenges for devices that lack compatible and interoperable designs. Conventional solutions are restricted to limited domains or rely on engineers to design and deploy translators for each pair of ontologies. This is a costly process in terms of engineering efforts and computational resources. The issue persists that a new device with a different ontology must be integrated into an existing IoT network. We propose a self-learning model that can determine the taxonomy of devices given their ontology meta-data and structural information. The model finds matches between two distinct ontologies using the Natural Language Processing (NLP) approach for learning linguistic contexts. Then, by visualizing the ontology network as a knowledge graph, it is possible to learn the structure of the meta-data and understand the device's message formulation. Finally, it can align entities of both ontology graphs similar in context and structure. Furthermore, the model performs dynamic M2M translation without requiring extra engineering or hardware efforts.

The Randić index of a graph G is the sum of (dG(u)dG(v))−1/2 over all edges uv of G, where dG(u) denotes the degree of vertex u in G. In this paper, we investigate a few graph transformations that decrease Randić index of graph. By applying those transformations, we determine the minimum Randić index on tricyclic graphs, and characterize the corresponding extremal graphs.

Due to the inclusion of both the principles and divination methods, the study of Yijing (Yijing) becomes more complex. The complex data types, diverse semantic relationships, and unclear influencing mechanisms in Yijing pose challenges to its scientific research. Knowledge graph, as an advanced way of organizing knowledge, can provide technical support in exploring the hidden connections and knowledge structure within text resources. This paper proposes a method of constructing a Yijing knowledge graph based on Neo4j. By analyzing the concepts, entities, and various related relationships in Yijing, the method discusses the basic architecture, data model, and implementation steps of constructing the Yijing knowledge graph. It also extracts, integrates, and structures the Yijing knowledge, allowing for inquiries, associations, and reasoning about the knowledge and its various elements. By adopting a top-down approach, the paper reconstructs the fundamental knowledge system of the Yijing, including yin-yang, the five elements, generation and restriction, 64 hexagrams, and six lines(yao). It establishes a knowledge graph pattern layer and a data layer that encompass concepts, attributes, and relationships. With the technical support of the Neo4j platform, the visualization and retrieval of Yijing knowledge are realized, providing new ideas and methods for studying the mechanisms of the Yijing. The proposed method of constructing a Yijing knowledge graph can be expanded to other types of ancient scripture knowledge graph research and can be applied to the field of digital humanities, promoting in-depth cross-disciplinary research and integration.

In recent years, graph neural networks (GNNs) have become a promising method for analyzing data structured in graph format. By considering connections between entities in a graph, GNNs are able to extract valuable insights. One notable variation of GNN is the graph attention network (GAT), which employs the attention mechanism and has demonstrated promising performance in various applications. However, its ability to incorporate feature information from nodes beyond the immediate neighborhood is limited, leading to degraded performance on heterophilic data. To address this limitation, this thesis proposes a novel attention-based model, namely the Directional Graph Attention Network (DGAT). This model combines the feature-based attention with the global directional information extracted from the graph topology, as inspired by the Directional Graph Network (DGN). A new class of Laplacian matrices is proposed and an existing theoretical result on DGN is extended. This extension bridges a gap in the literature. The experimental results presented in the thesis, based on nine real-world benchmarks and ten synthetic data sets, demonstrate the superiority of the proposed DGAT model compared to the GAT baseline model. Particularly on heterophilic data sets, DGAT showed a notable average increase of approximately 35% in node classification tasks across all heterophilic real-world data sets. In addition, DGAT outperforms GAT by an average margin of around 51% in all ten synthetic data sets with various levels of heterophily

Using graph theory, computer aided motion, static force and power flow analysis of planetary gear mechanism is realized. The motion, static force and efficiency calculations of 6HP26 automatic transmission are carried out. Based on kinematic and static force analysis model, related matrices are acquired. Hence, kinematic and static force analysis of planetary gear mechanism is achieved. The link power can be determined by the link speed and torque. Power flow diagrams of each gear are acquired. The efficiency is calculated by transmission ratio method.

An automatic recognizing system of white blood cells can assist hematologists in the diagnosis of many diseases, where accuracy and efficiency are paramount for computer-based system. In this paper, we present a new image processing system to recognize the five types of white blood cells in peripheral blood with marked improvement in efficiency when juxtaposed against mainstream methods. The prevailing deep learning segmentation solutions often utilize millions of parameters to extract high-level image features and neglect the incorporation of prior domain knowledge, which consequently consume substantial computational resources and increase the risk of overfitting, especially when limited medical image samples are available for training. To address these challenges, we propose a novel memory-efficient strategy that exploits graph structures derived from the images. Specifically, we introduce a lightweight superpixel-based Graph Neural Network (GNN) and break new ground by introducing superpixel metric learning to segment nucles and cytoplasm. Remarkably, our proposed segmentation model (SMGNN) achieves state-of-the-art segmentation performance while utilizing at most 10000$\times$ less than the parameters compared to existing approaches. The subsequent segmentation-based cell type classification processes show satisfactory results that such automatic recognizing algorithms are accurate and efficient to execeute in hematological laboratories.

Among the various generalizations of persistent topology, the one based on rank functions and leading to indexing-aware functions appears to be particularly suited to catch graph-theoretical properties without the need for a simplicial construction and a homology computation. This paper defines and studies "simple" and "single-vertex" features in directed and undirected graphs, by which several indexing-aware persistence functions are produced, within the scheme of steady and ranging sets. The implementation of the "sink" feature and its application to trust networks provide an example of the ease of use and meaningfulness of the method.

With the deepening of the diversification and openness of financial system, financial vulnerability, as an endogenous attribute of financial system, becomes an important measurement of financial security. Based on network analysis, we introduce network curvature indicator improved by Copula entropy as an innovative metric of financial vulnerability. Compared with previous network curvature analysis method, CE-based curvature proposed in this paper can measure market vulnerability and systematic risk with significant advantages.

Generally, when cognitive radio users are in Underlay mode, through the analysis of the electromagnetic spectrum in time, frequency, space, and field of multiple dimensional data accounts for judging the inherent correlation of the radio spectrum used/idle state, this is the realization of cognitive radio users (secondary users, SUs) efficient access to the foundation of the limited spectrum resources. Therefore, how to efficiently use of spectrum status of each SU implementation of reception multidimensional combination forecasting is the core of this paper addressing the problem. In this paper, we propose a deep-learning hybrid model called TensorGCN-LSTM based on the tensor data structure. The model treats SUs deployed at different spatial locations under the same frequency and the spectrum status of SUs themselves under different frequencies in the task area as nodes and constructs two types of graph structures. Graph convolutional operations are used to sequentially extract corresponding spatial-domain and frequency-domain features from the two types of graph structures. Then, the long short-term memory (LSTM) model is used to fuse the spatial, frequency, and temporal features of the cognitive radio environment data. Finally, the prediction task of the spectrum distribution situation is accomplished through fully connected layers. Specifically, the model constructs a tensor graph based on the spatial similarity of SUs' locations and the frequency correlation between different frequency signals received by SUs, which describes the electromagnetic wave's dependency relationship in spatial and frequency domains. LSTM is used to capture the electromagnetic wave's dependency relationship in the temporal domain. To evaluate the effectiveness of the model, we conducted ablation experiments on LSTM, GCN, GC-LSTM, and TensorGCN-LSTM models using simulated data. The experimental results show that our model achieved better prediction performance in RMSE, and the correlation coefficient R2 of 0.8753 also confirmed the feasibility of the model.

Knowledge graphs (KGs) play a crucial role in many applications, such as question answering, but incompleteness is an urgent issue for their broad application. Much research in knowledge graph completion (KGC) has been performed to resolve this issue. The methods of KGC can be classified into two major categories: rule-based reasoning and embedding-based reasoning. The former has high accuracy and good interpretability, but a major challenge is to obtain effective rules on large-scale KGs. The latter has good efficiency and scalability, but it relies heavily on data richness and cannot fully use domain knowledge in the form of logical rules. We propose a novel method that injects rules and learns representations iteratively to take full advantage of rules and embeddings. Specifically, we model the conclusions of rule groundings as 0-1 variables and use a rule confidence regularizer to remove the uncertainty of the conclusions. The proposed approach has the following advantages: 1) It combines the benefits of both rules and knowledge graph embeddings (KGEs) and achieves a good balance between efficiency and scalability. 2) It uses an iterative method to continuously improve KGEs and remove incorrect rule conclusions. Evaluations on two public datasets show that our method outperforms the current state-of-the-art methods, improving performance by 2.7% and 4.3% in mean reciprocal rank (MRR).

The Harmonic Graphs Conjecture states that there exists an asymptotic relation involving the Harmonic Index and the natural logarithm as the order of the graph increases. This conjecture, grounded in the novel context of Prime Graphs, draws upon the Prime Number Theorem and the sum of divisors function to unveil a compelling asymptotic connection. By carefully expanding the definitions of the harmonic index and the sum of divisors function, and leveraging the prime number theorem's approximations, we establish a formula that captures this intricate relationship. This work is an effort to contribute to the advancement of graph theory, introducing a fresh lens through which graph connectivity can be explored. The synthesis of prime numbers and graph properties not only deepens our understanding of structural complexity but also paves the way for innovative research directions.

Consensus algorithms are the core technology of blockchain and a focus in the current distributed system research. The consensus algorithms are widely used in distributed systems, it has solved the decentralization problem. The traditional consensus algorithm needs the process of node legitimacy checking, identity authentication, and primary node view change, so the time cost of reaching an agreement between nodes is still exponential. In response to the problem, a lightweight consensus algorithm based on graph (LCAG) is proposed for the Internet of Things (IoT) in this paper, which is proposes an access control table, and reaches an agreement among nodes by calculating the probability of nodes in the control table, and reduces the time overhead of the reaching an agreement in distributed systems. We have carried out simulation experiments for the new algorithm, and the experiments show that: the new algorithm needs less time overhead than the classical Byzantine algorithm need, as well as Byzantine Generals problem (BGP), practical Byzantine fault-tolerant algorithm (PBFT) and directed acyclic graph (DAG) algorithm, and so on. The new algorithm can be applied to the devices of IoT, which have limited computing power.

In bioinformatics research, traditional machine learning methods have demonstrated efficacy in addressing Euclidean data. However, real-world data often encompasses non-Euclidean forms, such as graph data, which contain intricate structural patterns or high-order relationships that elude conventional machine-learning approaches. Representation learning seeks to derive valuable data representations from enhancing predictive or analytic tasks, capturing vital patterns and structures. This method has proven particularly beneficial in bioinformatics and biomedicine, as it effectively handles high-dimensional, sparse data, detects complex biological patterns, and optimizes predictive performance. In recent years, graph representation learning has become a popular research direction. It embeds graphs into a low-dimensional space while preserving the structural and attribute information of the graph, enabling better feature extraction for downstream tasks. This study extensively reviews representation learning advancements, particularly in the research of representation methods since the emergence of COVID-19. We begin with an analysis and classification of neural network-based language model representation learning techniques as well as graph representation learning methods. Subsequently, we explore their methodological innovations in the context of COVID-19, with a focus on the domains of drugs, public health, and healthcare. Furthermore, we discuss the challenges and opportunities associated with graph representation learning. This comprehensive review presents invaluable insights for researchers as it documents the development of COVID-19 and offers experiential lessons to preempt future infectious diseases. Moreover, this study guides future bioinformatics and biomedicine research methodologies.

This paper presents the use of Graph Neural Networks (GNNs) to predict the tensile strength of Fused Deposition Modeling (FDM) specimens. In the present work, there are four main input parameters i.e. Infill percentage, Layer height, Print speed and Extrusion temperature while the Tensile Strength is an output parameter were considered. This study includes use of central composite design based response surface methodology to finalize the experimental layout. 3D printed specimen were manufactured as per the ASTM E8 standard on FDM printer using Polylactic Acid (PLA) as filament. Micro-tensile test were performed on the printed specimen as per ASTM E8 standard. The GNN algorithm was trained on a dataset of FDM specimens, achieving a mean squared error (MSE) of 2.47, mean absolute error (MAE) of 1.14, and R-squared value of 0.78. An adjacency matrix, which shows the connections between nodes in a graph. The obtained plot for nodes and weights in a GNN provide valuable information about the model and its performance. The results show the potential of using GNNs in predicting the mechanical properties of additively manufactured specimens and provide a promising direction for further research in this field.

In cold-climate regions, road salt is used as a de-icer for winter road maintenance. The applied road salt melts ice and snow on roads, being washed off through storm sewer systems into nearby urban streams, harming the freshwater ecosystem. Addressing the gap in the knowledge regarding the use of deep learning approaches for urban stream water quality forecasting, the present work discusses our implementation of a “Graph Neural Network” - “Sample and Aggregate” (GNN-SAGE) model for forecasting chloride concentrations in the Credit River in Ontario, Canada. The proposed GNN-SAGE is compared to other models, including a Deep Neural Network based transformer (DNN-Transformer) and a benchmarking persistence model for 6 hours forecasting horizon. Ac-cording to the results, the GNN-SAGE model surpasses other models in providing accurate predic-tions of chloride concentrations within the assessed prediction window. Also, a SHAP analysis provides insight into the variables that influence the model’s forecasting, showing the impact of the spatiotemporal neighbouring data from the network and the seasonality variables on the model’s result. The GNN-SAGE model shows potential for use in real-time forecasting of water quality in urban streams, aiding in the development of regulatory policies to protect the vulnerable freshwater ecosystems in urban areas.

Shannon entropy quantifying bi-colored Ramsey complete graphs is introduced. Complete graphs in which vertices are connected with two types of links, labeled as α-links and β-links are considered. Shannon-entropy is introduced according to the classical Shannon formula considering the fractions of monochromatic convex α-colored polygons with n α-sides or edges, and the fraction of monochromatic β-colored convex polygons with m β-sides in the given complete graph. Introduced Shannon entropy is insensitive to the exact shape of the graph, but it is sensitive to the distribution of monochromatic polygons in a given graph. The introduced Shannon Entropies Sα and Sβ are interpreted as follows: Sα is interpreted as an average uncertainty to find the green α-polygon in the given graph, Sβ is, in turn, an average uncertainty to find the red β-polygon in the same graph. The re-shaping of the Ramsey theorem in terms of the Shannon Entropy is suggested. Various measures quantifying the Shannon Entropy of the entire complete bi-colored graphs are suggested. Physical interpretations of the suggested Shannon Entropies are discussed.

Many parameters and complex boundaries are involved in the spatial arrangement of an under-ground powerhouse for a hydropower station, which requires reference to many relevant cases and specifications. However, in practical applications, retrieving relevant cases or specifications is difficult, and there is a lack of knowledge of cascading logic among design parameters. For this question, a targeted knowledge graph based on knowledge graph management technology is established to support subsequent applications. This paper proposes a new concept of con-structing a knowledge graph for building information modeling (BIM) underground power-houses of hydropower stations. Firstly, the ontology skeleton of hydropower station spatial ar-rangement design, which represents the knowledge organization structure of the knowledge graph, is reconstructed by carefully analyzing the requirements for intelligent modeling of un-derground powerhouses. A large amount of unstructured data is identified based on optical character recognition (OCR) technology and is divided into words to extract correlation knowledge based on THULAC. In the next step, the knowledge triad of the spatial arrangement of the underground powerhouse is extracted based on ChatGPT and stored in a Neo4j knowledge base to build a knowledge graph. Finally, the knowledge graph is serviced to realize the query of knowledge and parameter recommendation to assist the digital intelligent design of spatial arrangement of an underground powerhouse of pumped storage hydropower stations.

As various services have been generating large scale graphs to represent multiple relationships between objects, studies have been conducted to obtain subgraphs with particular patterns. In this paper, we propose a distributed query processing method to efficiently search a subgraph for a large graph on Spark. To reduce unnecessary processing costs, the search order is determined by filtering scores using the probability distribution. The partitioned queries are searched in parallel in the distributed graph of each slave node according to the search order, and the local search results obtained from each slave node are combined and returned. The query is partitioned in triplets based on the determined search order. The performance of the proposed method is compared with the performance of existing methods to demonstrate its superiority.

In this paper, we demonstrate a useful interaction between the theory of clique partitions, edge clique covers of a graph, and the spectra of graphs. Using a clique partition and an edge clique cover of a graph we introduce the notion of a vertex-clique incidence matrix for a graph and produce new lower bounds for the negative eigenvalues and negative inertia of a graph. Moreover, utilizing these vertex-clique incidence matrices, we generalize several notions such as the signless Laplacian matrix, and develop bounds on the incidence energy and the signless Laplacian energy of the graph. %The tight upper bounds for the energies of a graph and its line graph are given. More generally, we also consider the set $S(G)$ of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent. An important parameter in this setting is $q(G)$, and is defined to be the minimum number of distinct eigenvalues over all matrices in $S(G)$. For a given graph $G$ the concept of a vertex-clique incidence matrix associated with an edge clique cover is applied to establish several classes of graphs with $q(G)=2$.

Drugs-drugs interactions(DDI) are entities composed of different chemical substructures (functional groups). In existing methods that predict drug–drug interactions based on the usage of substructures, each node is considered the center of a substructure, and adjacent nodes eventually become centers of similar substructures, resulting in redundancy. Furthermore, the significant differ- ences in structure and properties among compounds can lead to unrelated pairings, making it difficult to integrate information. This heterogeneity negatively affects the prediction results. To address these issues, we propose a drug–drug interaction prediction method based on substructure signature learning (DDI-SSL). This method extracts useful information from local subgraphs surrounding drugs and effectively utilizes substructures to assist in predicting drug side effects. Additionally, a deep clustering algorithm is used to aggregate similar substructures, allowing any individual subgraph to be reconstructed using this set of global signatures. Furthermore, we developed a layer-independent collaborative attention mechanism to model the mutual influence between drugs, generating signal strength scores for each class of drugs to mitigate noise caused by heterogeneity. Finally, we evaluated DDI-SSL on a comprehensive dataset and demonstrated improved performance in DDI prediction compared to state-of-the-art methods.

Hyperspectral image and LiDAR image fusion plays a crucial role in remote sensing by capturing spatial relationships and modeling semantic information for accurate classification and recognition. However, existing methods, like Graph Convolutional Networks (GCNs), face challenges in constructing effective graph structures due to variations in local semantic information and limited receptiveness to large-scale contextual structures. To overcome these limitations, we proposed a invariant attribute-driven binary bi-branch classification (IABC) method which is a unified network that combines binary Convolutional Neural Network (CNN) and GCN with invariant attributes. Our approach utilizes a joint detection framework that can simultaneously learn features from small-scale regular regions and large-scale irregular regions, resulting in an enhanced structured representation of HSI and LiDAR images in the spectral-spatial domain. This approach not only improves the accuracy of classification and recognition but also reduces storage requirements and enables real-time decision-making, which is crucial for effectively processing large-scale remote sensing data. Extensive experiments demonstrates the superior performance of our proposed method in hyperspectral image analysis tasks. The combination of CNNs and GCNs allows for accurate modeling of spatial relationships and effective construction of graph structures. Furthermore, the integration of binary quantization enhances computational efficiency, enabling real-time processing of large-scale data. Therefore, our approach presents a promising opportunity for advancing remote sensing applications using deep learning techniques.

: Biological networks such as protein interaction networks, gene regulation networks and metabolic pathways are examples of complex networks which are large graphs with small-world and scale-free properties. Analysis of these networks has a profound effect on our understanding the origins of life, health and disease states of organisms, and diagnose diseases to aid the search for remedial processes. In this review, we describe main analysis methods of biological networks using graph theory by first defining main parameters such as clustering coefficient, modularity and centrality. We then survey fundamental graph clustering methods and algorithms followed by the network motif search algorithms with the aim of finding repeating subgraphs in a biological network graph. A frequently appearing subgraph usually conveys a basic function carried out by that small network and discovering such a function provides an insight to the overall function of the organism. Lastly, we review network alignment algorithms that achieve to find similarities between two or more graphs representing biological networks. A conserved subgraph between the biological networks of organisms may mean a common ancestor and finding such relationship may help researchers derive ancestral relationships and predict the future evolution of organisms to enable designing new drugs. We conclude by the current challenging areas of biological network analysis using graph theory and parallel processing for high performance analysis

The root system plays an irreplaceable role in plant growth. Its improvement can increase crop productivity. However, such system is still mysterious for us. The underlying mechanism has not been fully uncovered. The investigation on proteins related to the root system is an important means to complete this task. In the previous time, lack of root-related proteins makes it impossible to adopt machine learning methods for designing efficient models for the discovery of novel root-related proteins. Recently, a public database on root-related proteins was set up and machine learning methods can be applied in this field. In this study, we proposed a machine learning based model, named Graph-Root, for identification of root-related proteins. The features derived from protein sequences and one network were extracted, where the former features were processed by graph convolutional neural network and multi-head attention, and the later features abstracted the linkage between proteins. These features were fed into the fully connected layer to make prediction. The 5-fold cross-validation and independent tests suggested its good performance. It also outperformed the only one previous model, SVM-Root. Furthermore, the importance of each feature type and component in the proposed model was investigated.

Ensuring the integrity of scientific literature is essential for advancing knowledge and research. However, the credibility and trustworthiness of scholarly publications are compromised by manipulated citations. Traditional methods, such as manual inspection and basic statistical analyses, have limitations in detecting intricate patterns and subtle manipulations of citations. In recent years, network-based approaches have emerged as promising techniques for identifying and understanding citation manipulation. This study introduces a novel method to identify potential citation manipulation in academic papers using perturbations of a deep embedding model. The key idea is to reconstruct meaningful connections represented by citations within a network by exploring slightly longer alternative paths. These indirect pathways enable the recovery of original and reliable citations while estimating their trustworthiness. The investigation takes a comprehensive approach to link prediction, leveraging the consistent behavior of prominent connections when exposed to network perturbations. Through numerical experiments, the method demonstrates a high capability to identify reliable citations as the core of the analyzed data and to raise suspicions about unreliable references that may have been manipulated.

Breast cancer is one of the most common types of malignant tumors worldwide and the leading cause of cancer-related deaths in women. According to the latest report from the World Health Organization, breast cancer has surpassed lung cancer, becoming the most diagnosed cancer globally. Herein, a systematic, quantitative, and visual analysis of the scientific achievements in natural products research and development for breast cancer over the past 30 years is presented. The study utilizes bibliometric and knowledge graph visualization techniques to analyze the trends, co-occurrence of keywords, cooperative networks, cited literature, and research hotspots in the field. The analysis shows that breast cancer natural drug development involves mutual cooperation between multiple countries, with China, the United States, and India being the most active players. Pharmacology is the discipline with the largest number of articles published in nearly 30 years. The study also reveals that the extraction of drugs from organisms and their metabolites is an important direction in the current development of anticancer drugs. The development of natural medicines for breast cancer together with the mining of genetic knowledge play an important role in treating human breast cancer. The research presented here provides insights into the current state of natural product research and development for breast cancer, and highlights the need for strengthening mutual communication and cooperation between countries and scientific research institutions to enhance the development of breast cancer treatment technologies and natural medicines.

This paper presents a limited scope dynamic probabilistic risk assessment (D-PRA) on the survivability of commercial of the shelf (COTS) drones tasked with surveilling areas with varying radiation levels after a nuclear accident. The D-PRA is based on a discrete-dynamic event tree (D-DET) approach, which couples with the OpenEPL error propagation framework to model sequences leading to Loss of Mission (LOM) scenarios due to component failures in the drone’s navigation system. Radiation effects are simulated by calculating the total ionizing dose (TID) against the permissible limit per component, and errors are propagated within the electronic hardware and software blocks to quantify navigation system availability per radiation zone. The proposed methods are integrated into the traditional event tree/fault tree approach and the most vulnerable components are radiation-hardened (RAD-HARD) to the extent specified by a predefined mission success criterion. The results demonstrate the usefulness of the proposed approach in performing trade studies for incorporating COTS components into RAD-HARD drone designs.

The popularity and development of social media has made it more and more convenient to spread rumors, and it has become especially important to detect rumor information from massive amounts of information. Most of the traditional rumor detection methods use content characteristics or propagation structure to mine rumor characteristics, ignoring the fusion characteristics of content and structure and their interaction characteristics. Therefore, a novel rumor detection method based on heterogeneous convolutional networks is proposed. Firstly, this paper constructs a heterogeneous map of joint rumor content and propagation structure to explore the interaction between content and propagation structure during rumor propagation and obtain rumor representation. On that basis, this paper uses the deep residual graph convolutional neural network to construct the content and structure interaction information of the current network propagation model. Finally, this paper uses the two datasets of Twitter15 and Twitter16 to verify the proposed method. Experimental results show that the proposed method has higher detection accuracy than the traditional rumor detection method.

This report gives a comprehensive summary of two problems about graph convolutional networks (GCNs): over-smoothing and heterophily challenges, and outlines future directions to explore.

Electroencephalography (EEG) signals are the primary source for discriminating the preictal from the interictal stage, enabling early warnings before the seizure onset. The epileptic seizure prediction models face significant challenges due to data scarcity, diversity, and privacy. This paper proposes a three-tier architecture for epileptic seizure prediction associated with the Federated Learning (FL) model that enhances the capability by utilizing the significant amount of seizure patterns from globally distributed patients with data privacy. The determination of the preictal state is influenced by global and local model-assisted decision-making by modeling the two-level edge layer. Integrating the Spiking Encoder (SE) with Graph Convolutional Neural Network (Spiking-GCNN) works as the local model trained using the bi-timescale approach. Each local model utilizes the aggregated seizure knowledge from the different medical centers through FL and determines the preictal probability in the coarse-grained personalization. The Adaptive Neuro-Fuzzy Inference System (ANFIS) is utilized in fine-grained personalization to recognize epileptic seizure patients by examining the outcomes of the FL model, heart rate variability features, and patient-specific clinical features. The proposed seizure prediction is evaluated using benchmark datasets by comparing them with the existing works to demonstrate the potential results.

The development of knowledge graphs for water resources as a tool for studying sustainable regional development is a relevant task, as the increasing deterioration of water bodies affects the ecology, economy of the country, as well as the health of the population living near water bodies. Solving this problem requires the development of water resource monitoring methods based on semantic data analysis is required to detect and track sources of pollution and provide recommendations to support decision-making. This research proposes a method of semantic analysis for modeling knowledge graphs and constructing rules that enable the integration of data from heterogeneous sources, semantic compatibility, support for reasoning and inference, facilitate queries and search, and represent knowledge in the field of water resource monitoring. As a result, an ontology based on the SWRL language is created, which enables the expression of complex relationships and derivation of new knowledge, SSN for interaction between the ontology and sensor data, and Time Ontology, which models and analyzes information related to temporal aspects.After populating the ontology and establishing logical connections, SPARQL queries are implemented to retrieve new knowledge about water resources.

Chatbots have gained widespread popularity for their task automation capabilities and consistent availability in various domains, including education. However, their ability to adapt to the continuously evolving and dynamic nature of knowledge is limited. This research investigates the implementation of an internet wizard to enhance the knowledge base of an open-domain question-answering chatbot. The proposed approach leverages search engines, particularly Google, and its features, including feature snippets, knowledge graph, and organic search, in conjunction with data science and natural language models. This mechanism empowers the chatbot to dynamically access the extensive and up-to-date knowledge available on the web, enabling the provision of real-time and pertinent answers to user queries sourced from web documents. A pilot study in a higher education context evaluated the chatbot's mechanism and features, confirming its proficiency in generating responses across a broad range of educational and non-educational topics. Positive feedback and high user satisfaction validate these findings. Notably, the chatbot's dynamic feature of retrieving related or follow-up questions from search engines significantly enhances student engagement and facilitates exploration of supplementary information beyond the curriculum.

Traffic shaping is a critical task in software-defined -IoT networks (SDN-IoTs) to efficiently manage network resources and ensure Quality of Service (QoS) for end-users. However, traditional traffic shaping approaches based on queuing theory or static policies may not be effective due to the dynamic and unpredictable nature of network traffic. In this paper, we propose a novel approach that leverages Graph Neural Networks (GNNs) and Multi-arm Bandit algorithms to dynamically optimize traffic shaping policies based on real-time network traffic patterns. Specifically, our approach uses a GNN model to learn and predict network traffic patterns and a Multi-arm Bandit algorithm to optimize traffic shaping policies based on these predictions. We evaluate the proposed approach on three different datasets, including a simulated corporate network (KDD Cup 1999), a collection of network traffic traces (CAIDA), and a simulated network environment with both normal and malicious traffic (NSL-KDD). The results demonstrate that our approach outperforms other state-of-the-art traffic shaping methods, achieving higher throughput, lower packet loss, and lower delay, while effectively detecting anomalous traffic patterns. The proposed approach offers a promising solution to traffic shaping in SDNs, enabling efficient resource management and QoS assurance

Unmanned construction machinery vehicles mostly carry work in bridges, tunnels, and outdoor open spaces. Obtaining accurate pose estimation of the entire vehicle and establishing a map of the surrounding environment is of great significance for path planning and control in the later stage. Traditional simultaneous localization and mapping (SLAM) schemes, which mostly use a single sensor, but there are problems with localization drift and mapping failure in scenarios where there are few geometric features and the environment is prone to degradation. Currently, the multi-sensor fusion strategy has been proven to be an effective solution and widely used in the field of unmanned vehicle localization and mapping. This paper proposes a SLAM framework that tightly couples a LiDAR, IMU and camera to achieve accurate and reliable pose estimation. The framework is based on LiDAR-inertial system(LIS) and factor graph optimization theory. Texture information provided by vision is integrated into the LiDAR-inertial odometry to generate a new visual-inertial subsystem(VIS).The two subsystems, VIS and LIS, can assist each other and work jointly. Through real vehicle tests, the system can perform incremental, real-time state estimation, reconstruct dense 3D point cloud maps,and effectively solve the problems of localization drift and mapping failure in the lack of geometric features or challenging construction environments. Meanwhile, the system has a safety redundancy mechanism. When any subsystem fails, the system can also operate normally, to ensure the reliability and robustness of vehicle positioning.

Application of the Ramsey Theory to the set of the points placed in the plane is discussed. Consider a set of N points located in the same plane. The straight lines connecting these points are yikx=αikx+βik i,k=1...N. Listed below values of slopes αik are possible: αik>0; αik=0; αik is not defined; αik<0. Following coloring procedure is introduced: we connect the pairs of points for which αik>0, αik=0 or αik is not defined, with the red links, and the pairs of points for which αik<0 place with green links. The suggested coloring procedure enables building of the complete bi-colored graph for any set containing N points located in the same plane. We apply the Ramsey theorem to the complete graph emerging from the suggested coloring. For the set containing N=6 points at least one monochromatic triangle will necessarily appear in the graph. The values of the slopes αik depend on the chosen coordinate system. The rotation of coordinate axes changes the coloring of the graph; however, at least one monochromatic triangle will be present for N=6. The introduced coloring procedure diminishes the order of the symmetry group of the regular hexagon, irrespectively to the orientation of the coordinate axes. We hypothesized that this will be true for arbitrary regular n-polygon, independently on the orientation of coordinate axes. The inverse bi-color Ramsey graphs arise, when we replace red links appearing in the source graph with red ones, and vice versa. The total number of triangles in the “direct” and “inverse” Ramsey graphs is the same. We considered the particular case of the set of points for which αik>0 or αik<0 is true in the given coordinates. In this particular case, the rotation of the Cartesian coordinate axes to the angle θ=π2 yields the inverse complete graph. Generalization of this coloring for an arbitrary number and arbitrary location of the source points is introduced.

There has been a great deal of research in the area of using graph engines and graph databases to model network traffic and network attacks, but the novelty of this research lies in visually or graphically representing the Reconnaissance Tactic (TA0043) of the MITRE ATT&CK framework. Using the newly created dataset, UWF-Zeekdata22, based on the MITRE ATT&CK framework, patterns involving network connectivity, connection duration, and data volume were found and loaded into a graph environment. Patterns were also found in the graphed data that match the Reconnaissance as well as other tactics captured by UWF-Zeekdata22. The Star motif was particularly useful in mapping the Reconnaissance tactic. The results of this paper show that graph databases/graph engines can be essential tools for understanding network traffic and trying to detect network intrusions before they happen. Finally, an analysis of the run-time performance of the reduced dataset used to create the graph databases showed that the reduced datasets performed better than the full dataset.

The chemical feedback between building blocks in templated polymerization of diblock copolymers and their consecutive micellization was studied for the first time by means of coarse-grained molecular dynamics simulations. Using a stochastic polymerization model, we were able to reproduce the experimental findings on the effect of chemical feedback on the polymerization rates at low and high solution concentrations. The size and shape of micelles were computed using a newly development software in python conjugated with graph theory. In full agreement with the experiments, our simulations revealed that micelles formed by the templated micellization are more spherical and have lower radius of gyration than those formed by the traditional two-step micellization method. Understanding the underlying mechanisms in templated reaction/assembly of polymers will help for rational design of new synthetic supramolecular materials.

The fusion of machine learning, biomedical, and bioengineering research offers novel ways to understand, diagnose, and treat various health conditions. However, the complexities of biomedical and bioengineering data, coupled with the intricate process of developing and deploying machine learning solutions, often pose significant challenges to researchers in these fields. We introduce a new Automatic Semantic Machine Learning Microservice Framework (AIMS) that addresses these challenges by automating key aspects of the machine learning pipeline, from data preprocessing to model evaluation. Our proposed framework emphasizes model interpretability, the integration of domain knowledge, and the efficient handling of biomedical data. Furthermore, it incorporates self-supervised knowledge learning strategies, enabling the automatic generation, optimization, and continuous adaptation of machine learning models in response to new tasks and data. We illustrate the potential of our framework through three case studies in biomedical research, showcasing its capacity to streamline research processes, improve scientific exploration quality, and provide a foundation for significant breakthroughs.

Existing Knowledge Graph (KG) models for commonsense question answering present two challenges: (i) existing methods retrieved entities related to questions from the knowledge graph, which may extract noise and irrelevant nodes, and (ii) lack of interaction representation between questions and graph entities. However, current methods mainly focus on retrieving relevant entities with some noisy and irrelevant nodes. In this paper, we propose a novel Retrieval-augmented Knowledge Graph (RAKG) model, which solves the above issues through two key innovations. First, we leverage the density matrix to make the model reason along the corrected knowledge path and extract an enhanced knowledge graph subgraph. Second, we fuse representations of questions and graph entities through a bidirectional attention strategy, in which two representations fuse and update by Graph Convolutional Network (GCN). To evaluate the performance of our method, we conduct experiments on two widely-used benchmark datasets CommonsenseQA and OpenBookQA. The case study gives insight into findings that the augmented subgraph provides reasoning along the corrected knowledge path for question answering.

Given several nonnegative matrices with a single pattern of allocation among their zero/nonzero elements, the average matrix should have the same pattern, too. This is the first tenet of the pattern-multiplicative average (PMA) concept, while the second one suggests the multiplicative (or geometric) nature of averaging. The original concept of PMA was motivated by the practice of matrix population models as a tool to assess the population viability from long-term monitoring data. The task has reduced to searching for an approximate solution to an overdetermined system of polynomial equations for unknown elements of the average matrix (G), hence to a nonlinear constrained minimization problem for the matrix norm. Former practical solutions faced certain technical problems, which required sophisticated algorithms but returned acceptable estimates. Fresh idea to use the eigenvalue approximation ensues also from the basic equation of averaging, which determines the exact value of λ1(G), the dominant eigenvalue of matrix G, too, and the corre-sponding eigenvector. These are bound by the well-known linear equations, which reduce the task to a standard problem of linear programing (LP). The LP approach is realized for 13 fixed-pattern matrices gained in a case study of Androsace albana, an alpine short-lived perennial, monitored on permanent plots during 14 years. A standard software routine reveals the unique exact solution, rather than an approximate one, to the PMA problem, which turns the LP approach into ‘’the best of versatile optimization tools”. The exact solution turns out to be peculiar in reaching zero bounds for certain nonnegative entries of G, which deserves a modified problem formulation separating the lower bounds from zero.

Ligand-based virtual screening (LBVS) is a promising approach for rapid and low-cost screening of potentially bioactive molecules in the early stage of drug discovery. Compared with traditional similarity-based machine learning methods, deep learning frameworks for LBVS can more effectively extract high-order molecule structure representations from molecular fingerprints or structures. However, the 3D conformation of a molecule largely influences its bioactivity and physical properties, and has rarely been considered in previous deep learning-based LBVS methods. Moreover, the relative bioactivity benchmark dataset is still lacking. To address these issues, we introduce a novel end-to-end deep learning architecture trained from molecular conformers for LBVS. We first extracted molecule conformers from multiple public molecular bioactivity data and consolidated them into a large-scale bioactivity benchmark dataset, which totally includes millions of endpoints and molecules corresponding to 954 targets. Then, we devised a deep learning-based LBVS called EquiVS to learn molecule representations from conformers for bioactivity prediction. Specifically, graph convolutional network (GCN) and equivariant graph neural network (EGNN) are sequentially stacked to learn high-order molecule-level and conformer-level representations, followed by attention-based deep multiple-instance learning (MIL) to aggregate these representations and then predict the potential bioactivity for the query molecule on a given target. We conducted various experiments to validate the data quality of our benchmark dataset, and confirmed EquiVS achieved better performance compared with 10 traditional machine learning or deep learning-based LBVS methods. Further ablation studies demonstrate the significant contribution of molecular conformation for bioactivity prediction, as well as the reasonability and non-redundancy of deep learning architecture in EquiVS. Finally, a model interpretation case study on CDK2 shows the potential of EquiVS in optimal conformer discovery. The overall study shows that our proposed benchmark dataset and EquiVS method have promising prospects in virtual screening applications.

With the rapid development of Internet of Things (IoT)-based near-earth remote sensing technology, the problem of network intrusion for near-earth remote sensing systems has become more complex and large-scale. Therefore, it is essential to seek an intelligent, automated, and robust network intrusion detection method. In recent years, network intrusion detection methods based on graph neural networks (GNNs) have been proposed. However, there are still some practical issues with these methods. For example, they have not taken into consideration the characteristics of near-earth remote sensing systems, the state of the nodes, and the temporal features. Therefore, this article analyzes the characteristics of existing near-earth remote sensing systems and proposes a spatio-temporal graph attention network (N-STGAT) that considers the state of nodes. The proposed network applies spatiotemporal graph neural networks to the network intrusion detection of near-earth remote sensing systems and validates the effectiveness of the proposed method on the latest flow-based dataset.

We introduce the Open Research Knowledge Graph Agriculture Named Entity Recognition (the ORKG Agri-NER) corpus and service for contribution-centric scientific entity extraction and classification. The ORKG Agri-NER corpus is a seminal benchmark for the evaluation of contribution-centric scientific entity extraction and classification in the agricultural domain. It comprises titles of scholarly papers that are available as Open Access articles on a major publishing platform. We describe the creation of this corpus and highlight the obtained findings in terms of the following features: 1) a generic conceptual formalism focused on capturing scientific entities in agriculture that reflect the direct contribution of a work; 2) a performance benchmark for named entity recognition of scientific entities in the agricultural domain by empirically evaluating various state-of-the-art sequence labeling neural architectures and transformer models; and 3) a delineated 3-step automatic entity resolution procedure for the resolution of the scientific entities to an authoritative ontology, specifically AGROVOC that is released in the Linked Open Vocabularies cloud. With this work we aim to provide a strong foundation for future work on the automatic discovery of scientific entities in the scholarly literature of the agricultural domain.

We revise the definition of graph operations in [WDK2018] and adapt correspondingly the construction of graph term algebras. As a first contribution to a prospective research field Universal Graph Algebra, we generalize some basic concepts and results from algebras to graph algebras. To tackle this generalization task, we revise and reformulate traditional set-theoretic definitions, constructions and proofs in Universal Algebra by means of more category-theoretic concepts and constructions. Especially, we generalize the concept generated subalgebra and prove that all monomorphic homomorphisms between graph algebras are regular. Derived graph operations are the other main topic. After an in depth analysis of terms as representations of derived operations in traditional algebras, we identify three basic mechanisms to construct new graph operations out of given ones: parallel composition, instantiation, and sequential composition. As a counterpart of terms, we introduce graph operation expressions with a structure as close as possible to the structure of terms. We show that the three mechanisms allow us to construct for any graph operation expression a corresponding derived graph operation in any graph algebra.

In recent years, intensive work has been carried out to achieve maximum energy production in photovoltaic power plants. Today, this challenge has to be solved for arrays of solar panels that move with the object on which they are installed (vehicles, trucks, ships, etc.). The present work tries to find the best solution for both constant voltage systems and for cases of maximum intensity. Once found, these solutions will be applied in real time for the dynamic recharging of battery packs, trying to achieve energetically autonomous vehicles.To solve these situations, a new computational method of voltage and amperage calculation has been developed in this paper, based on Dijkstra’s minimum path finding algorithm on graph theory, adapted to electrical circuits. For this purpose, panel performance analysis sensors, developed at the University of Malaga, have been combined with different electronic solutions (wifi relay devices using esp8266 or similar chips) achieving an accurate and sufficiently fast solution at very low cost. With this, series or parallel configurations can be carried out depending on the type of energy generation sought. The theoretical solutions using Minkowski paths, achieved in the past, have been simulated and subsequently constructed in this article, indicating the diagrams necessary for their realisation.

Molecular descriptors are essential in mathematical chemistry for studying quantitative structure-property relationships (QSPR), and topological indices are a valuable source of information about molecular properties such as size, cyclicity, branching degree, and symmetry. Graph theory has played a crucial role in the development of topological indices and dominating parameters for molecular descriptors. The molecule graph, under graph isomorphism conditions, represents an invariant number, and the graph theory approach considers dominating sets, which are subsets of the vertex set where every vertex outside the set is adjacent to at least one vertex inside the set. The dominating sigma index, a topological index that incorporates the mathematical principles of domination topological indices and the sigma index, is applicable to some families of graphs, such as book graphs, windmill graphs, and some graph operations, which have exact values for this new index. To evaluate the effectiveness of the domination sigma index in QSPR studies, a comparative analysis was conducted to establish an appropriate domination index that correlates with the physicochemical properties of octane and its isomers. Linear and non-linear models were developed using the QSPR approach to predict the properties of interest, and the results showed that both the domination forgotten and domination first Zagreb indices exhibited satisfactory performance in comparison testing. Further research into QSAR/QSPR domination indices is required to build more robust models for predicting the physicochemical properties of organic compounds while maintaining the importance of symmetry.

Link prediction is to complete the missing links in the network or to predict the generation of new links according to the current network structure information, which is very important for mining and analyzing the evolution of the network such for construction and analysis of logical architecture in 6G network. Link prediction algorithms based on node similarity need predefined similarity functions, which is highly hypothetical and only applies to specific network structures without generality. To solve this problem, this paper proposes a link prediction algorithm based on the subgraph of the target node pair. In order to automatically learn the graph structure characteristics, the algorithm firstly extracts the h-hop subgraph of the target node pair, and then predicts whether the target node pair will be linked according to the subgraph. Experiments on seven real data sets show that the link prediction algorithm based on target node pair subgraph is suitable for various network structures and superior to other link prediction algorithms.

Convolutional neural networks (CNN) have attracted much attention as a commonly used method for hyperspectral image (HSI) classification in recent years, however, CNNs can only be applied to Euclidean data and have limitations in dealing with relationships due to the limitations of local feature extraction. However, each pixel of a hyperspectral image contains a set of spectral bands that are correlated and interact with each other, and the methods used to process Euclidean data cannot effectively obtain these correlations. In contrast, the graph convolutional network (GCN) can be used in non-Euclidean data, but usually leads to oversmoothing and ignoring local detail features due to the need for superpixel segmentation processing to reduce computational effort. To overcome the above problems, we constructed a network a fusion network based on GCN and CNN, which contains two branches: a graph convolutional network based on superpixel segmentation and a convolutional network with added attention mechanism. The graph convolu-tional branch can extract the structural features and capture the relationships between the nodes, and the convolutional branch can extract the detailed features in the local fine region. Owing to the fact that the features extracted from the two branches are different, the classification performance can be improved by fusing the complementary features extracted from the two branches. To vali-date the proposed algorithm, experiments were conducted on three widely used datasets, namely Indian Pines, Pavia University, and Salinas, and the overall accuracy of 98.78% was obtained in the Indian Pines dataset, and the overall accuracy of 98.99% and 98.69% was obtained in the other two datasets. The results showed that the proposed fusion network can obtain richer features and achieve high classification accuracy.

In the last decade several projects have been developed for the digitization and semantization of cultural heritage data. They were developed to preserve and maintain this heritage, but bringing it closer to all types of users and allowing access to this information to other sectors such as tourism, education, etc. In these developments, web technologies are combined, along with the use of knowledge graphs and interactive visualisation tools. Although remarkably interesting projects have been developed, in those projects, the data visualization tools are usually focused on the project context. This makes it difficult to reuse these jobs. Additionally, there are peculiarities of cultural heritage data considered with little depth, such as uncertainty, spatial and temporal granularity, as well as other aspects, such as relationships between data. In this article, these problems are described and based on other works such as VUMO or VISO, the design of an ontology that formalizes how to visualise this information is proposed, considering these problems. In addition, the development of a platform that allows the visualisation of this information through a web application and its evaluation of its use in projects such as SILKNOW, or Arxiu Valencià del Disseny is exposed

Wireless sensor networks (WSNs) are a critical research area with numerous practical applications. WSNs are utilized in real-life scenarios, including environmental monitoring, healthcare, industrial automation, smart homes, and agriculture. As WSNs advance and become more sophisticated, they offer limitless opportunities for innovative solutions in various fields. However, due to their unattended nature, it is essential to develop strategies to improve their performance without draining the battery power of the sensor nodes, which is their most valuable resource. This paper proposes a novel sink mobility model based on constructing a bipartite graph from a deployed wireless sensor network. Using the bipartite graph’s properties, the mobile sink node can visit stationary sensor nodes in an optimal way to collect data and transmit it to the base station. We evaluated the proposed approach through simulations using the NS-2 simulator to investigate the performance of wireless sensor networks when adopting this mobility model. Our results show that using the proposed approach can significantly enhance the performance of wireless sensor networks while conserving the energy of the sensor nodes.

When an aircraft malfunctions, quickly and accurately identifying the faulty unit is essential for ensuring normal operation. Unfortunately, maintenance engineers often struggle to acquire the necessary fault-related knowledge due to poor management and utilization of aircraft fault documents. To address this issue, we introduce knowledge graph technology into the field of aircraft fault diagnosis, exploring its construction and application for effective knowledge management. Our work starts by analyzing the critical knowledge elements required for aircraft fault diagnosis and designing a schema layer for fault knowledge graphs. We then we then combine deep learning and heuristic rules to extract fault knowledge from both structured and unstructured data, enabling the construction of aircraft fault knowledge graphs. Finally, we develop a fault question-answering system based on fault knowledge graphs that can accurately give solutions to questions posed by maintenance engineers. Our practice demonstrates that knowledge graphs provide an effective means of managing aircraft fault knowledge, assisting engineers in locating fault reasons accurately and quickly.

Creating self-learning algorithms, developing deep neural networks and improving other methods that "learn" for various areas of human activity is the main goal of the theory of machine learning. It helps to replace the human with a machine, aiming to increase the quality of production. The theory of artificial neural networks, which already have replaced the humans in problems of detection of moving objects, recognition of images or sounds, time series prediction, big data analysis and numerical methods remains the most dispersed branch of the theory of machine learning. Certainly, for each area of human activity it is necessary to select appropriate neural network architectures, methods of data processing and some novel tools from applied mathematics. But the universal problem for all these neural networks with specific data is the achieving the highest accuracy in short time. Such problem can be resolved by increasing sizes of architectures and improving data preprocessing, where the accuracy rises with the training time. But there is a possibility to increase the accuracy without time growing, applying optimization methods. In this survey we demonstrate existing optimization algorithms of all types, which can be used in neural networks. There are presented modifications of basic optimization algorithms, such as stochastic gradient descent, adaptive moment estimation, Newton and quasi-Newton optimization methods. But the most recent optimization algorithms are related to information geometry, for Fisher-Rao and Bregman metrics. This approach in optimization extended the theory of classic neural networks to quantum and complex-valued neural networks, due to geometric and probabilistic tools. There are provided applications of all introduced optimization algorithms, what delighted many kinds of neural networks, which can be improved by including any advanced approaches in minimization of the loss function. Afterwards, we demonstrated ways of developing optimization algorithms in further researches, engaging neural networks with progressive architectures. Classical gradient based optimizers can be replaced by fractional order, bilevel and, even, gradient free optimization methods. There is a possibility to add such analogues in graph, spiking, complex-valued, quantum and wavelet neural networks. Besides the usual problems of image recognition, time series prediction, object detection, there are many are other tasks for modern theory of machine learning, such as solving problem of quantum computations, partial differential and integro-differential equations, stochastic processes and Brownian motion, making decisions and computer algebra.

Mobile Mapping System (MMS) plays a crucial role in generating high-precision 3D maps for various applications. However, the traditional MMS that uses tilted LiDAR (light detection and ranging) has limitations in capturing complete information of the environment. To overcome these limitations, we propose a panoramic vision-aided Cartographer simultaneous localization and mapping (SLAM) system for MMS, named "PVL-Cartographer". The proposed system integrates multiple sensors to achieve accurate and robust localization and mapping. It contains two sub-systems, early fusion and middle fusion. In the early fusion, range-maps are created from LiDAR points in a panoramic image space, facilitating the incorporation of visual features. The SLAM system works with both visual features with and without augmented ranges. In the middle fusion, a pose graph combines camera and LiDAR nodes, with IMU (Inertial Measurement Unit) data providing constraints between each node. Extensive experiments in challenging outdoor scenarios demonstrate the effectiveness of the proposed SLAM system in producing accurate results, even in conditions with limited features. Overall, our proposed PVL Cartographer system offers a robust and accurate solution for MMS localization and mapping.