List-only entity linking is the task of mapping ambiguous mentions in texts to target entities in a group of entity lists. Different from traditional entity linking task, which leverages rich semantic relatedness in knowledge bases to improve linking accuracy, list-only entity linking can merely take advantage of co-occurrences information in entity lists. State-of-the-art work utilizes co-occurrences information to enrich entity descriptions, which are further used to calculate local compatibility between mentions and entities to determine results. Nonetheless, entity coherence is also deemed to play an important part in entity linking, which is yet currently neglected. In this work, in addition to local compatibility, we take into account global coherence among entities. Specifically, we propose to harness co-occurrences in entity lists for mining both explicit and implicit entity relations. The relations are then integrated into an entity graph, on which Personalized PageRank is incorporated to compute entity coherence. The final results are derived by combining local mention-entity similarity and global entity coherence. The experimental studies validate the superiority of our method. Our proposal not only improves the performance of list-only entity linking, but also opens up the bridge between list-only entity linking and conventional entity linking solutions.

The application of graph theory in chemical and molecular structure research far exceeds people's expectations, and it has recently grown exponentially. In the molecular graph, atoms are represented by vertices and bonded by edges. Closed forms of multiplicative degree-based topological indices which are numerical parameters of the structure and determine physico-chemical properties of the concerned molecular compound. In this article, we compute and analyze many multiplicative degree-based topological indices of silicon-carbon Si₂C₃-I[p,q] and Si₂C₃-II[p,q].

This paper presents a new method : HIVEC to learn latent vector representations of graphs in a manner that captures the semantic dependencies of sub-structures. The representations can then be used in machine learning algorithms for tasks such as graph classification, clustering etcetera. The method proposed is unsupervised and uses the information of co-occurrence of sub-structures. It introduces a notion of hierarchical embeddings that allows us to avoid repetitive learning of sub-structures for every new graph. As an alternative to deep learning methods, the edit distance similarity between sub-structures is also used to learn vector representations. We compare the performance of these methods against previous work.

Ramsey approach to the vectors fields is introduced. Set of vectors defined on R^3, taken as the generators of the bi-colored complete graph, is introduced. Vectors are considered as the vertices of the graph. Following coloring procedure is suggested: vertices numbered i and j are linked with the red edge if their scalar product is non-negative; and they are linked with the green edge if their scalar product is negative. This procedure gives rise to the complete, bi-color graph. Graph generated by six vectors inevitably contains the monochromatic triangle: the Ramsey number Ring-like systems of generating vectors are addressed. Applications of the graphs emerging from the vector fields are discussed.

The task of human action recognition (HAR) based on skeleton data is a challenging yet crucial technique owing to its wide-ranging applications in numerous domains, including patient monitoring, security surveillance, and observation of human-machine interactions. While numerous algorithms have been proposed in an attempt to distinguish between a myriad of activities, most practical applications necessitate highly accurate detection of specific activity types. This study proposes a novel and highly accurate spatiotemporal graph autoencoder network for HAR based on skeleton data. Furthermore, an extensive investigation was conducted employing diverse modalities. To this end, a spatiotemporal graph autoencoder was constructed to automatically learn both spatial and temporal patterns from human skeleton datasets. The powerful graph convolutional network, designated as GA-GCN, developed in this study, notably outperforms the majority of existing state-of-the-art methods when evaluated on two common datasets, namely NTU RGB+D and NTU RGB+D 120. On the first dataset, the proposed approach achieved accuracies of 92.3\% and 96.8\% for the cross-subject and cross-view evaluations, respectively. On the more challenging NTU RGB+D 120 dataset, GA-GCN attained accuracies of 88.8\% and 90.4\% for the cross-subject and cross-set evaluations, respectively.

We introduce the Concept-Model-Graph-View Cycle (CMGVC). The CMGVC facilitates coherent architecture analysis, reasoning, insight, and decision-making based on conceptual models that are transformed into a generic, robust graph data structure (GDS). The GDS is then transformed into multiple views of the model, which inform stakeholders in various ways. This GDS-based approach decouples the view from the model and constitutes a powerful enhancement of model-based systems engineering (MBSE). The CMGVC applies the rigorous foundations of Category Theory, a mathematical framework of representations and transformations. We show that modeling languages are categories, drawing an analogy to programming languages. The CMGVC architecture is superior to direct transformations and language-coupled common representations. We demonstrate the CMGVC to transform a conceptual system architecture model built with the Object Process Modeling Language (OPM) into dual graphs and a stakeholder-informing matrix that stimulates system architecture insight.

In this work, a hybrid component Fault Detection and Diagnosis (FDD) approach for industrial sensor systems is established and analyzed, to provide a hybrid schema that combines the advantages and eliminates the drawbacks of both model-based and data-driven methods of diagnosis. Moreover, it shines the light on a new utilization of Random Forest (RF) together with model-based diagnosis, beyond its ordinary data-driven application. RF is trained and hyperparameter tuned using three-fold cross validation over a random grid of parameters using random search, to finally generate diagnostic graphs as the dynamic, data-driven part of this system. This is followed by translating those graphs into model-based rules in the form of if-else statements, SQL queries or semantic queries such as SPARQL, in order to feed the dynamic rules into a structured model essential for further diagnosis. The RF hyperparameters are consistently updated online using the newly generated sensor data to maintain the dynamicity and accuracy of the generated graphs and rules thereafter. The architecture of the proposed method is demonstrated in a comprehensive manner, and the dynamic rules extraction phase is applied using a case study on condition monitoring of a hydraulic test rig using time-series multivariate sensor readings.

In this work, A hybrid component Fault Detection and Diagnosis (FDD) approach for industrial sensor systems is established and analyzed, to provide a hybrid schema that combines the advantages and eliminates the drawbacks of both model-based and data-driven methods of diagnosis. Moreover, spotting the light on a new utilization of Random Forest (RF) together with model-based diagnosis, beyond its ordinary data-driven application. RF is trained and hyperparameter tuned using 3-fold cross-validation over a random grid of parameters using random search, to finally generate diagnostic graphs as the dynamic, data-driven part of this system. Followed by translating those graphs into model-based rules in the form of if-else statements, SQL queries or semantic queries such as SPARQL, in order to feed the dynamic rules into a structured model essential for further diagnosis. The RF hyperparameters are consistently updated online using the newly generated sensor data, in order to maintain the dynamicity and accuracy of the generated graphs and rules thereafter. The architecture of the proposed method is demonstrated in a comprehensive manner, as well as the dynamic rules extraction phase is applied using a case study on condition monitoring of a hydraulic test rig using time series multivariate sensor readings.

This work considers the task of representation learning on the attributed relational graph (ARG). Both the nodes and edges in an ARG are associated with attributes/features allowing ARGs to encode rich structural information widely observed in real applications. Existing graph neural networks offer limited ability to capture complex interactions within local structural contexts, which hinders them from taking advantage of the expression power of ARGs. We propose Motif Convolution Module (MCM), a new motif-based graph representation learning technique to better utilize local structural information. The ability to handle continuous edge and node features is one of MCM’s advantages over existing motif-based models. MCM builds a motif vocabulary in an unsupervised way and deploys a novel motif convolution operation to extract the local structural context of individual nodes, which is then used to learn higher-level node representations via multilayer perceptron and/or message passing in graph neural networks. When compared with other graph learning approaches to classifying synthetic graphs, our approach is substantially better in capturing structural context. We also demonstrate the performance and explainability advantages of our approach by applying it to several molecular benchmarks.

Session-based recommendations which aim to predict subsequent user-item interaction based on historical user behavior during anonymous sessions can be challenging tasks. Two main challenges need to be addressed and improved: (1) How to analyze these sessions to accurately and completely capture users’ preferences, and (2) how to identify and eliminate any interference caused by noisy behavior. Existing methods have not adequately addressed these issues since they either neglected the valuable insight that can be gained from analyzing consecutive groups of items or failed to take these noisy data in sessions seriously and handled them properly, which can jointly impede recommendation systems from capturing users’ real intentions. To address these two problems, we designed a multi-order semantic denoising (MSD) model for session-based recommendations. Specifically, we grouped items of different lengths as varying multi-order semantic units to mine the user’s primary intention from multiple dimensions. Meanwhile, a novel denoising network was designed to alleviate the interference of noisy behavior and provide a more precise session representation. The result of extensive experiments on three real-world datasets demonstrated that the proposed MSD model exhibited improved performance compared with existing state-of-the-art methods in session-based recommendation.

Although Lov\'{a}sz introduced the graph exponential $G^K$ in 1967, this product has received little attention. This paper focuses on the number of components in $G^K$ when exponent $K$ is a complete graph $K_n$. For a connected bipartite $G$, when $K$ is $K_2$, $G^{K_2}$ has three components; and when $K$ is $K_n$ with $n>2$, $G^{K_n}$ produces $\lceil\frac{n+1}{2}\rceil$ components. A connected $G$ with an odd cycle produces one component in $G^{K_n}$.

