This paper proposes a scheme to construct time- frequency codes based on protograph low density parity check （LDPC） codes in orthogonal frequency division multiplexing （OFDM） communication systems. This approach s...This paper proposes a scheme to construct time- frequency codes based on protograph low density parity check （LDPC） codes in orthogonal frequency division multiplexing （OFDM） communication systems. This approach synthesizes two techniques： protograph LDPC codes and OFDM. One symbol of encoded information by protograph LDPC codes corresponds to one sub-carrier, namely the length of encoded information equals to the number of sub-carriers. The design of good protograph LDPC codes with short lengths is given, and the proposed proto- graph LDPC codes can be of fast encoding, which can reduce the encoding complexity and simplify encoder hardware implementa- tion. The proposed approach provides a higher coding gain in the Rayleigh fading channel. The simulation results in the Rayleigh fading channel show that the bit error rate （BER） performance of the proposed time-frequency codes is as good as random LDPC- OFDM codes and is better than Tanner LDPC-OFDM codes under the condition of different fading coefficients.展开更多
With the increasingly complex and changeable electromagnetic environment,wireless communication systems are facing jamming and abnormal signal injection,which significantly affects the normal operation of a communicat...With the increasingly complex and changeable electromagnetic environment,wireless communication systems are facing jamming and abnormal signal injection,which significantly affects the normal operation of a communication system.In particular,the abnormal signals may emulate the normal signals,which makes it very challenging for abnormal signal recognition.In this paper,we propose a new abnormal signal recognition scheme,which combines time-frequency analysis with deep learning to effectively identify synthetic abnormal communication signals.Firstly,we emulate synthetic abnormal communication signals including seven jamming patterns.Then,we model an abnormal communication signals recognition system based on the communication protocol between the transmitter and the receiver.To improve the performance,we convert the original signal into the time-frequency spectrogram to develop an image classification algorithm.Simulation results demonstrate that the proposed method can effectively recognize the abnormal signals under various parameter configurations,even under low signal-to-noise ratio(SNR)and low jamming-to-signal ratio(JSR)conditions.展开更多
Seismic time-frequency(TF)transforms are essential tools in reservoir interpretation and signal processing,particularly for characterizing frequency variations in non-stationary seismic data.Recently,sparse TF trans-f...Seismic time-frequency(TF)transforms are essential tools in reservoir interpretation and signal processing,particularly for characterizing frequency variations in non-stationary seismic data.Recently,sparse TF trans-forms,which leverage sparse coding(SC),have gained significant attention in the geosciences due to their ability to achieve high TF resolution.However,the iterative approaches typically employed in sparse TF transforms are computationally intensive,making them impractical for real seismic data analysis.To address this issue,we propose an interpretable convolutional sparse coding(CSC)network to achieve high TF resolution.The proposed model is generated based on the traditional short-time Fourier transform(STFT)transform and a modified UNet,named ULISTANet.In this design,we replace the conventional convolutional layers of the UNet with learnable iterative shrinkage thresholding algorithm(LISTA)blocks,a specialized form of CSC.The LISTA block,which evolves from the traditional iterative shrinkage thresholding algorithm(ISTA),is optimized for extracting sparse features more effectively.Furthermore,we create a synthetic dataset featuring complex frequency-modulated signals to train ULISTANet.Finally,the proposed method’s performance is subsequently validated using both synthetic and field data,demonstrating its potential for enhanced seismic data analysis.展开更多
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.展开更多
With the widespread use of social media,the propagation of health-related rumors has become a significant public health threat.Existing methods for detecting health rumors predominantly rely on external knowledge or p...With the widespread use of social media,the propagation of health-related rumors has become a significant public health threat.Existing methods for detecting health rumors predominantly rely on external knowledge or propagation structures,with only a few recent approaches attempting causal inference;however,these have not yet effectively integrated causal discovery with domain-specific knowledge graphs for detecting health rumors.In this study,we found that the combined use of causal discovery and domain-specific knowledge graphs can effectively identify implicit pseudo-causal logic embedded within texts,holding significant potential for health rumor detection.To this end,we propose CKDG—a dual-graph fusion framework based on causal logic and medical knowledge graphs.CKDG constructs a weighted causal graph to capture the implicit causal relationships in the text and introduces a medical knowledge graph to verify semantic consistency,thereby enhancing the ability to identify the misuse of professional terminology and pseudoscientific claims.In experiments conducted on a dataset comprising 8430 health rumors,CKDG achieved an accuracy of 91.28%and an F1 score of 90.38%,representing improvements of 5.11%and 3.29%over the best baseline,respectively.Our results indicate that the integrated use of causal discovery and domainspecific knowledge graphs offers significant advantages for health rumor detection systems.This method not only improves detection performance but also enhances the transparency and credibility of model decisions by tracing causal chains and sources of knowledge conflicts.We anticipate that this work will provide key technological support for the development of trustworthy health-information filtering systems,thereby improving the reliability of public health information on social media.展开更多
Graph Neural Networks(GNNs)have proven highly effective for graph classification across diverse fields such as social networks,bioinformatics,and finance,due to their capability to learn complex graph structures.Howev...Graph Neural Networks(GNNs)have proven highly effective for graph classification across diverse fields such as social networks,bioinformatics,and finance,due to their capability to learn complex graph structures.However,despite their success,GNNs remain vulnerable to adversarial attacks that can significantly degrade their classification accuracy.Existing adversarial attack strategies primarily rely on label information to guide the attacks,which limits their applicability in scenarios where such information is scarce or unavailable.This paper introduces an innovative unsupervised attack method for graph classification,which operates without relying on label information,thereby enhancing its applicability in a broad range of scenarios.Specifically,our method first leverages a graph contrastive learning loss to learn high-quality graph embeddings by comparing different stochastic augmented views of the graphs.To effectively perturb the graphs,we then introduce an implicit estimator that measures the impact of various modifications on graph structures.The proposed strategy identifies and flips edges with the top-K highest scores,determined by the estimator,to maximize the degradation of the model’s performance.In addition,to defend against such attack,we propose a lightweight regularization-based defense mechanism that is specifically tailored to mitigate the structural perturbations introduced by our attack strategy.It enhances model robustness by enforcing embedding consistency and edge-level smoothness during training.We conduct experiments on six public TU graph classification datasets:NCI1,NCI109,Mutagenicity,ENZYMES,COLLAB,and DBLP_v1,to evaluate the effectiveness of our attack and defense strategies.Under an attack budget of 3,the maximum reduction in model accuracy reaches 6.67%on the Graph Convolutional Network(GCN)and 11.67%on the Graph Attention Network(GAT)across different datasets,indicating that our unsupervised method induces degradation comparable to state-of-the-art supervised attacks.Meanwhile,our defense achieves the highest accuracy recovery of 3.89%(GCN)and 5.00%(GAT),demonstrating improved robustness against structural perturbations.展开更多
Reliable traffic flow prediction is crucial for mitigating urban congestion.This paper proposes Attentionbased spatiotemporal Interactive Dynamic Graph Convolutional Network(AIDGCN),a novel architecture integrating In...Reliable traffic flow prediction is crucial for mitigating urban congestion.This paper proposes Attentionbased spatiotemporal Interactive Dynamic Graph Convolutional Network(AIDGCN),a novel architecture integrating Interactive Dynamic Graph Convolution Network(IDGCN)with Temporal Multi-Head Trend-Aware Attention.Its core innovation lies in IDGCN,which uniquely splits sequences into symmetric intervals for interactive feature sharing via dynamic graphs,and a novel attention mechanism incorporating convolutional operations to capture essential local traffic trends—addressing a critical gap in standard attention for continuous data.For 15-and 60-min forecasting on METR-LA,AIDGCN achieves MAEs of 0.75%and 0.39%,and RMSEs of 1.32%and 0.14%,respectively.In the 60-min long-term forecasting of the PEMS-BAY dataset,the AIDGCN out-performs the MRA-BGCN method by 6.28%,4.93%,and 7.17%in terms of MAE,RMSE,and MAPE,respectively.Experimental results demonstrate the superiority of our pro-posed model over state-of-the-art methods.展开更多
Graph Federated Learning(GFL)has shown great potential in privacy protection and distributed intelligence through distributed collaborative training of graph-structured data without sharing raw information.However,exi...Graph Federated Learning(GFL)has shown great potential in privacy protection and distributed intelligence through distributed collaborative training of graph-structured data without sharing raw information.However,existing GFL approaches often lack the capability for comprehensive feature extraction and adaptive optimization,particularly in non-independent and identically distributed(NON-IID)scenarios where balancing global structural understanding and local node-level detail remains a challenge.To this end,this paper proposes a novel framework called GFL-SAR(Graph Federated Collaborative Learning Framework Based on Structural Amplification and Attention Refinement),which enhances the representation learning capability of graph data through a dual-branch collaborative design.Specifically,we propose the Structural Insight Amplifier(SIA),which utilizes an improved Graph Convolutional Network(GCN)to strengthen structural awareness and improve modeling of topological patterns.In parallel,we propose the Attentive Relational Refiner(ARR),which employs an enhanced Graph Attention Network(GAT)to perform fine-grained modeling of node relationships and neighborhood features,thereby improving the expressiveness of local interactions and preserving critical contextual information.GFL-SAR effectively integrates multi-scale features from every branch via feature fusion and federated optimization,thereby addressing existing GFL limitations in structural modeling and feature representation.Experiments on standard benchmark datasets including Cora,Citeseer,Polblogs,and Cora_ML demonstrate that GFL-SAR achieves superior performance in classification accuracy,convergence speed,and robustness compared to existing methods,confirming its effectiveness and generalizability in GFL tasks.展开更多
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.展开更多
Network attacks have become a critical issue in the internet security domain.Artificial intelligence technology-based detection methodologies have attracted attention;however,recent studies have struggled to adapt to ...Network attacks have become a critical issue in the internet security domain.Artificial intelligence technology-based detection methodologies have attracted attention;however,recent studies have struggled to adapt to changing attack patterns and complex network environments.In addition,it is difficult to explain the detection results logically using artificial intelligence.We propose a method for classifying network attacks using graph models to explain the detection results.First,we reconstruct the network packet data into a graphical structure.We then use a graph model to predict network attacks using edge classification.To explain the prediction results,we observed numerical changes by randomly masking and calculating the importance of neighbors,allowing us to extract significant subgraphs.Our experiments on six public datasets demonstrate superior performance with an average F1-score of 0.960 and accuracy of 0.964,outperforming traditional machine learning and other graph models.The visual representation of the extracted subgraphs highlights the neighboring nodes that have the greatest impact on the results,thus explaining detection.In conclusion,this study demonstrates that graph-based models are suitable for network attack detection in complex environments,and the importance of graph neighbors can be calculated to efficiently analyze the results.This approach can contribute to real-world network security analyses and provide a new direction in the field.展开更多
基于深度学习的网络攻击检测是对欧几里得数据进行建模,无法学习攻击数据中的结构特征。为此,提出一种基于改进图采样与聚合(graph sample and aggregate,GraphSAGE)的网络攻击检测算法。首先,将攻击数据从平面结构转换为图结构数据。其...基于深度学习的网络攻击检测是对欧几里得数据进行建模,无法学习攻击数据中的结构特征。为此,提出一种基于改进图采样与聚合(graph sample and aggregate,GraphSAGE)的网络攻击检测算法。首先,将攻击数据从平面结构转换为图结构数据。其次,对GraphSAGE算法进行了改进,包括在消息传递阶段融合节点和边的特征,同时在消息聚合过程中考虑不同源节点对目标节点的影响程度,并在边嵌入生成时引入残差学习机制。在两个公开网络攻击数据集上的实验结果表明,在二分类情况下,所提算法的总体性能优于E-GraphSAGE、LSTM、RNN、CNN算法;在多分类情况下,所提算法在大多数攻击类型上的F1值高于对比算法。展开更多
The increasing complexity of China’s electricity market creates substantial challenges for settlement automation,data consistency,and operational scalability.Existing provincial settlement systems are fragmented,lack...The increasing complexity of China’s electricity market creates substantial challenges for settlement automation,data consistency,and operational scalability.Existing provincial settlement systems are fragmented,lack a unified data structure,and depend heavily on manual intervention to process high-frequency and retroactive transactions.To address these limitations,a graph-based unified settlement framework is proposed to enhance automation,flexibility,and adaptability in electricity market settlements.A flexible attribute-graph model is employed to represent heterogeneousmulti-market data,enabling standardized integration,rapid querying,and seamless adaptation to evolving business requirements.An extensible operator library is designed to support configurable settlement rules,and a suite of modular tools—including dataset generation,formula configuration,billing templates,and task scheduling—facilitates end-to-end automated settlement processing.A robust refund-clearing mechanism is further incorporated,utilizing sandbox execution,data-version snapshots,dynamic lineage tracing,and real-time changecapture technologies to enable rapid and accurate recalculations under dynamic policy and data revisions.Case studies based on real-world data from regional Chinese markets validate the effectiveness of the proposed approach,demonstrating marked improvements in computational efficiency,system robustness,and automation.Moreover,enhanced settlement accuracy and high temporal granularity improve price-signal fidelity,promote cost-reflective tariffs,and incentivize energy-efficient and demand-responsive behavior among market participants.The method not only supports equitable and transparent market operations but also provides a generalizable,scalable foundation for modern electricity settlement platforms in increasingly complex and dynamic market environments.展开更多
Lateral movement represents the most covert and critical phase of Advanced Persistent Threats(APTs),and its detection still faces two primary challenges:sample scarcity and“cold start”of new entities.To address thes...Lateral movement represents the most covert and critical phase of Advanced Persistent Threats(APTs),and its detection still faces two primary challenges:sample scarcity and“cold start”of new entities.To address these challenges,we propose an Uncertainty-Driven Graph Embedding-Enhanced Lateral Movement Detection framework(UGEA-LMD).First,the framework employs event-level incremental encoding on a continuous-time graph to capture fine-grained behavioral evolution,enabling newly appearing nodes to retain temporal contextual awareness even in the absence of historical interactions and thereby fundamentally mitigating the cold-start problem.Second,in the embedding space,we model the dependency structure among feature dimensions using a Gaussian copula to quantify the uncertainty distribution,and generate augmented samples with consistent structural and semantic properties through adaptive sampling,thus expanding the representation space of sparse samples and enhancing the model’s generalization under sparse sample conditions.Unlike static graph methods that cannot model temporal dependencies or data augmentation techniques that depend on predefined structures,UGEA-LMD offers both superior temporaldynamic modeling and structural generalization.Experimental results on the large-scale LANL log dataset demonstrate that,under the transductive setting,UGEA-LMD achieves an AUC of 0.9254;even when 10%of nodes or edges are withheld during training,UGEA-LMD significantly outperforms baseline methods on metrics such as recall and AUC,confirming its robustness and generalization capability in sparse-sample and cold-start scenarios.展开更多
The Gabor and S transforms are frequently used in time-frequency decomposition methods. Constrained by the uncertainty principle, both transforms produce low-resolution time-frequency decomposition results in the time...The Gabor and S transforms are frequently used in time-frequency decomposition methods. Constrained by the uncertainty principle, both transforms produce low-resolution time-frequency decomposition results in the time and frequency domains. To improve the resolution of the time-frequency decomposition results, we use the instantaneous frequency distribution function（IFDF） to express the seismic signal. When the instantaneous frequencies of the nonstationary signal satisfy the requirements of the uncertainty principle, the support of IFDF is just the support of the amplitude ridges in the signal obtained using the short-time Fourier transform. Based on this feature, we propose a new iteration algorithm to achieve the sparse time-frequency decomposition of the signal. The iteration algorithm uses the support of the amplitude ridges of the residual signal obtained with the short-time Fourier transform to update the time-frequency components of the signal. The summation of the updated time-frequency components in each iteration is the result of the sparse timefrequency decomposition. Numerical examples show that the proposed method improves the resolution of the time-frequency decomposition results and the accuracy of the analysis of the nonstationary signal. We also use the proposed method to attenuate the ground roll of field seismic data with good results.展开更多
Predicting the time-varying auto-spectral density of a spacecraft in high-altitude orbits requires an accurate model for the non-stationary random vibration signals with densely spaced modal frequency. The traditional...Predicting the time-varying auto-spectral density of a spacecraft in high-altitude orbits requires an accurate model for the non-stationary random vibration signals with densely spaced modal frequency. The traditional time-varying algorithm limits prediction accuracy, thus affecting a number of operational decisions. To solve this problem, a time-varying auto regressive （TVAR） model based on the process neural network （PNN） and the empirical mode decomposition （EMD） is proposed. The time-varying system is tracked on-line by establishing a time-varying parameter model, and then the relevant parameter spectrum is obtained. Firstly, the EMD method is utilized to decompose the signal into several intrinsic mode functions （IMFs）. Then for each IMF, the PNN is established and the time-varying auto-spectral density is obtained. Finally, the time-frequency distribution of the signals can be reconstructed by linear superposition. The simulation and the analytical results from an example demonstrate that this approach possesses simplicity, effectiveness, and feasibility, as well as higher frequency resolution.展开更多
Some factors influencing the intelligibility of the enhanced whisper in the joint time-frequency domain are evaluated. Specifically, both the spectrum density and different regions of the enhanced spectrum are analyze...Some factors influencing the intelligibility of the enhanced whisper in the joint time-frequency domain are evaluated. Specifically, both the spectrum density and different regions of the enhanced spectrum are analyzed. Experimental results show that for a spectrum of some density, the joint time-frequency gain-modification based speech enhancement algorithm achieves significant improvement in intelligibility. Additionally, the spectrum region where the estimated spectrum is smaller than the clean spectrum, is the most important region contributing to intelligibility improvement for the enhanced whisper. The spectrum region where the estimated spectrum is larger than twice the size of the clean spectrum is detrimental to speech intelligibility perception within the whisper context.展开更多
In this paper, it is described that the time-frequency resolution of geophysical signals is affected by the time window function attenuation coefficient and sampling interval and how such effects are eliminated effect...In this paper, it is described that the time-frequency resolution of geophysical signals is affected by the time window function attenuation coefficient and sampling interval and how such effects are eliminated effectively. Improving the signal resolution is the key to signal time-frequency analysis processing and has wide use in geophysical data processing and extraction of attribute parameters. In this paper, authors research the effects of the attenuation coefficient choice of the Gabor transform window function and sampling interval on signal resolution. Unsuitable parameters not only decrease the signal resolution on the frequency spectrum but also miss the signals. It is essential to first give the optimum window and range of parameters through time-frequency analysis simulation using the Gabor transform. In the paper, the suggestions about the range and choice of the optimum sampling interval and processing methods of general seismic signals are given.展开更多
A time-frequency signal processing method for two-phase flow through a horizontal Venturi based on adaptive optimal-kernel （AOK） was presented in this paper.First,the collected dynamic differential pressure signal o...A time-frequency signal processing method for two-phase flow through a horizontal Venturi based on adaptive optimal-kernel （AOK） was presented in this paper.First,the collected dynamic differential pressure signal of gas-liquid two-phase flow was preprocessed,and then the AOK theory was used to analyze the dynamic differ-ential pressure signal.The mechanism of two-phase flow was discussed through the time-frequency spectrum.On the condition of steady water flow rate,with the increasing of gas flow rate,the flow pattern changes from bubbly flow to slug flow,then to plug flow,meanwhile,the energy distribution of signal fluctuations show significant change that energy transfer from 15-35 Hz band to 0-8 Hz band;moreover,when the flow pattern is slug flow,there are two wave peaks showed in the time-frequency spectrum.Finally,a number of characteristic variables were defined by using the time-frequency spectrum and the ridge of AOK.When the characteristic variables were visu-ally analyzed,the relationship between different combination of characteristic variables and flow patterns would be gotten.The results show that,this method can explain the law of flow in different flow patterns.And characteristic variables,defined by this method,can get a clear description of the flow information.This method provides a new way for the flow pattern identification,and the percentage of correct prediction is up to 91.11%.展开更多
In this study, several advanced analysis methods are applied to understand the relationships between the Nino-3.4 sea surface temperatures （SST） and the SSTs related to the tropical Indian Ocean Dipole （IOD）. By a...In this study, several advanced analysis methods are applied to understand the relationships between the Nino-3.4 sea surface temperatures （SST） and the SSTs related to the tropical Indian Ocean Dipole （IOD）. By analyzing a long data record, the authors focus on the time-frequency characteristics of these relationships, and of the structure of IOD. They also focus on the seasonal dependence of those characteristics in both time and frequency domains. Among the Nino-3.4 SST, IOD, and SSTs over the tropical western Indian Ocean （WIO） and eastern Indian Ocean （EIO）, the WIO SST has the strongest annual and semiannual oscillations. While the Nino-3.4 SST has large inter-annual variability that is only second to its annual variability, the IOD is characterized by the largest semiannual oscillation, which is even stronger than its annual oscillation. The IOD is strongly and stably related to the EIO SST in a wide range of frequency bands and in all seasons. However, it is less significantly related to the WIO SST in the boreal winter and spring. There exists a generally weak and unstable relationship between the WIO and EIO SSTs, especially in the biennial and higher frequency bands. The relationship is especially weak in summer and fall, when IOD is apparent, but appears highly positive in winter and spring, when the IOD is unimportantly weak and even disappears. This feature reflects a caution in the definition and application of IOD. The Nino-3.4 SST has a strong positive relationship with the WIO SST in all seasons, mainly in the biennial and longer frequency bands. However, it shows no significant relationship with the EIO SST in summer and fall, and with IOD in winter and spring.展开更多
基金supported by the Beijing Natural Science Foundation of China (4102050)the National Natural Science of Foundation of China (NSFC)-Korea Science and Engineering Foundation (KOSF) Joint Research Project of China and Korea (60811140343)
文摘This paper proposes a scheme to construct time- frequency codes based on protograph low density parity check （LDPC） codes in orthogonal frequency division multiplexing （OFDM） communication systems. This approach synthesizes two techniques： protograph LDPC codes and OFDM. One symbol of encoded information by protograph LDPC codes corresponds to one sub-carrier, namely the length of encoded information equals to the number of sub-carriers. The design of good protograph LDPC codes with short lengths is given, and the proposed proto- graph LDPC codes can be of fast encoding, which can reduce the encoding complexity and simplify encoder hardware implementa- tion. The proposed approach provides a higher coding gain in the Rayleigh fading channel. The simulation results in the Rayleigh fading channel show that the bit error rate （BER） performance of the proposed time-frequency codes is as good as random LDPC- OFDM codes and is better than Tanner LDPC-OFDM codes under the condition of different fading coefficients.
基金supported by Natural Science Foundation of China(No.62371231)Natural Science Foundation on Frontier Leading Technology Basic Research Project of Jiangsu under Grant BK20222001Jiangsu Provincial Key Research and Development Program(No.BE2023027).
文摘With the increasingly complex and changeable electromagnetic environment,wireless communication systems are facing jamming and abnormal signal injection,which significantly affects the normal operation of a communication system.In particular,the abnormal signals may emulate the normal signals,which makes it very challenging for abnormal signal recognition.In this paper,we propose a new abnormal signal recognition scheme,which combines time-frequency analysis with deep learning to effectively identify synthetic abnormal communication signals.Firstly,we emulate synthetic abnormal communication signals including seven jamming patterns.Then,we model an abnormal communication signals recognition system based on the communication protocol between the transmitter and the receiver.To improve the performance,we convert the original signal into the time-frequency spectrogram to develop an image classification algorithm.Simulation results demonstrate that the proposed method can effectively recognize the abnormal signals under various parameter configurations,even under low signal-to-noise ratio(SNR)and low jamming-to-signal ratio(JSR)conditions.
基金supported by the National Natural Science Foundation of China under Grant 42474139the Key Research and Development Program of Shaanxi under Grant 2024GX-YBXM-067.
文摘Seismic time-frequency(TF)transforms are essential tools in reservoir interpretation and signal processing,particularly for characterizing frequency variations in non-stationary seismic data.Recently,sparse TF trans-forms,which leverage sparse coding(SC),have gained significant attention in the geosciences due to their ability to achieve high TF resolution.However,the iterative approaches typically employed in sparse TF transforms are computationally intensive,making them impractical for real seismic data analysis.To address this issue,we propose an interpretable convolutional sparse coding(CSC)network to achieve high TF resolution.The proposed model is generated based on the traditional short-time Fourier transform(STFT)transform and a modified UNet,named ULISTANet.In this design,we replace the conventional convolutional layers of the UNet with learnable iterative shrinkage thresholding algorithm(LISTA)blocks,a specialized form of CSC.The LISTA block,which evolves from the traditional iterative shrinkage thresholding algorithm(ISTA),is optimized for extracting sparse features more effectively.Furthermore,we create a synthetic dataset featuring complex frequency-modulated signals to train ULISTANet.Finally,the proposed method’s performance is subsequently validated using both synthetic and field data,demonstrating its potential for enhanced seismic data analysis.
基金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.
基金funded by the Hunan Provincial Natural Science Foundation of China(Grant No.2025JJ70105)the Hunan Provincial College Students’Innovation and Entrepreneurship Training Program(Project No.S202411342056)The article processing charge(APC)was funded by the Project No.2025JJ70105.
文摘With the widespread use of social media,the propagation of health-related rumors has become a significant public health threat.Existing methods for detecting health rumors predominantly rely on external knowledge or propagation structures,with only a few recent approaches attempting causal inference;however,these have not yet effectively integrated causal discovery with domain-specific knowledge graphs for detecting health rumors.In this study,we found that the combined use of causal discovery and domain-specific knowledge graphs can effectively identify implicit pseudo-causal logic embedded within texts,holding significant potential for health rumor detection.To this end,we propose CKDG—a dual-graph fusion framework based on causal logic and medical knowledge graphs.CKDG constructs a weighted causal graph to capture the implicit causal relationships in the text and introduces a medical knowledge graph to verify semantic consistency,thereby enhancing the ability to identify the misuse of professional terminology and pseudoscientific claims.In experiments conducted on a dataset comprising 8430 health rumors,CKDG achieved an accuracy of 91.28%and an F1 score of 90.38%,representing improvements of 5.11%and 3.29%over the best baseline,respectively.Our results indicate that the integrated use of causal discovery and domainspecific knowledge graphs offers significant advantages for health rumor detection systems.This method not only improves detection performance but also enhances the transparency and credibility of model decisions by tracing causal chains and sources of knowledge conflicts.We anticipate that this work will provide key technological support for the development of trustworthy health-information filtering systems,thereby improving the reliability of public health information on social media.
基金funded by the National Key Research and Development Program of China(Grant No.2024YFE0209000)the NSFC(Grant No.U23B2019).
文摘Graph Neural Networks(GNNs)have proven highly effective for graph classification across diverse fields such as social networks,bioinformatics,and finance,due to their capability to learn complex graph structures.However,despite their success,GNNs remain vulnerable to adversarial attacks that can significantly degrade their classification accuracy.Existing adversarial attack strategies primarily rely on label information to guide the attacks,which limits their applicability in scenarios where such information is scarce or unavailable.This paper introduces an innovative unsupervised attack method for graph classification,which operates without relying on label information,thereby enhancing its applicability in a broad range of scenarios.Specifically,our method first leverages a graph contrastive learning loss to learn high-quality graph embeddings by comparing different stochastic augmented views of the graphs.To effectively perturb the graphs,we then introduce an implicit estimator that measures the impact of various modifications on graph structures.The proposed strategy identifies and flips edges with the top-K highest scores,determined by the estimator,to maximize the degradation of the model’s performance.In addition,to defend against such attack,we propose a lightweight regularization-based defense mechanism that is specifically tailored to mitigate the structural perturbations introduced by our attack strategy.It enhances model robustness by enforcing embedding consistency and edge-level smoothness during training.We conduct experiments on six public TU graph classification datasets:NCI1,NCI109,Mutagenicity,ENZYMES,COLLAB,and DBLP_v1,to evaluate the effectiveness of our attack and defense strategies.Under an attack budget of 3,the maximum reduction in model accuracy reaches 6.67%on the Graph Convolutional Network(GCN)and 11.67%on the Graph Attention Network(GAT)across different datasets,indicating that our unsupervised method induces degradation comparable to state-of-the-art supervised attacks.Meanwhile,our defense achieves the highest accuracy recovery of 3.89%(GCN)and 5.00%(GAT),demonstrating improved robustness against structural perturbations.
文摘Reliable traffic flow prediction is crucial for mitigating urban congestion.This paper proposes Attentionbased spatiotemporal Interactive Dynamic Graph Convolutional Network(AIDGCN),a novel architecture integrating Interactive Dynamic Graph Convolution Network(IDGCN)with Temporal Multi-Head Trend-Aware Attention.Its core innovation lies in IDGCN,which uniquely splits sequences into symmetric intervals for interactive feature sharing via dynamic graphs,and a novel attention mechanism incorporating convolutional operations to capture essential local traffic trends—addressing a critical gap in standard attention for continuous data.For 15-and 60-min forecasting on METR-LA,AIDGCN achieves MAEs of 0.75%and 0.39%,and RMSEs of 1.32%and 0.14%,respectively.In the 60-min long-term forecasting of the PEMS-BAY dataset,the AIDGCN out-performs the MRA-BGCN method by 6.28%,4.93%,and 7.17%in terms of MAE,RMSE,and MAPE,respectively.Experimental results demonstrate the superiority of our pro-posed model over state-of-the-art methods.
基金supported by National Natural Science Foundation of China(62466045)Inner Mongolia Natural Science Foundation Project(2021LHMS06003)Inner Mongolia University Basic Research Business Fee Project(114).
文摘Graph Federated Learning(GFL)has shown great potential in privacy protection and distributed intelligence through distributed collaborative training of graph-structured data without sharing raw information.However,existing GFL approaches often lack the capability for comprehensive feature extraction and adaptive optimization,particularly in non-independent and identically distributed(NON-IID)scenarios where balancing global structural understanding and local node-level detail remains a challenge.To this end,this paper proposes a novel framework called GFL-SAR(Graph Federated Collaborative Learning Framework Based on Structural Amplification and Attention Refinement),which enhances the representation learning capability of graph data through a dual-branch collaborative design.Specifically,we propose the Structural Insight Amplifier(SIA),which utilizes an improved Graph Convolutional Network(GCN)to strengthen structural awareness and improve modeling of topological patterns.In parallel,we propose the Attentive Relational Refiner(ARR),which employs an enhanced Graph Attention Network(GAT)to perform fine-grained modeling of node relationships and neighborhood features,thereby improving the expressiveness of local interactions and preserving critical contextual information.GFL-SAR effectively integrates multi-scale features from every branch via feature fusion and federated optimization,thereby addressing existing GFL limitations in structural modeling and feature representation.Experiments on standard benchmark datasets including Cora,Citeseer,Polblogs,and Cora_ML demonstrate that GFL-SAR achieves superior performance in classification accuracy,convergence speed,and robustness compared to existing methods,confirming its effectiveness and generalizability in GFL tasks.
基金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 MSIT(Ministry of Science and ICT),Republic of Korea,under the ICAN(ICT Challenge and Advanced Network of HRD)support program(IITP-2025-RS-2023-00259497)supervised by the IITP(Institute for Information&Communications Technology Planning&Evaluation)and was supported by Institute of Information&Communications Technology Planning&Evaluation(IITP)grant funded by the Republic of Korea government(MSIT)(No.IITP-2025-RS-2023-00254129+1 种基金Graduate School of Metaverse Convergence(Sungkyunkwan University))was supported by the Basic Science Research Program of the National Research Foundation(NRF)funded by the Republic of Korean government(MSIT)(No.RS-2024-00346737).
文摘Network attacks have become a critical issue in the internet security domain.Artificial intelligence technology-based detection methodologies have attracted attention;however,recent studies have struggled to adapt to changing attack patterns and complex network environments.In addition,it is difficult to explain the detection results logically using artificial intelligence.We propose a method for classifying network attacks using graph models to explain the detection results.First,we reconstruct the network packet data into a graphical structure.We then use a graph model to predict network attacks using edge classification.To explain the prediction results,we observed numerical changes by randomly masking and calculating the importance of neighbors,allowing us to extract significant subgraphs.Our experiments on six public datasets demonstrate superior performance with an average F1-score of 0.960 and accuracy of 0.964,outperforming traditional machine learning and other graph models.The visual representation of the extracted subgraphs highlights the neighboring nodes that have the greatest impact on the results,thus explaining detection.In conclusion,this study demonstrates that graph-based models are suitable for network attack detection in complex environments,and the importance of graph neighbors can be calculated to efficiently analyze the results.This approach can contribute to real-world network security analyses and provide a new direction in the field.
文摘基于深度学习的网络攻击检测是对欧几里得数据进行建模,无法学习攻击数据中的结构特征。为此,提出一种基于改进图采样与聚合(graph sample and aggregate,GraphSAGE)的网络攻击检测算法。首先,将攻击数据从平面结构转换为图结构数据。其次,对GraphSAGE算法进行了改进,包括在消息传递阶段融合节点和边的特征,同时在消息聚合过程中考虑不同源节点对目标节点的影响程度,并在边嵌入生成时引入残差学习机制。在两个公开网络攻击数据集上的实验结果表明,在二分类情况下,所提算法的总体性能优于E-GraphSAGE、LSTM、RNN、CNN算法;在多分类情况下,所提算法在大多数攻击类型上的F1值高于对比算法。
基金funded by the Science and Technology Project of State Grid Corporation of China(5108-202355437A-3-2-ZN).
文摘The increasing complexity of China’s electricity market creates substantial challenges for settlement automation,data consistency,and operational scalability.Existing provincial settlement systems are fragmented,lack a unified data structure,and depend heavily on manual intervention to process high-frequency and retroactive transactions.To address these limitations,a graph-based unified settlement framework is proposed to enhance automation,flexibility,and adaptability in electricity market settlements.A flexible attribute-graph model is employed to represent heterogeneousmulti-market data,enabling standardized integration,rapid querying,and seamless adaptation to evolving business requirements.An extensible operator library is designed to support configurable settlement rules,and a suite of modular tools—including dataset generation,formula configuration,billing templates,and task scheduling—facilitates end-to-end automated settlement processing.A robust refund-clearing mechanism is further incorporated,utilizing sandbox execution,data-version snapshots,dynamic lineage tracing,and real-time changecapture technologies to enable rapid and accurate recalculations under dynamic policy and data revisions.Case studies based on real-world data from regional Chinese markets validate the effectiveness of the proposed approach,demonstrating marked improvements in computational efficiency,system robustness,and automation.Moreover,enhanced settlement accuracy and high temporal granularity improve price-signal fidelity,promote cost-reflective tariffs,and incentivize energy-efficient and demand-responsive behavior among market participants.The method not only supports equitable and transparent market operations but also provides a generalizable,scalable foundation for modern electricity settlement platforms in increasingly complex and dynamic market environments.
基金supported by the Zhongyuan University of Technology Discipline Backbone Teacher Support Program Project(No.GG202417)the Key Research and Development Program of Henan under Grant 251111212000.
文摘Lateral movement represents the most covert and critical phase of Advanced Persistent Threats(APTs),and its detection still faces two primary challenges:sample scarcity and“cold start”of new entities.To address these challenges,we propose an Uncertainty-Driven Graph Embedding-Enhanced Lateral Movement Detection framework(UGEA-LMD).First,the framework employs event-level incremental encoding on a continuous-time graph to capture fine-grained behavioral evolution,enabling newly appearing nodes to retain temporal contextual awareness even in the absence of historical interactions and thereby fundamentally mitigating the cold-start problem.Second,in the embedding space,we model the dependency structure among feature dimensions using a Gaussian copula to quantify the uncertainty distribution,and generate augmented samples with consistent structural and semantic properties through adaptive sampling,thus expanding the representation space of sparse samples and enhancing the model’s generalization under sparse sample conditions.Unlike static graph methods that cannot model temporal dependencies or data augmentation techniques that depend on predefined structures,UGEA-LMD offers both superior temporaldynamic modeling and structural generalization.Experimental results on the large-scale LANL log dataset demonstrate that,under the transductive setting,UGEA-LMD achieves an AUC of 0.9254;even when 10%of nodes or edges are withheld during training,UGEA-LMD significantly outperforms baseline methods on metrics such as recall and AUC,confirming its robustness and generalization capability in sparse-sample and cold-start scenarios.
基金funded by the National Basic Research Program of China(973 Program)(No.2011 CB201002)the National Natural Science Foundation of China(No.41374117)the great and special projects(2011ZX05005–005-008HZ and 2011ZX05006-002)
文摘The Gabor and S transforms are frequently used in time-frequency decomposition methods. Constrained by the uncertainty principle, both transforms produce low-resolution time-frequency decomposition results in the time and frequency domains. To improve the resolution of the time-frequency decomposition results, we use the instantaneous frequency distribution function（IFDF） to express the seismic signal. When the instantaneous frequencies of the nonstationary signal satisfy the requirements of the uncertainty principle, the support of IFDF is just the support of the amplitude ridges in the signal obtained using the short-time Fourier transform. Based on this feature, we propose a new iteration algorithm to achieve the sparse time-frequency decomposition of the signal. The iteration algorithm uses the support of the amplitude ridges of the residual signal obtained with the short-time Fourier transform to update the time-frequency components of the signal. The summation of the updated time-frequency components in each iteration is the result of the sparse timefrequency decomposition. Numerical examples show that the proposed method improves the resolution of the time-frequency decomposition results and the accuracy of the analysis of the nonstationary signal. We also use the proposed method to attenuate the ground roll of field seismic data with good results.
基金Aeronautical Science Foundation of China (20071551016)
文摘Predicting the time-varying auto-spectral density of a spacecraft in high-altitude orbits requires an accurate model for the non-stationary random vibration signals with densely spaced modal frequency. The traditional time-varying algorithm limits prediction accuracy, thus affecting a number of operational decisions. To solve this problem, a time-varying auto regressive （TVAR） model based on the process neural network （PNN） and the empirical mode decomposition （EMD） is proposed. The time-varying system is tracked on-line by establishing a time-varying parameter model, and then the relevant parameter spectrum is obtained. Firstly, the EMD method is utilized to decompose the signal into several intrinsic mode functions （IMFs）. Then for each IMF, the PNN is established and the time-varying auto-spectral density is obtained. Finally, the time-frequency distribution of the signals can be reconstructed by linear superposition. The simulation and the analytical results from an example demonstrate that this approach possesses simplicity, effectiveness, and feasibility, as well as higher frequency resolution.
基金The National Natural Science Foundation of China(No.61301295,61273266,61301219,61201326,61003131)the Natural Science Foundation of Anhui Province(No.1308085QF100,1408085MF113)+2 种基金the Natural Science Foundation of Jiangsu Province(No.BK20130241)the Natural Science Foundation of Higher Education Institutions of Jiangsu Province(No.12KJB510021)the Doctoral Fund of Anhui University
文摘Some factors influencing the intelligibility of the enhanced whisper in the joint time-frequency domain are evaluated. Specifically, both the spectrum density and different regions of the enhanced spectrum are analyzed. Experimental results show that for a spectrum of some density, the joint time-frequency gain-modification based speech enhancement algorithm achieves significant improvement in intelligibility. Additionally, the spectrum region where the estimated spectrum is smaller than the clean spectrum, is the most important region contributing to intelligibility improvement for the enhanced whisper. The spectrum region where the estimated spectrum is larger than twice the size of the clean spectrum is detrimental to speech intelligibility perception within the whisper context.
基金This work was funded by National Natural Science Foundation of China-（No. 40474044）.
文摘In this paper, it is described that the time-frequency resolution of geophysical signals is affected by the time window function attenuation coefficient and sampling interval and how such effects are eliminated effectively. Improving the signal resolution is the key to signal time-frequency analysis processing and has wide use in geophysical data processing and extraction of attribute parameters. In this paper, authors research the effects of the attenuation coefficient choice of the Gabor transform window function and sampling interval on signal resolution. Unsuitable parameters not only decrease the signal resolution on the frequency spectrum but also miss the signals. It is essential to first give the optimum window and range of parameters through time-frequency analysis simulation using the Gabor transform. In the paper, the suggestions about the range and choice of the optimum sampling interval and processing methods of general seismic signals are given.
基金Supported by the Natural Science Foundation of Zhejiang Province（Y1100842） the Planning Projects of General Administration of Quality Supervision Inspection and Quarantine of the People＇s Republic of China（2006QK23）
文摘A time-frequency signal processing method for two-phase flow through a horizontal Venturi based on adaptive optimal-kernel （AOK） was presented in this paper.First,the collected dynamic differential pressure signal of gas-liquid two-phase flow was preprocessed,and then the AOK theory was used to analyze the dynamic differ-ential pressure signal.The mechanism of two-phase flow was discussed through the time-frequency spectrum.On the condition of steady water flow rate,with the increasing of gas flow rate,the flow pattern changes from bubbly flow to slug flow,then to plug flow,meanwhile,the energy distribution of signal fluctuations show significant change that energy transfer from 15-35 Hz band to 0-8 Hz band;moreover,when the flow pattern is slug flow,there are two wave peaks showed in the time-frequency spectrum.Finally,a number of characteristic variables were defined by using the time-frequency spectrum and the ridge of AOK.When the characteristic variables were visu-ally analyzed,the relationship between different combination of characteristic variables and flow patterns would be gotten.The results show that,this method can explain the law of flow in different flow patterns.And characteristic variables,defined by this method,can get a clear description of the flow information.This method provides a new way for the flow pattern identification,and the percentage of correct prediction is up to 91.11%.
文摘In this study, several advanced analysis methods are applied to understand the relationships between the Nino-3.4 sea surface temperatures （SST） and the SSTs related to the tropical Indian Ocean Dipole （IOD）. By analyzing a long data record, the authors focus on the time-frequency characteristics of these relationships, and of the structure of IOD. They also focus on the seasonal dependence of those characteristics in both time and frequency domains. Among the Nino-3.4 SST, IOD, and SSTs over the tropical western Indian Ocean （WIO） and eastern Indian Ocean （EIO）, the WIO SST has the strongest annual and semiannual oscillations. While the Nino-3.4 SST has large inter-annual variability that is only second to its annual variability, the IOD is characterized by the largest semiannual oscillation, which is even stronger than its annual oscillation. The IOD is strongly and stably related to the EIO SST in a wide range of frequency bands and in all seasons. However, it is less significantly related to the WIO SST in the boreal winter and spring. There exists a generally weak and unstable relationship between the WIO and EIO SSTs, especially in the biennial and higher frequency bands. The relationship is especially weak in summer and fall, when IOD is apparent, but appears highly positive in winter and spring, when the IOD is unimportantly weak and even disappears. This feature reflects a caution in the definition and application of IOD. The Nino-3.4 SST has a strong positive relationship with the WIO SST in all seasons, mainly in the biennial and longer frequency bands. However, it shows no significant relationship with the EIO SST in summer and fall, and with IOD in winter and spring.
