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.

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.

Currently, the most important challenge in any assessment of state-of-the-art sensor technology and its reliability is to achieve road traffic safety targets. The research reported in this paper is focused on the design of a procedure for evaluating the reliability of Internet-of-Things (IoT) sensors and the use of a Cyber-Physical System (CPS) for the implementation of that evaluation procedure to gauge reliability. An important requirement for the generation of real critical situations under safety conditions is the capability of managing a co-simulation environment, in which both real and virtual data sensory information can be processed. An IoT case study that consists of a LiDAR-based collaborative map is then proposed, in which both real and virtual computing nodes with their corresponding sensors exchange information. Specifically, the sensor chosen for this study is a Ibeo Lux 4-layer LiDAR sensor with IoT added capabilities. Implementation is through an artificial-intelligence-based modeling library for sensor data-prediction error, at a local level, and a self-learning-based decision-making model supported on a Q-learning method, at a global level. Its aim is to determine the best model behavior and to trigger the updating procedure, if required. Finally, an experimental evaluation of this framework is also performed using simulated and real data

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.

The Internet-of-Things (IoT) triggers new types of cyber risks. Therefore, the integration of new IoT devices and services requires a self-assessment of IoT cyber security posture. By security posture this article refers to the cybersecurity strength of an organisation to predict, prevent and respond to cyberthreats. At present, there is a gap in the state-of-the-art, because there are no self-assessment methods for quantifying IoT cyber risk posture. To address this gap, an empirical analysis is performed of 12 cyber risk assessment approaches. The results and the main findings from the analysis is presented as the current and a target risk state for IoT systems, followed by conclusions and recommendations on a transformation roadmap, describing how IoT systems can achieve the target state with a new goal-oriented dependency model. By target state, we refer to the cyber security target that matches the generic security requirements of an organisation. The research paper studies and adapts four alternatives for IoT risk assessment and identifies the goal-oriented dependency modelling as a dominant approach among the risk assessment models studied. The new goal-oriented dependency model in this article enables the assessment of uncontrollable risk states in complex IoT systems and can be used for a quantitative self-assessment of IoT cyber risk posture.

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.

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.

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.

Animal models of diseases in particular, the mice, are considered to be the cornerstone for translational research in immunology. The aim of the present study is to model the geometry and analyze the network structure of murine lymphatic system (LS). The algorithm for building the graph model of the LS makes use of anatomical data. To identify the edge directions of the graph model, a mass balance approach to lymph dynamics based on Hagen-Poiseuille equation is applied. It is the first study in which a geometric model of the murine LS has been developed and characterized in terms of its structural organization and the lymph transfer function. Our study meets the demand for quantitative mechanistic approaches in the growing field of immunoengineering to utilize or exploit the lymphatic system for immunotherapy.

The PAX8/PPARγ rearrangement, producing the PAX8–PPARγ fusion protein (PPFP), is thought to play an essential role in the oncogenesis of thyroid follicular tumors. To identify PPFP-targeted drug candidates and establish an early standard of care for thyroid tumors, we performed ensemble docking-based compound screening. Specifically, we investigated which pocket structure should be adopted to search for a promising ligand compound for the PPFP; the position of the ligand binding pocket on the PPARγ side of the PPFP is common to that of PPARγ; however, the shape is slightly different between them due to environmental factors. We developed a method for selecting a PPFP structure with a relevant pocket and high prediction accuracy for ligand binding. This method was validated using PPARγ, whose structure and activity values are known for many compounds. Then, we performed docking calculations to PPFP for 97 drug or drug-like compounds with a thiazolidine backbone, which is one of the characteristics of ligands that bind well to PPARγ, registered in the DrugBank database. Furthermore, the binding affinities of promising ligand candidates were estimated more reliably using the molecular mechanics-Poisson–Boltzmann surface area method. Thus, we propose promising drug candidates for the PPFP with a thiazolidine backbone.

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.

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.

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.

This paper proposes two max-pooling engines, named the RTB-MAXP engine and the CMB-MAXP engine, with a scalable window size parameter for FPGA-based convolutional neural network (CNN) implementation. The max-pooling operation for the CNN can be decomposed into two stages, i.e., a horizontal axis max-pooling operation and a vertical axis max-pooling operation. These two one-dimensional max-pooling operations are performed by tracking the rank of the values within the window in the RTB-MAXP engine and cascading the maximum operations of the values in CMB-MAXP engine. Both the RBM-MAXP engine and the CMB-MAXP engine were implemented using VHSIC Hardware Description Language (VHDL) and verified by simulations. They have been employed for and tested in our CNN accelerator targeting at the CNN model YOLOv4-CSP-S-Leaky for object detection.

Structural health monitoring (SHM) is critical for ensuring the safety of infrastructures like bridges. This article presents a digital twin solution for SHM of railway bridges using low-cost wireless accelerometers and Machine Learning (ML). The system architecture combines edge on-premises computing and cloud analytics to enable efficient real-time monitoring and complete storage of relevant time-history datasets. After train crossings, accelerometers stream raw vibration data, which is processed in the frequency domain and analyzed via machine learning to detect anomalies indicating potential structural issues. The digital twin approach is demonstrated on an in-service railway bridge, where vibration data was collected over two years under normal operating conditions. By learning allowable ranges for vibration patterns, the digital twin model identifies abnormal spectral peaks, suggesting changes in structural integrity. The long-term pilot proves that this affordable SHM system can provide automated and real-time warning of bridge damage and also supports the use of in-house designed sensors of lower-cost and edge computing capabilities than those used in the demonstration. The successful on-premises-cloud hybrid implementation provides a cost effective and scalable model for expanding monitoring to thousands of railway bridges, democratizing SHM to improve safety by avoiding catastrophic failures.

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

The Imbalance Cost Pass-Through (ICPT) is a flexible component of the Incentive Regulation (IBR) that empowers power producers to adjust tariffs in response to variable fuel prices, thereby enhancing the economic resilience of electricity generation. However, the cost of electricity generation is significantly influenced by the volatility of commodity prices, including coal, gas and LNG. In Malaysia, the Energy Commission has conducted biannual reviews of fuel and other generation costs. Any cost savings or increases identified during these reviews will be passed on to customers in the form of rebates or surcharges. Due to that reason, this study proposes ICPT price forecasting for the electricity market in Peninsular Malaysia. The study aims to construct an ICPT-related baseline model for the peninsular generation data by employing three forecasting methods. The forecasting performance is analysed by a Mean Absolute Percentage Error (MAPE). In findings, the ARIMA method is one of the most accurate forecasting methods for fuel prices compared to the Moving Average (MA) and LSSVM methods. The observed price differences between the ARIMA and LSSVM models for ICPT are minimal. The ICPT price for July-December 2022 and January-June 2023 is MYR 0.21/ kWh for ARIMA and MYR 0.18/kWh for LSSVM, which are close to the actual TNB’s ICPT tariff. As for the forecasting, the ICPT price is expected to drop for the next announcement. The findings of this study may contribute to a positive impact on the sustainability of the energy sector in Malaysia.

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.