In the modern world where research is taking a huge leap, the collaboration network between authors is also expanding, increasing the probability of different authors coming together to work on the same project, same research paper making them co-authors. In coauthorship, link prediction is used to anticipate new interactions between its members that are likely to occur in the future. Researchers have concentrated their efforts on studying and suggesting methods for providing effective reviews for authors who can collaborate on a scientific endeavor. In order to provide a precise link prediction, a graph database approach is proposed in this paper using nodes to determine most possible co-authors in future. In order to forecast the connections, we preprocessed the data set for the maximum relative contents. A supervised learning approach is used to execute the solution, which includes random forest classifier and logistic regression. The first findings of our technique reveal that the total of two author node’s research collaboration indices has the greatest influence on the performance of supervised link prediction than that of the traditional approach, which stimulates us to conduct further study on employing such a forecast.

Due to their increased surface area, extent of swelling and active substance loading capacity and flexibility, nanogels made from natural and synthetic polymers have gained significant interest in the scientific and industrial areas. Especially, customized design and implementation of non-toxic, biocompatible, and biodegradable micro/nano carriers makes their usage very feasible for a range of biomedical applications, including drug delivery, tissue engineering, and bioimaging. The design and application methodologies of nanogels have been outlined in this review. Additionally, the most recent advancements in nanogel biomedical applications have been discussed, with a particular emphasis on applications for the delivery of drugs and biomolecules.

Application of the Ramsey graph theory to the analysis of physical systems is reported. Physical interactions may be very generally classified as attractive and repulsive. This classification creates the premises for the application of the Ramsey theory to the analysis of physical systems built of electrical charges, electric and magnetic dipoles. The notions of mathematical logic, such as transitivity and intransitivity relations, become crucial for understanding of the behavior of physical systems. The Ramsey theory explains why nature prefers cubic lattices over hexagonal ones for systems built of electric or magnetic dipoles. The Ramsey approach may be applied to the analysis of mechanical systems when actual and virtual paths between the states in the configurational space are considered. Irreversible mechanical and thermodynamic processes are seen within the reported approach as directed graphs. Chains of irreversible processes appear as transitive tournaments. These tournaments are acyclic; the transitive tournaments necessarily contain the Hamiltonian path. The set of states in the phase space of the physical system, between which irreversible processes are possible, is considered. The Hamiltonian path of the tournament emerging from the graph uniting these states is a relativistic invariant. Applications of the Ramsey theory to the general relativity become possible when the discrete changes in the metric tensor are assumed. Reconsideration of the concept of “simultaneity” within the Ramsey approach is reported.

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.

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 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.

In this paper, we give some upper and lower bounds for the multiplicative Randic index, reduced reciprocal Randic index, Narumi-Katayama index and symmetric division index a graph using solely the vertex degrees. Then we obtain upper and lower bounds for these indices for the complete graphs, path graphs and Fibonacci-sum graphs. Finally, we compared the bounds of these indices for a general graph and some special graphs.

We propose the Ramsey approach for the analysis of behavior of isolated mechanical systems containing interacting particles. The total momentum of the system in the frame of the center of masses is zero. The mechanical system is described by the Ramsey, bi-colored, complete graph. Vectors of momenta of the particles pi serve as the vertices of the graph. We start from the graph representing the system in the frame of the center of masses, the momenta of the particles in this system are pcmi. If (pcmi(t)∙pcmj(t))≥0 is true, vectors of momenta of the particles are connected with the red link; if (pcmi(t)∙pcmj(t))<0 takes place, the vectors of momenta are connected with the green link. Thus, the complete, bi-colored graph emerges. Consider the isolated system built of six interacting particles. According to the Ramsey Theorem, the graph inevitably comprises at least one monochromatic triangle. The coloring procedure is invariant relatively to inertial frames; thus, the graph representing the system contains at least one monochromatic triangle in any of inertial frames. This gives rise to the novel kind of a mechanical invariant. Similar coloring is introduced for the angular momenta of the particles.

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.

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.

Financial markets require a great deal of decision making from the investors and market makers. One metric that can help ease the process of decision making is investment risk which can be measured in two parts; systematic risk and idiosyncratic risk. Clear understanding of the volatilities in each risk component can be a powerful signal in recognizing the right assets to maximize the investment returns. In this paper, we focus on the idiosyncratic volatility values and pre-calculate the idiosyncratic volatility values for 31,198 members of NYSE, Amex and Nasdaq markets for the trades occurring between January 1963 and December 2019. Utilizing a subset of dataset, limited to Nasdaq100 index, we consider the application of machine learning techniques in predicting the idiosyncratic volatility values using the raw trade data to explore a data extension option for the future market trade records that have not yet occurred. We offer a deep learning based regression model and compare it with traditional tree-based methods on a small subset of our per-calculated idiosyncratic volatility dataset. Our analytical results show that the performance of the deep learning techniques is much more robust in comparison to that of the traditional tree-based baselines.

In this paper we formally define the hierarchical clustering network problem (HCNP) as the problem to find a good hierarchical partition of a network. This new problem focuses on the dynamic process of the clustering rather than on the final picture of the clustering process. To address it, we introduce a new hierarchical clustering algorithm in networks, based on a new shortest path betweenness measure. To calculate it, the communication between each pair of nodes is weighed by the importance of the nodes that establish this communication. The weights or importance associated to each pair of nodes are calculated as the Shapley value of a game, named as the linear modularity game. This new measure, (the node-game shortest path betweenness measure), is used to obtain a hierarchical partition of the network by eliminating the link with the highest value. To evaluate the performance of our algorithm, we introduce several criteria that allow us to compare different dendrograms of a network from two point of view: modularity and homogeneity. Finally, we propose a faster algorithm based on a simplification of the node-game shortest path betweenness measure, whose order is quadratic on sparse networks. This fast version is competitive from a computational point of view with other hierarchical fast algorithms, and, in general, it provides better results.

In his Cynefin classification of system behaviours, Snowden (2007), posits that his Simple (Clear ) and even Complicated system categories are sufficiently understandable to be amenable to the traditional methods of system analysis and modelling. Here, relationships between entities in the system are clear and unambiguous and they behave predictably. So, we can build mathematical “models” to describe how the system is expected to function in different situations. Leaving aside his fourth category, Chaotic, as too hard for the moment, this paper focusses on the third category, Complex systems. Yaneer Bar-Yam [1998] defined "complex systems" as systems that "have multiple interacting components, whose collective behaviour cannot be simply inferred from the behaviour of components." So, the traditional system modelling approach of decomposition into components and attempting to build up a picture of system performance from individual pieces, alone, is no longer appropriate for this class. The problem is that most of the methods we currently employ, and particularly the methods that attempt to make the case that these systems are safe, (such as Fault trees, FMEA. and Root Cause Analysis), rely on this decomposition into components and attempt to make the parts more reliable individually. Even the more systemic approaches, such as Reason’s (1990) Swiss Cheese Model, and Leveson’s System Theoretic Analysis (STPA) (2004), encourage adding layers of protection, barriers, strengthened control loops and better safety critical systems, in the hope that they are making the systems safer. But without a valid model to test the effectiveness of these add-ons, we cannot be sure that they will not have an opposite effect, of making the systems even more complex, unreliable and unpredictable. For complex systems, the careful gathering and documentation of system components and their relationships is still a necessary first step, but we need an additional capacity to model these complex systems to test out and prove they work safely and successfully in the real world. (not just draw fixed component relationships as system “models” (wiring diagrams)) In the last 10 years, an original approach developed by Hollnagel, (2012), to model systems as sets of interactive, interdependent “functions”, (abstracted from and independent of component details), has now been developed to the point where it can take the basic data and structures from the current component focussed system engineering “models”, such as MBSE( Goldberg (1994)), and can pull it all together in a dynamic system model from which analysts can discern how it really works in practice, and predict the emergent behaviours characteristic of complex systems. The paper describes how this methodology developed and how it is currently used to model real situations, to analyse incidents and anticipate events.

Introduced in 1967 by Lov\'{a}sz, graph exponentiation has received little attention over the past several decades. Since graph exponentiation produces large graphs and any graph can be constructed utilizing its adjacency matrix, we provide a four step linear construction algorithm that generates the adjacency matrix for the graph exponential.

The commonly-used large-scale knowledge bases have been facing challenges in open domain question answering tasks which are caused by the loose knowledge association and weak structural logic of triplet-based knowledge. To find a way out of this dilemma, this work proposes a novel metaknowledge enhanced approach for open domain question answering. We design an automatic approach to extract metaknowledge and build metaknowledge network from Wiki documents. For the purpose of representing the directional weighted graph with hierarchical and semantic features, we present an original graph encoder GE4MK to model the metaknowledge network. Then a metaknowledge enhanced graph reasoning model MEGr-Net is proposed for question answering, which aggregates both relational and neighboring interactions comparing with R-GCN and GAT. Experiments have proved the improvement of metaknowledge over main-stream triplet-based knowledge. We have found that the graph reasoning models and pre-trained language models also have influences on the metaknowledge enhanced question answering approaches.

Everyday place descriptions provide a rich source of knowledge about places and their relative locations. This research proposes a place graph model for modeling this spatial, non-spatial, and contextual knowledge from place descriptions. The model extends a prior place graph, and overcomes a number of limitations. The model is implemented using the Neo4j graph database, and a management system has also been developed that allows operations including querying, mapping, and visualizing the stored knowledge in an extended place graph. Then three experimental tasks, namely georeferencing, reasoning, and querying, are selected to demonstrate the superiority of the extended model.

