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.

Graph theory plays significant role in every field of science as well as technology. Every situation can be articulated in terms of suitable graphs by using various approaches of graph theory. Considering the recent pandemic in the world and the precautions taken for prevention of the COVID 19, it is the most appropriate way to exercise the graph models with theoretical as well as practical aspects to control this epidemic. This paper defines the variable set, variable graphs and their types with respect to variable vertex sets and variable edge sets. Depending upon the nature of the pandemic, there are four types of Virus graphs. Virus graph I and III are not so perilous for all living beings. Although, Virus graphs II and IV are extremely hazardous for the harmony of the world. In view of different aspects for expand of pandemic, growth types of virus graphs are divided in 1-1, 1-P and 1-all growth types. The COVID19 initially was in Virus graph-I type, but presently it is in Virus graph-II types. We present the table involving the number of infected people after n days with respect to different values of P and growth rates with I0 = 100. Moreover, the country wise starting dates of stages of the virus graph-I and II are specified. The concept of cut sets is applicable for prevention of COVID19 and the whole world is using the same analogy.

This study presents the synthesis and electrochemical evaluation of nitrogen-doped vanadium oxide (N-V2O3/C) as a cathode material for aqueous zinc-ion batteries (AZIBs), using a hydrothermal method. Compared to undoped V2O3/C, N-V2O3/C exhibits enhanced electrical conductivity, capacity, and electrochemical kinetics, attributed to the incorporation of pyridinic and pyrrolic nitrogen. Initial charge-discharge cycles indicate phase transitions to amorphous vanadium oxides, enhancing conductivity. N-V2O3/C shows a high specific capacity of 168.4 mAh g−1 at 10 A g−1 and remarkable reversibility, highlighted by the transient existence of intermediate species during cycling. Optimal electrochemical performance is achieved with a vanadium to nitrogen molar ratio of 2:3, indicating the significant impact of nitrogen doping concentration on the material’s efficiency. This work underscores the potential of N-V2O3/C as a superior cathode material for AZIBs.

Using density functional theory (DFT), the density of states of NH4V3O8 (NVO) was analyzed pre and post-oxygen defects (Od) formation. The findings revealed a reduced bandgap in NVO after Od introduction, emphasizing the role of Od in enhancing conductivity of the material, thus improving its electrochemical attributes. Through the water bath method, both NVO and its oxygen-deficient counterpart, (NH4)2V10O25⸱8H2O (NVOd), were synthesized as potential cathode materials for aqueous zinc-ion batteries (AZIBs). Experimental outcomes resonated with DFT predictions, highlighting the beneficial role of oxygen defects in boosting electrical conductivity. Notably, the refined material displayed a remarkable capacity of 479.3 mAh g-1 at 0.1 A g-1, underscoring its promise for advanced energy storage solutions.

This study reports on the development of bio-based hydrophobic coatings for packaging papers through deposition of polyhydroxybutyrate (PHB) particles in combination with nanofibrillated cellulose (NFC) and plant wax. In a first approach, PHB particles in micrometer range (PHB-MP) were prepared through a phase-separation technique providing internally nanosized structures. The particles were transferred as a coating by dip-coating filter papers in the particle suspension, followed by sizing with a carnauba wax solution. This approach allowed partial to almost full surface coverage of PHB-MP over the paper surface resulting in static water contact angles of 105° to 122° and 129° to 144° after additional wax coating. In a second approach, PHB particles with submicron sizes (PHB-SP) were synthesized by an oil-in-emulsion (o/w) solvent evaporation method, and mixed in aqueous suspensions with 0 to 7 wt% NFC. After dip-coating filter papers in PHB-SP/NFC suspensions and sizing with a carnauba wax solution, static water contact angles of 112° to 152° were obtained. The intrinsic properties of the particles were analyzed by scanning electron microscopy, thermal analysis and infrared spectroscopy, indicating higher crystallinity for PHB-SP than PHB-MP. The chemical interactions between the more amorphous PHB-MP particles and paper fibers were identified as an esterification reaction, while the morphology of the NFC fibrillar network was playing a key role as binding agent in the retention of more crystalline PHB-SP at the paper surface, hence contributing to higher hydrophobicity.

Public transportation scheduling aims to optimize the allocation of transportation resources, enhance transportation efficiency, and increase passenger satisfaction, which is crucial for building a sustainable urban transportation system. As a complement to public transportation, shared bikes provide users with a solution for the last mile of travel, compensating for the lack of flexibility in public transportation and helping to improve its utilization rate. Due to the characteristics of shared bikes, such as peak usage periods in the morning and evening and significant fluctuations in demand across different areas, the optimization of shared bike dispatch can better meet user needs, thereby reducing vehicle vacancy rates and increasing operating revenue. Addressing this issue, this paper designs a comprehensive decision-making approach for spatio-temporal demand prediction and bike dispatch optimization. For demand prediction, we designed a T-GCN based bike demand prediction model. In terms of dispatch optimization, we considered factors such as dispatch capacity, distance restrictions, and dispatch costs, and designed an optimization solution based on genetic algorithms. Finally, this paper validates the approach using shared bike operating data, shows that T-GCN can effectively predict short-term demand for shared bikes. Meanwhile, the optimization model based on genetic algorithms provides a complete dispatch solution verifying the model’s effectiveness. The shared bike dispatch approach proposed in this paper, which combines demand prediction with resource scheduling. This scheme can also be extended to other transportation scheduling problems with uncertain demand, such as store replenishment delivery and intercity inventory dispatch.

This work presents a novel approach for the study of the movement of droplets on inclined surfaces under the influence of gravity and chemical heterogeneities. The developed numerical methodology uses data-driven modeling to extend the applicability limits of an analytically derived reduced-order model for the contact line velocity. More specifically, while the reduced-order model is able to capture the effects of the chemical heterogeneities to a satisfactory degree, it does not account for gravity. To alleviate this shortcoming, datasets generated from direct numerical simulations are used to train a data-driven model for the contact line velocity, which is based on the Fourier neural operator and corrects the reduced-order model predictions to match the reference solutions. This hybrid surrogate model, which comprises of both analytical and data-driven components, is then integrated in time to simulate the droplet movement, offering a speedup of five orders of magnitude compared to direct numerical simulations. The performance of this hybrid model is quantified and assessed in different wetting scenarios, by considering various inclination angles and values for the Bond number, demonstrating the accuracy of the predictions as long as the adopted parameters lie within the ranges considered in the training dataset.

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.

This paper numerically investigates a 3D mesh independency study of a straight blade horizontal axis tidal turbine modelled using Computational Fluid Dynamics (CFD). The solution was produced by employing two turbulence models, the standard k-ε model and Shear Stress Transport (SST) in ANSYS CFX. Three parameters were investigated: mesh resolution, turbulence model, and power coefficient in the initial CFD, analysis. It was found that the mesh resolution and the turbulence model affect the power coefficient results. The power coefficients obtained from the standard k-ε model are 15% to 20% lower than the accuracy of the SST model. It can also be demonstrated that the torque coefficient increases with the increasing Tip Speed Ratio (TSR), but drops drastically after TSR = 5 and k-ε model failing to capture the non-linearity in the torque coefficient with the increasing TSR.

