Dear Editor,D2This letter presents a node feature similarity preserving graph convolutional framework P G.Graph neural networks(GNNs)have garnered significant attention for their efficacy in learning graph representat...Dear Editor,D2This letter presents a node feature similarity preserving graph convolutional framework P G.Graph neural networks(GNNs)have garnered significant attention for their efficacy in learning graph representations across diverse real-world applications.展开更多
Distributed Denial of Service(DDoS)attacks are one of the severe threats to network infrastructure,sometimes bypassing traditional diagnosis algorithms because of their evolving complexity.PresentMachine Learning(ML)t...Distributed Denial of Service(DDoS)attacks are one of the severe threats to network infrastructure,sometimes bypassing traditional diagnosis algorithms because of their evolving complexity.PresentMachine Learning(ML)techniques for DDoS attack diagnosis normally apply network traffic statistical features such as packet sizes and inter-arrival times.However,such techniques sometimes fail to capture complicated relations among various traffic flows.In this paper,we present a new multi-scale ensemble strategy given the Graph Neural Networks(GNNs)for improving DDoS detection.Our technique divides traffic into macro-and micro-level elements,letting various GNN models to get the two corase-scale anomalies and subtle,stealthy attack models.Through modeling network traffic as graph-structured data,GNNs efficiently learn intricate relations among network entities.The proposed ensemble learning algorithm combines the results of several GNNs to improve generalization,robustness,and scalability.Extensive experiments on three benchmark datasets—UNSW-NB15,CICIDS2017,and CICDDoS2019—show that our approach outperforms traditional machine learning and deep learning models in detecting both high-rate and low-rate(stealthy)DDoS attacks,with significant improvements in accuracy and recall.These findings demonstrate the suggested method’s applicability and robustness for real-world implementation in contexts where several DDoS patterns coexist.展开更多
Dear Editor,This letter addresses the critical challenge of preserving privacy in graph learning without compromising on data utility.Differential privacy(DP)is emerging as an effective method for privacy-preserving g...Dear Editor,This letter addresses the critical challenge of preserving privacy in graph learning without compromising on data utility.Differential privacy(DP)is emerging as an effective method for privacy-preserving graph learning.However,its application often diminishes data utility,especially for nodes with fewer neighbors in graph neural networks(GNNs).展开更多
With network attack technology continuing to develop,traditional anomaly traffic detection methods that rely on feature engineering are increasingly insufficient in efficiency and accuracy.Graph Neural Network(GNN),a ...With network attack technology continuing to develop,traditional anomaly traffic detection methods that rely on feature engineering are increasingly insufficient in efficiency and accuracy.Graph Neural Network(GNN),a promising Deep Learning(DL)approach,has proven to be highly effective in identifying intricate patterns in graph⁃structured data and has already found wide applications in the field of network security.In this paper,we propose a hybrid Graph Convolutional Network(GCN)⁃GraphSAGE model for Anomaly Traffic Detection,namely HGS⁃ATD,which aims to improve the accuracy of anomaly traffic detection by leveraging edge feature learning to better capture the relationships between network entities.We validate the HGS⁃ATD model on four publicly available datasets,including NF⁃UNSW⁃NB15⁃v2.The experimental results show that the enhanced hybrid model is 5.71%to 10.25%higher than the baseline model in terms of accuracy,and the F1⁃score is 5.53%to 11.63%higher than the baseline model,proving that the model can effectively distinguish normal traffic from attack traffic and accurately classify various types of attacks.展开更多
Skin diseases affect millions worldwide.Early detection is key to preventing disfigurement,lifelong disability,or death.Dermoscopic images acquired in primary-care settings show high intra-class visual similarity and ...Skin diseases affect millions worldwide.Early detection is key to preventing disfigurement,lifelong disability,or death.Dermoscopic images acquired in primary-care settings show high intra-class visual similarity and severe class imbalance,and occasional imaging artifacts can create ambiguity for state-of-the-art convolutional neural networks(CNNs).We frame skin lesion recognition as graph-based reasoning and,to ensure fair evaluation and avoid data leakage,adopt a strict lesion-level partitioning strategy.Each image is first over-segmented using SLIC(Simple Linear Iterative Clustering)to produce perceptually homogeneous superpixels.These superpixels form the nodes of a region-adjacency graph whose edges encode spatial continuity.Node attributes are 1280-dimensional embeddings extracted with a lightweight yet expressive EfficientNet-B0 backbone,providing strong representational power at modest computational cost.The resulting graphs are processed by a five-layer Graph Attention Network(GAT)that learns to weight inter-node relationships dynamically and aggregates multi-hop context before classifying lesions into seven classes with a log-softmax output.Extensive experiments on the DermaMNIST benchmark show the proposed pipeline achieves 88.35%accuracy and 98.04%AUC,outperforming contemporary CNNs,AutoML approaches,and alternative graph neural networks.An ablation study indicates EfficientNet-B0 produces superior node descriptors compared with ResNet-18 and DenseNet,and that roughly five GAT layers strike a good balance between being too shallow and over-deep while avoiding oversmoothing.The method requires no data augmentation or external metadata,making it a drop-in upgrade for clinical computer-aided diagnosis systems.展开更多
A dynamic graph(DG)is adopted to portray the evolving interplay between nodes in real-world scenarios prevalently.A high-order graph convolutional network(HGCN)is equipped with the ability to represent a DG by the spa...A dynamic graph(DG)is adopted to portray the evolving interplay between nodes in real-world scenarios prevalently.A high-order graph convolutional network(HGCN)is equipped with the ability to represent a DG by the spatial-temporal message passing mechanism built on tensor product.Concretely,an HGCN utilizes the discrete Fourier transform(DFT)to implement temporal message passing and then employs face-wise product to realize spatial message passing.However,DFT is only a special case of assorted time-frequency transforms,which considers the complex temporal patterns partially,thereby resulting in an inaccurate temporal message passing possibly.To address this issue,this study proposes six advanced time-frequency transform-incorporated HGCNs(TF-HGCNs)with discrete Fourier,discrete Hartley,discrete cosine,Haar wavelet,Walsh Hadamard,and slant transforms.In addition,a potent ensemble is built regarding the proposed six TF-HGCNs as the bases.Finally,the corresponding theoretical proof is presented.Empirical studies on six DG datasets demonstrate that owing to diverse time-frequency transforms,the proposed six TF-HGCNs significantly outperform state-of-the-art models in addressing the task of link weight estimation.Moreover,their ensemble outstrips each base's performance.展开更多
The reliable operation of power grid secondary equipment is an important guarantee for the safety and stability of the power system.However,various defects could be produced in the secondary equipment during longtermo...The reliable operation of power grid secondary equipment is an important guarantee for the safety and stability of the power system.However,various defects could be produced in the secondary equipment during longtermoperation.The complex relationship between the defect phenomenon andmulti-layer causes and the probabilistic influence of secondary equipment cannot be described through knowledge extraction and fusion technology by existing methods,which limits the real-time and accuracy of defect identification.Therefore,a defect recognition method based on the Bayesian network and knowledge graph fusion is proposed.The defect data of secondary equipment is transformed into the structured knowledge graph through knowledge extraction and fusion technology.The knowledge graph of power grid secondary equipment is mapped to the Bayesian network framework,combined with historical defect data,and introduced Noisy-OR nodes.The prior and conditional probabilities of the Bayesian network are then reasonably assigned to build a model that reflects the probability dependence between defect phenomena and potential causes in power grid secondary equipment.Defect identification of power grid secondary equipment is achieved by defect subgraph search based on the knowledge graph,and defect inference based on the Bayesian network.Practical application cases prove this method’s effectiveness in identifying secondary equipment defect causes,improving identification accuracy and efficiency.展开更多
Since the advent of smart contracts,security vulnerabilities have remained a persistent challenge,compromsing both the reliability of contract execution and the overall stability of the virtual currency market.Consequ...Since the advent of smart contracts,security vulnerabilities have remained a persistent challenge,compromsing both the reliability of contract execution and the overall stability of the virtual currency market.Consequently,the academic community has devoted increasing attention to these security risks.However,conventional approaches to vulnerability detection frequently exhibit limited accuracy.To address this limitation,the present study introduces a novel vulnerability detection framework called GNNSE that integrates symbolic execution with graph neural networks(GNNs).The proposedmethod first constructs semantic graphs to comprehensively capture the control flow and data flow dependencies within smart contracts.These graphs are subsequently processed using GNNs to efficiently identify contracts with a high likelihood of vulnerabilities.For these high-risk contracts,symbolic execution is employed to perform fine-grained,path-level analysis,thereby improving overall detection precision.Experimental results on a dataset comprising 10,079 contracts demonstrate that the proposed method achieves detection precisions of 93.58% for reentrancy vulnerabilities and 92.73% for timestamp-dependent vulnerabilities.展开更多
Log anomaly detection is essential for maintaining the reliability and security of large-scale networked systems.Most traditional techniques rely on log parsing in the reprocessing stage and utilize handcrafted featur...Log anomaly detection is essential for maintaining the reliability and security of large-scale networked systems.Most traditional techniques rely on log parsing in the reprocessing stage and utilize handcrafted features that limit their adaptability across various systems.In this study,we propose a hybrid model,BertGCN,that integrates BERT-based contextual embedding with Graph Convolutional Networks(GCNs)to identify anomalies in raw system logs,thereby eliminating the need for log parsing.TheBERT module captures semantic representations of log messages,while the GCN models the structural relationships among log entries through a text-based graph.This combination enables BertGCN to capture both the contextual and semantic characteristics of log data.BertGCN showed excellent performance on the HDFS and BGL datasets,demonstrating its effectiveness and resilience in detecting anomalies.Compared to multiple baselines,our proposed BertGCN showed improved precision,recall,and F1 scores.展开更多
The adjoint method is widely used in gradient-based optimization with high-dimensional design variables.However,the cost of solving the adjoint equations in each iteration is comparable to that of solving the flow fie...The adjoint method is widely used in gradient-based optimization with high-dimensional design variables.However,the cost of solving the adjoint equations in each iteration is comparable to that of solving the flow field,resulting in expensive computational costs.To improve the efficiency of solving adjoint equations,we propose a physics-constrained graph neural networks for solving adjoint equations,named ADJ-PCGN.ADJ-PCGN establishes a mapping relationship between flow characteristics and adjoint vector based on data,serving as a replacement for the computationally expensive numerical solution of adjoint equations.A physics-based graph structure and message-passing mechanism are designed to endow its strong fitting and generalization capabilities.Taking transonic drag reduction and maximum lift-drag ratio of the airfoil as examples,results indicate that ADJ-PCGN attains a similar optimal shape as the classical direct adjoint loop method.In addition,ADJ-PCGN demonstrates strong generalization capabilities across different mesh topologies,mesh densities,and out-of-distribution conditions.It holds the potential to become a universal model for aerodynamic shape optimization involving states,geometries,and meshes.展开更多
Accurate,up to date,and quick information related to any disaster supports disaster management team/authorities to perform quick,easy,and cost-effective response to enhance rescue operations to alleviate the possible ...Accurate,up to date,and quick information related to any disaster supports disaster management team/authorities to perform quick,easy,and cost-effective response to enhance rescue operations to alleviate the possible loss of lives,financial risks,and properties.Due to damaged infrastructure in disaster-affected areas,social media is the only way to share/exchange real time information.Therefore,‘X’(formerly Twitter)has become a major platform for disseminating real-time information during disaster events or emergencies,i.e.,floods and earthquake.Rapid identification of actionable content is critical for effective humanitarian response;however,the brief and noisy nature of tweets makes automated classification challenging.To tackle this problem,this study proposes a hybrid classification framework that integrates term frequency–inverse document frequency(TF-IDF)features with graph convolutional networks(GCNs)to enhance disaster-related tweet analysis.The proposed model performs three classification tasks:identifying disaster-related tweets(achieving 94.47%accuracy),categorizing disaster types(earthquake,flood,and non-disaster)with 91.78%accuracy,and detecting aid requests such as food,donations,and medical assistance(94.64%accuracy).By combining the statistical strengths of TF-IDF with the relational learning capabilities of GCNs,the model attains high accuracy while maintaining computational efficiency and interpretability.The results demonstrate the framework’s strong potential for real-time disaster response,offering valuable insights to support emergency management systems and humanitarian decision-making.展开更多
Leakage events occurring at multiple locations simultaneously generate overlapping and topologydependent pressure signatures,making reliable detection and subsequent restoration planning a persistent challenge in wate...Leakage events occurring at multiple locations simultaneously generate overlapping and topologydependent pressure signatures,making reliable detection and subsequent restoration planning a persistent challenge in water distribution systems(WDSs).While recent data-driven techniques have improved the ability to identify anomalous hydraulic behavior,most approaches remain limited to the detection stage and offer little guidance on how utilities should prioritize repairs once multiple failures are identified.To bridge this gap,this study proposes an integrated framework that links topology-aware leakage detection with quantitative restoration prioritization.First,a multi-task learning framework based on Graph Attention Networks(GAT)is employed to jointly detect both the location and magnitude of multiple leakages by explicitly incorporating hydraulic responses and network topology into the learning process.The model’s detection robustness is evaluated across networks with contrasting looped,branched,and hybrid topologies to examine how structural characteristics influence detection accuracy under multievent conditions.Second,the study develops a restoration-planning module that constructs a two-objective decision space combining restoration cost and segment vulnerability,where the latter accounts for disruption potential arising from hydraulic importance and local service connectivity.Non-dominated sorting is used to derive Pareto-optimal restoration sequences,enabling explicit quantification of the trade-offs between operational cost and service disruption.This provides decision-makers with a ranked set of restoration orders that reflect both hydraulic impact and functional risk,rather than relying on heuristics or cost-only criteria.Notably,the proposed framework separates offline training from online inference,requiring only a single forward pass for real-time decision-making without the need for iterative hydraulic simulations.Results demonstrate that topology strongly governs both detection performance and the structure of optimal repair sequences,underscoring the importance of integrating network-aware learning with multi-criteria restoration evaluation.展开更多
Social bots are automated programs designed to spread rumors and misinformation,posing significant threats to online security.Existing research shows that the structure of a social network significantly affects the be...Social bots are automated programs designed to spread rumors and misinformation,posing significant threats to online security.Existing research shows that the structure of a social network significantly affects the behavioral patterns of social bots:a higher number of connected components weakens their collaborative capabilities,thereby reducing their proportion within the overall network.However,current social bot detection methods still make limited use of topological features.Furthermore,both graph neural network(GNN)-based methods that rely on local features and those that leverage global features suffer from their own limitations,and existing studies lack an effective fusion of multi-scale information.To address these issues,this paper proposes a topology-aware multi-scale social bot detection method,which jointly learns local and global representations through a co-training mechanism.At the local level,topological features are effectively embedded into node representations,enhancing expressiveness while alleviating the over-smoothing problem in GNNs.At the global level,a clustering attention mechanism is introduced to learn global node representations,mitigating the over-globalization problem.Experimental results demonstrate that our method effectively overcomes the limitations of single-scale approaches.Our code is publicly available at https://anonymous.4open.science/r/TopoMSG-2C41/(accessed on 27 October 2025).展开更多
Temporal alignment of multisensor time series(MTS)is a critical prerequisite for accurate modeling and optimal control in subsequent data-driven applications.Nevertheless,many approaches frequently neglect to consider...Temporal alignment of multisensor time series(MTS)is a critical prerequisite for accurate modeling and optimal control in subsequent data-driven applications.Nevertheless,many approaches frequently neglect to consider the complex interdependencies between different sensors in MTS,and temporal alignment in many methods is typically treated as an isolated task disconnected from the downstream objectives,leading to unsatisfactory performances in follow-up applications.To address these challenges,this paper proposes a novel knowledge graph(KG)-guided iterative-updating graph neural network(GNN)for time-delay estimation(TDE)in MTS.Initially,a domain-specific KG is constructed from domain mechanism knowledge,providing a foundation for GNN's initialization.Next,capitalizing on the inherent structure of the graph topology,a GNN-based TDE method is developed.Then,a customized loss function is constructed,which synthesizes both the performances of downstream tasks and graph-based constraints.Moreover,an innovative algorithm for GNN structure learning and iterative-updating is proposed to renovate the graph structure further.Finally,experimental results across various regression and classification tasks on numerical simulation,public datasets,and the real blast furnace ironmaking dataset demonstrate that the proposed method can achieve accurate temporal alignment of MTS.展开更多
This study proposes a novel forecasting framework that simultaneously captures the strong periodicity and irregular meteorological fluctuations inherent in solar radiation time series.Existing approaches typically def...This study proposes a novel forecasting framework that simultaneously captures the strong periodicity and irregular meteorological fluctuations inherent in solar radiation time series.Existing approaches typically define inter-regional correlations using either simple correlation coefficients or distance-based measures when applying spatio-temporal graph neural networks(STGNNs).However,such definitions are prone to generating spurious correlations due to the dominance of periodic structures.To address this limitation,we adopt the Elastic-Band Transform(EBT)to decompose solar radiation into periodic and amplitude-modulated components,which are then modeled independently with separate graph neural networks.The periodic component,characterized by strong nationwide correlations,is learned with a relatively simple architecture,whereas the amplitude-modulated component is modeled with more complex STGNNs that capture climatological similarities between regions.The predictions from the two components are subsequently recombined to yield final forecasts that integrate both periodic patterns and aperiodic variability.The proposed framework is validated with multiple STGNN architectures,and experimental results demonstrate improved predictive accuracy and interpretability compared to conventional methods.展开更多
Graph neural networks(GNN)have shown strong performance in node classification tasks,yet most existing models rely on uniform or shared weight aggregation,lacking flexibility in modeling the varying strength of relati...Graph neural networks(GNN)have shown strong performance in node classification tasks,yet most existing models rely on uniform or shared weight aggregation,lacking flexibility in modeling the varying strength of relationships among nodes.This paper proposes a novel graph coupling convolutional model that introduces an adaptive weighting mechanism to assign distinct importance to neighboring nodes based on their similarity to the central node.Unlike traditional methods,the proposed coupling strategy enhances the interpretability of node interactions while maintaining competitive classification performance.The model operates in the spatial domain,utilizing adjacency list structures for efficient convolution and addressing the limitations of weight sharing through a coupling-based similarity computation.Extensive experiments are conducted on five graph-structured datasets,including Cora,Citeseer,PubMed,Reddit,and BlogCatalog,as well as a custom topology dataset constructed from the Open University Learning Analytics Dataset(OULAD)educational platform.Results demonstrate that the proposed model achieves good classification accuracy,while significantly reducing training time through direct second-order neighbor fusion and data preprocessing.Moreover,analysis of neighborhood order reveals that considering third-order neighbors offers limited accuracy gains but introduces considerable computational overhead,confirming the efficiency of first-and second-order convolution in practical applications.Overall,the proposed graph coupling model offers a lightweight,interpretable,and effective framework for multi-label node classification in complex networks.展开更多
In this paper,we propose a novel graph signal processing convolution recurrent network(GSP CRN)for signal enhancement against high suppressive interference(HSI)in wireless communications.GSPCRN consists of the short-t...In this paper,we propose a novel graph signal processing convolution recurrent network(GSP CRN)for signal enhancement against high suppressive interference(HSI)in wireless communications.GSPCRN consists of the short-time graph signal processing(SGSP)approach and a modified convolution recurrent network.Similar to the traditional shorttime time-frequency transformation,SGSP frames the complex-valued communication signal and transforms it to the graph-domain representations,where the connection and weight flexibility of each vertex are fully taken into account.In the presence of HSI,SGSP can extract signal features from new graph-domain dimensions and empower neural networks for weak signal enhancement.Two SGSP methods,adjacency singular value decomposition and implicit graph transformation,are designed to capture relationships among the sampling points in the segmented signals.Simulation results demonstrate that our proposed GSPCRN outperforms existing classic methods in extracting weak signals from the HSI environment.When the interference-to-signal ratio exceeds 27dB,only our proposed GSPCRN can achieve the interference mitigation.展开更多
Deep graph contrastive clustering has attracted widespread attentions due to its self-supervised representation learning paradigm and superior clustering performance.Although,two challenges emerge and result in high c...Deep graph contrastive clustering has attracted widespread attentions due to its self-supervised representation learning paradigm and superior clustering performance.Although,two challenges emerge and result in high computational costs.Most existing contrastive methods adopt the data augmentation and then representation learning strategy,where representation learning with trainable graph convolution is coupled with complex and fixed data augmentation,inevitably limiting the efficiency and flexibility.The similarity metric between positive-negative sample pairs is complex and contrastive objective is partial,limiting the discriminability of representation learning.To solve these challenges,a novel wide graph clustering network(WGCN)adhering to representation and then augmentation framework is proposed,which mainly consists of multiorder filter fusion(MFF)and double-level contrastive learning(DCL)modules.Specifically,the MFF module integrates multiorder low-pass filters to extract smooth and multi-scale topological features,utilizing self-attention fusion to reduce redundancy and obtain comprehensive embedding representation.Further,the DCL module constructs two augmented views by the parallel parameter-unshared Siamese encoders rather than complex augmentations on graph.To achieve simple yet effective self-supervised learning,representation self-supervision and structural consistency oriented double-level contrastive loss is designed,where representation self-supervision maximizes the agreement between pairwise augmented embedding representations and structural consistency promotes the mutual information correlation between appending neighborhoods with similar semantics.Extensive experiments on six benchmark datasets demonstrate the superiority of the proposed WGCN,especially highlighting its time-saving characteristic.The code could be available in the https://github.com/Tianxiang Zhao0474/WGCN.展开更多
The development of brain-computer interfaces(BCI)based on motor imagery(MI)has greatly improved patients’quality of life with movement disorders.The classification of upper limb MI has been widely studied and applied...The development of brain-computer interfaces(BCI)based on motor imagery(MI)has greatly improved patients’quality of life with movement disorders.The classification of upper limb MI has been widely studied and applied in many fields,including rehabilitation.However,the physiological representations of left and right lower limb movements are too close and activated deep in the cerebral cortex,making it difficult to distinguish their features.Therefore,classifying lower limbs motor imagery is more challenging.In this study,we propose a feature extraction method based on functional connectivity,which utilizes phase-locked values to construct a functional connectivity matrix as the features of the left and right legs,which can effectively avoid the problem of physiological representations of the left and right lower limbs being too close to each other during movement.In addition,considering the topology and the temporal characteristics of the electroencephalogram(EEG),we designed a temporal-spatial convolutional network(TSGCN)to capture the spatiotemporal information for classification.Experimental results show that the accuracy of the proposed method is higher than that of existing methods,achieving an average classification accuracy of 73.58%on the internal dataset.Finally,this study explains the network mechanism of left and right foot MI from the perspective of graph theoretic features and demonstrates the feasibility of decoding lower limb MI.展开更多
Natural rubber(NR)latex is a renewable colloidal dispersion used in medical gloves,coatings,and flexible products.It is known for its excellent elasticity and film-forming ability but is limited by insufficient mechan...Natural rubber(NR)latex is a renewable colloidal dispersion used in medical gloves,coatings,and flexible products.It is known for its excellent elasticity and film-forming ability but is limited by insufficient mechanical robustness and chemical resistance.Incorporating nanofillers,such as graphene oxide(GO),is an effective approach to enhance its performance;however,achieving strong interfacial compatibility between hydrophilic GO and the nonpolar rubber matrix remains challenging.To overcome this issue,a multifunctional interfacial design inspired by mussel adhesion chemistry was developed to construct a hierarchical and cohesive GO network within the NR latex matrix.A tannic acid-based modifier(TM)bearing catechol and thiol groups was synthesized and anchored onto latex particles via hydrogen bonding with surface proteins and phospholipids,enabling subsequentπ-πinteractions and hydrogen bonding with GO nanosheets.This guided the selective self-assembly of GO into a continuous segregated network along the latex particle boundaries.Hierarchical interface reinforcement was achieved through Eu^(3+)ligand coordination.The incorporation of GO and enhancement of interfacial interactions promoted strain-induced crystallization,resulting in increased crystallinity and improved load transfer.The resulting composite film containing 0.5 part per hundred rubber GO and the bioinspired interface exhibited a tensile strength that was 107.8%higher than that of the pure NR latex film,while maintaining an elongation at break of 915%.Tear strength increased by 118.5%,toughness reached 61.7 MJ/m~3,nitrogen permeability decreased by 20.1%,and antibacterial efficiency against both Escherichia coli and Staphylococcus aureus reached 99.9%.The films also exhibited enhanced resistance to organic solvents,acids,and alkalis.This study provides a green and scalable strategy for fabricating high-performance NR latex-based products suitable for medical,protective,and engineering applications.展开更多
基金supported by the National Natural Science Foundation of China(62402399)the New Chongqing Youth Innovation Talent Project(CSTB2024NSCQ-QCXMX0035)。
文摘Dear Editor,D2This letter presents a node feature similarity preserving graph convolutional framework P G.Graph neural networks(GNNs)have garnered significant attention for their efficacy in learning graph representations across diverse real-world applications.
文摘Distributed Denial of Service(DDoS)attacks are one of the severe threats to network infrastructure,sometimes bypassing traditional diagnosis algorithms because of their evolving complexity.PresentMachine Learning(ML)techniques for DDoS attack diagnosis normally apply network traffic statistical features such as packet sizes and inter-arrival times.However,such techniques sometimes fail to capture complicated relations among various traffic flows.In this paper,we present a new multi-scale ensemble strategy given the Graph Neural Networks(GNNs)for improving DDoS detection.Our technique divides traffic into macro-and micro-level elements,letting various GNN models to get the two corase-scale anomalies and subtle,stealthy attack models.Through modeling network traffic as graph-structured data,GNNs efficiently learn intricate relations among network entities.The proposed ensemble learning algorithm combines the results of several GNNs to improve generalization,robustness,and scalability.Extensive experiments on three benchmark datasets—UNSW-NB15,CICIDS2017,and CICDDoS2019—show that our approach outperforms traditional machine learning and deep learning models in detecting both high-rate and low-rate(stealthy)DDoS attacks,with significant improvements in accuracy and recall.These findings demonstrate the suggested method’s applicability and robustness for real-world implementation in contexts where several DDoS patterns coexist.
基金supported by the National Key Research and Development Program of China(2023YFF0612900,2023YFF0612902)the Natural Science Foundation of Beijing,China(4254086)+3 种基金the National Natural Science Foundation of China(62472032)the Open Project Funding of Key Laboratory of Mobile Application Innovation and Governance Technology,Ministry of Industry and Information Technology(2023IFS080601-K)the Beijing Institute of Technology Research Fund Program for Young Scholarsthe Young Elite Scientists Sponsorship Program by CAST(2023QNRC001)。
文摘Dear Editor,This letter addresses the critical challenge of preserving privacy in graph learning without compromising on data utility.Differential privacy(DP)is emerging as an effective method for privacy-preserving graph learning.However,its application often diminishes data utility,especially for nodes with fewer neighbors in graph neural networks(GNNs).
基金National Natural Science Foundation of China(Grant No.62103434)National Science Fund for Distinguished Young Scholars(Grant No.62176263).
文摘With network attack technology continuing to develop,traditional anomaly traffic detection methods that rely on feature engineering are increasingly insufficient in efficiency and accuracy.Graph Neural Network(GNN),a promising Deep Learning(DL)approach,has proven to be highly effective in identifying intricate patterns in graph⁃structured data and has already found wide applications in the field of network security.In this paper,we propose a hybrid Graph Convolutional Network(GCN)⁃GraphSAGE model for Anomaly Traffic Detection,namely HGS⁃ATD,which aims to improve the accuracy of anomaly traffic detection by leveraging edge feature learning to better capture the relationships between network entities.We validate the HGS⁃ATD model on four publicly available datasets,including NF⁃UNSW⁃NB15⁃v2.The experimental results show that the enhanced hybrid model is 5.71%to 10.25%higher than the baseline model in terms of accuracy,and the F1⁃score is 5.53%to 11.63%higher than the baseline model,proving that the model can effectively distinguish normal traffic from attack traffic and accurately classify various types of attacks.
基金funded by the Deanship of Graduate Studies and Scientific Research at Jouf University under grant No.(DGSSR-2025-02-01296).
文摘Skin diseases affect millions worldwide.Early detection is key to preventing disfigurement,lifelong disability,or death.Dermoscopic images acquired in primary-care settings show high intra-class visual similarity and severe class imbalance,and occasional imaging artifacts can create ambiguity for state-of-the-art convolutional neural networks(CNNs).We frame skin lesion recognition as graph-based reasoning and,to ensure fair evaluation and avoid data leakage,adopt a strict lesion-level partitioning strategy.Each image is first over-segmented using SLIC(Simple Linear Iterative Clustering)to produce perceptually homogeneous superpixels.These superpixels form the nodes of a region-adjacency graph whose edges encode spatial continuity.Node attributes are 1280-dimensional embeddings extracted with a lightweight yet expressive EfficientNet-B0 backbone,providing strong representational power at modest computational cost.The resulting graphs are processed by a five-layer Graph Attention Network(GAT)that learns to weight inter-node relationships dynamically and aggregates multi-hop context before classifying lesions into seven classes with a log-softmax output.Extensive experiments on the DermaMNIST benchmark show the proposed pipeline achieves 88.35%accuracy and 98.04%AUC,outperforming contemporary CNNs,AutoML approaches,and alternative graph neural networks.An ablation study indicates EfficientNet-B0 produces superior node descriptors compared with ResNet-18 and DenseNet,and that roughly five GAT layers strike a good balance between being too shallow and over-deep while avoiding oversmoothing.The method requires no data augmentation or external metadata,making it a drop-in upgrade for clinical computer-aided diagnosis systems.
基金supported in part by the National Natural Science Foundation of China(62372385,62272078,62002337)Chongqing Natural Science Foundation(CSTB2022NSCQ-MSX1486,CSTB2023NSCQ-LZX0069)。
文摘A dynamic graph(DG)is adopted to portray the evolving interplay between nodes in real-world scenarios prevalently.A high-order graph convolutional network(HGCN)is equipped with the ability to represent a DG by the spatial-temporal message passing mechanism built on tensor product.Concretely,an HGCN utilizes the discrete Fourier transform(DFT)to implement temporal message passing and then employs face-wise product to realize spatial message passing.However,DFT is only a special case of assorted time-frequency transforms,which considers the complex temporal patterns partially,thereby resulting in an inaccurate temporal message passing possibly.To address this issue,this study proposes six advanced time-frequency transform-incorporated HGCNs(TF-HGCNs)with discrete Fourier,discrete Hartley,discrete cosine,Haar wavelet,Walsh Hadamard,and slant transforms.In addition,a potent ensemble is built regarding the proposed six TF-HGCNs as the bases.Finally,the corresponding theoretical proof is presented.Empirical studies on six DG datasets demonstrate that owing to diverse time-frequency transforms,the proposed six TF-HGCNs significantly outperform state-of-the-art models in addressing the task of link weight estimation.Moreover,their ensemble outstrips each base's performance.
基金supported by the State Grid Southwest Branch Project“Research on Defect Diagnosis and Early Warning Technology of Relay Protection and Safety Automation Devices Based on Multi-Source Heterogeneous Defect Data”.
文摘The reliable operation of power grid secondary equipment is an important guarantee for the safety and stability of the power system.However,various defects could be produced in the secondary equipment during longtermoperation.The complex relationship between the defect phenomenon andmulti-layer causes and the probabilistic influence of secondary equipment cannot be described through knowledge extraction and fusion technology by existing methods,which limits the real-time and accuracy of defect identification.Therefore,a defect recognition method based on the Bayesian network and knowledge graph fusion is proposed.The defect data of secondary equipment is transformed into the structured knowledge graph through knowledge extraction and fusion technology.The knowledge graph of power grid secondary equipment is mapped to the Bayesian network framework,combined with historical defect data,and introduced Noisy-OR nodes.The prior and conditional probabilities of the Bayesian network are then reasonably assigned to build a model that reflects the probability dependence between defect phenomena and potential causes in power grid secondary equipment.Defect identification of power grid secondary equipment is achieved by defect subgraph search based on the knowledge graph,and defect inference based on the Bayesian network.Practical application cases prove this method’s effectiveness in identifying secondary equipment defect causes,improving identification accuracy and efficiency.
基金supported by the National Key Research and Development Program of China(2020YFB1005704).
文摘Since the advent of smart contracts,security vulnerabilities have remained a persistent challenge,compromsing both the reliability of contract execution and the overall stability of the virtual currency market.Consequently,the academic community has devoted increasing attention to these security risks.However,conventional approaches to vulnerability detection frequently exhibit limited accuracy.To address this limitation,the present study introduces a novel vulnerability detection framework called GNNSE that integrates symbolic execution with graph neural networks(GNNs).The proposedmethod first constructs semantic graphs to comprehensively capture the control flow and data flow dependencies within smart contracts.These graphs are subsequently processed using GNNs to efficiently identify contracts with a high likelihood of vulnerabilities.For these high-risk contracts,symbolic execution is employed to perform fine-grained,path-level analysis,thereby improving overall detection precision.Experimental results on a dataset comprising 10,079 contracts demonstrate that the proposed method achieves detection precisions of 93.58% for reentrancy vulnerabilities and 92.73% for timestamp-dependent vulnerabilities.
基金funded by the Deanship of Scientific Research(DSR)at King Abdulaziz University,Jeddah,under grant no.(GPIP:1074-612-2024).
文摘Log anomaly detection is essential for maintaining the reliability and security of large-scale networked systems.Most traditional techniques rely on log parsing in the reprocessing stage and utilize handcrafted features that limit their adaptability across various systems.In this study,we propose a hybrid model,BertGCN,that integrates BERT-based contextual embedding with Graph Convolutional Networks(GCNs)to identify anomalies in raw system logs,thereby eliminating the need for log parsing.TheBERT module captures semantic representations of log messages,while the GCN models the structural relationships among log entries through a text-based graph.This combination enables BertGCN to capture both the contextual and semantic characteristics of log data.BertGCN showed excellent performance on the HDFS and BGL datasets,demonstrating its effectiveness and resilience in detecting anomalies.Compared to multiple baselines,our proposed BertGCN showed improved precision,recall,and F1 scores.
基金supported by the National Natural Science Foundation of China(Grant No.12272316).
文摘The adjoint method is widely used in gradient-based optimization with high-dimensional design variables.However,the cost of solving the adjoint equations in each iteration is comparable to that of solving the flow field,resulting in expensive computational costs.To improve the efficiency of solving adjoint equations,we propose a physics-constrained graph neural networks for solving adjoint equations,named ADJ-PCGN.ADJ-PCGN establishes a mapping relationship between flow characteristics and adjoint vector based on data,serving as a replacement for the computationally expensive numerical solution of adjoint equations.A physics-based graph structure and message-passing mechanism are designed to endow its strong fitting and generalization capabilities.Taking transonic drag reduction and maximum lift-drag ratio of the airfoil as examples,results indicate that ADJ-PCGN attains a similar optimal shape as the classical direct adjoint loop method.In addition,ADJ-PCGN demonstrates strong generalization capabilities across different mesh topologies,mesh densities,and out-of-distribution conditions.It holds the potential to become a universal model for aerodynamic shape optimization involving states,geometries,and meshes.
文摘Accurate,up to date,and quick information related to any disaster supports disaster management team/authorities to perform quick,easy,and cost-effective response to enhance rescue operations to alleviate the possible loss of lives,financial risks,and properties.Due to damaged infrastructure in disaster-affected areas,social media is the only way to share/exchange real time information.Therefore,‘X’(formerly Twitter)has become a major platform for disseminating real-time information during disaster events or emergencies,i.e.,floods and earthquake.Rapid identification of actionable content is critical for effective humanitarian response;however,the brief and noisy nature of tweets makes automated classification challenging.To tackle this problem,this study proposes a hybrid classification framework that integrates term frequency–inverse document frequency(TF-IDF)features with graph convolutional networks(GCNs)to enhance disaster-related tweet analysis.The proposed model performs three classification tasks:identifying disaster-related tweets(achieving 94.47%accuracy),categorizing disaster types(earthquake,flood,and non-disaster)with 91.78%accuracy,and detecting aid requests such as food,donations,and medical assistance(94.64%accuracy).By combining the statistical strengths of TF-IDF with the relational learning capabilities of GCNs,the model attains high accuracy while maintaining computational efficiency and interpretability.The results demonstrate the framework’s strong potential for real-time disaster response,offering valuable insights to support emergency management systems and humanitarian decision-making.
基金supported by the Korea Environmental Industry&Technology Institute(KEITI)through Water Management Program for Drought,funded by Korea Ministry of Environment(MOE)(RS-2023-00231944)supported by the research grant of the Gyeongsang National University in 2023。
文摘Leakage events occurring at multiple locations simultaneously generate overlapping and topologydependent pressure signatures,making reliable detection and subsequent restoration planning a persistent challenge in water distribution systems(WDSs).While recent data-driven techniques have improved the ability to identify anomalous hydraulic behavior,most approaches remain limited to the detection stage and offer little guidance on how utilities should prioritize repairs once multiple failures are identified.To bridge this gap,this study proposes an integrated framework that links topology-aware leakage detection with quantitative restoration prioritization.First,a multi-task learning framework based on Graph Attention Networks(GAT)is employed to jointly detect both the location and magnitude of multiple leakages by explicitly incorporating hydraulic responses and network topology into the learning process.The model’s detection robustness is evaluated across networks with contrasting looped,branched,and hybrid topologies to examine how structural characteristics influence detection accuracy under multievent conditions.Second,the study develops a restoration-planning module that constructs a two-objective decision space combining restoration cost and segment vulnerability,where the latter accounts for disruption potential arising from hydraulic importance and local service connectivity.Non-dominated sorting is used to derive Pareto-optimal restoration sequences,enabling explicit quantification of the trade-offs between operational cost and service disruption.This provides decision-makers with a ranked set of restoration orders that reflect both hydraulic impact and functional risk,rather than relying on heuristics or cost-only criteria.Notably,the proposed framework separates offline training from online inference,requiring only a single forward pass for real-time decision-making without the need for iterative hydraulic simulations.Results demonstrate that topology strongly governs both detection performance and the structure of optimal repair sequences,underscoring the importance of integrating network-aware learning with multi-criteria restoration evaluation.
基金supported by“the Fundamental Research Funds for the Central Universities”(Grant No.CUCAI2511).
文摘Social bots are automated programs designed to spread rumors and misinformation,posing significant threats to online security.Existing research shows that the structure of a social network significantly affects the behavioral patterns of social bots:a higher number of connected components weakens their collaborative capabilities,thereby reducing their proportion within the overall network.However,current social bot detection methods still make limited use of topological features.Furthermore,both graph neural network(GNN)-based methods that rely on local features and those that leverage global features suffer from their own limitations,and existing studies lack an effective fusion of multi-scale information.To address these issues,this paper proposes a topology-aware multi-scale social bot detection method,which jointly learns local and global representations through a co-training mechanism.At the local level,topological features are effectively embedded into node representations,enhancing expressiveness while alleviating the over-smoothing problem in GNNs.At the global level,a clustering attention mechanism is introduced to learn global node representations,mitigating the over-globalization problem.Experimental results demonstrate that our method effectively overcomes the limitations of single-scale approaches.Our code is publicly available at https://anonymous.4open.science/r/TopoMSG-2C41/(accessed on 27 October 2025).
基金supported by the Young Scientists Fund of the National Natural Science Foundation of China(62303491)the Major Program of Xiangjiang Laboratory(22XJ01005)+1 种基金the Science and Technology Innovation Program of Hunan Province(2024RC1007)the Natural Science Foundation of Hunan Province(2025JJ10007)。
文摘Temporal alignment of multisensor time series(MTS)is a critical prerequisite for accurate modeling and optimal control in subsequent data-driven applications.Nevertheless,many approaches frequently neglect to consider the complex interdependencies between different sensors in MTS,and temporal alignment in many methods is typically treated as an isolated task disconnected from the downstream objectives,leading to unsatisfactory performances in follow-up applications.To address these challenges,this paper proposes a novel knowledge graph(KG)-guided iterative-updating graph neural network(GNN)for time-delay estimation(TDE)in MTS.Initially,a domain-specific KG is constructed from domain mechanism knowledge,providing a foundation for GNN's initialization.Next,capitalizing on the inherent structure of the graph topology,a GNN-based TDE method is developed.Then,a customized loss function is constructed,which synthesizes both the performances of downstream tasks and graph-based constraints.Moreover,an innovative algorithm for GNN structure learning and iterative-updating is proposed to renovate the graph structure further.Finally,experimental results across various regression and classification tasks on numerical simulation,public datasets,and the real blast furnace ironmaking dataset demonstrate that the proposed method can achieve accurate temporal alignment of MTS.
基金supported by Basic Science Research Program through the National Research Foundation of Korea(NRF)funded by the Ministry of Education(RS-2023-00249743).
文摘This study proposes a novel forecasting framework that simultaneously captures the strong periodicity and irregular meteorological fluctuations inherent in solar radiation time series.Existing approaches typically define inter-regional correlations using either simple correlation coefficients or distance-based measures when applying spatio-temporal graph neural networks(STGNNs).However,such definitions are prone to generating spurious correlations due to the dominance of periodic structures.To address this limitation,we adopt the Elastic-Band Transform(EBT)to decompose solar radiation into periodic and amplitude-modulated components,which are then modeled independently with separate graph neural networks.The periodic component,characterized by strong nationwide correlations,is learned with a relatively simple architecture,whereas the amplitude-modulated component is modeled with more complex STGNNs that capture climatological similarities between regions.The predictions from the two components are subsequently recombined to yield final forecasts that integrate both periodic patterns and aperiodic variability.The proposed framework is validated with multiple STGNN architectures,and experimental results demonstrate improved predictive accuracy and interpretability compared to conventional methods.
基金Support by Sichuan Science and Technology Program[2023YFSY0026,2023YFH0004]Guangzhou Huashang University[2024HSZD01,HS2023JYSZH01].
文摘Graph neural networks(GNN)have shown strong performance in node classification tasks,yet most existing models rely on uniform or shared weight aggregation,lacking flexibility in modeling the varying strength of relationships among nodes.This paper proposes a novel graph coupling convolutional model that introduces an adaptive weighting mechanism to assign distinct importance to neighboring nodes based on their similarity to the central node.Unlike traditional methods,the proposed coupling strategy enhances the interpretability of node interactions while maintaining competitive classification performance.The model operates in the spatial domain,utilizing adjacency list structures for efficient convolution and addressing the limitations of weight sharing through a coupling-based similarity computation.Extensive experiments are conducted on five graph-structured datasets,including Cora,Citeseer,PubMed,Reddit,and BlogCatalog,as well as a custom topology dataset constructed from the Open University Learning Analytics Dataset(OULAD)educational platform.Results demonstrate that the proposed model achieves good classification accuracy,while significantly reducing training time through direct second-order neighbor fusion and data preprocessing.Moreover,analysis of neighborhood order reveals that considering third-order neighbors offers limited accuracy gains but introduces considerable computational overhead,confirming the efficiency of first-and second-order convolution in practical applications.Overall,the proposed graph coupling model offers a lightweight,interpretable,and effective framework for multi-label node classification in complex networks.
基金supported by he National Social Science Found of China(2022-SKJJ-B-112).
文摘In this paper,we propose a novel graph signal processing convolution recurrent network(GSP CRN)for signal enhancement against high suppressive interference(HSI)in wireless communications.GSPCRN consists of the short-time graph signal processing(SGSP)approach and a modified convolution recurrent network.Similar to the traditional shorttime time-frequency transformation,SGSP frames the complex-valued communication signal and transforms it to the graph-domain representations,where the connection and weight flexibility of each vertex are fully taken into account.In the presence of HSI,SGSP can extract signal features from new graph-domain dimensions and empower neural networks for weak signal enhancement.Two SGSP methods,adjacency singular value decomposition and implicit graph transformation,are designed to capture relationships among the sampling points in the segmented signals.Simulation results demonstrate that our proposed GSPCRN outperforms existing classic methods in extracting weak signals from the HSI environment.When the interference-to-signal ratio exceeds 27dB,only our proposed GSPCRN can achieve the interference mitigation.
基金supported by the National Natural Science Foundation of China(62225303,62403043,62433004)the Beijing Natural Science Foundation(4244085)+1 种基金the Postdoctoral Fellowship Program of China Postdoctoral Science Foundation(GZC20230203)the China Postdoctoral Science Foundation(2023M740201)。
文摘Deep graph contrastive clustering has attracted widespread attentions due to its self-supervised representation learning paradigm and superior clustering performance.Although,two challenges emerge and result in high computational costs.Most existing contrastive methods adopt the data augmentation and then representation learning strategy,where representation learning with trainable graph convolution is coupled with complex and fixed data augmentation,inevitably limiting the efficiency and flexibility.The similarity metric between positive-negative sample pairs is complex and contrastive objective is partial,limiting the discriminability of representation learning.To solve these challenges,a novel wide graph clustering network(WGCN)adhering to representation and then augmentation framework is proposed,which mainly consists of multiorder filter fusion(MFF)and double-level contrastive learning(DCL)modules.Specifically,the MFF module integrates multiorder low-pass filters to extract smooth and multi-scale topological features,utilizing self-attention fusion to reduce redundancy and obtain comprehensive embedding representation.Further,the DCL module constructs two augmented views by the parallel parameter-unshared Siamese encoders rather than complex augmentations on graph.To achieve simple yet effective self-supervised learning,representation self-supervision and structural consistency oriented double-level contrastive loss is designed,where representation self-supervision maximizes the agreement between pairwise augmented embedding representations and structural consistency promotes the mutual information correlation between appending neighborhoods with similar semantics.Extensive experiments on six benchmark datasets demonstrate the superiority of the proposed WGCN,especially highlighting its time-saving characteristic.The code could be available in the https://github.com/Tianxiang Zhao0474/WGCN.
基金supported in part by the National Natural Science Foundation of China under Grant 62172368the Natural Science Foundation of Zhejiang Province under Grant LR22F020003.
文摘The development of brain-computer interfaces(BCI)based on motor imagery(MI)has greatly improved patients’quality of life with movement disorders.The classification of upper limb MI has been widely studied and applied in many fields,including rehabilitation.However,the physiological representations of left and right lower limb movements are too close and activated deep in the cerebral cortex,making it difficult to distinguish their features.Therefore,classifying lower limbs motor imagery is more challenging.In this study,we propose a feature extraction method based on functional connectivity,which utilizes phase-locked values to construct a functional connectivity matrix as the features of the left and right legs,which can effectively avoid the problem of physiological representations of the left and right lower limbs being too close to each other during movement.In addition,considering the topology and the temporal characteristics of the electroencephalogram(EEG),we designed a temporal-spatial convolutional network(TSGCN)to capture the spatiotemporal information for classification.Experimental results show that the accuracy of the proposed method is higher than that of existing methods,achieving an average classification accuracy of 73.58%on the internal dataset.Finally,this study explains the network mechanism of left and right foot MI from the perspective of graph theoretic features and demonstrates the feasibility of decoding lower limb MI.
基金supported by the National Natural Science Foundation of China(No.52303063)。
文摘Natural rubber(NR)latex is a renewable colloidal dispersion used in medical gloves,coatings,and flexible products.It is known for its excellent elasticity and film-forming ability but is limited by insufficient mechanical robustness and chemical resistance.Incorporating nanofillers,such as graphene oxide(GO),is an effective approach to enhance its performance;however,achieving strong interfacial compatibility between hydrophilic GO and the nonpolar rubber matrix remains challenging.To overcome this issue,a multifunctional interfacial design inspired by mussel adhesion chemistry was developed to construct a hierarchical and cohesive GO network within the NR latex matrix.A tannic acid-based modifier(TM)bearing catechol and thiol groups was synthesized and anchored onto latex particles via hydrogen bonding with surface proteins and phospholipids,enabling subsequentπ-πinteractions and hydrogen bonding with GO nanosheets.This guided the selective self-assembly of GO into a continuous segregated network along the latex particle boundaries.Hierarchical interface reinforcement was achieved through Eu^(3+)ligand coordination.The incorporation of GO and enhancement of interfacial interactions promoted strain-induced crystallization,resulting in increased crystallinity and improved load transfer.The resulting composite film containing 0.5 part per hundred rubber GO and the bioinspired interface exhibited a tensile strength that was 107.8%higher than that of the pure NR latex film,while maintaining an elongation at break of 915%.Tear strength increased by 118.5%,toughness reached 61.7 MJ/m~3,nitrogen permeability decreased by 20.1%,and antibacterial efficiency against both Escherichia coli and Staphylococcus aureus reached 99.9%.The films also exhibited enhanced resistance to organic solvents,acids,and alkalis.This study provides a green and scalable strategy for fabricating high-performance NR latex-based products suitable for medical,protective,and engineering applications.