Graph neural networks and graph convolutional networks are effective at representing complex relationships. We attempt to apply them to sports analytics by reviewing existing applications in sports. These methodologies leverage the inherent graph structure of sports data, capturing interactions among players, teams, and game events. By systematically examining various studies, we highlight how GNNs and GCNs can enhance performance prediction, player evaluation, and tactical analysis in sports. Our review emphasizes the unique advantages these models offer over traditional analytical approaches, particularly in their ability to account for the dynamic and interconnected nature of sports activities. We conclude by identifying potential areas for future research and application, suggesting that the integration of advanced graph-based techniques could significantly advance the field of sports analytics.

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.

Decision making as a result of system dynamics analysis requires, in practice, a straightforward and systematic modelling capability as well as a high-level of customisation and flexibility to adapt to situations and environments that may vary very much from each other. While in general terms a completely generic approach could be not as effective as ad-hoc solutions, the proper application of modern technology may facilitate agile strategies as a result of a smart combination of qualitative and quantitative aspects. In order to address such a complexity, we propose a knowledge-based approach that integrates the systematic computation of heterogeneous criteria with open semantics. The holistic understanding of the framework is described by a reference architecture and the proof-of-concept prototype developed can support high-level system analysis, as well as it suitable within a number of applications contexts - i.e. as a research/educational tool, communication framework, gamification and participatory modelling. Additionally, the knowledge-based philosophy, developed upon Semantic Web technology, increases the capability in terms of holistic knowledge building and re-use via interoperability. Last but not least, the framework is designed to constantly evolve in the next future, for instance by incorporating more advanced AI-powered features.

This paper explores the use of GNN architectures, including Graph Convolutional Networks (GCNs), Graph Attention Networks (GATs), and GraphSAGE, in modeling blockchain data. A specific focus is given to their applications in cryptocurrency transaction networks, where GNNs can detect fraudulent activities and track illicit fund flows by learning from transaction patterns and network structure. Additionally, future directions for GNN research in blockchain are discussed, including scalability challenges, privacy-preserving models, and multi-chain graph analysis. Through these advancements, GNNs offer significant potential for enhancing the security, transparency, and efficiency of blockchain and cryptocurrency ecosystems. This paper also shows an example of fraud detection for Ethereum cryptocurrencies.

Functional Connectivity analysis using Electroencephalography signals is common. The EEG signals are converted to networks by transforming the signals into a correlation matrix and analyzing the resulting networks. Here, four learning models, namely, Logistic Regression, Random Forest, Support Vector Machine, and Recurrent Neural Networks, are implemented on the correlation matrix data to classify them either on their psychometric assessment or the effect of therapy; The EEG data is trail-based/event-related. The classifications based on RNN provided higher accuracy( 74-88%) than the other three models( 50-78%). Instead of using individual graph features, a correlation matrix provides an initial test of the data. When compared with the time-resolved correlation matrix, it offered a 4-5% higher accuracy. The time-resolved correlation matrix is better suited for dynamic studies here; it provides lower accuracy when compared to the correlation matrix, a static feature.

Drug development is a lengthy process with a high failure rate. Increasingly, machine learning is utilized to facilitate the drug development processes. These models aim to enhance our understanding of drug characteristics, including their activity in biological contexts. However, a major challenge in drug response (DR) prediction is model interpretability as it aids in the validation of findings. This is important in biomedicine, where models need to be understandable in comparison with established knowledge of drug interactions with proteins. drGAT, a graph deep learning model, leverages a heterogeneous graph composed of relationships between proteins, cell lines, and drugs. drGAT is designed with two objectives: DR prediction as a binary sensitivity prediction and elucidation of drug mechanism from attention coefficients. drGAT has demonstrated superior performance over existing models, achieving 78\% accuracy (and precision), and 76\% F1 score for 269 DNA-damaging compounds of the NCI60 drug response dataset. To assess the model's interpretability, we conducted a review of drug-gene co-occurrences in Pubmed abstracts in comparison to the top 5 genes with the highest attention coefficients for each drug. We also examined whether known relationships were retained in the model by inspecting the neighborhoods of topoisomerase-related drugs. For example, our model retained TOP1 as a highly weighted predictive feature for irinotecan and topotecan, in addition to other genes that could potentially be regulators of the drugs. Our method can be used to accurately predict sensitivity to drugs and may be useful in the identification of biomarkers relating to the treatment of cancer patients.

Incorporating knowledge graphs as auxiliary information to enhance recommendation systems can improve the representations learning of users and items. Recommendation methods based on knowledge graph can introduce user-item interaction learning into the item graph, focusing only on learning the node vector representations within a single graph; alternatively, they can treat user-item interactions and item graphs as two separate graphs and learn from each graph individually. Learning from two graphs has natural advantages in exploring original information and interaction information, but faces two main challenges: 1) in complex graph connection scenarios, how to adequately mine the self-information of each graph, and 2) how to merge interaction information from the two graphs while ensuring that user-item interaction information predominates. Existing methods do not thoroughly explore the simultaneous mining of self-information from both graphs and effective interaction information, leading to the loss of valuable insights. Considering the success of contrastive learning in mining self-information and auxiliary information, this paper proposes a dual-graph contrastive learning recommendation method based on knowledge graphs (KGDC) to explore a more accurate representations of users and items in recommendation systems based on external knowledge graphs. In the learning process within the self-graph, KGDC has strengthened and represented the information of different connecting edges in both graphs, and extracted the existing information more fully. In interactive information learning, KGDC reinforces the interaction relationship between users and items in the external knowledge graph, realizing the leading role of the main task. We have conducted a series of experiments on three standard datasets, and the results show that the proposed method can achieve better results.

Model-based approaches form the basis of the majority of damage detection and localization studies; however, built-in online detection technique can offer an alternative for future structural health monitoring technologies. Thus, in this paper, we present a dynamic localization algorithm for damage localization in functionally graded plates. The method depends on the creation of a grid matrix that contains the dynamic response of the structure over time. Subsequently, an optimization process is carried out via a linear equation representing the information contained within the grid to achieve accurate localization of damage. Due to the inherent sparsity of the localization nature, the FISTA algorithm has been employed as a problem solver. The approach is tested in the case of the functionally graded plate under clamped free boundary conditions. Several, damage scenarios were investigated for the case of damage signals on and off the grid. The results show that the proposed approach is capable of accurately predicting damage position and can be suitable for use in low size data systems.

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.

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.

This paper describes a polynomial time algorithm for solving graph isomorphism and automorphism. We introduce a new tree data structure called Walk Length Tree. We show that such tree can be both constructed and compared with another in polynomial time. We prove that graph isomorphism and automorphism can be solved in polynomial time using Walk Length Trees.

Indoor positioning based on the received signal strength (RSS) of the WiFi signal has become the most popular solution for indoor localization. In order to realize the rapid deployment of indoor localization systems, solutions based on crowdsourcing have been proposed. However, compared to conventional methods, crowdsourced RSS values are more erroneous and can result in large localization errors. To mitigate the negative effect of the erroneous measurements, a graph-based semi-supervised learning (G-SSL) method is used to exploit the correlation between the RSS values at nearby locations to estimate an optimal RSS value at each location. Before using the G-SSL method, the Linear Regression (LR) algorithm is proposed to solve the device diversity problem in crowdsourcing system. Since the spatial distribution of the APs is sparse, the Compressed Sensing (CS) method is applied to precisely estimate the location of the APs. Based on the location of the APs and a simple signal propagation model, the RSS difference between different locations is calculated and used as an additional constraint to improve the performance of G-SSL. Furthermore, to exploit the sparsity of the weights used in the G-SSL, we use the CS method to reconstruct these weights more accurately and make a further improvement on the performance of the G-SSL. Experimental results show improved results in terms of the smoothness of the radio map and the localization accuracy.

Previously, we described the initial use of Flipped Team‐Based learning (FTBL) defined as TBL approach combined with flipped classroom learning methodology, in which students previewed online lectures and applied their knowledge in different in-class activities. The purpose of the present study is to review the progress within this approach and to investigate how constant changes in team allocation can affect student’s perception regarding this modified FTBL approach. Although students showed reluctance initially to get out of their ‘comfort zone’, our findings show that learners perceived the adoption of the continued random allocation, and became accustomed to this learning approach, which finally assisted them to enhance their team-work skills and classroom performance, to develop their reflective capabilities as well as improving their rapport building skills, learning and academic performance. Learners also believed that this learning strategy that creates critical incidents can simulate their future work environment as they might be expected to work in unfamiliar situations. Therefore, the present study indicated strong support for the modified FTBL method and was seen to work exceptionally well, despite some minor problems that students can experience working in a team and/or with different teammates in every session.

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.

The complexity of modern power grids, exacerbated by integrating diverse energy sources, espe-cially inverter-based resources (IBRs), presents a significant challenge to grid operation and plan-ning since linear models fail to capture the intricate IBR dynamics. This study employs the Sparse Identification of Nonlinear Dynamics (SINDy) method to bridge the gap between theoretical un-derstanding and practical implementation in power system analysis. It introduces the novel Volterra-based Nonlinearity Index (VNI) to examine system-level nonlinearity comprehensively. The distinction of dynamics into first-order linearizable terms, second-order nonlinear dynamics, and third-order noise elucidates the intricacy of power systems. The findings demonstrate a fundamental shift in system dynamics as power sources transit to IBRs, revealing system-level nonlinearity compared to module-level nonlinearity in conventional syn-chronous generators. The VNI quantifies nonlinear-to-linear relationships, enriching our comprehension of power system behavior and offering a versatile tool for distinguishing between different nonlinearities and visualizing their distinct patterns through the proposed VIN profile.