In this paper, carbon nanotubes modified screen-printed electrode (CNTs/SPE) was prepared and the CNTs/SPE was employed for the electrochemical determination of antioxidant substance Chlorogenic acids (CGAs). A pair of well-defined redox peak of CGA was observed at the CNTs/SPE in 0.10 mol∙L^-1 acetic acid-sodium acetate buffer (pH 6.2) and electrode process is adsorption-controlled. Cyclic voltammetry (CV) and differential pulse voltammetry (DPV) method for the determination of CGA were proposed based on the CNTs/SPE. Under the optimal conditions, the proposed method exhibited linear ranges from 4.73×10^-7 to 4.45×10^-5 mol∙L^-1, the linear regression equation was Ipa(µA) = 4.1993 C (mol∙L^-1)+1.1039 (r = 0.9976) and the detection limit for CGA could reach 3.25×10^-6 mol∙L^-1. The recovery of matrine was 94.74~106.65% (RSD = 2.92%) in coffe beans. The proposed method is quick, sensitive, reliable, and can be used for the determination of CGA.

Intrahepatic cholangiocarcinoma (ICCA) is a malignant epithelial neoplasm characterized by biliary differentiation within the liver. ICCA is molecularly heterogeneous and exhibits a broad spectrum of histopathological features. It is a highly aggressive carcinoma with high mortality and poor survival rates. ICCAs are classified into two main subtypes: small duct type and large duct types. These two tumor types have different cell origins and clinicopathological features. ICCAs are characterized by numerous molecular alterations, including mutations in KRAS, TP53, IDH1/2, ARID1A, BAP1, BRAF, SAMD4, and EGFR, and FGFR2 fusion. Two main molecular subtypes–inflammation and proliferation–have been proposed. Recent advances in high-throughput assays using next-generation sequencing have improved our understanding of ICCA pathogenesis and molecular genetics. The diagnosis of ICCA poses a significant challenge for pathologists because of its varied morphologies and phenotypes. Accurate diagnosis of ICCA is essential for effective patient management and prognostic determination. This article provides an updated overview of ICCA pathology, focusing particularly on molecular features, histological subtypes, and diagnostic approaches.

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.

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.

The exact dynamics of emergence remains one of the most prominent outstanding questions for the field of complexity science. I first discuss various perspectives on emergence in various contexts, then offer a different perspective on understanding emergence in a graph-theoretic representation. From the discussion, an observer’s choice in state space seems to have an effect for that observer to detect emergent behavior. To test these ideas, I analyze the dynamics of all possible spatial state spaces near the critical temperature in an Ising model. As a result, state space topologies that appear more deterministic flip more bits than topologies that appear more random, which is contrary to our intuitions about randomness. In addition, the size of different state spaces constrain a system’s ability to explore various states within the same time frame. These results are important to understanding emergent phenomena in biological systems, which are layered with various state spaces and observational perspectives.

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

Background: Circulating rare cells participate in breast cancer evolution as systemic components of the disease and thus, are a source of theranostic information. Exploration of cancer-associated rare cells is in its infancy. We determined the validity of a rare-cell detection platform and demonstrated the usefulness of a certain rare cell subset as a novel approach to characterize the breast cancer system. Methods: Linearity of the Rarmax® platform was established using a spike-in approach. The platform includes red blood cell lysis, leukocyte depletion and high-resolution fluorescence image recording. Rare cell analysis was conducted on 28 samples (before and after surgery) from 14 patients with breast cancer, 20 healthy volunteers and 9 non-cancer control volunteers. In-depth identification of rare cells, including circulating tumor cells, endothelial-like cells, erythroblasts and inflammation-associated cells, was performed using a phenotype and morphology-based classification system. Results: The platform performed linearly over a range of 5-950 spiked cells, with an average recovery of 84.6%. Circulating epithelial and endothelial-like cell subsets have been demonstrated to be associated with or independent of cancer with tumor presence. Furthermore, certain cell patterns may be associated with treatment-related adverse effects. The sensitivity in detecting tumor-presence and cancer-associated abnormality before surgery was 50% and 85.7%, respectively and the specificity was 100% and 96.6%, respectively. Conclusion: The present study supports the idea of a cancer-associated rare cell abnormality to represent tumor entities as well as systemic cancer. The latter is independent of the apparent clinical cancer.

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

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.

Amid escalating urbanization, devising rational commercial space layouts is a critical challenge. Leveraging machine learning, this study uses a Back-propagation (BP) neural network to optimize commercial spaces in Weinan City's central urban area. The results indicate an increased number of commercial facilities with a trend of multi-centered agglomeration and outward expansion. Based on these findings, we propose a strategic framework for rational commercial space development emphasizing aggregation centers, development axes, and spatial guidelines. This strategy provides valuable insights for urban planners in small and medium-sized cities in the Yellow River Basin and metropolitan areas, ultimately showcasing the power of machine learning in enhancing urban planning.

This research uses the computing of conceptual distance to measure information content in Wikipedia categories. The proposed metric, generality, relates information content to conceptual distance by determining the ratio of information a concept provides to others compared to the information it receives. The DIS-C algorithm calculates generality values for each concept, considering each relationship's conceptual distance and distance weight. The findings of this study were compared to current methods in the field and found to be comparable to results obtained using the WordNet corpus. This method offers a new approach to measuring information content applied to any relationship or topology in conceptualization.

The proposed method deals with the problem of data privacy and sharing when processing personal mobility tracking data. Previous methods concentrate on producing highly detailed data on short-term and restricted areas, e.g. for autonomous driving scenarios. Another possibility consists of city-wide scales and beyond, that are used to predict general traffic flows. The presented approach takes the tracked mobility behavior of individuals to create coherent new mobility data that reflects the long-term mobility behavior of the person, guaranteeing location persistency and sound embedding within the point-of-interest structure of the observed area. After an analysis and clustering step with the original data, the area is distributed into a geospatial grid structure (H3 is used here), and the neighborhood relationships between the grids are interpreted as a graph. A feed-forward-autoencoder and a graph encoding-decoding network generate a latent space representation of the area. The original clustered data is associated with their respective H3 grids. With a greedy algorithm approach and concerning privacy strategies, new combinations of grids are top-level patterns for individual mobility behavior. Concrete locations are found and connected within the grids based on the original data. The described method is then applied to a study with 1000 participants from the city of Munich in Germany, and the results are described, showing the application of the approach in generating synthetic data, enabling further research on individual mobility behavior and patterns. The result is a sharable dataset on the same abstraction level as the input data, which makes it interesting, particularly for machine learning applications.

model checking techniques are often used for the verification of software systems. Such techniques are accompanied with several advantages. However, state space explosion is one of the drawbacks to model checking. During recent years, several methods have been proposed based on evolutionary and meta-heuristic algorithms to solve this problem. In this paper, a hybrid approach is presented to cope with the SSE problem in model checking of systems modeled by GTS with an ample state space. Most of existence proposed methods that aim to verify systems are applied to detect deadlocks by graph transformations. The proposed approach is based on the fuzzy genetic algorithm and is designed to decline the safety property by verifying the reachability property and detecting deadlocks. In this solution, the state space of the system is searched by a fuzzy genetic algorithm to find the state in which the specified property is refuted/verified. To implement and evaluate the suggested approach, GROOVE is used as a powerful designing and model checking toolset in GTS. The experimental results indicate that the presented hybrid fuzzy method improves speed and performance by comparing other techniques