This review highlights the potential and limitations of mRNA vaccines with a particular focus on mucosal delivery as an alternative to parenteral administration. The strengths of mRNA vaccines are: a) Versatility: they can be adapted to target a wide range of pathogens; b) Faster development: designed and produced more quickly than traditional vaccines; c) High efficacy: effective in preventing severe disease, as demonstrated during the COVID-19 pandemic. Current challenges: a) Delivery: current methods (mainly intramuscular injection) may not be optimal for inducing mucosal immunity; b) Stability: mRNA is fragile and needs to be protected from degradation; c) Safety: potential side effects, including myocarditis, blood clotting, allergic reactions need further investigation. Mucosal delivery could be more effective in preventing the transmission of pathogens and is generally better accepted by the population. Pros: offers the potential to induce local immunity at the site of pathogen entry, potentially providing broader protection; Cons: developing effective delivery systems and adjuvants for mucosal delivery is difficult. Extracellular vesicles as a mucosal delivery system are promising and offer a potentially safe, scalable, and needle-free approach. Future directions: a) Optimizing mRNA constructs: strategies like codon optimization and self-amplifying RNA can improve stability and translation efficiency; b) Rigorous pre-clinical studies are essential before human trials.

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

A growing area in neurosciences is focused on the modeling and analysis the complex system of connections in neural systems, i.e. the connectome. Here we focus on the representation of connectomes by using graph theory formalisms. The human brain connectomes are usually derived from neuroimages; the analyzed brains are co-registered in the image domain and brought to a common anatomical space. An atlas is then applied in order to define anatomically meaningful regions that will serve as the nodes of the network - this process is referred to as parcellation. Recently, it has been proposed to perform atlas-free random brain parcellation into nodes and align brains in the network space instead of the anatomical image space to define network nodes of individual brain networks. In the network domain, the question of comparison of the structure of networks arises. Such question is tackled by modeling the comparison of brain network as a network alignment (NA) problem. In this paper, we first defined the NA problem formally, then we applied three existing state of the art of multiple alignment algorithms (MNA) on diffusion MRI-derived brain networks and we compared the performances. The results confirm that MNA algorithms may be applied in cases of atlas-free parcellation for a fully network-driven comparison of connectomes.

The interest in virtual fencing, as opposed to traditional physical barriers, has increased since it makes it easier to move the boundaries of animal enclosures for agricultural and rewilding purposes. Despite this, the implementation of virtual fence systems, such as the Nofence© system, requires large financial investments. The necessity of individual collars also makes it more difficult to implement this system on a larger scale. If a herd of cattle tend to maintain cohesive social groups around dominant individuals, it might be possible to use fewer collars thereby making the system more cost efficient. This study investigates the pattern in spatial distribution in a herd of 17 Angus cows on Fanø in Denmark with GPS locations, using a Nofence© system. The aim of this paper is to determine how individuals position themselves in a herd, spatially, and identify a pattern in ranks. The method used in this study examines the distances between an individual to the rest of the herd mates using nearest neighbour and distribution plots. Contrary to the expectations, this study did not show a distinct pattern in herd distribution. While some tendencies in spatial distribution patterns were observed, only a low concordance could be found (W=0.15,p=3.02e−16). Therefore, interactions among individuals should be considered in future studies, rather than only investigating the herd as one unit. A cumulative curves of the ranks estimated over the entire periods allowed however a rough estimation of the hierarchy and allowed the identification of the highest ranked cows. Therefore it might be possible to use fewer collars if the high ranked cows are discovered, but the estimation of the hierarchy will require a period of observation overall several days as the hierarchical positions are fluctuating too much from days to days. Therefore the cumulative rank curves seems to be a valid solution.

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.

Agriculture is an important sector of European Union in societal , economic and environmental dimensions. Sustainability of the sector require improvements in its key operations. Weeding is one of the crucial operation having impact on farms’ productivity, safety for farmers, food security and environmental state. To achieve EU policy goals of sustainable agriculture there are needed new technical and organizational solutions. One of the advanced techniques are laser based weeding technique. It is important to understand well the impacts of introduction of these tech-niques to the markets and agricultural practice in sustainability context. For that reason Social Life Cycle Assessment was performed. The method was based on participatory approach. The as-sessment was carried in three perspectives: general society, farmers, and business perspective re-lated to agriculture. Expert interviews based on questionnaires and workshops were realized to get the opinions on the impacts of a new laser technique on particular aspects of its implementation. The results show generally positive impact in all perspectives, especially in the perspective of farmers.

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

Graph neural networks (GNNs) build on the success of deep learning models by extending them for use in graph spaces. Transfer learning has proven extremely successful for traditional deep learning problems: resulting in faster training and improved performance. Despite the increasing interest in GNNs and their use cases, there is little research on their transferability. This research demonstrates that transfer learning is effective with GNNs, and describes how source tasks and the choice of GNN impact the ability to learn generalisable knowledge. We perform experiments using real-world and synthetic data within the contexts of node classification and graph classification. To this end, we also provide a general methodology for transfer learning experimentation and present a novel algorithm for generating synthetic graph classification tasks. We compare the performance of GCN, GraphSAGE and GIN across both the synthetic and real-world datasets. Our results demonstrate empirically that GNNs with inductive operations yield statistically significantly improved transfer. Further we show that similarity in community structure between source and target tasks support statistically significant improvements in transfer over and above the use of only the node attributes.

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.

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

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.

The study of the brain networks using analysis of electroencephalography (EEG) data based on statistical dependencies (functional connectivity) and mathematical graph theory concepts is common in neuroscience and cognitive sciences for examinations of patient and healthy individuals. The Consciousness Fields according to Taheri theory and applications in the optimization of system under study have been investigated in various studies. In this study, we examine the results of working with Faradarmani Consciousness Field (FCF) in the brain of Faradarmangars. Faradarmangars are one of the necessary components in mind mediation of the function of Faradarmani Consciousness Fields according to Taheri. For this purpose, the functional and effective connectivity and the corresponding brain graphs of EEG from the brain of Faradarmangars is compared with that of non Faradarmangar groups during FCF connection. According to the results of the present study, the brain of the Faradarmangars shows significant decreased activity in delta (BA8), beta2 (BA4/6/8/9/10/11/32/44/47) and beta3 (in 34 of 52 BA) frequency bands mainly in frontal lobe and after that in parietal and temporal lobes in the comparison with the non Faradarmangars. Moreover, the functional and effective connectivity analysis in the frontal network shows dominant multiple decreased connectivity mainly in the case of beta3 frequency band in all parts of the frontal network. On the other hand, the graph theory analysis of the Faradarmangar brain shows an increase in the activity of the O2-T5-F4-F3-FP2-F8 areas and significant decrease in the characteristic path length and increases in global efficiency, clustering coefficient and transitivity. In conclusion, the unique higher graph function efficiency and the reduction in the brain activity and connectivity during the Faradarmani Consciousness Field mind mediation, shown the passive and detector like function of the human brain in this task.

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.