Process mining offers significant services in the development of digital threads and digital twin applications for healthcare. One of the sub-emerging case studies is the use of patients’ location data in process mining analyses. While the streamlining of published works is focused on introducing process discovery algorithms, there is a necessity to address challenges beyond that. Literature analysis indicates that explainability, reasoning, and characterizing the root causes of process drifts in healthcare processes is an important but overlooked challenge. In addition, incorporating domain-specific knowledge into process discovery could be a significant contribution to process mining literature. To address this, we present the DIAG approach that consists of a meta-model and an algorithm that enables diagnosing in process mining through an ontology-driven approach. With DIAG, we modeled the healthcare semantics in a process mining application and diagnosed the causes of drifts in patients’ pathways. We performed an experiment in a hospital living lab to examine the effectiveness of the DIAG approach.

Euler's theorem about the relationship between the numbers of individual elements of planar graphs (vertices, edges, faces) is also satisfied when the graph has zero vertices. The problem of the existence or not of such graphs has so far been the subject of very few studies. Plus, research that didn't prove anything. The paper presents an interpretation of this kind of graphs as mathematical formations lying on piecewise smooth surfaces. The lines of intersection of two or more smooth surfaces (faces of a graph) form edges without a vertex of the graph. The elementary properties of such graphs are discussed, the method of counting non-isomorphic 0-vertex graphs and their importance in physics and chemistry are given.

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.

In this article, there's an effort to make sense about the new versions of matroid. I believe that there's new idea on the background of. matroid. Two styles of matroid is defined in the background of fixed graphs and after that the attributes of these new notion on the graph and its parameters have been studied. The focus of this article is on the version of matroid which has the basis on the cycles as if there's gentle discussion on the results which are based on the set of independent vertices as matroid-x. The relation amid fundamental parameters and specific set like independent set and minimal set in the terminology of graph theory have been considered. Matroid is the word to use in the study on the parameters of graph theory as if set theory and its terminology are also recorded. The terms of word in various terminology have been relatively used. There are open ways to use hypergraphs or some serious relations amid these two types.