Sign Language Recognition (SLR) aims to bridge speech-impaired and general communities by recognizing signs from given videos. Researchers still face challenges developing efficient SLR systems because of the video’s complex background, light illumination, and subject structures. Recently many researchers developed a skeleton-based sign language recognition system to overcome the subject and background variation of hand gesture signs. However, skeleton-based SLR is still under exploration due to the lack of information and annotations on hand key points. More recently, researchers included body and face information with the hand gesture for the SLR, but their performance and efficiency are unsatisfactory. We proposed a Multi-Stream Graph-based Deep Neural Network (SL-GDN) for a skeleton-based SLR system to overcome the problems. The main purpose of the proposed SL-GDN approach is to improve the efficiency and performance of the SLR system with a low computational cost based on the human body pose in the form of 2D landmark locations. In the procedure, firstly, we constructed a skeleton graph based on the selected 27 whole-body key points among 67 key points to solve the inefficiency problems. Then we proposed multi-stream SL-GDN to extract features from the whole-body skeleton graph for four streams. Finally, we concatenated the four different features and applied a classification module to refine the feature and recognize corresponding sign classes. Our data-driven and graph construction method increases the system’s flexibility and brings high generability to adapt various data samples. We used three large-scale benchmark SLR datasets to evaluate the proposed model: WLASL, AUTSL and CSL. The demonstrated performance accuracy table proved the superiority of the proposed model, and we believe this will be considered a great invention in the SLR domain.

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.

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

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.

It is difficult to effectively operate a dual-arm robot using only the information written in a cooking recipe. To cope with this problem, this paper proposes a graph based approach on bimanual cooking motion planning from a cooking recipe. In our approach, we first decompose the cooking recipe into graph elements. Then, we try to connect the graph elements taking into account the attributes of the input/output nodes. If two graph elements cannot be connected each other, we search for a graph element that can be inserted between them from the database of graph elements. Since the constructed graph includes the whole sequence of the robot’s motions to perform the cooking task, we can generate a task sequence of a dual-arm manipulator simultaneously performing two different tasks by using two arms. Through experimental study, we show that it is possible to generate robot motions from a cooking recipe and perform the cooking motions while simultaneously moving the left and right arms.

Identifying fake news on the media has been an important issue. This is especially true considering the wide spread of rumors on the popular social networks such as Twitter. Various kinds of techniques have been proposed for automatic rumor detection. In this work, we study the application of graph neural networks for rumor classification at a lower level, instead of applying existing neural network architectures to detect rumors. The responses to true rumors and false rumors display distinct characteristics. This suggests that it is essential to capture such interactions in an effective manner for a deep learning network to achieve better rumor detection performance. To this end we present a simplified aggregation graph neural network architecture. Experiments on publicly available Twitter datasets demonstrate that the proposed network has performance on a par with or even better than that of state-of-the-art graph convolutional networks, while significantly reducing the computational complexity.

The internet can broadly be divided into three parts: surface, deep and dark among which the latter offers anonymity to its users and hosts [1]. Deep Web refers to an encrypted network that is not detected on search engine like Google etc. Users must use Tor to visit sites on the dark web [2]. Ninety six percent of the web is considered as deep web because it is hidden. It is like an iceberg, in that, people can just see a small portion above the surface, while the largest part is hidden under the sea [3, 4, and 5]. Basic methods of graph theory and data mining, that deals with social networks analysis can be comprehensively used to understand and learn Deep Web and detect cyber threats [6]. Since the internet is rapidly evolving and it is nearly impossible to censor the deep web, there is a need to develop standard mechanism and tools to monitor it. In this proposed study, our focus will be to develop standard research mechanism to understand the Deep Web which will support the researchers, academicians and law enforcement agencies to strengthen the social stability and ensure peace locally & globally.

Single-phase-to-ground fault in non-effectively grounded systems poses serious public safety concern. Along with increasing deployment of low-voltage (LV) sensors, new opportunities and ways are created for solving this traditional problem in distribution systems. A new approach, identifying primary single-phase-to-ground line fault and locating it through measurement data from smart sensors deployed in the secondary side of distribution transformers, is proposed in this paper. When a fault occurs in primary distribution feeder, the transient aerial mode voltage (AMV) of each LV smart sensor is calculated. The fault line can be identified by an abrupt change value of AMV at LV side. Next, by finding the position of the maximum value of this AMV from LV sensors on the fault line, the fault location can be pinpointed to two neighboring distribution transformers. The proposed method has been proven to be efficient and reliable by simulation studies.

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

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

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

With the rapid development of the Internet industry, the problem of information overload has arisen due to the abundance of information available online. Recommendation algorithms, as the core of recommendation systems, have been attracting much attention and are a hot topic of research for many experts and scholars. The classical recommendation algorithms are mainly divided into three major categories: collaborative filtering recommendation algorithms, content-based recommendation algorithms, and hybrid-based recommendation algorithms. Although these algorithms are widely used in various fields, with the proliferation of information, these traditional recommendation algorithms are no longer able to meet the needs of the times. To address this issue, recommendation systems have been developed to provide users with personalized and relevant information or products. Despite the wide use of recommendation algorithms, such as collaborative filtering, content-based filtering, and hybrid approaches, traditional recommendation algorithms have limitations and are no longer suitable for meeting the demands of the times. This paper proposes a new recommendation algorithm, SFRRG, that fuses structure and feature information in graph neural networks to improve the performance of the recommendation system in rating prediction. The effectiveness of the proposed algorithm is demonstrated through experiments on various data sets and compared with existing recommendation algorithms.

In this paper, inspired by Jleli and Samet [journal of inequalities and applications 38 (2014) 2 1–8] we introduce two new classes of auxiliary functions and utilize the same to define (q, y)R-weak 3 contractions. Utilizing (q, y)R-weak contractions, we prove some fixed point theorems in the setting 4 of relational metric spaces. We employ some examples to substantiate the utility of our newly proved 5 results. Finally, we apply one of our newly proved results to ensure the existence and uniqueness of 6 solution of a Volterra-type integral equation.

Psoriasis is a chronic recurrent inflammatory autoimmune pathology, with a major genetic component and several interferences of immunological cells and their cytokines. The complex orchestration of psoriasis pathogenesis is related to the synergic effect of immune cells, polygenic alterations, the presence of autoantigens and several external factors. The major act of IL-23/IL-17 axis, strongly influencing the inflammatory pattern established during the disease activity, is visible as a continuous perpetuation of the pro-inflammatory response and keratinocyte activation and proliferation leading to the development of psoriatic lesions. Genome wide association studies (GWAS) along offered a better view of psoriasis pathogenic pathways, with approximately one third of psoriasis genetic impact on psoriasis development is associated to MHC region, with genetic loci located on chromosome 6. The most eloquent genetic factor of psoriasis, PSORS1, was identified in the MHC I site. Between the several factors involved in its complex etiology, dysbiosis, due to genetic or external stimulus, exhibiting less variety and the involvement of pathogenic bacteria, cand induce a burst of proinflammatory consequences, both cutaneous and gut microbiome being involved in psoriasis pathogenic process. A complex understanding of the major pathways that interplay in order to initiate and perpetuate psoriatic diseases and its associated comorbidities can help the current clinical practice by properly evaluating completely and individualized each patient and establish the proper therapeutic management.