Neural networks models are mostly represented by oriented graphs where only the components, constitutive elements of the graph, are transcribed into mathematical xpression. Indeed, accurate knowledge of the full expression of the model is required in certain situations such as selecting among several reference models, the one that best fits the available data or comparing the explanatory and predictive performance of an established model with respect to some reference models. In this paper, we establish a formalism of the mathematical expression for multilayer perceptron neural network in a general framework, MLP-p-n-q, with p, n and q natural integers and show its restriction to cases where one has a hidden layer and multivariate outputs (MLP-p-1-q), and then a single output (MLP-p-1-1). Then, we give some specific cases of the most commonly used models. An application case is presented in the context of solving a nonlinear regression problem.

Here we present a fast and highly scalable community structure preserving network module detection that recursively integrates graph sparsification and clustering. Our algorithm, called SparseClust, participated in the most recent DREAM community challenge on disease module identification, an open competition to comprehensively assess module identification methods across a wide range of biological networks.

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.

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.

In MBSE there is yet no converged terminology. The term ’system model’ is used in different contexts in literature. In this study we elaborated the definitions and usages of the term ’system model’, to find a common definition. 104 publications have been analyzed in depth for their usage and definition as well as their meta-data e.g., the publication year and publication background to find some common patterns. While the term is gaining more interest in recent years it is used in a broad range of contexts for both analytical and synthetic use cases. Based on this three categories of system models have been defined and integrated into a more precise definition.

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

Microgrids (MGs) have evolved as critical components of modern energy distribution networks, providing increased dependability, efficiency, and sustainability. Effective control strategies are essential for optimising MG operation and maintaining stability in the face of changing environmental and load conditions. Traditional rule-based control systems are extensively used due to their interpretability and simplicity. However, these strategies frequently lack the flexibility for complex and changing system dynamics. This paper provides a novel method called hybrid intelligent control for adaptive MG that integrates basic rule-based-control and deep learning techniques, including gated recurrent units (GRU), basic recurrent neural network (RNN) and long short-term memory (LSTM). The main target of this hybrid approach is to improve MG management performance by combining the strengths of basic rule-based systems and deep learning techniques. These deep learning techniques readily enhance and adapt control decisions based on historical data and domain-specific rules, leading to increasing system efficiency, stability, and resilience in adaptive MG. Our results show that the proposed method optimises MG operation, especially under demanding conditions such as variable renewable energy supply and unanticipated load fluctuations. This study investigates special RNN architectures and hyper-parameter optimization techniques with the aim of predicting power consumption and generation within the adaptive MG system. Our promising results show the highest-performing models indicating high accuracy and efficiency in power prediction. The finest-performing model accomplishes an R2 value close to 1, representing a strong correlation between predicted and actual power values.

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

System-of-systems (SoS) evolution is a complex and unpredictable process. Although various principles to facilitate collaborative SoS evolution have been proposed, there is a lack of experimental data validating their effectiveness. To address these issues, we present an Agent-Based Model (ABM) for SoS evolution in the Internet of Vehicles (IoV) , serving as a quantitative analysis tool for SoS research. By integrating multiple complex and rational behaviors of individuals, we aim to simulate real-world scenarios as accurately as possible. To simulate the SoS evolution process, our model employs multiple agents with autonomous interactions and incorporates external environmental variables. Furthermore, we propose three evaluation metrics: evolutionary time, degree of variation, and evolutionary cost, to assess the performance of SoS evolution. Our study demonstrates that enhanced information transparency significantly improves the evolutionary performance of distributed SoS. Conversely, the adoption of uniform standards only brings limited performance enhancement to distributed SoSs. Although our proposed model has limitations, it stands out from other approaches that utilize Agent-Based Modeling to analyze SoS theories. Our model focuses on realistic problem contexts and simulates realistic interaction behaviors. This study enhances the comprehension of SoS evolution processes and provides valuable insights for the formulation of effective evolutionary strategies.

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

This paper attempts at applying adaptive network-based fuzzy inference system (ANFIS) for analysis of the resonant frequency of a microstrip rectangular patch antenna with two equal size slots which are placed on the patch vertically. The resonant frequency is calculated as the position of slots is shifted to the right and left sides on the patch. As a result , the antenna resonates at more than one frequency . Commonly, machine algorithms based on artificial neural networks are employed to recognize the whole resonant frequencies. However ,they fail to estimate the resonant frequencies correctly as in some cases variations are not very sensible and the resonant frequencies overlap each other . It can be concluded that artificial neural networks could be replaced in such designs by the adaptive network-based fuzzy Inference system due to its high approximation capability and much faster convergence rate.

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.

Drug repositioning (also called drug repurposing) is a strategy for identifying new therapeutic targets for existing drugs. This approach is of great importance in pharmacology as it is a faster and cheaper way to develop new medical treatments. In this paper, we present, to our knowledge, the first application of multiplex-heterogeneous network embedding to drug repositioning. Network embedding learns the vector representations of nodes, opening the whole machine learning toolbox for a wide variety of applications including link prediction, node labelling or clustering. So far, the application of network embedding for drug repositioning focused on heterogeneous networks. Our approach for drug repositioning is based on multiplex-heterogeneous network embedding. Such method allows the richness and complexity of multiplex and heterogeneous networks to be projected in the same vector space. In other words, multiplex-heterogeneous networks aggregate different multi-omics data in the same network representation. We validate the approach on a task of link prediction and on a case study for SARS-CoV2 drug repositioning. Experimental results show that our approach is highly robust and effective for finding new drug-target associations.

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

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.

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

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

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.

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

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

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

The basic challenges of this work are twofold: demonstrating the dependence between the functional and topological qualities of partition networks and finding the simplest—with respect to algorithmic complexity—network elements. The study of these problems is based on finding the solution to an appropriate antagonistic vertex game. The results of the numerical simulations of antagonistic partition games demonstrate that the winner’s graphs are “almost always” dense and hyperenergetic compared to the loser’s graphs. These observations reveal that successful evolutionary mechanisms can be realized, in principle, by the simplest objects (such as viruses).

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

