Search Results (231)

Multi-hop question answering (MQA) requires models to perform multi-step reasoning and integrate multiple knowledge sources. However, existing methods combining pre-trained language models (PLMs) and graph neural networks (GNNs) often suffer from low computational efficiency, insufficient deep semantic fusion, and imbalanced modeling of heterogeneous relations. To solve these problems, we propose a Dynamic Hierarchical Adaptive Graph Convolution Network (DHACNet). First, to deal with the issues of insufficient computational efficiency and feature interpretability, we introduce Dynamic Sparse Activation (DSA). A trainable gate unit is used to generate importance masks for the encoder outputs, keeping only the task-relevant neurons. This greatly decreases the computational burden and enhances the interpretability of the model’s decisions. Second, to alleviate insufficient deep semantic fusion, we design a Hierarchical Feature Fusion (HFF) mechanism. It adaptively weights and fuses hidden states from different layers, enhancing the extraction and representation of deep textual semantics. Furthermore, for graph structure modeling, we present Adaptive Graph Convolution (AGC), which assigns learnable weights to different edge types in the graph, thereby improving heterogeneous relation modeling. Finally, hierarchical graph pooling is introduced, which integrates attention mechanism and Top-$K$ selection to achieve efficient and robust graph-level representation. The experimental results show that our proposed model maintains the symmetry between the text representation and graph representation through adaptive layered fusion and relational perceptual graph propagation. This symmetry-aware reasoning process encourages semantic consistency during multi-hop inference and makes knowledge integration more robust. Full article

Accurate prediction of slope displacement from high-frequency GNSS monitoring data is critical for early warning of landslides and tailings dam failures. However, existing deep learning approaches often neglect the spatial coordination imposed by geological structures and fail to decouple abrupt deformation signals from background noise, leading to non-physical oscillations and inconsistent long-term predictions. To address these limitations, this paper proposes a Symmetry-Aware Physics-Guided Spatio-Temporal Graph Network (PG-STGN). First, a geological hierarchy-aware graph is constructed by integrating geometric proximity with prior knowledge of exploration levels, where the resulting adjacency matrix is symmetric by design and reflects the physical symmetry of deformation interactions among monitoring points at the same elevation. A hierarchical masking mechanism restricts feature aggregation to physically connected neighborhoods while preserving this symmetry. Second, an improved dual-path temporal convolutional network (iTCN) decouples high-frequency abrupt variations from low-frequency evolutionary trends, enabling both sensitive detection of sudden deformation and stable tracking of long-term creep. Third, a physics-consistent loss function combining first-order temporal differencing and graph Laplacian regularization enforces kinematic smoothness and spatial coordination; the Laplacian itself is derived from the symmetric adjacency matrix, ensuring symmetric regularization across the monitoring network. Evaluated on a real-world slope GNSS dataset from a large-scale mining project, PG-STGN reduces mean squared error (MSE) by approximately 23.7% and achieves a global R² of 0.924, outperforming state-of-the-art spatio-temporal models. Ablation studies confirm that the symmetric physics-guided graph, dual-path decoupling, and consistency loss are each essential for suppressing spurious correlations and maintaining physically plausible predictions. The proposed framework provides a robust, interpretable, and symmetry-constrained solution for automated slope monitoring under complex geological conditions. Full article

Fault diagnosis of diesel engines is a critical task in the operation and maintenance of complex equipment. Diesel engine fault diagnosis technology based on deep learning has seen widespread development due to its powerful feature learning and fault classification capabilities. However, traditional data-driven deep learning models cannot explicitly uncover relationships between signals, which hinders better fault information capture. Therefore, this paper proposes a diesel-engine valve-clearance fault diagnosis method driven by a combination of knowledge and data. Firstly, the original signals are converted into graph data with a topological structure based on the spatiotemporal relationships of events occurring within the cylinder, thereby uncovering the intrinsic structural information of the samples. Then, the graph structure is input into a graph convolutional attention network to extract features and learn fault patterns. Valve fault experiments were conducted on a diesel engine test bench, and the results indicate that the proposed knowledge and data-driven deep learning fault diagnosis model achieves better diagnostic performance and clearer interpretability compared to traditional data-driven deep learning fault diagnosis models, and it still has a relatively high accuracy in a diagnostic environment with scarce data. Full article