To address the challenge of recognizing ship states accurately amidst the complexities of marine environments, this study proposes a novel ship state recognition approach leveraging a graph convolutional neural network (GCNN). Initially, the method extracts canonical and efficient ship motion trajectories from AIS data. Subsequently, a state recognition network tailored for ship motion trajectories is devised and implemented employing graph convolution. Notably, the accuracy of this model is enhanced through the introduction of novel weights and optimization of the Adj parameter. Experimental evaluations conducted on a ship state dataset demonstrate significant performance improvements. Specifically, the proposed recognition network achieves a recognition accuracy of 98.3% for regulated ship trajectories, marking an impressive 8.4% enhancement over traditional convolutional neural networks. This advancement holds promise for enhancing ship state recognition accuracy across diverse maritime applications including maritime supervision, navigation safety, and ship management.

Mechanical equipment is composed of several parts, the interaction between the parts exists throughout whole life cycle leads to the widespread phenomenon of fault coupling and the diagnosis of independent faults cannot meet the requirements of the health management of mechanical equipment under actual working conditions. In this paper, the topological structure of graph neural network is used to describe the correlation of coupling faults and multiple fault types are regarded as network nodes respectively. The fault features are fused and extracted by graph convolution to achieve the classification of coupling faults. In this paper, dynamic vertexes are defined in data topology and the parameters of DIGNN classification model are optimized by changing the fault type of dynamic vertexes during training stage. The data is loaded into dynamic vertexes for classification and analysis during testing stage. The one-dimensional vibration data is converted into two-dimensional time-frequency domain data by wavelet transform making the input features of the model interpretable to reduce the uncertainty of model training. The data topology is then fed into DIGNN for fault classification, and GCN's node aggregation gives interpretability to each layer of network data processing. The method proposed in this paper can realize accurate diagnosis of independent faults on the data set, and can effectively judge the coupling mode of coupling faults, which is suitable for coupling fault analysis of mechanical equipment.

Recommender systems as an effective information filtering system can be used to obtain information through the user's explicit or implicit behavior. On the one hand finding items that may be of interest to the user. On the other hand, the recommendation facilitates the interaction between the user and the item to increase the revenue. Recommender systems have been widely used in various fields, such as e-commerce, travel recommendation, online books and movies, social networks, etc, which can satisfy the intrinsic implicit needs of users through personalized services. In recent years, the development of deep learning has further improved the performance of recommendation systems. Although these methods improve the performance of the recommendation system, when the number of users and products increases, the recommendation system may face sparsity and cold start problems, and thus cannot achieve personalized recommendations. Knowledge graphs, which are structured data, have become the choice of many algorithms due to the high quality and wide scale of the data, and therefore many recommendation algorithms combined with knowledge graphs have emerged as a popular new direction in recommendation systems. These algorithms are able to preserve the rich connections between different entities. Moreover, when constructing the features of an entity, the entities that are far away from the central entity can also be utilized. Entities are no longer only directly connected to each other. To address the shortcomings of existing recommendation algorithms, this paper designs the recommendation algorithm GPRE using graph neural networks. GPRE focuses on expressing the user's features. The graph neural network provides GPRE with a strong generalization capability for modeling, which can provide long-range semantics between users and entities, as well as selective entity selection in the auxiliary graph neural network. Explicit semantic links are established between remote and central nodes to reduce the introduction of noise. In this paper, experiments are conducted on real-world datasets and the results are compared with baselines. The experimental results show that GPRE performs well on the experimental dataset.

There is a considerable amount of research in online social networks, most of which focuses on the structural analysis of social graphs. The interpersonal relationships of social networks, especially friend circle, can solve the cold start and sparsity problems, and through the relationship between social networks can effectively recommend users' favorite items (items), such as music , videos, brands/products, preferred tags, location, services, etc. User relationships in social networks are diverse and there are many different perspectives on different social networks. Associations among users can form multi-layered composite networks, and multi-layered social networks present new challenges and opportunities. Different relationships can influence users' preferences to different degrees, which in turn affects their behavior. Therefore, fusing multiple social networks is an effective way to improve recommendation. Although some studies have started to address multiple social network recommendations, simple linear superposition cannot reflect the coupling and nonlinear association between multiple social networks. In this paper, we propose a graph neural network recommendation model under social relationships based on this background. We first propose to compute the 2nd order collaborative signals and their intensities directly from the neighboring matrix for updating the node embedding of the graph convolution layer. Secondly by embedding historical evaluations, various social networks constituting different dimensions, the attention integration of user preferences by different social networks is achieved, and its effectiveness and scalability are demonstrated in theoretical derivation and experimental validation. The theoretical derivation and experimental validation demonstrate its effectiveness and scalability.

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.

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

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

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.

(1) Background: TNF inhibitors (TNFi) have revolutionized the treatment of rheumatoid arthritis (RA). However, 30-40 % of RA patients do not respond adequately to those biologics. In addition to neutralizing soluble TNF, TNFi have the ability to bind the transmembrane form of TNF, tmTNF. Importantly, tmTNF can act itself as a receptor that induces a “Reverse Signaling” (RS) in cells. We previously showed that certolizumab, a Fab’ TNFi, activates RS in human primary monocytes, at least in part through the transcription factor NRF2 that is known to regulate the expression of genes involved in anti-inflammatory response and oxidative stress. (2) Methods: Here, we have developed an assay for the prediction of clinical response of RA patients to TNF inhibitors. This assay is based on mRNA quantitation of CD36 activation and of 6 genes induced by NRF2 following tmTNF RS in fresh monocytes. (3) Results: We could predict the response to anti-TNF monoclonal antibodies (mAbs) with 93.3 % accuracy. However, our method was not suitable for the prediction of the response to TNF soluble receptor etanercept. (4) Conclusions: We have developed a rather simple, short-term, test that can be standardized. Predicting the response to TNF mAbs will help physicians offer the best available treatment and provide patients with personalized medicine.

Selecting road networks in cartographic generalization has consistently posed formidable challenges, driving research towards the application of intelligent models. Despite previous efforts, the accuracy and connectivity preservation in these studies, particularly when dealing with road types of similar sample sizes, still warrant improvement. To address these shortcomings, we introduce a Heterogeneous Graph Attention Network (HAN) for road selection, where feature masking method is initially utilized to assess the significance of road features. Concentrating on the most relevant features, two meta-paths are introduced within the HAN framework: one for aggregating features of the same road type within the first-order neighborhood, emphasizing local connectivity, and another extending this aggregation to the second-order neighborhood, capturing a broader spatial context. For a comprehensive evaluation, we introduce a set of metrics considering both quantitative and qualitative aspects of the road network. Compared to traditional neural networks, our HAN model demonstrates superior accuracy and F1-score, particularly for road types with comparable samples. Additionally, it enhances the overall connectivity of the selected network. In summary, our HAN-based method provides an advanced solution for road network selection, surpassing previous approaches in terms of accuracy and connectivity preservation.

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.

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