Tephra plumes can cause a significant hazard for surrounding towns, infrastructure, and air traffic. The current work presents the use of a small and compact X-band Multi-Parameter (X-MP) radar for the remote tephra detection and tracking of two eruptive events at Merapi Volcano, Indonesia, in May and June 2018. Tephra detection was done by analysing the multiple parameters of radar: copolar correlation and reflectivity intensity. These parameters were used to cancel unwanted clutter and retrieve tephra properties, which are grain size and concentration. Real-time spatial and temporal forecasting of tephra dispersal was performed by applying an advection scheme (nowcasting) in the manner of Ensemble Prediction System (EPS). Cross-validation was done using field-survey data, radar observations, and Himawari-8 imagery. The nowcasting model computed both the displacement and growth and decaying rate of the plume based on the temporal changes in two-dimensional movement and tephra concentration, respectively. Our results with ground-based data, where the radar-based estimated grain size distribution fell within the range of in-situ data. The uncertainty of real-time forecasted tephra plume depends on the initial condition, which affects the growth-and decaying rate estimation. The EPS improves the predictability rate by reducing the number of missed and false forecasted events. Our findings and the method presented here are suitable for early warning of tephra fall hazard at the local scale.

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.

Driven by environmental sustainability concerns, the integration of biobased components in curtain wall systems is gaining traction in both research and the construction market. This paper explores the development and validation of a bio-based façade system within the Basajaun H2020 project. The project aimed to demonstrate the feasibility of introducing environmentally friendly bio-based components into the mature curtain wall façade industry. The paper focuses on identifying technological solutions for replacing key components such as profiles, insulation, and the tightness system with bio-based and less environmental impact alternatives presenting the results achieved in the façade system design of the Basajaun project funded by European Union. These solutions aimed at creating a bio-composite-based curtain wall façade that adheres to current building envelope standards and normative; to implement diverse façade typologies for vision panels, opaque sections, and integrated windows; to engineer the prefabrication process for industrialization, enabling wider market replication and simplified transport and installation. The results demonstrate that the Basajaun façade successfully integrates selected components and meets the performance requirements set by regulations. However, questions remain regarding the workability of bio-based profiles as a commercially viable, ready-to-market solution that can replace traditional aluminum profiles in the curtain wall façade industry.

Cloud Computing is a promising and emerging technology that is rapidly being adopted by many IT companies due to a number of benefits that it provides, such as large storage space, low investment cost, virtualization, resource sharing, etc. Users are able to store a vast amount of data and information in the cloud and access it from anywhere, anytime on a pay-per-use basis. Since many users are able to share the data and the resources stored in the cloud, there arises a need to provide access to the data to only those users who are authorized to access it. This can be done through access control schemes which allow the authenticated and authorized users to access the data and deny access to unauthorized users. In this paper, a comprehensive review of all the existing access control schemes has been discussed along with analysis. Keywords: role-based access control, attribute-based access control, attribute-based encryption

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

City zones have become increasingly overcrowded as a result of the extensive population widening ratio and the swift relocation of people from villages. The traffic monitoring process is a major issue in these areas due to the massive traffic flow on the roads. This research proposed a cluster-based improved authentication and communication scheme for an Intelligent Transportation System in Vehicular AdHoc Networks (VANETs). Our primary objective is to optimize resource sharing in vehicular communication. We enhanced the reliability, scalability, and stability of fast-moving VANETs by introducing cluster-based routing schemes for Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) communications. We used a third-party certification authority for vehicle authentication to address security and privacy concerns. Our proposed schemes support minimizing the end-to-end (E2E) delay and route request, in addition to reducing link failure. Our schemes’ leading yield includes throughput enhancement, TCP Socket Initialization time minimization, TCP handshake response speedup, and DNS lookup improvement. The schemes are centred on short-range peer-to-peer (P2P) wireless communication in a 400-meter radius cluster. This includes innovative P2P wireless communications on VANET using minimized resources. The proposed schemes deliver a secure authentication mechanism with a securely generated vehicle authentication key provided by a certification authority. Furthermore, we have developed RESTful APIs in vehicular communication for implementation purposes, and also offered and implemented algorithms for resource sharing regarding V2V and V2I communication. Ultimately, we evaluated the performance of our experiments.

Fossil-based plastics are significant contributors to global warming through CO₂ emissions. For more sustainable alternatives to be successful, it is important to ensure that consumers become aware of the benefits of innovations such as bio-based plastics, in order to create demand and a willingness to initially pay more. Given that consumer attitudes and (inaccurate) beliefs can influence the uptake such new technologies, we investigated participants’ attitudes towards fossil-based and bio-based plastic, their perceived importance of recycling both types of plastic, their willingness to pay, and their perceptions of bio-based plastic in four studies (total N = 961). The pre-registered fourth study experimentally manipulated information about bio-based plastic and measured willingness to pay for different types of plastic. The results suggest participants hold very favourable attitudes and are willing to pay more for bio-based products. However, they also harbour misconceptions, especially overestimating bio-based plastic’s biodegradability, and they find it less important to recycle bio-based than fossil-based plastic. Study 4 provided evidence that educating consumers about the properties of bio-based plastic can dispel misconceptions, retain a favourable attitude and a high willingness to pay. We found mixed evidence for the effect of attitudes on willingness to pay, suggesting other psychological factors may also play a role. We discuss how attitudes and misconceptions affect the uptake of new sustainable technologies such as bio-based plastics and consumers’ willingness to purchase them.

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

The accurate prediction of molecular properties such as lipophilicity and aqueous solubility are of great importance and pose challenges in several stages of the drug discovery pipeline. Machine learning methods like graph-based neural networks (GNNs) have shown exceptionally good performance in predicting these properties. In this work, we introduce a novel GNN architecture, called directed edge graph isomorphism network (D-GIN). It is composed of two distinct sub-architectures (D-MPNN, GIN) and achieves an improvement in accuracy over its sub-architectures employing various learning, and featurization strategies. We argue that combining models with different key aspects help make graph neural networks deeper and simultaneously increase their predictive power. Furthermore, we address current limitations in assessment of deep-learning models, namely, comparison of single training run performance metrics, and offer a more robust solution.