Considerable efforts have been devoted to accurately monitoring the depth of anesthesia to ensure patient safety during surgery. Traditional approaches typically rely on electroencephalogram (EEG)-based indices, such as the Bispectral Index (BIS), which require specialized equipment. In contrast, electrocardiogram (ECG) signals are widely available in clinical settings and can be conveniently acquired via wearable devices, while also exhibiting strong responsiveness to anesthetic agents. Inspired by biomimetic physiological regulation mechanisms, this study proposes a wearable-compatible ECG-based framework for depth-of-anesthesia detection that leverages autonomic nervous system characteristics and a knowledge graph-enhanced graph convolutional network (GCN). ECG recordings from 110 patients were preprocessed, and 20 anesthesia-related features were extracted, spanning morphological, statistical, spectral, heart rate variability (HRV), and entropy-based descriptors; feature selection methods identified 13 discriminative features. A patient-level knowledge graph was first constructed using the 88 training patients (1760 nodes), and test patient nodes were incorporated only after training was complete for inductive inference. Experimental results demonstrate that the proposed deep knowledge GCN achieves a test accuracy of 98.18% in distinguishing between awake and deep sleep anesthesia states, indicating that biomimetic, wearable-compatible ECG analysis combined with knowledge graph learning holds strong potential as a cost-effective alternative to traditional EEG-based anesthesia monitoring systems. Full article

This study addresses two key challenges in computational pharmacology: identifying novel therapeutic uses for existing drugs and modeling drug safety-related characteristics. We propose a multi-relational biomedical knowledge graph that integrates gene, drug, and disease associations with adverse effect data, enabling joint modeling of therapeutic and safety-related properties. A Relational Graph Convolutional Network (R-GCN) is employed to learn relationally aware embeddings that capture complex biological interactions across heterogeneous entities. The framework is evaluated on two tasks: (1) drug–disease link prediction for drug repurposing and (2) prediction of drug side-effect burden based on adverse event patterns. The experimental results demonstrate that the R-GCN model outperforms baseline methods, achieving 94.63% accuracy in drug–disease link prediction, while embedding-based classifiers attain up to 97.14% F1-score in side-effect burden classification. Additionally, multi-hop relational reasoning enables the discovery of biologically plausible connections between drugs, genes, and diseases. These findings highlight the effectiveness of knowledge graph-based representation learning in jointly supporting therapeutic discovery and safety-related analysis. While side-effect burden is used as a surrogate measure rather than a direct indicator of drug quality, the proposed framework provides a scalable foundation for integrating real-world pharmacovigilance and regulatory data in future studies. Full article

Extracting relational triples from unstructured text is essential for information extraction and knowledge graph construction, but it remains challenging in complex scenarios involving overlapping entities and diverse relational patterns. To address this issue, this paper proposes an Information-Enhanced Multi-Scale Fusion Convolutional Neural Network (EnInfo-Mulscal FCNN) for joint entity–relation extraction. The model uses BERT to obtain contextual representations, predicts candidate relations through multi-label classification, incorporates relation-aware features into entity recognition, and introduces a multi-scale fusion convolutional module and an attention-based entity filtering mechanism to enhance subject–object correspondence modeling. Experiments on the NYT-star and WebNLG datasets demonstrate the effectiveness of the proposed method. Experiments show that EnInfo-Mulscal FCNN achieves precision, recall, and F1-score values of 87.2%, 75.1%, and 80.7% on NYT-star and 86.3%, 88.3%, and 87.3% on WebNLG, respectively. Compared with ETL-span, our model improves the F1-score by 2.7% on NYT-star and 4.2% on WebNLG. Compared with PRE-span, our model improves the F1-score by 4.3%, demonstrating its effectiveness in relational triple extraction. These results indicate that the proposed method improves relational triple extraction by enhancing information in the relation identification, entity recognition, and entity filtering stages, thereby improving triple generation in complex text scenarios. Full article