Although Eulerian approaches are standard in computational acoustics, they are less effective for certain classes of problems like bubble acoustics and combustion noise. A different approach for solving acoustic problems is to compute with individual particles following particle motion. In this paper, a Lagrangian approach to model sound propagation in moving fluid is presented and implemented numerically, using three meshfree methods to solve the Lagrangian acoustic perturbation equations (LAPE) in the time domain. The LAPE split the fluid dynamic equations into a set of hydrodynamic equations for the motion of fluid particles and perturbation equations for the acoustic quantities corresponding to each fluid particle. Then, three meshfree methods, the smoothed particle hydrodynamics (SPH) method, the corrective smoothed particle (CSP) method, and the generalized finite difference (GFD) method, are introduced to solve the LAPE and the linearized LAPE (LLAPE). The SPH and CSP methods are widely used meshfree methods, while the GFD method based on the Taylor series expansion can be easily extended to higher orders. Applications to modeling sound propagation in steady or unsteady fluids in motion are outlined, treating a number of different cases in one and two space dimensions. A comparison of the LAPE and the LLAPE using the three meshfree methods is also presented. The Lagrangian approach shows good agreement with exact solutions. The comparison indicates that the CSP and GFD method exhibit convergence in cases with different background flow. The GFD method is more accurate, while the CSP method can handle higher Courant numbers.

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

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

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

Proteins play a pivotal role in supporting athletes by promoting muscle hypertrophy and minimizing protein catabolism during exercise. They stimulate muscle protein synthesis, aiding in the repair of exercise-induced muscle damage and serving as an energy source, particularly for post-exercise glycogen replenishment. In individuals with phenylketonuria (PKU), for whom protein intake is limited to essential phenylalanine (Phe), supplementation with Phe-free amino acids or glycomacropeptides is necessary. Tailored for macronutrient and micronutrient content, these protein substitutes fulfill most protein requirements, but lack Phe, unlike dietary sources of protein. Protein requirements for athletes with PKU exceed general recommendations due to limited availability in supplements and potential catabolism mitigation. Various factors influence tolerated dietary Phe in PKU, including protein substitute quantity, distribution, pharmacological treatment, age, growth rate, pregnancy, catabolic states, and physical activity. While general protein requirements for PKU surpass those of the general population, adherence to supplement regimens is crucial for athletes and patients with PKU. Strategically timed protein substitutes enhance muscle protein synthesis, body composition, and sports performance within safety limits. Individualized intake is essential for optimal outcomes, as proteins have a multifaceted role in optimizing athletic performance and addressing challenges in PKU.

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.

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

With the improvement of software copyright protection awareness, code obfuscation technology plays a crucial role in protecting key code segments. As the obfuscation technology becomes more and more complex and diverse, it has spawned a large number of malware variants, which make it easy to evade the detection of anti-virus software. Malicious code detection mainly depends on binary code similarity analysis. However, the existing software analysis technologies are difficult to deal with the growing complex obfuscation technologies. To solve this problem, this paper proposes a new obfuscation-resilient program analysis method, which is based on the data flow transformation relationship of the intermediate representation and the graph network model. In our approach, we first construct the data transformation graph based on LLVM IR. Then, we design a novel intermediate language representation model based on graph networks, named DFSGraph, to learn the data flow semantics from DTG. DFSGraph can detect the similarity of obfuscated code by extracting the semantic information of program data flow without deobfuscation. Extensive experiments prove that our approach is more accurate than existing deobfuscation tools when searching for similar functions from obfuscated code.

Satellite communication is expected to play a vital role in realizing Internet of Remote Things (IoRT) applications. This article considers an intelligent reflecting surface (IRS)-assisted downlink low Earth orbit (LEO) satellite communication network, where IRS provides additional reflective links to enhance the intended signal power. We aim to maximize the sum-rate of all the terrestrial users by jointly optimizing the satellite’s precoding matrix and IRS’s phase shifts. However, it is difficult to directly acquire the instantaneous channel state information (CSI) and optimal phase shifts of IRS due to the high mobility of LEO and the passive nature of reflective elements. Moreover, most conventional solution algorithms suffer from high computational complexity and are not applicable to these dynamic scenarios. A robust beamforming design based on graph attention networks (RBF-GAT) is proposed to establish a direct mapping from the received pilots and dynamic network topology to the satellite and IRS’s beamforming, which is trained offline using the unsupervised learning approach. The simulation results corroborate that the proposed RBF-GAT can achieve approximate performance compared to the upper bound with low complexity.

With the rapid development of technology and the advancement of Internet technology, various social networking platforms are gradually coming into people's view and occupying a higher and higher position. In the recommendation scenario, the user-item interaction naturally forms a bipartite heterogeneous graph structure and with the development of graph embedding and graph neural network technologies based on deep learning to process graph domain information, the combination of graph information and recommendation systems shows strong research potential and application prospects. The methodological improvement of the recommendation algorithm based on collaborative filtering takes advantage of the nature that user-items can form a bipartite graph in the recommendation scenario. The existing methods still have some shortcomings. The methods that only use weights or convolutional recurrent neural networks to implicitly model different historical behaviors lack explicit modeling of video switching relationships in serialized behaviors. The user's interest is changing all the time, so it is not possible to recommend based on the user's history, and it is necessary to consider both the long-term and short-term interest of the user according to the video content in order to achieve accurate recommendation of short videos. In this paper, we design a recommendation model based on graph neural network, which models users' long-term and short-term interests by two vector propagation methods, respectively.

Graph coloring is a manifestation of graph partitioning, wherein, a graph is partitioned based on the adjacency of its elements. Partitioning serves potentially as a compartmentalization for any structural problem. Vertex coloring is the heart of the problem which is to find the chromatic number of a graph. The fact that there is no general efficient solution to this problem that may work unequivocally for all graphs opens up the realistic scope for combinatorial optimization algorithms to be invoked. The algorithmic complexity of graph coloring is non-deterministic in polynomial time (NP) and hard. To the best of our knowledge, there is no algorithm as yet that procures an exact solution of the chromatic number comprehensively for any and all graphs within the polynomial (P) time domain. However, several heuristics as well as some approximation algorithms have been attempted to obtain an approximate solution for the same. Here, we present a novel heuristic, namely, the 'trailing path', which returns an approximate solution of the chromatic number within polynomial time, and, with a better accuracy than most existing algorithms. The ‘trailing path’ algorithm is effectively a subtle combination of the search patterns of two existing heuristics (DSATUR and Largest First), and, operates along a trailing path of consecutively connected nodes (and thereby effectively maps to the problem of finding spanning tree(s) of the graph) during the entire course of coloring, where essentially lies both the novelty and the apt of the current approach. The study also suggests that the judicious implementation of randomness is one of the keys towards rendering an improved accuracy in such combinatorial optimization algorithms. Apart from the algorithmic attributes, essential properties of graph partitioning in random and different structured networks have also been surveyed, followed by a comparative study. The study reveals the remarkable stability and absorptive property of chromatic number across a wide array of graphs. Finally, a case study is presented to demonstrate the potential use of graph coloring in protein design – yet another hard problem in structural and evolutionary biology.

This study delves into the intricate interplay of economic growth components, specifically focusing on Consumption and investment in Saudi Arabia from 2000 to 2022. Employing vector error correction models and cointegration techniques, we analyze the short- and long-term dynamics within the relationship of Consumption, investment, and economic growth. Granger causality analysis is also used to discern these pivotal variables' causal connections. Our empirical analysis reveals a persistent long-term cointegration relationship among the variables, underscoring the enduring nature of their interdependency. Furthermore, our findings highlight Consumption and investment's statistically significant positive impact on economic growth. Notably, the short-term analysis unveils a stable model characterized by an annual adjustment to equilibrium of 100%.Moreover, the Granger causality study demonstrates unidirectional causal linkages between Consumption, investment, and economic growth. These findings hold substantial implications for policy formulation in Saudi Arabia. Policymakers must grasp the ramifications of burgeoning prosperity and evolving private consumption patterns on future environmental outcomes. Achieving sustainable long-term results necessitates equal emphasis on bolstering private Consumption and fostering other facets of economic growth.

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