This paper presents a new methodology to derive and analyze strategies for a fully decarbonized urban transport system which combines conceptual vehicle design, a large-scale agent-based transport simulation, operational cost analysis, and life cycle assessment for a complete urban region. The holistic approach evaluates technical feasibility, system cost, energy demand, transportation time and sustainability-related impacts of various decarbonization strategies. In contrast to previous work, the consequences of a transformation to fully decarbonized transport system scenarios are quantified across all traffic segments, considering procurement, operation and disposal. The methodology can be applied to arbitrary regions and transport systems. Here, the metropolitan region of Berlin is chosen as a demonstration case. First results are shown for a complete conversion of all traffic segments from conventional propulsion technology to battery electric vehicles. The transition of private individual traffic is analyzed regarding technical feasibility, energy demand and environmental impact. Commercial goods, municipal traffic and public transport are analyzed with respect to system cost and environmental impacts. We can show a feasible transition path for all cases with substantially lower greenhouse gas emissions. Based on current technologies and today’s cost structures our simulation shows a moderate increase in total systems cost of 13-18%.

Effectively mapping and monitoring rubber plantation is still changing. Previous studies have explored the potential of phenology features for rubber plantation mapping through a pixel-based approach (pixel-based phenology approach). However, in fragmented mountainous Xishuangbanna, it could lead to noises and low accuracy of resultant maps. In this study, we investigated the capability of an integrated approach by combining phenology information with an object-based approach (object-based phenology approach) to map rubber plantations in Xishuangbanna. Moderate Resolution Imaging Spectroradiometer (MODIS) data were firstly used to acquire the temporal profile and phenological features of rubber plantations and natural forests, which delineates the time windows of defoliation and foliation phases. Landsat images were then used to extract a phenology algorithm comparing three different approaches: pixel-based phenology, object-based phenology, and extended object-based phenology to separate rubber plantations and natural forests. The results showed that the two object-based approaches achieved higher accuracy than the pixel-based approach, having overall accuracies of 96.4%, 97.4%, and 95.5%, respectively. This study proved the reliability of a phenology-based rubber mapping in fragmented landscapes with a distinct dry/cool season using Landsat images. This study indicated that the object-based phenology approaches can effectively improve the accuracy of the resultant maps in fragmented landscapes.

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

The ubiquity of mobile sensors (such as GPS, accelerometer and gyroscope) together with increasing computational power have enabled an easier access to contextual information, which proved its value in next generation of the recommender applications. The importance of contextual information has been recognized by researchers in many disciplines, such as ubiquitous and mobile computing, to filter the query results and provide recommendations based on different user status. A context-aware recommendation system (CoARS) provides a personalized service to each individual user, driven by his or her particular needs and interests at any location and anytime. Therefore, a contextual recommendation system changes in real time as a user’s circumstances changes. CoARS is one of the major applications that has been refined over the years due to the evolving geospatial techniques and big data management practices. In this paper, a CoARS is designed and implemented to combine the context information from smartphones’ sensors and user preferences to improve efficiency and usability of the recommendation. The proposed approach combines user’s context information (such as location, time, and transportation mode), personalized preferences (using individuals past behavior), and item-based recommendations (such as item’s ranking and type) to personally filter the item list. The context-aware methodology is based on preprocessing and filtering of raw data, context extraction and context reasoning. This study examined the application of such a system in recommending a suitable restaurant using both web-based and android platforms. The implemented system uses CoARS techniques to provide beneficial and accurate recommendations to the users. The capabilities of the system is evaluated successfully with recommendation experiment and usability test.

The field of program classification, a critical aspect of software engineering, facilitates understanding and categorization of code across various applications, including anomaly detection, and code quality assessment. The advancement of cross-language program classification opens up avenues for efficient code translation among different programming languages, significantly aiding developers in rapid coding and reducing development cycles. Existing research primarily focuses on semantic code analysis, with limited emphasis on cross-linguistic challenges. To address this, we introduce an innovative neural network model, CodeSemanticsNN, which leverages a refined Syntax Structure (SS) approach. This model consists of two integral mechanisms: first, it adopts a novel SS representation that combines sequential and graph-based SS structures, enhancing semantic feature capture. Second, it employs a 'unified vocabulary' strategy to bridge the gap between diverse programming languages, facilitating efficient cross-language classification. Additionally, we have compiled a comprehensive dataset of 20,000 files spanning five programming languages, serving as a benchmark for cross-language classification. Our experiments on this dataset demonstrate that CodeSemanticsNN surpasses existing models in four key metrics: Precision, Recall, F1-score, and Accuracy.

The problem of quantifying the vulnerability of graphs has received much attention nowadays, especially in the field of computer or communication networks. In a communication network, the vulnerability measures the resistance of the network to disruption of operation after the failure of certain stations or communication links. If we think of a graph as modeling a network, the average lower 2-domination number of a graph is a measure of the graph vulnerability and it is defined by ${\gamma }_{2av}\left(G\right)=\frac{1}{\left|V\left(G\right)\right|}{\sum }_{v\in V\left(G\right)}{\gamma }_{2v}\left(G\right)$, where the lower 2-domination number, denoted by ${\gamma }_{2v}\left(G\right)$, of the graph G relative to v is the minimum cardinality of 2-domination set in G that contains the vertex v. In this paper, the average lower 2-domination number of wheels and some related networks namely gear graph, friendship graph, helm graph and sun flower graph are calculated. Then, we offer an algorithm for computing the 2-domination number and the average lower 2-domination number of any graph G.

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

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

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.

This paper presents the PEnsemble 4 model, a sophisticated machine learning framework that integrates IoT-based environmental data to accurately forecast maize yield. With the projected significant growth in global maize demand over the next decade, the inherent risks posed by the crop’s dependence on weather conditions necessitate improved prediction capabilities. The PEnsemble 4 model, developed with high accuracy, incorporates comprehensive datasets encompassing soil attributes, nutrient composition, weather conditions, and UAV-captured vegetation imagery. By employing a combination of Huber and M estimates, the PEnsemble 4 model effectively analyzes temporal patterns in vegetation indices, specifically CIre and NDRE, which serve as reliable indicators of canopy density and plant height. In addition, this research significantly contributes to precision agriculture by offering an efficient and sustainable alternative to conventional farming practices through precise yield predictions. Notably, the PEnsemble 4 model enables earlier estimation, advancing the timeline for yield prediction from the conventional day 100 in the R6 stage to day 79 in the R2 stage. This improvement enhances decision-making processes in farming operations. The remarkable accuracy rate of 91% underscores the importance of adopting a multifaceted data approach that harnesses IoT-derived environmental insights. Additionally, the PEnsemble 4 model extends its benefits beyond yield prediction, facilitating the detection of water and crop stress, as well as disease monitoring in broader agricultural contexts. Ultimately, the PEnsemble 4 model establishes a new standard in maize yield prediction, revolutionizing crop management and protection through the synergistic utilization of IoT and machine learning technologies.