Securing IoT-enabled wireless sensor network links requires selecting a minimum-cost set of connected monitor nodes that observes every link while satisfying capacity constraints, a problem known as the minimum weighted connected capacitated vertex cover (MWCCVC). To the best of our knowledge, this work introduces the first learning-based framework for the MWCCVC through a three-stage pipeline that combines supervised graph neural networks, feasibility repair, and local search. We compare twelve graph neural network architectures, including graph convolutional network, graph attention network, GraphSAGE, Graph Isomorphism Network (GIN), and GraphTransformer, under unified features, loss functions, and hyperparameter tuning. Throughout the evaluation on 309 benchmark instances under a 5-fold cross-validation protocol, feasibility is guaranteed by the deterministic repair module instead of being learned by the network, resulting in 100% feasible covers across all evaluated instances. At the large scale, GIN, GraphSAGE, DeeperGIN, and EdgeAwareGIN reach parity with the state-of-the-art hybrid genetic algorithm (HGA), with GIN attaining a mean gap of $-0.37\%$ (a difference of less than one percentage point) while completing in seconds instead of HGA’s hours. Statistical tests across the full 309-instance benchmark confirm significant differences between the architectures, with Friedman ${\chi }^2=93.05$, $p<{10}^{-4}$. The best-performing architectures remain within about $2\%$ of HGA on small- and medium-scale instances, where HGA is near-optimal, and become the preferred choice at the large scale, mainly because their wall-clock time is much shorter than HGA’s at the same solution quality. Full article

Background/Objectives: Integrating multi-omics data for cancer prognosis remains a challenging problem in bioinformatics because molecular profiles are high-dimensional, heterogeneous, and structured by incomplete biological relationships. Pathway databases provide biologically meaningful prior knowledge for modeling gene-level associations, but the sparsity and local incompleteness of pathway-derived networks often limit the performance of graph-based survival models. This study aimed to develop a pathway-guided framework for improving multi-omics survival prediction and identifying biologically relevant prognostic signals. Methods: We proposed PANA-Surv, a pathway-guided adaptive neighborhood augmentation framework for multi-omics cancer survival analysis. In this framework, KEGG pathways were used to construct gene graphs, and gene-level multi-omics profiles were encoded as node features. A conditional variational autoencoder module (PANA-VAE) was designed to enhance local representations through neighborhood reconstruction and adaptive weighting. The augmented features were then integrated into a graph convolutional survival model optimized with the Cox partial likelihood. Results: PANA-Surv was evaluated on 10 cancer cohorts from The Cancer Genome Atlas (TCGA). The proposed method achieved the highest mean concordance index (C-index) among all compared models and significantly outperformed Cox-EN, DeepSurv, GraphSurv, and LAGProg (all p < 0.01). Ablation analyses showed that both neighborhood reconstruction and adaptive weighting contributed to the observed performance gains, and KEGG-guided graph construction was more effective than alternative graph construction strategies. In a breast cancer (BRCA) case study, PANA-Surv identified 18 prognostic genes, including 12 genes supported by previous studies and 6 potentially novel candidates. Conclusions: These findings indicate that the integration of pathway prior knowledge with adaptive local feature enhancement can improve multi-omics survival modeling and support the identification of biologically relevant prognostic signals associated with cancer outcomes. Full article

Ship structural failure mode classification still relies heavily on subjective expert judgment, which is time-consuming and may introduce uncertainty in safety assessment. Although deep learning provides a promising avenue for automation, many existing learning approaches rely on 2D image representations and may therefore suffer from geometric occlusion and information loss when projecting complex 3D stiffened structures. To address these challenges, we propose a Physics-Guided Graph Convolutional Network (PGGCN) for failure mode classification. Specifically, our method models finite-element (FE) meshes directly as graphs, preserving the holistic topology and displacement-field fidelity without viewpoint dependency. We further incorporate domain knowledge through a hybrid strategy: a Deep Graph Convolutional Network (DeepGCN) first detects local component buckling states such as plate or web buckling, and a logic matrix derived from classical failure definitions subsequently determines panel-level failure modes. To enable systematic evaluation, we construct a dataset spanning diverse stiffened-panel geometries via Latin Hypercube Sampling. Progressive analysis states from each loading case are organized into task-specific graph samples for supervised learning. Experiments on the test set achieve accuracies of 95.48% and 91.42% for plate- and web-buckling classification, respectively, and 89.56% for panel-level failure mode discrimination. These results demonstrate that the proposed method provides an interpretable framework for automated failure mode classification from FE meshes in ship stiffened panels. Full article