With the development of deep learning, several Graph Neural Networks (GNN)-based approaches have been utilized for text classification. However, GNNs encounter challenges in capturing contextual text information within a document sequence. To address this, a novel text classification model RB-GAT is proposed by combining RoBERTa-BiGRU embedding and a multi-head Graph ATtention Network (GAT). First, the pre-trained RoBERTa model is exploited to learn word and text embeddings in different contexts. Second, the Bidirectional Gated Recurrent Unit (BiGRU) is employed to capture long-term dependencies and bidirectional sentence information from the text context. Next, the multi-head graph attention network is applied to analyze this information, which serves as a node feature for the document. Finally, the classification results are generated through a Softmax layer. Experimental results on three benchmark datasets demonstrate that our method can achieve an accuracy of 71.48%, 98.45%, and 80.32% on Ohsumed, R8, and MR, which is superior to the existing nine text classification approaches.

This research addresses the formidable challenge of achieving precise trajectory tracking for autonomous vehicle formations in uncertain environments. It introduces an adaptive control system tailored for autonomous vehicles, with a primary focus on ensuring prescribed performance in trajectory tracking within a leader-follower formation paradigm. The system incorporates a guidance law that allows the leader vehicle to dynamically adjust desired yaw angles and speeds for follower vehicles based on the established reference trajectory, enhancing tracking accuracy and responsiveness to environmental changes. To address practical external disturbances, the study utilizes Radial Basis Function Neural Networks (RBFNN) in conjunction with second-order filters for error approximation. This approach is further strengthened by a carefully formulated adaptive law. The innovative integration of a barrier Lyapunov function with the backstepping method significantly enhances the system’s adaptability and robustness, ensuring trajectory tracking performance meets predetermined standards. Simulation results illustrate the control system’s adept handling of various external disturbances, consistently maintaining trajectory tracking errors within predefined limits. This underscores the system’s potential to markedly enhance the operational reliability and efficiency of autonomous vehicle formations in unpredictable environmental conditions.

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

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

This paper presents a computational approach designed to construct and query a literature-based knowledge graph for predicting novel drug therapeutics. The main objective is to offer a platform that discovers drug combinations from FDA-approved drugs and accelerates their investigations by domain scientists. Specifically, the paper introduced the following algorithms: (1) an algorithm for constructing the knowledge graph from drug, gene, and disease mentions in the biomedical literature; (2) an algorithm for vetting the knowledge graph from drug combinations that may pose a risk of drug interaction; (3) and two querying algorithms for searching the knowledge graph by a single drug or a combination of drugs. The resulting knowledge graph had 844 drugs, 306 gene/protein features, and 19 disease mentions. The original number of drug combinations generated was 2,001. We queried the knowledge graph to eliminate noise generated from chemicals that are not drugs. This step resulted in 614 drug combinations. When vetting the knowledge graph to eliminate the potentially risky drug combinations, it resulted in predicting 200 combinations. Our domain expert manually eliminated extra 54 combinations which left only 146 combination candidates. Our three-layered knowledge graph, empowered by our algorithms, offered a tool that predicted drug combination therapeutics for scientists who can further investigate from the viewpoint of drug targets and side effects.

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

The application of smartphone-based color evaluation of passive sampling devices for gases has only been sparsely reported. The present review aims to compile available publications with respect to the configuration of the passive samplers, conditions of smartphone photographing, analytical procedure for color detection and quantification (including calibration processes), and their application to different target gases. The performance of the methods - whenever available - is presented regarding the analytical specifications selectivity, sensitivity, and limit of detection in comparison with other color evaluation methods of passive samplers. Practical aspects like requirements of instrumentation and ease of use will be outlined in view of the potential employment in education and citizen science projects. In one section of the review the inconsistent terminology of passive and diffusive sampling is discussed in order to clarify the distinction of information obtained from the uptake of the passive samplers between gas-phase concentration and the accumulated deposition flux of gaseous analytes. Colorimetric gas sensors are included in the review when applied in passive sampling configurations and evaluation is performed with smartphone-based color evaluation. Differences in the analytical procedures employed after the passive sampling step and prior to the detection of the colored compounds are also presented.

Keywords: olfactory rehabilitation; chronic pain; fMRI;

Particulate matter (PM) is one of the problems faced in environmental science. It has health effects on man and animals in both developed and developing countries. Research and efforts have been on it several years back. Policy statements and efforts have been published. This review paper is an added information on air pollution. In it, efforts were made in discussing these: classification, effects, methodology, case studies and source apportionment. It is hoped that this paper would contribute to existing knowledge on PM.

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

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

Zero-Knowledge Proofs ZKP provide a reliable option to verify that a claim is true without giving detailed information other than the answer. A classical example is provided by the ZKP based in the Graph Isomorphism problem (GI), where a prover must convince the verifier that he knows an isomorphism between two isomorphic graphs without publishing the bijection. We design a novel ZKP exploiting the NP-hard problem of finding the algebraic ideal of a multivariate polynomial set, and consequently resistant to quantum computer attacks. Since this polynomial set is obtained considering instances of GI, we guarantee that the protocol is at least as secure as the GI based protocol.

Many corporations have now revised their value statements to showcase their commitment to sustainable development and green business due to the pressing issues of climate and environmental damage. Despite the importance of value statements that can direct companies to achieve sustainable goals, what kind of values can be perceived as organizational orientations to sustainability remains unknown. This study explores how the general public views the inclusion of sustainable components in value statements from the listed companies in Hong Kong by using Q-sort methodology (n = 30). Analyzing the final sample of 40 value statements extracted from 27 listed companies, we identified three factors related to sustainability, namely, Empowering business process management, Empowering customer-centric excellence, and Empowering sustainable progress. This study provides an additional component to the traditional triple bottom line by suggesting that internal operation of a company is an emerging idea to understand corporate sustainability.

Historically, urban development has always been centered on coastal areas – with access to waterbodies – seas, rivers and canals being a significant advantage for movement and trade. With most of the world’s megapolises located on coasts, land reclamation offers a solution for the expansion of city centers which are otherwise restricted by the coastline. The current understanding of urban regeneration and development on reclaimed lands is defined in this study, answering the basic questions of what, why and how. This study aims to assess the urban regeneration on reclaimed coastal land based on the principles of sustainable development defined by existing studies. The literature review establishes a theoretical framework and defines performance-based benchmarks identifying the spatial indicators of urban development. Composite indicators namely open space coverage, land use mix, percentage of coast for people, accessibility to public transportation and amenities, availability of pedestrian paths and cycling tracks and adequate road networks are considered for this framework. The conclusions are drawn based on the results of the analysis of spatial layout using GIS as a tool to map and empirically measure each indicator. The framework is validated using a major land reclamation project, West Bay, in the coastal urban area of ​​the city of Doha. The results determine that West Bay has achieved a good level of sustainability, although there are areas that could be enhanced to further improve the overall sustainability of urban development. These findings can serve as a guide for policymakers and various stakeholders for sustainable urban planning on reclaimed coastal lands.