This article aims to solve the problem of robust supervision of a reverse osmosis desalination system (RO-DS) with two models, external model and bond graph model. The structure of an industrial system from the point of view of the external model operates according to several modes of operation (degraded and normal). For this external model, we cannot locate the faults since we are talking about a global operation of the system. The possible solution for the development of research was to use the multidisciplinary model called bond graph. This model by its graphic nature and using a unified language makes it possible to model the industrial system element by element from where it helps the user not only to detect the faults but also to locate them when they appear in the system. The results suggest that the use of the bond graph model for alarm 02 is a reverse osmosis error (RO1); these phenomena are readable on the bond graph model and can be quantified by equations. The equation of the model of this reverse osmosis (RO1) is found in the residual equations (r5, r6 and r7), so that these residues will be sensitive to this rupture. The possible solution during research development was to use the bond graph model to supplement information with physical knowledge and to locate faults. This article also describes the operating safety (by minimizing false alarms and non-detections as well as delays in fault detection) of the desalination system by using the bond graph model described in Linear Fractional Transformation (LFT) form for enable it to manage the robust supervision of a desalination system. An approach based on (LFT-BG) is developed to monitor tank leakage (Cu) and reverse osmosis (RO1 and RO2) faults or valve level (V1 and V2) closures and membrane clogging reverse osmosis (Rm1 and Rm2) that can occur in the reverse osmosis desalination system (RO-DS).

Continuous greenhouse gas emissions are causing global warming and impacting the habitats of many animals. Researchers in the field of electric power are making efforts to mitigate this situation. Operating and maintaining the power grid in an economic, low-carbon, and stable is challenging. To address the issue, we propose a grid dispatching technique that combines prediction technology, reinforcement learning, and optimization technology. Prediction technology can forecast future power demand and solar power generation, while reinforcement learning and optimization technology can make charging and discharging decisions for energy storage devices based on current and future grid conditions. In the power system, the aggregation of distributed energy resources increases uncertainty, particularly due to the fluctuating generation of renewable energy. This requires the use of advanced predictive control techniques to ensure long-term economic and decarbonization goals. In this paper, we present a real-time dispatching framework that integrates deep learning-based prediction, reinforcement learning-based decision-making, and stochastic optimization techniques. The framework can rapidly adapt to target uncertainty caused by various factors in real-time data distribution and control processes. The proposed framework achieved global Champion in the NeurIPS Challenge 2022 competition and demonstrated its effectiveness in practical scenarios of intelligent building energy management.

Hybrid materials are a recent addition in the field of Restorative Dentistry for computer-assisted design/ computer-assisted manufacturing (CAD/CAM) indirect restorations. The long–term clinical success of modern dental restorative materials follows a multifactorial pattern. Among the characteristics, affecting the longevity of a restoration, mechanical properties and physicο – chemical interactions are of utmost importance. While numerous researchers constantly evaluate the mechanical properties, the biological background of resin–based CAD/CAM biomaterials is scarcely investigated and, therefore, less described in the literature. This review aims to analyze the biofilm formation on the surfaces of novel hybrid, resin–based CAD/CAM materials and evaluate the methodological protocols followed to assess microbial growth. It is demonstrated that the surface structure, the composition and the finishing and polishing procedures on the surface of a dental restorative material influence the initial bacterial adhesion; however most studies focus on in vitro protocols, whereas in vivo and/or in situ research of microbiomics in CAD/CAM restorative materials is lacking, obstructing in that manner the accurate understanding of the bioadhesion phenomenon in the oral cavity.

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

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

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

A comprehensive kinetic model of the Fischer-Tropsch synthesis (FTS) is developed in a fixed bed reactor under operating conditions (temperature, 230–235°C, pressure, 20–25 bar, gas hourly space velocity, 4000–5000 cm³(STP)/h/g_catalyst ,H₂/CO feed molar ratio, 2.1) over a Co based catalyst. Reaction rate equations based on Eley-Rideal (ER) type model for initiation step and Langmuir-Hinshelwood-Hougen-Watson (LHHW) type model for propagation and termination steps of the FTS reactions have been considered and the readsorption of olefins were taken into account. The model that was reported in the literature was modified in order to explain many significant deviations from the ASF distribution. Optimum parameters have been obtained by Genetic Algorithms (GA). The calculated activation energies to produce n-paraffins and 1-olefins were in the range of 82.24 to 90.68 kJ/mol and 100.66 to 105.24 kJ/mol, respectively. The hydrocarbon distribution in FTS reactions was satisfactorily predicted particularly for paraffins.

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

Recent discovery of triangular boron Nanotubes makes it a competitor of carbon in many respects. Closed forms of M-polynomial of nanotubes produce closed forms of many degree-based topological indices which are numerical parameters of the structure and, in combination, determine properties of the concerned nanotubes. In this report, we give M-polynomials of triangular boron nanotubes and recover many important topological degree-based indices of these nanotubes. We also plot surfaces associated to these nanotubes.

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.

Water is a limited resource that needs to be properly managed and distributed to the ever-growing population of the world. Rapid urbanization and development have drastically increased the overall water demand worldwide. Ageing water distribution networks are vulnerable to deterioration and leakage, thereby causing an estimated annual loss of about 48 trillion liters of water. To address these issues, efficient and reliable leakage detection and management techniques are necessary. In this paper, the results of the experiments performed on a looped water distribution network in AnSeong, Korea are discussed. Transient-based techniques were used and physical data were collected for the detection and localization of leakages in the experimental water pipes. The results obtained from the experiments demonstrated the applicability of transient techniques for leak analysis in looped water distribution networks.

The numerical implementation of the controllers allows the use of very complex algorithms with ease. However, in practice, due to its proven advantages, the PID controller (and its variants) is widely used in industrial control systems as well as in many other applications that require continuous control. Most of the methods for tuning the parameters of PID controllers are based on time-invariant linear models of the processes, which in practice can lead to poor performance of the control system. The paper presents an application of reinforcement learning algorithms in tuning of PID controllers for the control of some classes of continuous nonlinear systems. Tuning the parameters of PID controllers is done with the help of Twin Delayed Deep Deterministic Policy Gradients (TD3) algorithm which presents a series of advantages compared to other similar methods from Machine Learning dedicated to continuous state and action spaces. TD3 algorithm is an off-policy Actor-Critic based method and was used as it does not require a system model. The presented technique is applied for control of a biotechnological system which has a strongly nonlinear dynamic. The proposed tuning method is compared to the classical tuning methods of PID controllers. The performance of the tuning method based on the TD3 algorithm is demonstrated through simulation illustrating the effectiveness of the proposed methodology.