Dynamic scheduling can improve the latency and memory efficiency of deep neural network inference on edge devices, but it often introduces cold-start overhead when a newly deployed model requires online profiling and policy adaptation before reaching stable performance. This paper proposes EdgeOpt-Sched-CS, a cold-start-aware extension of dynamic graph scheduling for edge inference. The key idea is to initialize the scheduler of a target computation graph using scheduling knowledge transferred from structurally similar source graphs, instead of starting from a generic policy. EdgeOpt-Sched-CS constructs compact graph signatures, retrieves relevant source schedulers, and performs lightweight cold-start-aware online adaptation during early deployment. We evaluate the framework across representative device–model scenarios involving lightweight convolutional neural networks, transformer models, and quantized language-model workloads. The results show that EdgeOpt-Sched-CS reduces cumulative cold-start latency by 10.6–20.4% and shortens time-to-stability by 5.2–21.7%, while preserving the steady-state latency–memory behavior of the original dynamic scheduler with only small additional scheduling overhead. These findings indicate that scheduler initialization is an important optimization dimension for adaptive edge inference and that prior scheduling knowledge can be effectively reused across related computation graphs. Full article

Smart home environments are evolving toward context-aware intelligent systems with the rapid integration of the Internet of Things (IoT), edge computing, and artificial intelligence. In such settings, large volumes of heterogeneous sensor data must be continuously processed to support perception, behavior understanding, and autonomous decision-making. Deep learning has emerged as a key approach for transforming raw sensor signals into structured representations that enable these functions. This review examines recent advances in deep learning for smart home applications from a sensor-driven perspective. Existing studies are organized into five major domains: human activity recognition, health monitoring and assisted living, smart energy management, security monitoring and anomaly detection, and voice interaction and intelligent control. Representative methodological paradigms—including convolutional and recurrent neural networks, Transformers, graph-based learning, multimodal fusion, and deep reinforcement learning—are discussed with emphasis on their roles in signal representation, multimodal integration, and decision-oriented modeling. Despite notable progress, several challenges continue to limit real-world deployment. These include the scarcity of high-quality labeled data, privacy and security concerns associated with continuous sensing, limited generalization across environments and users, constraints of edge devices, and the limited interpretability of model output. Addressing these issues requires advances not only in model design but also in data-efficient learning, privacy-preserving architectures, and system-level integration. Future research is expected to focus on multimodal perception, distributed and edge intelligence, knowledge-enhanced modeling, and human-centered explainable systems. By synthesizing current developments and highlighting open challenges, this review aims to support the development of robust and deployable deep learning solutions for next-generation smart home systems. Full article

Industrial Control Systems (ICSs), which are essential components of critical infrastructures, are inherently complex and vulnerable to cyberattacks. Advanced Persistent Threats (APTs) that target these systems are multi-stage, coordinated attacks that can lead not only to information loss but also to physical damage and loss of life. Traditional threat modeling approaches fall short in adapting to the dynamic nature of ICSs, necessitating new methodologies to predict and prevent such complex attacks. This work presents a digital twin-assisted dynamic threat modeling framework for ICS environments. The framework leverages a knowledge graph that integrates system data and cyber threat intelligence to predict potential attacks. In addition, the digital twin environment enables the validation of mitigation strategies before deployment in the physical system, while also supporting adaptive response and real-time mitigation. To predict the attacker’s next move, we propose a Relational Graph Convolutional Network (RGCN)-based model that utilizes enriched relational data such as tactics, campaigns, groups, techniques, and assets. The proposed RGCN model achieves a recall of 0.887, an F1-score of 0.893, and an AUC of 0.957 in predicting potential attack sequences. These results demonstrate that the model provides reliable and well-balanced predictive performance. Full article