For a graph G, let P(G, λ) be its chromatic polynomial. Two graphs G and H are said to be chromatically equivalent if P(G,λ) = P(H,λ). A graph is said to be chromatically unique if no other graph shares its chromatic polynomial. In this paper, chromatic polynomial of the necklace graph N_n, for n ≥ 2 has been determined. It is further shown that N₃ is chromatically unique.

The relation between CO2 emissions and atmospheric CO2 concentration has traditionally been treated with more or less complex models with several boxes. Our approach is motivated by the question of how much CO2 must necessarily be absorbed by sinks. Observations lead to the model assumption, that carbon sinks like oceans or biosphere are linearly dependent on CO2 concentration on a decadal scale. In particular this implies the falsifiable hypothesis that oceanic and biological CO2 buffers have not significantly changed in the past 50 years and are not saturated in the forseeable future. The simple model with 2 parameters explains very well the CO2 emission and historical CO2 concentration data. The model gives estimates of the natural emissions, the pre-industrial CO2 equilibrium concentration levels, the half-life time of an emission pulse, and the future CO2 concentration level from a given emission scenario. This is validated by an ex-post forecast of the last 20 years. The important result is that with the stated polices scenario of the IEA future CO2 concentrations will not rise above 475 ppm. The model is compared with the Carbon modul of the Bern model, mapping their complex IRFs to a single time variant parameter.

We present a Deep Learning generative model specialized to work with graphs with a regular geometry. It is build on a Variational Autoencoder framework and employs Graph convolutional layers in both encoding and decoding phases. We also introduce a pooling technique (ReNN-Pool), used in the encoder, that allows to downsample graph nodes in a spatially uniform and highly interpretable way. In the decoder, a symmetrical un-pooling technique is used to retrieve the original dimensionality of graphs. Performance of the model are tested on the standard Sprite benchmark dataset, a set of 2D images of video game characters, adequately transforming images data into graphs, and on the more realistic use-case of a dataset of cylindrical-shaped graph data that describe the distributions of the energy deposited by a particle beam in a medium.

Concrete is more stable than filler as a false roof in a downward approach type infill quarry, but the mechanical model of a concrete false roof is not clear. As a result, there has been limited application. Therefore, it is necessary to establish the mechanical model of a concrete artificial false roof to enhance the stability of the downward approach infill quarry. This paper combines theoretical analysis, model derivation, finite element analysis and field application methods. Firstly, the basic assumptions of thin plate theory and elasticity mechanics are used as the premise to establish the differential equations of the deflection curve of the concrete thin plate false roof. Then, the three types of bending moment generation of the concrete thin plate false roof are explored. Secondly, the relationship between the location of dangerous surface and dangerous point in hard-supported weak-slab structure and soft-supported weak-slab structure is analyzed, and the type of uniform load and calculation model of concrete thin-slab false roof are improved. Finally, according to the established mechanical model of thin slab false roof, finite element analysis and field application were carried out. The results show that there are three types of deflection curve differential equations in the concrete thin slab false roof perpendicular to the strike, and three extreme points exist in the middle section of the thin slab and on both sides of the surrounding rock. The hazardous surface of the hard-supported weak-slab structure is present at the intersection of the encircling rock and the thin-slab fake ceiling, with the perilous point situated on the top of this surface. The hazardous surface of the soft-supported weak-slab structure can be found in the centre section of the thin-slab fake ceiling, with the perilous point being located at the bottom of this surface. Moreover, the damage mode for both structures is that of maximum tensile stress damage. Upon conducting a finite element analysis, the results indicate that the concrete's maximum tensile stress is significantly high.

Chinese texts often feature a substantial volume of normative content, and their analysis has increasingly become a focal point in recent semantic analysis endeavors. Enhancing the effectiveness of text classification and clustering is pivotal in unveiling the intricate semantics within extensive textual data. Empirical research within the realm of computational social science has underscored the need for improved explanatory power when it comes to general text clustering methods applied to normative texts. This study introduces an innovative hierarchical clustering method that incorporates part-of-speech (POS) features and pioneers a novel semantic network model. It achieves this by amalgamating a POS-based feature weight calculation method with hierarchical clustering techniques. To assess its efficacy, the method is rigorously evaluated across three diverse text datasets, encompassing normative reports, news articles, and social media content. The experimental results unequivocally demonstrate the superior performance of the POS-HC method, surpassing the traditional TF and TF-IDF feature extraction methods in terms of clustering accuracy, and surpassing some existing clustering methods. Furthermore, its classification effectiveness exhibits notable advantages, particularly in the semantic classification of normative texts.

In GNSS/IMU integrated navigation systems, factors such as satellite occlusion and non-line-of-sight conditions can lead to degradation of satellite positioning results, Subsequently affecting the overall accuracy of the integrated navigation system. To address this issue and ef-fectively utilize historical pseudorange information from satellites, this paper proposes a graph optimization-based GNSS/IMU model with virtual constraints. These virtual constraints are con-structed using satellite ‘s position from previous time step, the rate of change of pseudoranges, and ephemeris data. This virtual constraint can serve as an alternative solution for individual satellites in case of signal anomalies, ensuring the integrity and continuity of the graph optimi-zation model. Additionally, this paper conducts an analysis of the graph optimization model constructed using these virtual constraints, comparing it with traditional integrated navigation graph optimization model, and analyzes and reconstructs the marginalization process based on these virtual constraints. The experimental results, compared with tightly coupled Kalman fil-tering and the original graph optimization method on a set of real-world data, demonstrate that the introduction of virtual pseudoranges maintains high positioning accuracy. The RMSE error between it and the original graph optimization remains within 5%, affirming the high feasibility of this approach.

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.

Vision-based tactile sensors (VBTS) have become the de facto method of giving robots the ability to obtain tactile feedback from their environment. Unlike other solutions to tactile sensing, VBTS offers high spatial resolution feedback without compromising on instrumentation costs or incurring additional maintenance expenses. However, conventional cameras used in VBTS have a fixed update rate and output redundant data, leading to computational overhead downstream. In this work, we present a neuromorphic vision-based tactile sensor (N-VBTS) that employs observations from an event-based camera for contact angle prediction. Particularly, we design and develop a novel graph neural network, dubbed TactiGraph, that asynchronously operates on graphs constructed from raw N-VBTS streams exploiting their spatiotemporal correlations to perform predictions. Although conventional VBTS uses an internal illumination source, TactiGraph is reported to perform efficiently in both scenarios, with and without an internal illumination source. Rigorous experimental results revealed that TactiGraph achieved a mean absolute error of 0.62∘ in predicting the contact angle and was faster and more efficient than both conventional VBTS and other N-VBTS, with lower instrumentation costs. Specifically, N-VBTS requires only 5.5% of the compute-time needed by VBTS when both are tested on the same scenario.

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.