3D point cloud classification tasks have been a hot topic in recent years. Most existing point cloud processing frameworks lack context-aware features due to the deficiency of sufficient local feature extraction information. Therefore, we design an augmented sampling and grouping (ASG) module to efficiently obtain fine-grained features from the original point cloud. In particular, this method strengthens the domain near each centroid and makes reasonable use of the local mean and global standard deviation to mine point cloud’s local and global features. In addition to this, inspired by the transformer structure UFO-ViT in 2D vision tasks, we first try to use a linearly-normalized attention mechanism in point cloud processing tasks, investigating a novel transformer-based point cloud classification architecture UFO-Net. An effective local feature learning module is adopted as a bridging technique to connect different feature extraction modules. Importantly, UFO-Net employs multiple stacked blocks to better capture feature representation of the point cloud. Extensive ablation experiments on public datasets show that our method outperforms other state-of-the-art methods. For instance, our network performed with 93.7% overall accuracy on the ModelNet40 dataset, which was 0.5% higher than PCT. Our network also archived 83.8% overall accuracy on the ScanObjectNN dataset, which is 3.8% better than PCT.

Background: This study aimed to develop and evaluate a dietary self-care promotion program for hemodialysis patients based on Hurley's self-efficacy model. Methods: The needs of hemodialysis patients were identified, and an online community-based dietary self-care promotion program was developed with expert evaluations. 44 hemodialysis patients were randomly assigned to an experimental group (n=22) and a control group (n=22). The program was applied to the experimental group for four weeks. Before and after the intervention, as well as four weeks after the intervention, dietary self-efficacy, dietary self-care behavior, interdialytic weight gain, serum phosphorus, and serum potassium were assessed in both groups. Results: Significant differences over time and between groups were observed in dietary self-efficacy, interdialytic weight gain, serum phosphorus, and serum potassium. The interaction between time and group was also significant. While no significant differences were found over time in dietary self-care behavior, significant group differences and interaction effects between time and group were identified. Conclusions: The results indicate that the dietary self-care promotion program using an online community for hemodialysis patients is more effective in enhancing dietary self-efficacy and dietary self-care behavior compared to conventional treatment. This suggests the clinical applicability of the proposed dietary self-care promotion program.

Satellite-based rainfall estimation products provide a vital alternative source of rainfall data in areas where conventional precipitation measurement is not readily available. In order to facilitate the use of these products there is the need to evaluate their accuracies. This study evaluated the accuracy of three satellite rainfall products; TMPA 3B42RT, TMPA 3B42 and CMORPH in the Pra basin (23,330 km²) of Ghana. The evaluation was through the point-to-pixel method by comparing 0.25°x 0.25° satellite grids to gauged rainfall based on gauge locations and analyzed statistically using correlation coefficient (r), bias and percent bias (pBias) as the performance verification methods. Seven (7) gauge stations with no missing data for the period of 2003-2008 was used in the evaluation. The analysis was based on daily, monthly, annual and seasonal timescales. Our results showed a good correlation between the TMPA products and the gauged data on all timescales considered. The CMORPH on the other hand showed huge overestimation at all gauge locations. The TMPA 3B42 was seen to be the best amongst the three products. The overall rainfall in the basin was well depicted by the TMPA 3B42 and 3B42RT. Although there wasn’t a perfect match between the 3B42RT and 3B42 products and the gauged rainfall, these products can be used to supplement gauged rainfall measurements in the basin and in estimation of rainfall in ungauged basins with similar characteristics.

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

Neural radiance fields (NeRF) leverage a neural representation to encode scenes, obtaining photo-realistic rendering of novel views. However, NeRF has notable limitations. A significant drawback is that it does not capture surface geometry and only renders the object surface colors. Furthermore, the training of NeRF is exceedingly time-consuming. We propose Depth-NeRF as a solution to these issues. Specifically, our approach employs a fast depth completion algorithm to denoise and complete the depth maps generated by RGB-D cameras. These improved depth maps guide the sampling points of NeRF to be distributed closer to the scene's surface, benefiting from dense depth information. Furthermore, we have optimized the network structure of NeRF and integrated depth information to constrain the optimization process, ensuring that the termination distribution of the ray is consistent with the scene’s geometry. Compared to NeRF, our method accelerates the training speed by 18% and significantly reduces the RMSE between the rendered scene depth and the ground truth depth, which indicates that our method can better capture the geometric information of the scene. With these improvements, we can train the NeRF model more efficiently and achieve more accurate rendering results.

Non-invasive, electroencephalography (EEG)-based brain-computer interfaces (BCIs) on motor imagery movements translate the subject’s motor intention into control signals through classifying the EEG patterns caused by different imagination tasks, e.g. hand movements. This type of BCI has been widely studied and used as an alternative mode of communication and environmental control for disabled patients, such as those suffering from a brainstem stroke or a spinal cord injury (SCI). Notwithstanding the success of traditional machine learning methods in classifying EEG signals, these methods still rely on hand-crafted features. The extraction of such features is a difficult task due to the high non-stationarity of EEG signals, which is a major cause for the stagnating progress in classification performance. Remarkable advances in deep learning methods allow end-to-end learning without any feature engineering, which could benefit BCI motor imagery applications. We developed three deep learning models: 1) a long short-term memory (LSTM); 2) a proposed spectrogram-based convolutional neural network model (pCNN); and 3) a recurrent convolutional neural network (RCNN), for decoding motor imagery movements directly from raw EEG signals without (manual) feature engineering. Results were evaluated on our own, publicly available, EEG data collected from 20 subjects and on an existing dataset known as 2b EEG dataset from "BCI Competition IV". Overall, better classification performance was achieved with deep learning models compared to state-of-the art machine learning techniques, which could chart a route ahead for developing new robust techniques for EEG signal decoding. We underpin this point by demonstrating the successful real-time control of a robotic arm using our CNN based BCI.

Incorporating source-side linguistic knowledge into the neural machine translation (NMT) model has recently achieved impressive performance on machine translation tasks. One popular method is to generalize the word embedding layer of the encoder to encode each word and its linguistic features. The other method is to change the architecture of the encoder to encode syntactic information. However, the former cannot explicitly balance the contribution from the word and its linguistic features. The latter cannot flexibly utilize various types of linguistic information. Focusing on the above issues, this paper proposes a novel NMT approach that models the words in parallel to the linguistic knowledge by using two separate encoders. Compared with the single encoder based NMT model, the proposed approach additionally employs the knowledge-based encoder to specially encode linguistic features. Moreover, it shares parameters across encoders to enhance the model representation ability of the source-side language. Extensive experiments show that the approach achieves significant improvements of up to 2.4 and 1.1 BLEU points on Turkish→English and English→Turkish machine translation tasks, respectively, which indicates that it is capable of better utilizing the external linguistic knowledge and effective improving the machine translation quality.

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

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.