In considering knowledge graphs in a diverse range of domains of interest, graph neural networks have demonstrated significant improvements in node classification and prediction when applied to graph representation with learning node embedding to effectively represent hierarchical properties of graphs. DiffPool is a deep-learning approach using a differentiable graph pooling technique that generates hierarchical representations of graphs. In operation DiffPool is a differentiable graph pooling technique that generates hierarchical representations of graphs. DiffPool learns a differentiable soft cluster assignment for nodes at each layer of a deep graph neural network with nodes mapped sets of clusters. However, control of the learning process is difficult given the complexity and large number of parameters on an `end-to-end’ model. To address this difficulty we propose an novel approach termed FPool which is predicated on the basic approach adopted in DiffPool (where pooling is applied directly to node representations). Methods designed to enhance data classification have been developed and evaluated using a number popular and publicly available sensor data sets. Experimental results for FPool demonstrate improved classification and prediction performance when compared to alternative methods. Moreover, FPool shows an important reduction in the training time over the basic DiffPool framework.

Metabolic pathways provide key information to achieve a better understanding of life and all its processes; this is useful information for the improvement of medicine, agronomy, pharmacy, and other similar areas. The main analysis tool used to study these pathways is based on the idea of pathway comparison, using graph data structures. Metabolic pathway comparison has been defined as a computationally complex task \cite{ay2011submap,abaka2013campways}. In previous work from 2017, two different approaches that simplify the problem of comparing pathways represented as graphs were introduced. The first algorithm consists of the transformation of a two-dimensional graph structure, representing a metabolic pathway, to a one-dimensional structure and thus aligning the corresponding data using a reduced 1 dimension string. The second algorithm consists of performing a paired analysis between reactions in pathways and thus eliminating all similarities, finally, showing these differences to the user. The suggestion is to use the information provided by these algorithms as a previous analysis to a deeper, more expensive, comparison tool use. Here we provide an extension of this work with more data and deeper analysis. These methods have shown to be an effective way to treat the problem of metabolic pathway comparison as listed in the discussion and results section. Our results show evidence of a quick, simple and effective way to resolve the described problem.

The capacitated lot-sizing problem with product recovery (CLSP-RM) holds significant importance in reverse logistics but is notoriously complex (NP-hard). In this study, two techniques are introduced to confront this challenge. The first technique entails devising a linear optimization task that eliminates capacity limitations across a wide problem spectrum, yielding a remarkably accurate approximation of the optimal solution. This adaptable approach presents a potent alternative and holds potential for extension to diverse problem categories owing to its versatile nature. The second technique employs a simulation methodology utilizing Halton’s uniform random numbers to address the issue. This randomized production search method sidesteps considerations of production costs, inventory expenditures, and production order when determining production batches. The research’s novelty lies in its application of these techniques to the problem. The suggested methods undergo evaluation via a benchmark dataset of approximately 4200 instances, with comparison against solutions derived through the Gurobi solver. The results underscore the efficacy and resilience of the introduced methodology in tackling the CLSP-RM predicament.

Sewage surveillance can be used as an effective complementary tool for detecting pathogens in local communities, providing insights into emerging threats and aiding in the monitoring of outbreaks. In this study using qPCR and whole genomic sewage surveillance, we detected Mpox virus along with other viruses, in municipal and hospital wastewaters in Belo Horizonte, Brazil over a 9 months period (from July 2022 till March 2023). MPXV DNA detection rates varied in our study, with 19.6% (11 out of 56 samples) detected through the hybrid capture method of whole genome sequencing and 20% (12 out of 60 samples) through qPCR. In hospital wastewaters, the detection rate was higher at 40% (12 out of 30 samples), compared to 13.3%(4 out of 30 samples) in municipal wastewaters. This variation could be attributed to the relatively low number of MPXV cases reported in the city, which ranged from 106 to 341 cases during the study period, and to dilution effects, given that each of the two wastewater treatment plants (WWTP) investigated serves approximately 1.1 million inhabitants. Additionally, nine other virus families were identified in both hospitals and municipal wastewaters including Adenoviridade, Astroviridae, Caliciviridae, Picornaviridade, Polyomaviridae, Coronaviridae (which includes SARS-CoV-2), Herspesviridae, Papillomaviridae and Flaviviridae (notably including Dengue). These findings underscore the potential of genomic sewage surveillance as a robust public health tool for monitoring a wide range of viruses circulating in both community and hospitals environments including MPXV.

Over the past decade, Knowledge bases (KB) have been increasingly utilized to complete and enrich the representation of queries and documents in order to improve the document retrieval task. Although many approaches have used KB for such purpose, understanding how effectively lev-erage entity-based representation still needs to be resolved. This paper proposes a Purely Enti-ty-based Semantic Search Approach for Information Retrieval (PESS4IR) as a novel solution. The approach includes (i) its own entity linking method, (ii) an inverted indexing method, and for document retrieval and ranking, (iii) an appropriate ranking method is designed to take advantage of all the strengths of the approach. We report the findings on the performance of our approach tested by queries annotated by two known entity linking tools, REL and DBpedia-Spotlight. The experiments are performed on the standard TREC 2004 Robust and MSMARCO collections. By using the REL method, for queries whose all terms are annotated and whose average annotation scores are greater than or equal to 0.75, our approach achieves the maximum nDCG@5 score (1.000). Thus, using our approach with any other document retrieval method would be an added value, unless that method achieves the maximum nDCG@5 score for those highly annotated queries.

Adaptation to the impacts of human induced global heating is inevitable. For a socially just and ecological sustainable adjustment to these new circumstances, we need to draw from diverse knowledge systems while, simultaneously, foster a social-ecological transformation. We approach these concerns through the concept of community-based adaptation (CBA) and discuss remedies. Synergies with feminist knowledge systems and indigenous ways of living show the transdisciplinary essence of CBA. By abstracting from its origin and overlapping disciplines, revealing the social metabolism as a common problem, CBA is prone to achieve more equitable and sustainable adjustments. Transdisciplinarity itself and the current related CBA literature point beyond mere adjustments and call for a redesign of the social metabolism, thereby shifting from adaptation to global heating towards adaptation with nature by focusing on social provisioning. An engagement with transformative adaptation and heterodox economics further shows the potential of CBA to serve as an instrument in support of a social-ecological transformation by addressing root causes of vulnerability and by fostering epistemic justice. Reflecting these points back on the epistemological and ontological assumptions of CBA, the viewpoint proposes critical realism as a guiding philosophy of science to move forward.

Complexity of issues in cancer research has led to the introduction of powerful computational tools for helping experimental in vivo and in vitro methods. These tools, typically focused on studying cell behavior and dynamic cell populations, range from systems of differential equations solved numerically, to lattice models and agent-based simulations. In particular, agent-based models (ABMs) are increasingly used for they capability to incorporate multi-scale features ranging from the individual up to the population level, thus combining statistically aggregated assumptions with individual heterogeneity. In this work, we present an ABM that simulates tumor progression in a colonic crypt, with the aim of providing an experimental in silico environment for testing results achieved in traditional laboratory research and developing alternative scenarios of tumor development. The model also allows some speculations about causal relationships in biologically inspired systems.

An accurate and timely precipitation forecast is essential for water resources management in hydropower, irrigation, and reservoir control. The conventional methods are limited by their inability to capture the high precipitation variability in time and space. In the present work, a wavelet-based deep learning approach is adopted to forecast precipitation using the lagged monthly rainfall, local climate variables, and global teleconnections such as IOD, PDO, NAO, and Nino 3.4 as predictors. The method was tested and validated over the Krishna River Basin in India. Overall, the forecasting accuracy was higher using the wavelet-based hybrid models than the single-scale models. The proposed multi-scale model was then applied to the different climatic regions of the country, and it was shown that the model could forecast the rainfall at reasonable accuracy for different climate zones of the country.

In scenarios such as natural disasters and military strike, it is common for unmanned aerial vehicles (UAVs) to form groups to execute reconnaissance and surveillance. To ensure the effectiveness of UAV communications, repeated resource acquisition issues and transmission mechanism design need to be addressed urgently. In this paper, we build an information interaction scenario in a Flying Ad-hoc network (FANET). The data transmission problem with the goal of throughput maximization is modeled as a coalition game framework. Then, a novel mechanism of coalition selection and data transmission based on group-buying is investigated. Since large-scale UAVs will generate high transmission overhead due to the overlapping resource requirements, we propose a resource allocation optimization method based on distributed data content. Comparing existing works, a data transmission and coalition formation mechanism is designed. Then the system model is classified into graph game and coalition formation game. Through the design of the utility function, we prove that both games have stable solutions. We also prove the convergence of the proposed approach with coalition order and Pareto order. Binary log-linear learning based coalition selection algorithm (BLL-CSA) is proposed to explore the stable coalition partition of system model. Simulation results show that the proposed data transmission and coalition formation mechanism can achieve higher data throughput than the other contrast algorithms.

Re-shaping of thermodynamics with the graph theory and Ramsey theory is suggested. Maps built of thermodynamic states are addressed. Thermodynamic states may be attainable and non-attainable by the thermodynamic process in the system of constant mass. We address the following question how large should be a graph describing connections between discrete thermodynamic states to guarantee the appearance of thermodynamic cycles? The Ramsey theory supplies the answer to this question. Direct graphs emerging from the chains of irreversible thermodynamic processes are considered. In any complete directed graph, representing the thermodynamic states of the system the Hamiltonian path is found. Transitive thermodynamic tournaments are addressed. The entire transitive thermodynamic tournament built of irreversible processes does not contain a cycle of length 3, or in other words, the transitive thermodynamic tournament is acyclic and contains no directed thermodynamic cycles.

The realization of the third-generation artificial intelligence (AI) requires the evolution from perceptual intelligence to cognitive intelligence, where knowledge graphs may not meet the practical needs anymore. Based on the dual channel theory, cognitive graphs are established and developed through coordinating the implicit extraction module and the explicit reasoning module as well as integrating knowledge graphs, cognitive reasoning and logical expressions, which have achieved successes in multi-hop question answering. It is desired for cognitive graphs to be widely used in advanced AI applications such as large-scale knowledge representations and intelligent responses, promoting the development of Al dramatically. This review discusses cognitive graphs systematically and elaborately, including basic concepts, generations, theories and technologies. Moreover, we try to predict the development of cognitive intelligence in the short-term future and further enlighten more researches and studies.

Purpose: Now traditional lecture-based teaching and learning have been affected by the COVID-19. The objectives of this article are to design the novel educational technique called ‘dynamic-based learning’ (DBL) that provides the combination of online teaching-learning methods and student’s creativity, to evaluate primary dynamic-based learning function, and to propose dynamic-based learning for higher education. Methods: DBL composes of four steps, including, preparation, homework, classroom, and evaluation, which was designed, and taught in medical and dental schools. Online support materials included mobile phone, email, Facebook Messenger, Line Messenger, Cisco Webex, and Zoom Meetings applications were recruited for this novel method. Results: A total of 32 third-year medical students and 26 sixth-year dental students was treated by DBL similarly. three subjects, including, Innovation in Dentistry, Basic Medical Research, and Principles of Pathology and Forensic Medicine were selected in this article. The results showed students could create their knowledge, ideas, and creativity during the online classes.Conclusion: DBL can be used as an alternative learning mode during the COVID-19 crisis. The benefits of DBL also include high flexibility, dynamic process, active learning, and high creativity. DBL should be tested with other disciplines such as engineering school, laws school, health sciences school, and should be compared with other traditional teaching and learning modes in the future. This method may support the global higher education systems to move forward the COVID-19 pandemic to set a novel standard of a future normal.

In an increasingly complex world there is a real, urgent need for methodologies to enable engineers to model complex sociotechnical systems, as these now seem to describe the majority of systems in use today. This is of course exacerbated by the increasing involvement and augmentation with “black box” AI contributions. Hollnagel produced a methodology, (FRAM) which did allow the analyst in-sights into these systems’ behaviour, but the model-based system engineering applications demand numbers and a quantitative ap-proach. In the last 10 years, this original approach developed to model systems as sets of interactive, interdependent “functions”, (abstracted from agent or component details), has been further developed to the point where it can take the basic data and structures from the current component focussed system engineering “models”, and can pull it all together into dynamic models, (as opposed to static, fixed System Theoretic Process Accimaps), from which analysts can discern how they really work in practice, and predict the emergent behaviours characteristic of complex systems. This paper describes how the FRAM methodology has now been extended to provide these extra, essential attributes. It also describes its implementation using an open-source software, freely available for use and verification on the GitHub site.

Time and cost-efficient techniques are essential to avoid extra conventional experimental studies with large date-set to characterize the mechanical properties of composite materials. Correlation between the structural performance and mechanical properties could be captured through the efficient predictive models. Several ensembled Machine Learning (ML) methods were implemented in this study, to materially characterize carbon nanotube (CNT)-reinforced cement-based composites. Proposed models were compared with each other to represent the accuracy of each method. The Flexural and Compressive Strength (target values) of CNT reinforced composites were predicted based on the data-rich framework provided in previous experimental investigations. These data were utilized for training of the proposed models by employing SciKit-Learn library in Python, followed by hyper-parameter tuning and k-fold cross-validation method for obtaining an efficient model to predict the target values. Random Forest (RF) and Gradient Boosting Machine (GBM) were developed for this purpose. The findings of this study would be useful for prospective composite designers in case of sufficient experimental data availability for ML model training.

Fractional cointegration in time series data has been explored by several authors, but panel data applications have been largely neglected. A previous study of ours discovered that the Chen and Hurvich fractional cointegration test for time series was fairly robust to a moderate degree of heterogeneity across sections, out of the six tests considered. Therefore, this paper advances a customized version of the Chen and Hurvich methodology to detect cointegrating connections in panels with unobserved fixed effects. Specifically, we develop a test statistic that accommodates variation in the long-term cointegrating vectors and fractional cointegration parameters across observational units. The behaviour of our proposed test is examined through extensive Monte Carlo experiments under various data generating processes and circumstances. The findings reveal that our modified test performs quite well comparatively and can successfully identify fractional cointegrating relationships in panels even in the presence of idiosyncratic disturbances unique to each cross-sectional unit. Furthermore, the proposed modified test procedure established the presence of long-run equilibrium between the exchange rate and labour wage of 36 countries agricultural markets.

This paper investigates the theoretical foundation for developing renewable geothermal resources locally. For this reason, we pay attention to the role of communities in geothermal development. This study presents arguments for a framework that approaches the geothermal resources as an endogenous factor of community development. To analyse it, we create a model that explains the local economic characters of the geothermal exploitation beyond its geological conditions. It aims to conceptualise a community based geothermal development standard referring to the endogeneity principle. Geothermal energy is given attention since the characteristics of this resource determine its use locally. We argue that the role of communities in geothermal exploitation is pivotal in the process of green growth for further expansion of geothermal energy use.

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.

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.

This study assesses the impact of incorporating an adaptive learning mechanism into an agent-based model (ABMS) simulating behavior on a university campus during the course of a pandemic outbreak, with a particular case on the COVID-19 pandemic. The aim is to reduce overcrowding and infections on campus through the use of Reinforcement Learning (RL). Our findings indicate that RL is a viable approach for effectively representing agents’ behavior within this context. The results reveal specific temporal patterns of overcrowding violations. While our study successfully mitigated campus crowding, it had limited influence on altering the course of the epidemic. This highlights the necessity for comprehensive epidemic control strategies that consider the role of individual decision-making influenced by adaptive learning, along with the implementation of targeted interventions. This research significantly contributes to our understanding of adaptive learning within complex systems and offers valuable insights for shaping future public health policies in similar community settings. Future research directions encompass exploring various parameter settings and updating representations of the disease’s natural history.

Evidence-based data for endometriosis management are limited. Experiments are excluded without adequate animal models. Data are limited to symptomatic women and occasional observations. Hormonal medical therapy cannot be blinded if recognised by the patient. Randomised controlled trials are not realistic for surgery since a variable disease with low numbers. Each diagnosis and treatment is an experiment with an outcome and experience is Bayesian updating from the past. If the experience of many is similar, this has more value than an opinion. The combined experience of a group of endometriosis surgeons was used to discuss problems in the management of endometriosis. Considering endometriosis as several genetically/epigenetically different diseases is important for medical therapy. Imaging cannot exclude endometriosis and diagnostic accuracy is limited for superficial lesions, deep lesions, and cystic corpora lutea. Surgery should not be avoided for emotional reasons. Shifting infertility treatment to IVF without considering fertility surgery is questionable. The concept of complete excision should be reconsidered. Surgeons should introduce quality control and teaching should move to explain why it is done. The perception of information has a personal bias. These are the major problems in the management of endometriosis identified by the combined experience of endometriosis surgeons.

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.

It has recently been shown that, contrary to the wide belief that a shift-enabled condition (necessary for any shift-invariant filter to be representable by a graph shift matrix) can be ignored because any non-shift-enabled matrix can be converted to a shift-enabled matrix, such a conversion in general may not hold for a directed graph with non-symmetric shift matrix. This paper extends this prior work, focusing on undirected graphs where the shift matrix is generally symmetric. We show that while, in this case, the shift matrix can be converted to satisfy the original shift-enabled condition, the converted matrix is not associated with the original graph, that is, it does not capture anymore the structure of the graph signal. We show via a counterexample, that a non-shift-enabled matrix cannot be converted to a shift-enabled one and still maintain the topological structure of the underlying graph, which is necessary to facilitate localized signal processing.

Stenting is a common method for treating atherosclerosis. A metal or polymer stent is deployed to open the stenosed artery or vein. After the stent is deployed, the blood flow dynamics influence the mechanics by compressing and expanding the structure. If the stent does not respond properly to the resulting stress, vascular wall injury or re-stenosis can occur. In this work, Discrete Multiphysics is used to study the mechanical deformation of the coronary stent and its relationship with the blood flow dynamics. The major parameters responsible for deforming the stent are sort in terms of dimensionless numbers and a relationship between the elastic forces in the stent and pressure forces in the fluid is established. The blood flow and the stiffness of the stent material contribute significantly to the stent deformation and affect the rate of deformation. The stress distribution in the stent is not uniform with the higher stresses occurring at the nodes of the structure.

In this paper, we introduce a non-invasive approach for monitoring bridge infrastructure with ground-based interferometric radar. This approach is called the mirror mode, since it utilises the flat surface of the bridge underside as a mirror to reflect the signal to a corner reflector on the ground placed opposite of the radar sensor. For proving the feasibility of this approach, a measurement campaign has been carried out at an exemplary bridge in Karlsruhe (Germany) including a radar sensor in mirror mode, a second radar sensor in the default mode and a laser profile scanner. We investigate the potential of this approach to monitor the bridge displacement in vertical direction and compare the results with the two other sensors. The derived results reveal the potential for monitoring bridge infrastructure. Finally, we propose further research aspects of this approach to analyse its capabilities and limitation in the context of non-invasive infrastructure monitoring.

Cadmium (II) contamination in the environment is an emerging problem due to its acute toxicity and mobility, so it is very urgent to remove this species from industrial wastewater before it is discharged into the environment. Thus, a starch-based activated carbon (AC) with a specific surface area of 1600 m2g-1 is used as an adsorbent for the capturing of toxic Cadmium (II) ions from synthetic solution. The sorbent is characterized by BET, SEM, TEM, XRD, FT-IR, TGA, and zeta potential. The maximum uptake (284 mg g-1) of Cadmium (II) ion is obtained at pH 6. The thermodynamics parameters like ∆G, ∆H, ΔS are found to be -17.42 kJmol-1, 6.49 kJ mol-1, and 55.66 Jmol-1K-1 respectively, revealing that the adsorption mechanism is endothermic, spontaneous, and feasible. The experimental data follows the D-R and Langmuir models well. The mass transfer is controlled by pseudo 2nd order kinetics. Furthermore, the density functional theory simulations demonstrate that the activated carbon strongly interacted with the Cd (II) ion through its various active sites. The adsorption energy noted for all interactive sites is highly negative (-0.45 eV to -10.03 eV), which shows that the adsorption process is spontaneous and stable which is in agreement with the experimental thermodynamics analysis.

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 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.

The discharge of industrial effluents containing toxic heavy metals in water sources has serious consequences for human health and the environment, and biosorption appears to be an environmental-friendly and cost-effective alternative that can be used for wastewater treatment. The use of different types of agricultural waste as biosorbents for the removal of toxic heavy metals, although an alternative, is quite difficult to apply in practice because these wastes have many other uses. Based on these considerations, in this study, soybean biomass (SB), soybean waste biomass obtained from oil extraction (SBW) and biochar obtained from soybean waste pyrolysis (BC-SBW) were testes as biosorbents form the removal of Pb(II) and Cd(II) ions, in batch systems. Under optimal conditions (pH = 5.4, 4.0 g biosorbent/L, room temperature (25 ± 1 C), contact time = 180 min), the biosorption capacity increase in the order: SB < SBW < BC-SBW for both metal ions, indicating that BC-SBW has the highest efficiency in removing toxic heavy metals. In addition, experiments on wastewater samples have shown that, in addition to significant reducing the content of heavy metals, BC-SBW also significant improved other quality indicators (such as: pH, TSM, CCO-Cr, CBO5), compared to the other biosorbents (SB and SBW). Quantitative evaluation of the biosorptive performance of each biosorbent (SB, SBW and BC-SBW) shows that BC-SBW has a real chance of being used on an industrial scale for wastewater treatment. All these aspects allowed the development of a circular approach for the use of soybean biomass in the removal processes of toxic heavy metals. This approach minimizes the shortcomings of using biomass as a biosorbent and increase the chance of using these materials in industrial practice.

Plug and abandonment (P&A) operations demand valuable time and resources with operational procedures and materials to establish the well barrier element. This study proposes the use of a water-based fluid as a liquid well barrier element for temporary abandonment, based on esti-mates of its lifespan and survival probability on downhole conditions acquired through acceler-ated life tests. For that, the water-based formulation was tested and exposed to 95, 110, 140 and 150°C, for time intervals ranging from 1 to 10 days. After temperature exposure, the fluid prop-erties were verified and failure was detected by accounting for any deterioration in rheological parameters and/or a substantial increase in filtrate volume. Statistical analysis of failure data was performed in R software using Weibull Model, and fluid average lifespan and survival probability were estimated for P&A temperatures. The results obtained demonstrates that the degradation of the fluid only was observed for 140 and 150°C and is mostly related to the CMC deterioration. The reliability metrics shows that until 80°C the fluid is a promising alternative for temporary abandonment, with no need of monitoring. For higher downhole temperatures, theses metrics should be considered to define the maximum time of operation and requirements for monitoring management in the operation design.

In today's business world, many companies have realized that consumer feedback evaluations play a crucial part in shaping the company's future activities. The hotel and tourism industries are well-known examples where the user feedback has become crucial. Even though most accommodations want their clients to express their opinions about their services, these reviews are nevertheless carefully reviewed by them. This manual approach is time demanding and error prone, the level of expertise of the individual analyzing the evaluations determines the quality of the manual analysis. This research focuses on the development of a tool-based support system that analyzes text-based customer evaluations and then highlights the maintenance issues identified in the reviews, removing the need to manually evaluate and analyze the customer reviews. The process includes data preparation, sentiment analysis, and a fully trained deep learning model to extract critical insights. Using sentiment analysis techniques after data preprocessing and trained deep learning model, an accuracy of 96% was achieved, and this paper discusses how this technology helps to meet the needs of accommodation management by completing activities efficiently. This might save management time and helps to save money without losing clients, allowing them to enhance their additional sales.

In the realm of molecular science, intricate relationships between molecular structures and their biomedical and pharmacological characteristics have been revealed through empirical experiments. This exploration hinges on the application of numerical descriptors, known as Topological Indices, which illuminate the inherent properties of diverse molecular structures. With particular significance in the medical and pharmaceutical domains, these indices facilitate the prediction of biological features for new chemical compounds and drugs by quantifying weighted entropies. In the context of this paper, we delve into the concept of graph entropy, weaving it intricately with the topological properties of the crystalline framework of the copper oxide molecule, denoted as Cu\textsubscript{2}O$[i,j,t]$. Our primary objective is to unravel the mathematical symphony underlying the structural intricacies of Cu\textsubscript{2}O$[i,j,t]$ and to imbue it with the conceptual essence of entropy. We accomplish this through the computation of entropy, leveraging various topological indices, including weight. In addition to our analytical journey, we present a graphical comparison that juxtaposes the computed indices and entropies, shedding light on the interplay between mathematical analysis and the structural elegance of Cu\textsubscript{2}O$[i,j,t]$. This endeavor contributes to a deeper understanding of the material's multifaceted applications, spanning domains from chemical sensors to solar cells, photocatalysis, and batteries, where Cu\textsubscript{2}O's crystallographic structure plays a pivotal role.

To understand forest dynamics under today’s changing environmental conditions, it is important to analyze the state of forests at large scales. Forest inventories are not available for all regions, so it is important to use other additional sources of information, e.g. remote sensing observations. Increasingly, remotely sensed data based on optical instruments and airborne LIDAR are becoming widely available for forests. There is great potential in analyzing these measurements and gaining an understanding of forests state. In this work, we combine the new generation radiative transfer model mScope with the individual-based forest model FORMIND to generate reflectance spectra for forests. Combining the two models allows us to account for species diversity at different height layers in the forest. We compare the generated reflectances for forest stands in Finland, in the region of North Karelia, with Sentinel-2 measurements. We investigate which level of forest representation gives the best results. For the majority of the forest stands, we generated good reflectances with all levels forest representation compared to the measured reflectance. Good correlations were also found for the vegetation indices (especially NDVI with R²=0.62). This work provides a forward modelling tool for relating forest reflectance to forest characteristics. With this tool it is possible to generate a large set of forest stands with corresponding reflectances. This opens the possibility to understand how reflectance is related to succession and different forest conditions.

The United Nations' sustainable development goals have underscored the importance of enhancing supply chain sustainability while appropriately distributing orders. This study proposes a novel framework involving Z-number, game theory, indifference threshold-based attribute ratio analysis (ITARA), and combined compromise solution method (CoCoSo) to evaluate the sustainability of suppliers and order allocations. To better reflect the decision makers’ current choices for the sustainability of assessed suppliers and order allocations; enhance the comprehensiveness of decision-making, the importance parameter of the supplier is obtained through game theory objectively for transforming supplier performance into order allocation performance. The Z-numbers are involved in ITARA (so-called ZITARA) and CoCoSo (so-called ZCoCoSo) to overcome the issue of information uncertainty in the process of expert evaluation. ZITARA and ZCoCoSo are applied to assess the objective weight of criteria and the ranking of assessed order allocations, respectively. Afterwards, a case study of China’s company is illustrated the utility of the proposed framework and inform their decision-making process regarding the orders to be assigned to the assessed suppliers.

Simulated Annealing (SA), Tabu Search (TS), and Variable Neighborhood Search (VNS) are well-established single-solution-based metaheuristics known for their efficiency. In this paper, we explore the application of these techniques to enhance the performance of graph network models, specifically Graph Neural Networks (GNNs) and Graph Convolutional Networks (GCNs). By leveraging these metaheuristics, we aim to optimize key aspects of graph-based learning, such as hyperparameter tuning, architecture design, feature selection, and graph structure learning. Our approach demonstrates how these metaheuristics can improve the generalization, efficiency, and robustness of GNNs/GCNs, facilitating their use in large-scale graph-based tasks. The proposed framework illustrates the potential of combining advanced optimization techniques with state-of-the-art graph machine learning models.

Graph unlearning has emerged as a crucial technique in privacy-preserving applications, particularly in scenarios where sensitive data must be erased from graph-based systems. This paper explores the fundamental concepts, challenges, and methodologies associated with graph unlearning, including its application to domains such as social networks, financial transaction systems, and healthcare networks. By delving into various algorithms, including local and global unlearning methods, we analyze the trade-offs between accuracy, privacy, and computational efficiency. The paper further investigates the security risks associated with graph unlearning, including adversarial and inference attacks, and proposes mitigation strategies to safeguard unlearning processes. We also examine the unique challenges posed by federated learning systems, where unlearning requires coordination across decentralized clients. Finally, the paper evaluates graph unlearning techniques using performance metrics such as time complexity, accuracy, and privacy guarantees, supported by real-world examples from diverse applications. The findings emphasize the importance of developing robust, scalable, and secure unlearning mechanisms to ensure data privacy and compliance with regulations. Evaluation and metrics for Graph Unlearning will also be discussed in this paper.

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.

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.

This comprehensive review elucidates the profound relationship between the human microbiome and breast cancer managrement. Recent findings highlight the significance of microbial alterations in tissues, such as the gut and the breast, and their role in influencing breast cancer risk, development, progression, and treatment outcomes. We delve into how the gut microbiome can modulate systemic inflammatory responses and estrogen levels, thereby impacting cancer initiation and therapeutic drug efficacy. Furthermore, we explore the unique microbial diversity within breast tissue, indicating potential imbalances brought about by cancer and highlighting specific microbes as promising therapeutic targets. Emphasizing a holistic One Health approach, this review underscores the importance of integrating insights from human, animal, and environmental health to gain a deeper understanding of the complex microbe-cancer interplay. As the field advances, strategic manipulation of the microbiome and its metabolites presents innovative prospects for enhancing cancer diagnostics and therapeutics. However, rigorous clinical trials remain essential to confirm the potential of microbiota-based interventions in breast cancer management.

Coal combustion in thermal power plants releases ash. Ash is reported to cause different adverse health hazards in humans and other organisms. Owing to the presence of radionuclides, it is also considered as a potential radiation hazard. In this study, based on the surface radiation measurements and relevant ancillary data, expected radiation risk zones were identified with regard to the human population residing near the Thermal Power Plant. With population density as the risk determining criteria, about 20% of the study area was at ‘High’ risk and another 20% of the study area was at ‘Low’ risk zone. The remaining 60% was under medium risk zone. Based on the findings remedial measures which may be adopted have been suggested.

For effective warehouse management, various criteria should be taken into consideration in terms of inventory management, demand, transportation distance, usage area, delivery-waiting times, and minimizing the costs that may arise from them. Because, the purpose of the product assignment problem is to minimize the total transport distance during storage and to reduce the space required for product assignment. However, the storage location assignment problem (SLAP) occurs simultaneously with production planning activities in real life. In this study, an integrated mixed-integer nonlinear (MINLP) mathematical model is proposed, which includes the assignment of products to storage areas and production planning, using the TOPSIS (Technique for Order Preference by Similarity to Ideal Solution) class based policy for storage systems where multiple criteria are important. In the TOPSIS class-based policy, weight and waiting time criteria are taken into account, as well as the COI (Cube-per-order index index), which is widely used in the literature. In addition, a decision support system flow has been proposed that takes into account the single criterion, multiple criteria and COI index criteria of the developed model and provides its integration with different product assignment policies. Detailed literature research; It has been revealed that the proposed mathematical model and decision support system flow have the feature of applying an existing field of science to a new problem.

Balancing the efficiency and robustness of food systems is a well-known trade-off process. Over-optimization of efficiency may lead to excessive use of resources. On the other hand, under-optimization of efficiency may lead to excessive waste of resources. Using non-parametric methods can help in developing actionable frameworks through which decision-makers and stakeholders can effectively balance and improve food systems' efficiency and robustness. Under this context, this paper presents a new structured approach integrating two well-suited non-parametric methods for analyzing and balancing the interconnection between the efficiency and robustness of food systems. This approach consists of three main steps. First, the slacks-based data envelopment analysis (SBM-DEA) is utilized to analyze the efficiency of five food robustness dimensions. Second, the weighted efficiency of these dimensions is computed and analyzed to provide an insight into their influence on the food system efficiency. Finally, two search methods were developed to identify opportunities for improving efficiency and robustness. The outcomes of these methods have been analyzed and validated to ensure their effectiveness and viability. The operational and mathematical properties of the proposed approach were evaluated using data from thirty-seven food-producing countries. The weights of the robustness dimensions in this study were determined using the analytic hierarchy process (AHP) method. The input matrix of the AHP was constructed using expert judgment and consultations with stakeholders. The results of this study have shown an appropriate level of applicability and effectiveness of the proposed approach. While the first search method provided valuable insights, the second method proved to be more effective in identifying the sources of inefficacy of robustness dimensions. Several conclusions have been drawn and reported with some recommendations for future research works.

Urban air pollution is a significant threat to both the environment and public health. Primarily originating from traffic emissions, particulate matter is identified as the most prevalent and toxic pollutant in cities. In recent years, street vegetation has emerged as a nature-based solution to improve urban air quality. However, to achieve this goal, proper placement of vegetation is crucial. This study critically investigates how different street tree placement strategies affect the local air quality, based on a model calibrated using existing air quality measurements from one of the most polluted streets in Glasgow. We then test the local air quality effects of tree orientation, spacing, shape, porosity, size, species, and wind directions. The findings suggest that trees effectively enhance air quality, particularly when implemented on the leeward side of the street. To achieve optimal effectiveness, the spacing of trees require careful alignment with the aspect ratio, as haphazard planting could lead to unfavorable results. The insights on improving air quality in Glasgow's street canyons, complements the objectives of the ‘Glasgow Avenues Programme’ and can be included in its Low Emission Zones to co-benefit the environment and the wellbeing of the local community.

Since sensor-based perception systems are used in autonomous vehicle applications, validating such systems is imperative to guarantee the robustness of the systems before they are being put to use. In this study, a comprehensive corruption-related simulation-based robustness verification and enhancement process for sensor-based perception systems is proposed. Firstly, we present a methodology and scenario-based corruption generation tools for creating diverse simulated test scenarios that can analogously represent real-world traffic environments, especially considering corruption types related to safety concern. Then, an effective corruption similarity filtering algorithm is proposed to remove corruption types with high similarity and identify the representative corruption types to represent all considered corruption types. As a result, we can generate efficient corruption-related robustness test scenarios with less testing time and good scenario coverage. Subsequently, we perform the vulnerability analysis of object detection models to identify model weaknesses and construct an effective training dataset for model vulnerability enhancement. This enhances the tolerance of object detection models to weather and noise-related corruptions, ultimately improving the robustness of the perception system. We employ case studies to demonstrate the feasibility and effectiveness of the proposed robustness verification and enhancement procedures. Additionally, we explore the impact of different "similarity overlap threshold" parameter settings on scenario coverage, effectiveness, scenario complexity (size of training and testing datasets), and time costs.

With the continuous increase in ship size combined with the generally slower increase in the size of waterways, the need for the prediction of ship maneuvering in shallow waterways continues to attract attention from the international scientific community. Ship behavior in shallow water is relevant in seabed effects that result in changing the hydrodynamic forces acting on the ship. In this study, the maneuvering characteristics of container ship with four degrees of freedom in shallow water are analyzed. The Reynolds-averaged Navier Stokes approach in Ansys Fluent code is used to produce the maneuvering coefficients through the simulations of forward running, static drift, static heel, circular motion, the combined motions, and the pure roll motion of the Kriso container ship. The maneuvering characteristics of the ship are estimated for evaluating the ship behaviors in shallow water condition. The obtained results show that the roll has a significant decrease and the ship’s turning diameter has a significant increase when the ship operates in the shallow waterway. The prediction of maneuvering characteristics of the ship are in good agreement with those of free running model tests, indicating that the numerical simulation based on the Computational Fluid Dynamics method has compromising capability to predict the maneuvering derivatives and the 4-DOF ship maneuvering motion in shallow water as well.

Constructing new graph from the graph's parameters and related notions in the way that, the study on the new graph and old graph in their parameters could be facilitated. As graph, new graph has some characteristics and results which are related to the structure of this graph. For this purpose, regular graph is considered so the internal relation and external relation on this new graph are studied. The kind of having same number of edges when this number is originated by common number of graphs like maximum degree, minimum degree, domination number, coloring number and clique number, is founded in the word of having regular graph

We studied generalization of a method for extending configurational studies to variables that are not exclusively geographical, in order to allow investigation of generic relationships in the built environment. We observed a number of limitations of the classical approach of configurational studies and we considered how a complex analytical method could be implemented in the study of non-topological variables, such as land use, noise pollution and financial or property rents. In order to do this we established a system of relationships based on a labeled primary graph. Categorization of the labels of the links was performed on a generic variable, specifically, the predominant use of roads. The graph was then contracted using an optimization algorithm, which we describe. The algorithm allows the network to be reduced to a more streamlined system that can better analyze the relationships between the different categories. Application of the method showed that it is faster to identify weaknesses in urban networks, and then take measures to resolve them. The case study concerns the pedestrianization of the Colosseum area in Rome.

This study proposes a novel hybrid machine learning approach for modeling of rainfall-induced shallow landslides. The proposed approach is a combination of an instance-based learning algorithm (k-NN) and Rotation Forest (RF), state of the art machine techniques that have seldom explored for landslide modeling. The Lang Son city area (Vietnam) is selected as a case study. For this purpose, a spatial database for the study area was constructed, and then, was used to build and evaluate the hybrid model. Performance of the model was assessed using Receiver Operating Characteristic (ROC), area under the ROC curve (AUC), success rate and prediction rate, and several statistical evaluation metrics. The results showed that the model has high performance with both the training data (AUC = 0.948) and the validation data (AUC = 0.848). The results were compared with those obtained from soft computing techniques i.e. Random Forest, J48 Decision Trees, and Multilayer Perceptron Neural Networks. Overall, the performance of the proposed model is better than those obtained from the above methods. Therefore, the proposed model is a promising tool for landslide modeling. The research result can be highly useful for land use planning and management in landslide prone areas.

The worldwide population is undergoing a fundamental change in its age structure, which challenges the health and social services system. The need to migrate towards a more person-centered and coordinated model of care that supports the optimization of abilities and capacities for older people has to be matched. In this sense, eHealth technologies can play a fundamental role. In this paper, through a questionnaire-based data collection on 30 primary (older people) and 32 secondary (informal caregivers) end-users, we share the sustainable way to develop a product optimizing the user experience and ensuring adoption. Both older adults and caregivers consider the use of smartphone and smartwatch to be very important, but also the use of digital devices for healthcare can be helpful. Seniors care about self-monitoring of health parameters using wearable devices, regardless of their health status, and would like to be included in the process of making good health decisions, because they need to feel in control of their healthcare process. Digital solutions in health and care can support the wellbeing of older adults in many areas of their daily lives at home and in their communities, but only if such innovation is designed around the natural voice of the intended target.

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.

Acute low back pain (LBP) stands as a leading cause of activity limitation and work absenteeism, and its associated healthcare expenditures are expected to become substantial when acute LBP develops into a chronic and even refractory condition. Therefore, early intervention is crucial to prevent progression to chronic pain whose management is particularly challenging and for which the most effective pharmacological therapy is still controversial. Current guideline treatment recommendations vary and are mostly driven by expertise with opinion differing across different interventions. Thus, it is difficult to formulate evidence-based guidance when relatively few randomized clinical trials did explore the diagnosis and management of LBP while employing different selection criteria, statistical analyses, and outcome measurements. This narrative review aims to provide a critical appraisal of current acute LBP management by discussing the unmet needs and areas of improvement from bench-to-bedside and proposes multimodal analgesia as the way forward to attain an effective and prolonged pain relief and functional recovery in patients with acute LBP.

Water scarcity presents one of the greatest challenges of our time. Especially in naturally water scarce regions, the need of additional water resources is rising, requiring innovative and site-adapted technologies. In this review, selected non-conventional water technologies for sustainable water management are strategically evaluated. Focused on a matrix-based assessment incorporating key indicators, the study discusses the availability, applicability, environmental impact, scalability, and economic viability of the selected technologies. Based on a comprehensive literature review, the methodology involves a systematic comparison of technologies for desalination, water reuse, groundwater utilization, agricultural reuse, and unconventional approaches like cloud seeding, dew water, and fog water harvesting. The indicators covering the respective categories are presented in the results. On this basis, the different technologies are analyzed by matrix-based evaluation, highlighting various strengths and weaknesses and providing insights into technology selection based on regional needs. The discussion interprets the findings, deriving implications for dry environments, acknowledging limitations and suggesting pathways for future research. Through a rigorous analytical framework, this study contributes to the discourse on sustainable water solutions, offering valuable insights for policymakers, researchers and industries during a decision-making progress.

This paper investigates, experimentally and numerically, the buckling behavior of innovative sustainable Low-Cost Bamboo Composite (LCBC) structural columns under compressive loading. The LCBC columns are manufactured from bamboo culms in combination with bio-based resins to form composite structural columns. Different LCBC cross-sectional configurations are investigated in this study including the Russian doll (RD), Big Russian doll (BRD), Hawser (HAW), and Scrimber (SCR). Extra-large, large, medium, and small sizes of bamboo are employed to form the proposed configurations. Two bio-based resins including one bio-epoxy and one furan-based resin, in addition to a soft bio-based filler and a synthetic epoxy resin are applied. The bamboo species used as the cast-in-place giant bamboo for all configurations include Moso, Guadua, and Tali. In addition to experimental testing of the slender LCBC short columns, finite element analysis (FEA) software ABAQUS is applied to model the composite columns and predict their behavior. A buckling analysis using static Riks method is carried out to determine the LBCB’s response to axial compressive loading. A model is calibrated using test results with various imperfections, accounting for the variable behavior of each bamboo specimen, to accurately predict the behavior of LCBC columns with different resin contents. Slender LCBC columns showed maximum stress at buckling up to 60 MPa, highlighting the potential of bio-based resins for structural applications. The study found that the samples with bio-epoxy resin (BE2) exhibited enhanced material stiffness when compared to with synthetic epoxy (EPX) and furan-based resin (PF1), while PF1 specimens demonstrated increased ductility. The BE2 samples showed strain hardening in their stress-strain behavior, and the PF1 samples exhibited a long plateau phase before reaching the maximum load. Among the specimens with Moso bamboo and BE2 resin, those with SCR and HAW configurations achieved the highest compressive strengths.

Graph query languages such as Cypher are widely adopted to match and retrieve data in a graph representation, due to their ability of retrieving and transforming information. Despite the most natural way to match and transform information is through rewriting rules, those are scarcely or partially adopted in graph query languages. Their inability of doing so has a major impact on the subsequent way the information is structured, as it might then appear more natural to provide major constraint over the data representation so to consequently constraint the way the information should be represented. On the other hand, recent works are starting to move towards an opposite direction, as the provision of a truly general semistructured model (GSM) allows to both represent all the available data formats (Network-Based, Relational, and Semistructured) as well as support an holistic query language expressing all major queries in such languages. In this paper, we show that the usage of GSM enables the definition of a general rewriting mechanism which can be expressed in current graph query languages only at the cost of adhering the query to the specificity of the underlying data representation. We formalise the proposed query language in terms graph rewriting mechanisms described as a set of production rules $L\to R$ while providing restriction to the characterization of L, while extending it to support structural graph nesting operations, useful to aggregate similar information around an entry-point of interest. We discuss how GSM, by fully supporting index-based data representation, allows for a better physical model implementation leveraging the benefits of columnar database storages. Preliminary benchmarks shows the scalability of this proposed implementation in comparison with state-of-the-art implementations.