High resolution information on nucleotide arrangement in the genome of any or-ganism is critical to understand its genetic makeup, function, and evolutionary his-tory. For years, DNA sequencing has provided crucial breakthroughs in the field of genomics and molecular biology. With the advent of technology, Next Generation Sequencing has now transformed the whole genome sequencing prospects, thus unveiling the novel and interesting features of an organism genome that can behold. Next generation sequencing platforms offer realistic approach to identify and anal-yses whole genome with high throughput, accuracy, scalability in a very short time span. Information obtained can be further used in improving our existing healthcare systems, designing novel and personalized therapeutic modules, making the envi-ronment sustainable and proactively preparing ourselves for future pandemics and outbreaks. This article discusses the various NGS technologies and approaches, their advantages, drawbacks, and futuristic usage in different fields. Though still in nascent stages and marred with flaws, with ongoing advancement, NGS will indeed have promising impacts in the future.

In his best-selling book An Introduction to Probability Theory and its Applications, W. Feller established a way of ending the St. Petersburg Paradox by the introduction of an entrance fee, and provided it for the case in which the game is played with a fair coin. A natural generalization of his method is to establish the entrance fee for the case in which the probability of head is θ (0 < θ < 1/2). The deduction of those fees is the main result of Section 2. We then propose a Bayesian approach to the problem. When the probability of head is θ (1/2 < θ < 1) the expected gain of the St. Petersburg Game is finite, therefore there is no paradox. However, if one takes θ as a random variable assuming values in (1/2,1) the paradox may hold, what is counter-intuitive. On Section 3 we determine a necessary and sufficient condition for the absence of paradox on the Bayesian approach and on Section 4 we establish the entrance fee for the case in which θ is uniformly distributed in (1/2,1), for in this case there is paradox.

The paper focuses on the application of a multilevel, integrative and territorial approach to the protection of cultural heritage through planning instruments in Serbia. It points out the problems of the sectoral approach and discusses international recommendations that can be integrated into the planning methodology. The case study is the area of Djerdap National Park, which has an already established international and national importance. The research suggests that the cultural heritage in the area, with the exception of the Roman limes, is still recognized at the level of individual localities. The study emphasizes the importance of aligning all levels of governance to safeguard the whole spatial entity rather than focusing solely on its particular areas. The interna-tional and national importance of the planning area contributes to the strengthening of awareness of heritage and its institutional protection. However, the vitality of the area, which is key to its sustainable development, comes from the local level. Planning documents contribute to the inte-gration of local values and local communities into development programs and projects.

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.

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

The electroencephalogram (EEG) is a record of brain activity. Brain Computer Interface (BCI) technology formed by the EEG signal has become one of the hotspots at present. How to extract the feature signal of EEG is the most basic research of BCI technology. In this paper, A new method of recognizing fatigue, conscious, concentrated state of human brain is proposed by the combination of discrete wavelet transform and the neural network based on EEG signal. First of all, the law signal is preprocessed by the wavelet denoising method because the law EEG signal contains a large number of high frequency noise, which is decomposed into multi-layer high frequency signal and low frequency signal. thus, δ wave, θ wave, α wave, β wave are obtained by the wavelet transform. And then, frequency band energy of the different wave is regards as the feature signal of EEG. In the experiment, the feature signal is classified by radial basic function (RBF) and annealed chaotic competitive learning network (ACCLN). RBF and ACCLN networks are trained with 500 sets of sample data and are tested by 100 sets of samples in different mental states. The experimental results show that the average accuracy of RBF network under three conditions are 88.75%, 88.25%, 88.5%, respectively, and the correct rate of ACCLN network is 97%, 98%, 98%, respectively.

More than 20 years after the discovery of the first anelloviruses (AVs), they still remain a mysterious group of viruses. To date, there is no clear understanding of their impact on the host organism, although information is emerging about their participation in various pathologies. However, it is well known that AVs are an important component of the human virome. In the current study we assessed the abundance of AVs in viromes from four nasal and pharyngeal samples from children with respiratory symptoms using a metagenomic approach. It is worth noting that three patients had known respiratory viruses and one did not have any. Regarding AVs, they were detected in all samples, namely Torque teno mini virus (TTMV). The greatest abundance and diversity of AVs (Torque teno virus (TTV), TTMV and Torque teno midi virus (TTMDV)) were shown in a diseased patient with an absence of respiratory viruses, which may indicate the potential involvement of AVs in the maintenance of respiratory symptoms. An activated immune system to combat the main pathogens, against the background of which the number of AVs decreases, is discussed as a possible reason for the reduced diversity of anellome in other patients. We also compared the results of the metagenomic approach and qPCR for major respiratory viruses, which were in agreement. In addition, metagenomic sequencing made it possible to obtain additional data on viral genomes in order to establish their taxonomic identification and characterize individual viral profiles in patients from the Siberian part of Russia.

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.

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

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.

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

The hybrid bond graph has been studied in depth for scalar bond graphs, but how does this translate to the multi-bond graph? Here, the controlled junction – used to model structural switching such as contact – is extended to the multi-bond case. This is a simple process, assuming that all bonds switch simultaneously (which makes physical sense). A controlled 0-junction is applied to multi-bond graph of a car, which can lose contact with the ground in cornering. Dynamic causality features, but this can be accommodated using an equational submodel in 20-Sim (in a manner similar to that used with scalar bond graphs). The junction is proposed for subsequent work to develop a validated multi-body dynamics car model in cornering.

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

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

Wind turbines (WTs) are clean a renewable energy source that has been growing in popularity in recent years. Gearboxes are complex, expensive, and critical components of WT, which are subject to high maintenance costs and several stresses including high loads and harsh environments that can lead to failure with significant downtime and financial losses. This paper focuses on the development of a digital twin-based approach for the modelling and simulation of WT gearboxes with the aim to improve their design, diagnosis, operation, and maintenance by providing insights into their behavior under different operating conditions. Pow-erful commercial computer-aided design tools (CAD) and computer-aided engineering (CAE) software are embedded into a computationally efficient multi-objective optimization framework (modeFrontier) with the aim of maximizing the power density, compactness, performance, and reliability of the WT gearbox. This entails minimizing its weight, volume, and maximum stresses and strains achieved without compromising efficiency. The 3D CAD model of the WT gearbox is carried out using SolidWorks, the Finite Element Analysis (FEA) to obtain the stresses and strains fields are modelled using Ansys Workbench, while the multibody kinematic and dynamic system is analyzed using MSC Adams. The method has been successfully applied to different case studies to find the optimal design and analyze the performance of the WT gearboxes. Simulation results can be used to identify potential failure modes and optimize gearbox design to improve performance, extend service life and relia-bility, thereby ensuring proper operation over its lifetime and reducing maintenance costs.

This article develops a multi-perspective view on motivations and methods for tobamovirus purification through the ages, and presents a novel efficient, easy-to-use approach that can be well-adapted to different species of native and functionalized virions. We survey the various driving forces prompting researchers to enrich tobamoviruses: from the search for the causative agents of mosaic diseases in plants to their increasing recognition as versatile nanocarriers in biomedical and engineering applications. Best practice and also rarely applied options for the serial processing steps required for successful isolation of tobamoviruses are then reviewed. Adaptations for distinct particle species, pitfalls and 'forgotten' or underrepresented technologies are considered as well. The article is topped off with our own development of a method for virion preparation, rooted in historical protocols. It combines selective re-solubilization of polyethylene glycol (PEG) virion raw precipitates with density step gradient centrifugation in biocompatible iodixanol formulations, yielding ready-to-use particle suspensions. This newly established protocol and some considerations for perhaps worthwile further developments could serve as putative stepping stones towards preparation procedures appropriate for routine practical uses of the multivalent soft-matter nanorods.