This work presents the development and implementation of a distributed navigation system based on computer vision. The autonomous system consists of a wheeled mobile robot with an integrated colour camera. The robot navigates through a laboratory scenario where the track and several traffic signals must be detected and recognized by using the images acquired with its on-board camera. The images are sent to a computer server that processes them and calculates the corresponding speeds of the robot using a cascade of trained classifiers. These speeds are sent back to the robot, which acts to carry out the corresponding manoeuvre. The classifier cascade should be trained before experimentation with two sets of positive and negative images. The number of images in these sets should be considered to limit the training stage time and avoid overtraining the system.

In the construction sector, the integration of biobased materials has emerged as a pivotal aspect of EU policies, aimed at promoting sustainable practices throughout the value chain to mitigate resource consumption and carbon emissions. This paper explores the development and validation activities of a bio-based façade system within the Basajaun H2020 project, focusing on enhancing the utilization of biobased components within building envelopes to replace conventional solutions with eco-friendly alternatives. This paper reports the methodologies employed to detect requirements and outline the testing protocols undertaken to validate the façade system design devised within the project focusing on the original façade components as the bio composite profile. Vision and opaque façade modules are prototyped and tested following curtain wall standards standard for performance and acoustic assessments, to showcase the efficacy of the developed solution. The conducted tests demonstrate the feasibility of integrating bio-based components into building envelopes, aligning with project expectations, and prevailing standards for curtain wall façade solutions. Notably, the designed façade system meets technical conditions and project objectives. Nevertheless, the research underscores the need for further refinements to facilitate solution industrialization and explore broader market applicability. Future efforts will focus on addressing these improvements and assessing the scalability of the solution.

The paper presents the prediction of hydrodynamic characteristics of different rudder -plane configurations behind a submarine in deep water through the Reynolds-Averaged Navier-Stokes method in Ansys Fluent Solver. The hydrodynamic force and moment acting on the Cross-plane, X-plane, and Y-plane rudder configurations are analyzed for estimating hydrodynamic coefficientsfor predicting the advantages of each configuration to control the ship. The obtained results show that X-force of the X-plane rudder configuration is larger than the force acting on the Cross-plane rudder and Y-plane rudder configurations. However, Y-force, and Z-force of the X-plane rudder configuration are significantly greater than the Y-force of the left configurations. The same tendency can be seen in the moment of the X-plane rudder about the y-axis and z-axis. The roll moment induced by the Y-plane and Cross-plane rudder configurations is significantly larger than the case of the X-plane rudder configuration.

Despite saltmarshes being considered as nature-based solutions (NbS) towards climate change mitigation, India’s saltmarsh ecosystems are least studied. This study quantifies the seasonal variation in carbon stocks mono-specific saltmarsh species (Porteresia coarctata) and its potential to play an important role in India’s climate change mitigation plans. Seasonal (pre-and post-monsoon) sampling of P. coarctata surface water, biomass and 30 cm sediment core was collected across four locations on the east coast of India to quantify sediment dry bulk density (DBD), organic matter (OM%), organic carbon (Corg%), Corg stocks of sediment and biomass, total carbon (C%) and nitrogen (N%) and stable isotopes of δ13C and δ15N. In general, the sediment DBD, OM and Corg of P. coarctata meadows was higher in post-monsoon and was influenced by salinity and pH changes. Isotope (δ¹³C) modelling of various sediment C sources suggested, particulate organic matter (POM) contribution was highest (0.04-0.79%) followed by P. coarctata (0.01–052%) and other macrophytes across our study locations. The seasonal variation of δ¹³C showed increased contribution of marine derived particulate and dissolved organic matter into P. coarctata meadows in post-monsoon season. Heavier δ¹⁵N values were observed in post-monsoon season suggesting anthropogenic input, that was utilized by P. coarctata to increase its above and below-ground biomass and shoot density. The combined ecosystem (30 cm sediment + biomass) Corg stocks of P. coarctata was 1.7-fold higher in post-monsoon (4021.20± 917 Mg C) compared to pre-monsoon (2297.36 ±647 Mg C) season among the four locations with a sediment Corg contribution >70%. Based on the International Panel for Climate Change Tier II assessment the P. coarctata meadows (443 ha) can help in avoiding the pre and post-monsoon emissions of 8431.34 and 14757.84 Mg CO₂ respectively. The combined price of the total CO₂ equivalent stored in P. coarctata meadows in pre- and post-monsoon is US$ 14.50 and US$ 25.38 million respectively. Further studies quantifying the NbS potential of P. coarctata mono-specific and mixed meadows of India’s coast is needed along with integration of saltmarsh ecosystems into India’s National Action Plan on Climate Change.

Abnormal connections in brain networks of healthy people always bring the problems of cognitive impairments and degeneration of specific brain circuits, which may finally result in Alzheimer’s disease (AD). Exploring the development of the brain from normal controls (NC) to AD is an essential part of human research. Although connections changes have been found in the development, the connection mechanism that drives these changes remain incompletely understood. The purpose of this study is to explore the connection changes in brain networks in the process from NC to AD, and uncover the underlying connection mechanism that shapes the topologies of AD brain networks. In particular, we propose a model named MINM from the perspective of topology-based mutual information to achieve our aim. MINM concerns the question of estimating the connection probability between two cortical regions with the consideration of both the mutual information of their observed network topologies and their Euclidean distance in anatomical space. In addition, MINM considers establishing and deleting connections, simultaneously, during the networks modeling from the stage of NC to AD. Experiment results show that MINM is sufficient to capture an impressive range of topological properties of real brain networks such as characteristic path length, network efficiency, and transitivity, and it also provides an excellent fit to the real brain networks in degree distribution compared to experiential models. Thus, we anticipate that MINM may explain the connection mechanism for the formation of the brain network organization in AD patients.

The next future using machine tools will be dominated by highly flexible and interconnected systems, in order to achieve the required productivity, accuracy and reliability. Nowadays, distortion and vibration problems are easily solved for the most common cases by sing models based on equations describing the physical laws dominating the machining process; however additional efforts are needed to overcome the gap between scientific research and the real manufacturing problems. In fact, there is an increasing interest in developing simulation packages based on “deep knowledge and models” that aid the machine designer, the production engineer, or machinists to get the best of their machines. This article proposes a systematic methodology to reduce problems in machining by means of a simulation utility, which recognizes, collects and uses the main variables of the system/process as input data, and generates objective results that help in the proper decision-making. Direct benefits by such an application are found in a) the fixture/clamping optimal design, b) the machine tool configuration, c) the definition of chatter free optimum cutting conditions and the right programming of cutting tool path at the Computer Aided Manufacturing (CAM) stage. The information and knowledge-based approach showed successful results in several local manufacturing companies.