Dynamic knowledge representation in curved manifolds conventionally relies on integer-order Markovian sequence encoders, intrinsically yielding exponential memory decay. This paradigm fails to model the anomalous diffusion and heavy-tailed historical dependencies inherent in complex evolutionary networks and dense physical environments. This manuscript proposes the Fractional–Temporal Lorentz Graph Convolutional Network (FTL-GCN), formalizing temporal evolution as a continuous fractional geometric flow explicitly defined on the tangent bundle of the Lorentz manifold. Analytical derivations demonstrate that the discrete Grünwald–Letnikov memory kernel establishes a non-exponential, power-law lower bound for historical state retention, preventing topological manifold collapse over extended temporal horizons. Empirical evaluations demonstrate that FTL-GCN achieves competitive forecasting accuracy against the latest 2025–2026 state-of-the-art discrete models within specific temporal windows, while uniquely mitigating predictive degradation by up to 52% in long-horizon dependency stress tests and maintaining sub-millisecond latency for physical control. The architecture is subsequently deployed within an in silico biophysical simulation for autonomous micro–nano robotic navigation in the Tumor Microenvironment (TME). By establishing a physical-mathematical structural analogy—mapping the empirical fractional viscoelasticity of the extracellular matrix to the cognitive network’s fractional derivative order—FTL-GCN sustains continuous-space navigation policies in dense anomalous environments where standard integer-order models experience mechanical slip. Full article

Delivery services have drawn much attention and become of topmost significance in urban areas by presenting online food delivery selections for a diversity of dishes from a wide range of restaurants, decreasing both travel and waiting times. Customer data analysis acts as a cornerstone in corporate strategy, allowing enterprises to gather and interpret user feedback and helping them to make informed decisions that drive future business development. However, major knowledge gaps remain due to the scarcity of literature review studies on these delivery services, hindering a complete understanding of customer satisfaction in this sector. Furthermore, there has been little systematic research on managerial response tactics to online consumer complaints and negative reviews. Researchers have contributed by applying artificial intelligence, including deep learning and machine learning models, to analyze customer sentiment and understand customer brand perceptions. This study presents a Hybrid Deep Neural Network Model for Customer Satisfaction Analysis (HDNNM-CSA), with the aim of developing an efficient model which is capable of accurately classifying customer satisfaction levels in delivery apps based on textual responses provided by customer experience managers. To achieve this, the model initially pre-processes text data using text cleaning, emoji removal, normalization, tokenization, stop word removal, and stemming to clean and standardize the unstructured text data for further analysis. Following this, term frequency–inverse document frequency-based word embedding is utilized to transform the pre-processed text into meaningful feature representations. Lastly, an ensemble architecture involving bidirectional long short-term memory, temporal convolutional, and graph convolutional networks is deployed to classify customer satisfaction levels with managers’ responses. A series of experimental analyses are performed, and the results are examined for numerous features. A comparative analysis demonstrates the enhanced performance of the HDNNM-CSA technique with respect to existing approaches. Full article

Background: Accurate identification of cancer driver genes is essential for understanding tumorigenesis and developing targeted therapies. Although graph neural networks (GNNs) have advanced multi-omics integration, existing methods often simply concatenate omics features and underutilize the topological information of biological networks. Methods: We propose M-GNN, a multi-modal GNN framework for cancer driver gene prediction. It employs separate Graph Convolutional Network (GCN) encoders to process four types of omics data (mutation, expression, methylation, copy number variation (CNV)), each represented as a 16-dimensional vector. We incorporate knowledge distillation by using soft labels from a pre-trained teacher model to enhance feature representation. An attention mechanism adaptively fuses the encoded omics features, and a dual-path classifier combining a GCN and a Multilayer Perceptron (MLP) preserves both intrinsic gene properties and network topology. Results: Experiments on three public protein–protein interaction (PPI) networks show that M-GNN consistently achieves the highest or second-highest AUPRC compared to five state-of-the-art methods. Ablation studies confirm the contribution of each module, and biological interpretability analysis—including analysis of GO enrichment and drug sensitivity—validates the reliability of the predicted genes. Conclusions: M-GNN provides a robust and interpretable computational tool for systematic cancer driver gene identification, effectively integrating multi-omics and network data. Full article