Most Read articles

    Published in last 1 year |  In last 2 years |  In last 3 years |  All

    All
    Please wait a minute...
    For Selected: Toggle Thumbnails
    Source code vulnerability detection method based on Transformer-GCN
    Chen LIANG, Yisen WANG, Qiang WEI, Jiang DU
    Journal of Computer Applications    2025, 45 (7): 2296-2303.   DOI: 10.11772/j.issn.1001-9081.2024070998
    Abstract660)   HTML3)    PDF (3389KB)(926)       Save

    The existing deep learning-based methods for source code vulnerability detection often suffer from severe loss of syntax and semantics in target code, and neural network models allocating weights to the graph nodes (edges) in target code unreasonably. To address these issues, a method named VulATGCN for detecting source code vulnerabilities was proposed on the basis of Code Property Graph (CPG) and Adaptive Transformer-Graph Convolutional Network (AT-GCN). In the method, CPG was used to represent source code, CodeBERT was combined for node vectorization, and graph centrality analysis was employed to extract deep structural features, thereby capturing the code’s syntax and semantic information in multi-dimensional way. After that, AT-GCN model was designed by integrating strengths of Transformer-based self-attention mechanism, which excels at capturing long-range dependencies, and Graph Convolutional Network (GCN), which is proficient at capturing local features, thereby realizing fusion learning and precise extraction of features from regions with different importance. Experimental results on real vulnerability datasets Big-Vul and SARD show that the proposed method VulATGCN achieves an average F1 score of 82.9%, which is 10.4% to 132.9% higher than deep learning-based vulnerability detection methods such as VulSniper, VulMPFF, and MGVD, with an average increase of approximately 52.9%.

    Table and Figures | Reference | Related Articles | Metrics
    Dynamic detection method of eclipse attacks for blockchain node analysis
    Shuo ZHANG, Guokai SUN, Yuan ZHUANG, Xiaoyu FENG, Jingzhi WANG
    Journal of Computer Applications    2025, 45 (8): 2428-2436.   DOI: 10.11772/j.issn.1001-9081.2024081101
    Abstract638)   HTML9)    PDF (1546KB)(83)       Save

    Eclipse attacks, as a significant threat to blockchain network layer, can isolate the attacked node from entire network by controlling its network connections, thus affecting its ability to receive block and transaction information. On this basis, attackers can also launch double-spending and other attacks, which causes substantial damage to blockchain system. To address this issue, a dynamic detection method of eclipse attacks for blockchain node analysis was proposed by incorporating deep learning models. Firstly, Node Comprehensive Resilience Index (NCRI) was utilized to represent multidimensional attribute features of the nodes, and Graph ATtention network (GAT) was introduced to update the node features of network topology dynamically. Secondly, Convolutional Neural Network (CNN) was employed to fuse multidimensional features of the nodes. Finally, a Multi-Layer Perceptron (MLP) was used to predict vulnerability of the entire network. Experimental results indicate that an accuracy of up to 89.80% is achieved by the method under varying intensities of eclipse attacks, and that the method maintains stable performance in continuously changing blockchain networks.

    Table and Figures | Reference | Related Articles | Metrics
    Review of interpretable deep knowledge tracing methods
    Jinxian SUO, Liping ZHANG, Sheng YAN, Dongqi WANG, Yawen ZHANG
    Journal of Computer Applications    2025, 45 (7): 2043-2055.   DOI: 10.11772/j.issn.1001-9081.2024070970
    Abstract586)   HTML33)    PDF (2726KB)(2061)       Save

    Knowledge Tracing (KT) is a cognitive diagnostic method aimed at simulating learner's mastery level of learned knowledge by analyzing learner's historical question answering records, ultimately predicting learner's future question answering performance. Knowledge tracing techniques based on deep neural network models have become a hot research topic in knowledge tracing field due to their strong feature extraction capabilities and superior prediction performance. However, deep learning-based knowledge tracing models often lack good interpretability. Clear interpretability enable learners and teachers to fully understand the reasoning process and prediction results of knowledge tracing models, thus facilitating the formulation of learning plans tailored to the current knowledge state for future learning, and enhance the trust of learners and teachers in knowledge tracing models at the same time. Therefore, interpretable Deep Knowledge Tracing (DKT) methods were reviewed. Firstly, the development of knowledge tracing and the definition as well as necessity of interpretability were introduced. Secondly, improvement methods proposed for solving the lack of interpretability in DKT models were summarized and listed from the perspectives of feature extraction and internal model enhancement. Thirdly, the related publicly available datasets for researchers were introduced, and the influences of dataset features on interpretability were analyzed, discussing how to evaluate knowledge tracing models from both performance and interpretability perspectives, and sorting out the performance of DKT models on different datasets. Finally, some possible future research directions to address current issues in DKT models were proposed.

    Table and Figures | Reference | Related Articles | Metrics
    Emotion recognition method compatible with missing modal reasoning
    Bing YIN, Zhenhua LING, Yin LIN, Changfeng XI, Ying LIU
    Journal of Computer Applications    2025, 45 (9): 2764-2772.   DOI: 10.11772/j.issn.1001-9081.2024091262
    Abstract577)   HTML7)    PDF (1596KB)(154)       Save

    Aiming at the problem of model compatibility caused by modality absence in real complex scenes, an emotion recognition method was proposed, supporting input from any available modality. Firstly, during the pre-training and fine-tuning stages, a modality-random-dropout training strategy was adopted to ensure model compatibility during reasoning. Secondly, a spatio-temporal masking strategy and a feature fusion strategy based on cross-modal attention mechanism were proposed respectively, so as to reduce risk of the model over-fitting and enhance cross-modal feature fusion effects. Finally, to solve the noise label problem brought by inconsistent emotion labels across various modalities, an adaptive denoising strategy based on multi-prototype clustering was proposed. In the strategy, class centers were set for different modalities, and noisy labels were removed by comparing the consistency between clustering categories of each modality’ features and their labels. Experimental results show that on a self-built dataset, compared with the baseline Audio-Visual Hidden unit Bidirectional Encoder Representation from Transformers (AV-HuBERT), the proposed method improves the Weighted Average Recall rate (WAR) index by 6.98 percentage points of modality alignment reasoning, 4.09 percentage points while video modality is absent, and 33.05 percentage points while audio modality is absent; compared with AV-HuBERT on public video dataset DFEW, the proposed method achieves the highest WAR, reaching 68.94%.

    Table and Figures | Reference | Related Articles | Metrics
    Dual-population dual-stage evolutionary algorithm for complex constrained multi-objective optimization problems
    Zhichao YUAN, Lei YANG, Jinglin TIAN, Xiaowei WEI, Kangshun LI
    Journal of Computer Applications    2025, 45 (8): 2656-2665.   DOI: 10.11772/j.issn.1001-9081.2024081130
    Abstract563)   HTML0)    PDF (2608KB)(425)       Save

    For Constrained Multi-Objective Optimization Problem (CMOP) with complex constraints, balancing the algorithm's convergence and diversity effectively while ensuring strict constraint satisfaction is a significant challenge. Therefore, a Dual-Population Dual-Stage Evolutionary Algorithm (DPDSEA) was proposed. In this algorithm, two independently evolving populations were introduced: the main and secondary populations, and the feasibility rules and an improved epsilon constraint handling method were used for updating, respectively. In the first stage, the main and secondary populations were employed to explore the Constrained Pareto Front (CPF) and the Unconstrained Pareto Front (UPF), respectively, to obtain positional information about the UPF and the CPF. In the second stage, a classification method was designed to classify CMOPs based on positions of the UPF and the CPF, thereby executing specific evolutionary strategies for different types of CMOPs. Additionally, a random perturbation strategy was proposed to perturb the secondary population evolved near the CPF randomly to generate some individuals on the CPF, thereby promoting convergence and distribution of the main population on the CPF. Finally, experiments were conducted on LIRCMOP and DASCMOP test sets to compare the proposed algorithm with six representative algorithms: CMOES (Constrained Multi-Objective Optimization based on Even Search), dp-ACS (dual-population evolutionary algorithm based on Adaptive Constraint Strength), c-DPEA (Dual-population based Evolutionary Algorithm for constrained multi-objective optimization), CAEAD (Constrained Evolutionary Algorithm based on Alternative Evolution and Degeneration), BiCo (evolutionary algorithm with Bidirectional Coevolution), and DDCMOEA (Dual-stage Dual-Population Evolutionary Algorithm for Constrained Multiobjective Optimization). The results show that DPDSEA achieves 15 best Inverted Generational Distance (IGD) values and 12 best Hyper Volume (HV) values in 23 problems, demonstrating DPDSEA’s performance advantages in handling complex CMOPs significantly.

    Table and Figures | Reference | Related Articles | Metrics
    Point cloud classification and segmentation network based on dual attention mechanism and multi-scale fusion
    Weigang LI, Jiale SHAO, Zhiqiang TIAN
    Journal of Computer Applications    2025, 45 (9): 3003-3010.   DOI: 10.11772/j.issn.1001-9081.2024091254
    Abstract550)   HTML2)    PDF (2371KB)(56)       Save

    The existing networks are difficult to learn local geometric shape information of point clouds effectively, and have problems such as being unable to focus on important feature structure effectively and insufficient fusion. Therefore, a point cloud classification and segmentation network based on Dual Attention Mechanism (DAM) and multi-scale fusion was proposed. Firstly, in the data feature extraction stage, geometric positions and weights of the convolution kernels were adjusted using Geometric Adaptive Convolution (GAC) dynamically, so that it was able to adapt to local geometric structure of the point cloud data dynamically, thereby capturing local features more effectively. Secondly, in order to further improve the feature expression ability, the DAM was introduced to learn and adjust weights of the feature channels and spatial information automatically, thereby enhancing feature representation of the key points. Finally, feature information of different scales was connected for effective fusion to enhance the feature learning effect, thereby making the final feature representation richer and improving classification and segmentation accuracy of the network. Experimental results on ModelNet40, ShapeNet and S3DIS datasets show that the proposed network increases the Overall Accuracy (OA) and mean Intersection over Union (mIoU) compared with PointNet++ and DGCNN (Dynamic Graph Convolutional Neural Network), improving the performance of point cloud classification and segmentation effectively.

    Table and Figures | Reference | Related Articles | Metrics
    Review of research on efficiency of federated learning
    Lina GE, Mingyu WANG, Lei TIAN
    Journal of Computer Applications    2025, 45 (8): 2387-2398.   DOI: 10.11772/j.issn.1001-9081.2024081119
    Abstract548)   HTML115)    PDF (702KB)(709)       Save

    Federated learning is a distributed machine learning framework that effectively addresses the data silo problem and is crucial for ensuring privacy protection for individuals and organizations. However, enhancing the efficiency of federated learning remains a pressing issue due to the unsatisfactory high cost of federated learning caused by the characteristics of this learning. Therefore, a comprehensive summary and investigation of current mainstream research on improving the efficiency of federated learning was provided. Firstly, the background of efficient federated learning, including its origins and core ideas, was reviewed, and the concepts as well as classification of federated learning were explained. Secondly, the efficiency challenges generated by federated learning were discussed and categorized into heterogeneous problems, personalized problems, and communication cost issues. Thirdly, on the above basis, detailed solutions to these efficiency problems were analyzed and discussed, and the research on efficiency of federated learning was categorized into two areas: model compression optimization methods and communication optimization methods, and investigated. Fourthly, by comparison analysis, the advantages and disadvantages of each federated learning method were summarized, and the challenges still exist in efficient federated learning were expounded. Finally, the future research directions in efficient federated learning field were given.

    Table and Figures | Reference | Related Articles | Metrics
    Federated learning algorithm for personalization and fairness
    Hongyang ZHANG, Shufen ZHANG, Zheng GU
    Journal of Computer Applications    2025, 45 (7): 2123-2131.   DOI: 10.11772/j.issn.1001-9081.2024070934
    Abstract537)   HTML7)    PDF (3790KB)(572)       Save

    As a distributed optimization paradigm, Federated Learning (FL) enables a large number of resource-constrained client nodes to train models collaboratively without sharing the data. However, traditional federated learning algorithms, such as fedAvg, often fail to address fairness issues adequately. In practical scenarios, data distributions are highly heterogeneous typically, and conventional aggregation operations may introduce model biases towards certain clients, resulting in significant local performance disparities across clients of the global model. To tackle this challenge, a federated learning algorithm for personalization and fairness named FedPF (Federated learning for Personalization and Fairness) was proposed. FedPF aims to reduce inefficient aggregation behaviors in federated learning effectively, and distribute personalized models among clients by exploring the correlations between the global model and local models, thereby ensuring a balanced performance distribution among clients while maintaining performance of the global model. FedPF was evaluated and analyzed on Synthetic, MNIST, and CIFAR10 datasets, and was compared with three federated learning algorithms: FedProx, q-FedAvg, and FedAvg. Experimental results demonstrate that FedPF achieves notable improvements in both effectiveness and fairness.

    Table and Figures | Reference | Related Articles | Metrics
    Multi-target detection algorithm for traffic intersection images based on YOLOv9
    Yanhua LIAO, Yuanxia YAN, Wenlin PAN
    Journal of Computer Applications    2025, 45 (8): 2555-2565.   DOI: 10.11772/j.issn.1001-9081.2024071020
    Abstract536)   HTML28)    PDF (5505KB)(1138)       Save

    Aiming at the problem of complex traffic intersection images, the difficulty in detecting small targets, and the tendency for occlusion between targets, as well as the color distortion, noise, and blurring caused by changes in weather and lighting, a multi-target detection algorithm ITD-YOLOv9(Intersection Target Detection-YOLOv9) for traffic intersection images based on YOLOv9 (You Only Look Once version 9) was proposed. Firstly, the CoT-CAFRNet (Chain-of-Thought prompted Content-Aware Feature Reassembly Network) image enhancement network was designed to improve image quality and optimize input features. Secondly, the iterative Channel Adaptive Feature Fusion (iCAFF) module was added to enhance feature extraction for small targets as well as overlapped and occluded targets. Thirdly, the feature fusion pyramid structure BiHS-FPN (Bi-directional High-level Screening Feature Pyramid Network) was proposed to enhance multi-scale feature fusion capability. Finally, the IF-MPDIoU (Inner-Focaler-Minimum Point Distance based Intersection over Union) loss function was designed to focus on key samples and enhance generalization ability by adjusting variable factors. Experimental results show that on the self-made dataset and SODA10M dataset, ITD-YOLOv9 algorithm achieves 83.8% and 56.3% detection accuracies and 64.8 frame/s and 57.4 frame/s detection speeds, respectively; compared with YOLOv9 algorithm, the detection accuracies are improved by 3.9 and 2.7 percentage points respectively. It can be seen that the proposed algorithm realizes multi-target detection at traffic intersections effectively.

    Table and Figures | Reference | Related Articles | Metrics
    Batch process quality prediction model using improved time-domain convolutional network with multi-head self-attention mechanism
    Xiaoqiang ZHAO, Yongyong LIU, Yongyong HUI, Kai LIU
    Journal of Computer Applications    2025, 45 (7): 2245-2252.   DOI: 10.11772/j.issn.1001-9081.2024070945
    Abstract528)   HTML2)    PDF (4130KB)(250)       Save

    To improve the training stability of temporal convolutional networks (TCNs) under varying batch sizes and address the issue of low prediction accuracy caused by the inability of batch process quality prediction to capture long-term dependencies and global correlations, a Batch Group Normalization (BGN) and Mish activation function-enhanced residual structure TCN (BMTCN) combined with multi-head self-attention mechanism (MHSA) for batch process quality prediction (BMTCN-MHSA) was proposed. First, the three-dimensional data of the batch process was unfolded into a two-dimensional matrix form, and the data was normalized. Then, singular spectrum analysis (SSA) decomposition was introduced to reconstruct the data. Second, BGN was integrated into the residual part of the time-domain convolution to reduce the network model’s sensitivity to changes in batch size, the Mish activation function was introduced to enhance the model’s generalization ability, and the multi-head self-attention mechanism was utilized to associate and weight feature information from different positions in the sequence, thereby further extracting key feature information and interdependencies within the sequence, and better capturing the dynamic characteristics of the batch process. Finally, the model was validated using penicillin simulation experiment data. The experimental results show that compared to the TCN model, the BMTCN-MHSA model reduces the Mean Absolute Error (MAE) by 56.86%, the Mean Squared Error (MSE) by 48.80%, and achieves a coefficient of determination (R2) of 99.48%, indicating that the BMTCN-MHSA model improves the accuracy of quality prediction for batch processes.

    Table and Figures | Reference | Related Articles | Metrics
    3D object detection algorithm based on multi-scale network and axial attention
    Chengzhi YAN, Ying CHEN, Kai ZHONG, Han GAO
    Journal of Computer Applications    2025, 45 (8): 2537-2545.   DOI: 10.11772/j.issn.1001-9081.2024071058
    Abstract527)   HTML6)    PDF (2618KB)(174)       Save

    In 3D object detection, the detection accuracy of small targets such as pedestrians and cyclists remains low, presenting a challenging issue to perception systems of autonomous vehicles. To estimate the state of surrounding environment accurately and enhance driving safety, a 3D object detection algorithm based on a multi-scale network and axial attention was proposed after improving Voxel R-CNN (Voxel Region-based Convolutional Neural Network) algorithm. Firstly, a multi-scale network and a Pixel-level Fusion Module (PFM) were constructed in the backbone network to obtain richer and more precise feature representations, thereby enhancing robustness and generalization of the algorithm in complex scenarios. Secondly, an axial attention mechanism, tailored for 3D spatial dimension features, was designed and applied to Region of Interest (RoI) multi-scale pooling features, so as to capture both local and global features effectively while preserving essential information in 3D spatial structure, thereby improving accuracy and efficiency of object detection and classification of the algorithm. Finally, a Rotation-Decoupled Intersection over Union (RDIoU) method was brought into regression and classification branches, thereby enabling network to learn more precise bounding boxes and addressing alignment issue between classification and regression. Experimental results on KITTI public dataset show that the proposed algorithm achieves the mean Average Precision (mAP) of 62.25% for pedestrians and 79.36% for cyclists, which are improved by 4.02 and 3.15 percentage points, respectively, compared to baseline algorithm Voxel R-CNN, demonstrating the effectiveness of the improved algorithm in detecting hard-to-perceive objects.

    Table and Figures | Reference | Related Articles | Metrics
    Multi-scale information fusion time series long-term forecasting model based on neural network
    Lanhao LI, Haojun YAN, Haoyi ZHOU, Qingyun SUN, Jianxin LI
    Journal of Computer Applications    2025, 45 (6): 1776-1783.   DOI: 10.11772/j.issn.1001-9081.2024070930
    Abstract525)   HTML10)    PDF (1260KB)(106)       Save

    Time series data come from a wide range of social fields, from meteorology to finance and to medicine. Accurate long-term prediction is a key issue in time series data analysis, processing, and research. Aiming at exploitation and utilization of the correlation of different scales in time series data, a multi-scale information fusion time series long-term forecasting model based on neural network — ScaleNN was proposed with the purpose of better handling multi-scale problem in time series data to achieve more accurate long-term forecast. Firstly, fully connected neural network and convolutional neural network were combined to extract both global and local information effectively, and the two were aggregated for prediction. Then, by introducing a compression mechanism in the global information representation module, longer sequence input was accepted with a lighter structure, which increased perceptual range of the model and improved the model’s performance. Numerous experimental results demonstrate that ScaleNN outperforms the current excellent model in this field — PatchTST (Patch Time Series Transformer) on multiple real-world datasets. In specific, the running time is shortened by 35% with only 19% parameters required. It can be seen that ScaleNN can be applied to time series prediction problems in various fields widely, providing a foundation for forecasting in areas such as traffic flow prediction and weather forecasting.

    Table and Figures | Reference | Related Articles | Metrics
    Time series forecasting model based on segmented attention mechanism
    Huibin WANG, Zhan’ao HU, Jie HU, Yuanwei XU, Bo WEN
    Journal of Computer Applications    2025, 45 (7): 2262-2268.   DOI: 10.11772/j.issn.1001-9081.2024070929
    Abstract508)   HTML6)    PDF (831KB)(116)       Save

    To address the issue of local dependency loss during long-term forecasting due to increased sampling interval after time series segmentation, a time series forecasting model based on Segmented Attention Mechanism (SAMformer) was proposed. Firstly, time static covariates were fused with original data in proportion explicitly to enhance time domain information representation ability of the data. Secondly, two continuous linear layers with bias and an activation function were introduced to fine-tune the fused data, thereby improving the model’s ability to fit nonlinear data. Thirdly, a dot product attention mechanism was introduced in each segment of the segmented series to capture local feature dependencies. Finally, a cross-scale dependency based encoder-decoder architecture was utilized to predict time series data. Several experiments of the proposed model were carried out on five public time series datasets, and the results show that compared with other supervised learning based time series forecasting models, Crossformer, Pyraformer, and Informer, SAMformer reduces the Mean Squared Error (MSE) and Mean Absolute Error (MAE) by 2.0%-62.0% and 0.9%-49.8% respectively. Besides, through ablation experiments, the completeness and effectiveness of the proposed different components are verified, which further shows that fusion of time domain information and intra-segment attention mechanism is helpful to improve the accuracy of time series forecasting.

    Table and Figures | Reference | Related Articles | Metrics
    Digital content copyright protection and fair tracking scheme based on blockchain
    Li’e WANG, Caiyi LIN, Yongdong LI, Xingcheng FU, Xianxian LI
    Journal of Computer Applications    2025, 45 (6): 1756-1765.   DOI: 10.11772/j.issn.1001-9081.2024060901
    Abstract508)   HTML10)    PDF (3016KB)(102)       Save

    In order to solve the problems that copyright owners maliciously frame purchasers up and purchasers know their own watermarks so remove them easily during the digital content copyright protection and tracking processes, a digital content copyright protection and fair tracking scheme based on blockchain was proposed. Firstly, Paillier homomorphic encryption algorithm and key distribution smart contract were used to change the purchaser’s watermark in ciphertext state, and the watermark was embedded in the encrypted digital content. Secondly, the key distribution smart contract and arbitration smart contract were called by the verification node in blockchain, which solved the single point of failure problem in the traditional copyright protection solutions. Finally, experiments were conducted to verify the performance of the proposed scheme. The results show that when the digital content size is 1 024×1 024, compared with the blockchain-enabled accountability mechanism against information leakage in vertical industry services, the proposed scheme has the total execution time of encryption and watermark embedding reduced by 94.92%, and the total decryption execution time reduced by 79.72%. It can be seen that the proposed scheme has low total time and operating costs with good efficiency, and can be widely used in the field of digital content copyright protection.

    Table and Figures | Reference | Related Articles | Metrics
    Multivariate time series prediction method combining local and global correlation
    Xiang WANG, Zhixiang CHEN, Guojun MAO
    Journal of Computer Applications    2025, 45 (9): 2806-2816.   DOI: 10.11772/j.issn.1001-9081.2024091267
    Abstract504)   HTML9)    PDF (2188KB)(113)       Save

    Concerning the insufficient integration of local and global dependencies in the existing time series models, a method integrating local and global correlations for multivariate time series prediction, namely PatchLG (Patch-integrated Local-Global correlation method) was proposed. The proposed method was based on three key components: 1) segmenting the time series into multiple patches, thereby preserving the locality of the time series while making it easier for the model to capture global dependencies; 2) utilizing the depthwise separable convolution and self-attention mechanism to model local and global correlations; 3) decomposing the time series into trend and seasonal items to perform predictions simultaneously, and combining the prediction results of these two items to obtain the final result. Experimental results on seven benchmark datasets demonstrate that PatchLG achieves average improvements of 3.0% and 2.9% in Mean-Square Error (MSE) and Mean Absolute Error (MAE), respectively, compared to the optimal baseline method PatchTST (Patch Time Series Transformer), and has low actual running time and memory usage, validating the effectiveness of PatchLG in time series prediction.

    Table and Figures | Reference | Related Articles | Metrics
    Label noise adaptive learning algorithm based on meta-learning
    Qiaoling QI, Xiaoxiao WANG, Qianqian ZHANG, Peng WANG, Yongfeng DONG
    Journal of Computer Applications    2025, 45 (7): 2113-2122.   DOI: 10.11772/j.issn.1001-9081.2024070932
    Abstract500)   HTML11)    PDF (2377KB)(326)       Save

    Image classification requires the collection of a large number of images for model training and optimization, but the image collection process will bring noisy labels inevitably. To cope with this challenge, robust classification methods have emerged. The setting of hyperparameters in the current robust classification methods needs to be adjusted manually, which brings a lot of loss in human and material resources. Therefore, Meta Hyperparameter Adjuster (MHA) was proposed, which adopted a two-layer nested loop optimization method to learn noise-aware hyperparameter combinations adaptively, and a Meta-FPL (Feature Pseudo-Label adaptive learning algorithm based on Meta learning) algorithm was proposed too. In addition, in order to solve the problem that the backpropagation process in meta training phase consumes a large amount of GPU computing power, the Select Activation Metamodel Layer (SAML) strategy was proposed, which restricts the update of some metamodel layers by comparing sizes of the average gradient of the backpropagation and the meta-gradient in virtual training phase, which improves training efficiency of the model effectively. Experimental results on four benchmark datasets and one real dataset show that compared with MLC (Meta Label Correction for noisy label learning), CTRR (ConTrastive RegulaRization) and Feature Pseudo Label (FPL) algorithms, Meta-FPL algorithm has a higher classification accuracy. In addition, after introducing SAML strategy, the training duration of the backpropagation process in the meta training phase was reduced by 79.52%. It can be seen that Meta-FPL algorithm can effectively improve the accuracy of classification testing in a shorter training time.

    Table and Figures | Reference | Related Articles | Metrics
    Chinese spelling correction model ReLM enhanced with deep semantic features
    Wei ZHANG, Jiaxiang NIU, Jichao MA, Qiongxia SHEN
    Journal of Computer Applications    2025, 45 (8): 2484-2490.   DOI: 10.11772/j.issn.1001-9081.2024071015
    Abstract498)   HTML8)    PDF (1067KB)(766)       Save

    As a current leading Chinese Spelling Correction (CSC) model, ReLM (Rephrasing Language Model) has insufficient feature representation in complex semantic scenarios. To address this issue, an ReLM enhanced with deep semantic features, namely FeReLM (Feature-enhanced Rephrasing Language Model), was proposed. In the model, Depthwise Separable Convolution (DSC) technique was used to integrate deep semantic features generated by feature extraction model BGE (BAAI General Embedding) with global features generated by ReLM, thereby enhancing the model’s ability to parse complex contexts and effectively improving the precision in recognizing and correcting spelling errors. Initially, FeReLM was trained on Wang271K dataset, enabling the model to learn deep semantics and complex expressions within sentences continuously. Subsequently, the trained weights were transferred, so that the knowledge learned by the model was applied to new datasets for fine-tuning. Experimental results show that FeReLM outperforms models such as ReLM, MCRSpell (Metric learning of Correct Representation for Chinese Spelling Correction), and RSpell (Retrieval-augmented Framework for Domain Adaptive Chinese Spelling Check) on ECSpell and MCSC datasets in key metrics such as precision, recall, and F1 score, with improvements ranging from 0.6 to 28.7 percentage points. The effectiveness of the proposed method is confirmed through ablation experiments.

    Table and Figures | Reference | Related Articles | Metrics
    Partial label regression algorithm integrating feature attention and residual connection
    Haifeng WU, Liqing TAO, Yusheng CHENG
    Journal of Computer Applications    2025, 45 (8): 2530-2536.   DOI: 10.11772/j.issn.1001-9081.2024071012
    Abstract489)   HTML4)    PDF (1384KB)(235)       Save

    Partial Label Regression (PLR) complements the current situation that Partial Label Learning (PLL) only focuses on classification tasks. To address the problem that the existing PLR algorithms ignore characteristic differences between instance features, a Partial Label Regression algorithm integrating Feature Attention and Residual Connection (PLR-FARC) was proposed. Firstly, labels of real datasets were expanded into a set of real-value candidate labels by label enhancement technique. Secondly, the attention mechanism was employed to generate contribution of individual features to labels automatically. Thirdly, the residual connection was introduced to reduce information loss and maintain feature integrity during feature transmission. Finally, prediction loss was calculated based on IDent (IDentification method) and PIDent (Progressive IDentification method), respectively. Experimental results on Abalone, Airfoil, Concrete, Cpu-act, Housing and Power-plant datasets show that compared to IDent and PIDent, PLR-FARC has the Mean Absolute Error (MAE) reduced by 2.15%, 38.38%, 8.86%, 4.19%, 15.71% and 15.55%, averagely and respectively, and the Mean Squared Error (MSE) reduced by 9.35%, 71.32%, 23.10%, 20.17%, 27.22% and 9.46%, averagely and respectively. It can be seen that the proposed algorithm is feasible and effective.

    Table and Figures | Reference | Related Articles | Metrics
    Detection and defense scheme for backdoor attacks in federated learning
    Jintao SU, Lina GE, Liguang XIAO, Jing ZOU, Zhe WANG
    Journal of Computer Applications    2025, 45 (8): 2399-2408.   DOI: 10.11772/j.issn.1001-9081.2024081120
    Abstract489)   HTML112)    PDF (2521KB)(339)       Save

    Aiming at the commonly existing malicious backdoor attacks in Federated Learning (FL) systems, and the difficulty of achieving a balance between high accuracy of privacy protection and model training in the existing defense schemes, the backdoor attacks and their defense methods in FL were explored, a safe and efficient integrated scheme called GKFL (Generative Knowledge-based Federated Learning) was proposed to detect backdoor attacks and repair damaged models. In this scheme, there was no need to access original privacy data of the participants, detection data were generated through the central server to detect whether the aggregation model in federal learning was backdoor attacked, and knowledge distillation technology was used to repair the damaged models, thereby ensuring integrity and accuracy of the models. Experimental results on datasets MNIST and Fashion-MNIST show that the overall performance of GKFL is better than that of classic schemes such as FoolsGold, GeoMed, and RFA (Robust Aggregation Algorithm); GKFL can better protect data privacy than FoolsGold. It can be seen that GKFL scheme has the ability to detect backdoor attacks and repair the damaged models, and is better than the comparison schemes significantly in terms of model poisoning accuracy and the accuracy of model main task.

    Table and Figures | Reference | Related Articles | Metrics
    Multimodal sentiment analysis model with cross-modal text information enhancement
    Yihan WANG, Chong LU, Zhongyuan CHEN
    Journal of Computer Applications    2025, 45 (7): 2237-2244.   DOI: 10.11772/j.issn.1001-9081.2024060886
    Abstract489)   HTML7)    PDF (1163KB)(206)       Save

    Multimodal Sentiment Analysis (MSA) that utilize text, visual, and audio data to analyze speakers’ emotions in videos have garnered widespread attention. However, the contributions of different modalities to sentiment analysis vary significantly. Generally, the information contained in text is more intuitive, making it particularly important to seek a strategy for enhancing text in sentiment analysis. To address this issue, a Multimodal Sentiment Analysis Model with Cross-modal Text-information Enhancement (MSAM-CTE) was proposed. Firstly, the BERT (Bidirectional Encoder Representations from Transformers) pre-trained model was employed to extract text features, and the Bi-directional Long Short-Term Memory (Bi-LSTM) network was used to further process the pre-processed audio and video features. Then, a text based cross-attention mechanism was applied to integrate text information into emotion related nonverbal representations, thereby learning text oriented pairwise cross-modal mappings to obtain effective unified multimodal representations. Finally, the fused features were utilized for sentiment analysis. Experimental results show that compared to the optimal baseline model — Text Enhanced Transformer Fusion Network (TETFN), the proposed model achieved a 2.6% reduction in Mean Absolute Error (MAE) and a 0.1% increase in Pearson Correlation coefficient (Corr) on the CMU-MOSI (Carnegie Mellon University Multimodal Opinion Sentiment Intensity) dataset;on the CMU-MOSEI (Carnegie Mellon University Multimodal Opinion Sentiment and Emotion Intensity) dataset, the improvements are 3.8% for MAE and 1.7% for Corr, respectively, verifying the effectiveness of MSAM-CTE in sentiment analysis.

    Table and Figures | Reference | Related Articles | Metrics
    Few-shot skin image classification model based on spatial transformer network and feature distribution calibration
    Jing WANG, Jiaxing LIU, Wanying SONG, Jiaxing XUE, Wenxin DING
    Journal of Computer Applications    2025, 45 (8): 2720-2726.   DOI: 10.11772/j.issn.1001-9081.2024071039
    Abstract471)   HTML5)    PDF (1746KB)(72)       Save

    Deep learning-based image classification methods typically require a lot of labeled data. However, in classification task of skin lesions in the medical field, collecting a lot of image data faces numerous challenges. To classify few-shot skin diseases accurately, a few-shot classification model based on Spatial Transformer Network (STN) and feature distribution calibration was proposed. Firstly, transfer learning and meta-learning were integrated to address the overfitting issue in cross-domain few-shot transfer. Secondly, a rotation angle prediction task was inserted before the pre-training classification task to better adapt the model to the high complexity of medical image data. Thirdly, after downsampling the images, a STN was introduced to perform affine transformations on the input images explicitly, thereby enhancing feature extraction and recognition capabilities. Finally, feature distribution calibration was used to constrain new class features, and the nearest centroid algorithm was introduced for classification decisions, thereby reducing algorithm complexity while improving classification accuracy significantly. Experimental results on ISIC2018 skin lesion dataset show that compared to the current mainstream few-shot model Meta-Baseline, the proposed model has the accuracy improvements of 11.80 and 10.82 percentage points in 2-way and 3-way classification tasks, respectively; compared to the model MetaMed, the proposed model has the average accuracy improvements of 6.65 and 9.58 percentage points in 2-way 3-shot and 3-way 3-shot classification tasks, respectively. It can be seen that the proposed model improves the classification accuracy of few-shot skin diseases effectively, and can assist doctors better in enhancing clinical diagnosis accuracy.

    Table and Figures | Reference | Related Articles | Metrics
    Evaluation of training efficiency and training performance of graph neural network models based on distributed environment
    Yinchuan TU, Yong GUO, Heng MAO, Yi REN, Jianfeng ZHANG, Bao LI
    Journal of Computer Applications    2025, 45 (8): 2409-2420.   DOI: 10.11772/j.issn.1001-9081.2024081140
    Abstract469)   HTML95)    PDF (1623KB)(127)       Save

    With the rapid growth of graph data sizes, Graph Neural Network (GNN) faces computational and storage challenges in processing large-scale graph-structured data. Traditional stand-alone training methods are no longer sufficient to cope with increasingly large datasets and complex GNN models. Distributed training is an effective way to address these problems due to its parallel computing power and scalability. However, on one hand, the existing distributed GNN training evaluations mainly focus on the performance metrics represented by model accuracy and the efficiency metrics represented by training time, but pay less attention to the metrics of data processing efficiency and computational resource utilization; on the other hand, the main scenarios for algorithm efficiency evaluation are single machine with one card or single machine with multiple cards, and the existing evaluation methods are relatively simple in a distributed environment. To address these shortcomings, an evaluation method for model training in distributed scenarios was proposed, which includes three aspects: evaluation metrics, datasets, and models. Three representative GNN models were selected according to the evaluation method, and distributed training experiments were conducted on four large open graph datasets with different data characteristics to collect and analyze the obtained evaluation metrics. Experimental results show that all of model complexity, training time, computing node throughput and computing Node Average Throughput Ratio (NATR) are influenced by model architecture and data structure characteristics in distributed training; sample processing and data copying take up much time in training, and the time of one computing node waiting for other computing nodes cannot be ignored either; compared with stand-alone training, distributed training reduces the computing node throughput significantly, and further optimization of resource utilization for distributed systems is needed. It can be seen that the proposed evaluation method provides a reference for optimizing the performance of GNN model training in a distributed environment, and establishes an experimental foundation for further model optimization and algorithm improvement.

    Table and Figures | Reference | Related Articles | Metrics
    Vehicular digital evidence preservation and access control based on consortium blockchain
    Xin SHAO, Zigang CHEN, Xingchun YANG, Haihua ZHU, Wenjun LUO, Long CHEN, Yousheng ZHOU
    Journal of Computer Applications    2025, 45 (6): 1902-1910.   DOI: 10.11772/j.issn.1001-9081.2024030263
    Abstract465)   HTML65)    PDF (2356KB)(365)       Save

    In today’s society, the issue of frequent vehicle traffic accidents is still a serious practical problem. In order to ensure the trusted preservation and legal use of vehicle digital evidence, it is necessary to adopt advanced security technologies and strict access control mechanisms. Aiming at the preservation and sharing requirements of digital evidence on vehicle devices, an evidence preservation and access control scheme based on consortium blockchain was proposed. Firstly, based on consortium blockchain technology and InterPlanetary File System (IPFS), on-chain and off-chain storage of the digital evidence was realized, while confidentiality of the evidence was guaranteed by symmetric key and integrity of the evidence was verified by hash value. Secondly, in the process of uploading, managing and downloading the digital evidence, an access control mechanism combining attributes and roles was introduced to realize fine-grained and dynamic access control management, thereby ensuring legal access and sharing of the evidence. Finally, comparison and performance analysis of the schemes were conducted. Experimental results show that the proposed scheme has confidentiality, integrity and non-repudiation with stability in the case of large number of concurrent requests.

    Table and Figures | Reference | Related Articles | Metrics
    Entity-relation extraction strategy in Chinese open-domains based on large language model
    Yonggang GONG, Shuhan CHEN, Xiaoqin LIAN, Qiansheng LI, Hongming MO, Hongyu LIU
    Journal of Computer Applications    2025, 45 (10): 3121-3130.   DOI: 10.11772/j.issn.1001-9081.2024101536
    Abstract462)   HTML14)    PDF (3025KB)(202)       Save

    Large Language Models (LLMs) face issues of unstable extraction performance in Entity-Relation Extraction (ERE) tasks in Chinese open-domains, and have low precision in recognizing texts and annotated categories in certain specific fields. Therefore, a Chinese open-domain entity-relation extraction strategy based on LLM, called Multi-Level Dialog Strategy for Large Language Model (MLDS-LLM), was proposed. In the strategy, the superior semantic understanding and transfer learning capabilities of LLMs were used to achieve entity-relation extraction through multi-turn dialogues of different tasks. Firstly, structured summaries were generated by using LLM based on the structured logic of open-domain text and a Chain-of-Thought (CoT) mechanism, thereby avoiding relational and factual hallucinations generated by model as well as the problem of inability to consider subsequent information. Then, the limitations of the context window were reduced through the use of a text simplification strategy and the introduction of a replaceable vocabulary. Finally, multi-level prompt templates were constructed on the basis of structured summaries and simplified texts, the influence of the parameter temperature on ERE was explored using LLaMA-2-70B model, and the Precision, Recall, F1 value (F1), and Exact Match (EM) values of entity-relation extraction by LLaMA-2-70B model were tested before and after applying the proposed strategy. Experimental results demonstrate that the proposed strategy enhances the performance of LLM in Named Entity Recognition (NER) and Relation Extraction (RE) on five different domain Chinese datasets such as CL-NE-DS, DiaKG, and CCKS2021. Particularly on the DiaKG and IEPA datasets, which are highly specialized with poor zero-shot test results of model, compared to few-shot prompt test, the model has the precision of NER improved by 9.3 and 6.7 percentage points respectively with EM values increased by 2.7 and 2.2 percentage points respectively, and has the precision of RE improved by 12.2 and 16.0 percentage points respectively with F1 values increased by 10.7 and 10.0 percentage points respectively, proving that the proposed strategy enhances performance of LLM in ERE effectively and solves problem of unstable model performance.

    Table and Figures | Reference | Related Articles | Metrics
    Adversarial sample embedded attention U-Net for 3D medical image segmentation
    Zhixiong XU, Bo LI, Xiaoyong BIAN, Qiren HU
    Journal of Computer Applications    2025, 45 (9): 3011-3016.   DOI: 10.11772/j.issn.1001-9081.2024081134
    Abstract461)   HTML2)    PDF (1665KB)(241)       Save

    Computed Tomography (CT) and Magnetic Resonance Imaging (MRI) images are widely used in medical image depth segmentation. However, the traditional segmentation methods are affected by tumor boundary blurring and structural complexity, and ignore adversarial samples’ differentiation ability to the segmentation model, leading to challenges in achieving optimal segmentation results. To address these issues, a 3D medical image segmentation model with adversarial sample-embedded attention U-Net learning was proposed. In the model, by using the adversarial sample-embedded attention U-Net, adversarial samples were constructed through sample transformation, and tumor feature information was extracted from medical images; low-dimensional feature screening and high-dimensional feature fusion modules were introduced to purify the tumor distinguishable feature; the entire network was trained using a combined loss function based on cross-entropy, Dice loss, and contrastive loss to obtain a segmentation model rich in discriminative features. Experimental results show that on Nerve Sheath Tumor (NST) and Automated Cardiac Diagnosis Challenge (ACDC) datasets, the Dice Similarity Coefficients (DSCs) of the proposed method reach 88.14% and 91.75%, respectively, which are improved by 1.26 and 2.48 percentage points compared to those of not new U-Net (nnU-Net) method. It can be seen that the proposed method improves performance of 3D medical image segmentation with blurred tumor boundary effectively.

    Table and Figures | Reference | Related Articles | Metrics
    Federated learning fairness algorithm based on personalized submodel and K-means clustering
    Zhongrui JING, Xuebin CHEN, Yinlong JIAN, Qi ZHONG, Zhenbo ZHANG
    Journal of Computer Applications    2025, 45 (12): 3747-3756.   DOI: 10.11772/j.issn.1001-9081.2024121794
    Abstract456)   HTML78)    PDF (995KB)(253)       Save

    Traditional Federated Learning (FL) does not consider collaborative fairness, leading to a mismatch between the reward obtained by the client and its actual contribution. To address this issue, a Federated learning fairness algorithm based on Personalized Submodel and K-means clustering (FedPSK) was proposed. Firstly, the neurons in the neural network were clustered according to their activation patterns, and only the importance of the cluster center neurons after clustering was evaluated. And the scores of the cluster center neurons were used to represent the scores of other neurons in the cluster, which reduced the time consumption of neuron evaluation. Then, the number of neurons and their labeling included in the client submodel were selected through hierarchical selection method, and a submodel with a complete neural network structure was constructed for each client. Finally, collaborative fairness was achieved by distributing submodels to the clients. Experimental results on different datasets show that FedPSK improves the correlation coefficient of fairness measurement by 2.70% compared with FedSAC (Federated learning framework with dynamic Submodel Allocation for Collaborative fairness). In terms of time overhead, FedPSK reduces by at least 84.12% compared with FedSAC. It can be seen that FedPSK improves the fairness of FL algorithm, and reduces the time overhead of the algorithm execution greatly, verifying the efficiency of the proposed algorithm.

    Table and Figures | Reference | Related Articles | Metrics
    Two-stage data selection method for classifier with low energy consumption and high performance
    Shuangshuang CUI, Hongzhi WANG, Jiahao ZHU, Hao WU
    Journal of Computer Applications    2025, 45 (6): 1703-1711.   DOI: 10.11772/j.issn.1001-9081.2024060883
    Abstract455)   HTML33)    PDF (2107KB)(144)       Save

    Aiming at the problems of large training data size, long training time and high carbon emission when constructing classification models using massive data, a two-stage data selection method TSDS (Two-Stage Data Selection) was proposed for low energy consumption and high classifier performance. Firstly, the clustering center was determined by modifying the cosine similarity, and the sample data was split and hierarchically clustered on the basis of dissimilar points. Then, the clustering results were sampled adaptively according to the data distribution, so as to obtain a high-quality subset. Finally, the subset was used to train on the classification model, which accelerated the training process and improved the model accuracy at the same time. Support Vector Machine (SVM) and Multi-Layer Perceptron (MLP) classification models were constructed on six datasets, including Spambase, Bupa and Phoneme, to verify the performance of TSDS. Experimental results show that when the sample data compression ratio reaches 85.00%, TSDS can improve the classification model accuracy by 3 to 10 percentage points, and accelerates model training at the same time, with reducing the energy consumption of SVM classifiers by average 93.76%, and reducing that of MLP classifiers by average 75.41%. It can be seen that TSDS can shorten the training time and reduce the energy consumption, as well as improve the performance of classifiers in classification tasks in big data scenarios, thereby helping to achieve the “carbon peaking and carbon neutrality” goal.

    Table and Figures | Reference | Related Articles | Metrics
    P-Dledger: blockchain edge node security architecture
    Di WANG
    Journal of Computer Applications    2025, 45 (8): 2630-2636.   DOI: 10.11772/j.issn.1001-9081.2024111579
    Abstract452)   HTML59)    PDF (3808KB)(844)       Save

    In response to the issues of open deployment environment, weak security measures, vulnerability to security attacks, and insufficient computing and network resources of blockchain edge nodes, a blockchain security architecture based on Trusted Execution Environment (TEE), named P-Dledger, was proposed. In this architecture, by constructing a two-stage trust chain, the trustworthiness of the loaded components was ensured on the basis of meeting requirements for convenient software iteration; by constructing a trustworthy execution framework for smart contracts and a trustworthy data storage based on Serial Peripheral Interface Not OR Flash (SPI NOR Flash), the trustworthy computation of smart contracts and the secure storage of data were guaranteed. Additionally, a monotonically increasing unique identifier was assigned to consensus proposals to restrict the behavior of Byzantine nodes. Experimental and analysis results demonstrate that this architecture ensures the security and trustworthiness of loaded entities, ledger data, and execution processes. When the network latency exceeds 60 ms or the number of nodes is greater than 8, P-Dledger achieves higher throughput than blockchain systems employing Practical Byzantine Fault Tolerance (PBFT) algorithm, and P-Dledger has more stable performance as network latency and the number of nodes increase.

    Table and Figures | Reference | Related Articles | Metrics
    Survey of statistical heterogeneity in federated learning
    Hao YU, Jing FAN, Yihang SUN, Hua DONG, Enkang XI
    Journal of Computer Applications    2025, 45 (9): 2737-2746.   DOI: 10.11772/j.issn.1001-9081.2024091316
    Abstract449)   HTML21)    PDF (2650KB)(1375)       Save

    Federated learning is a distributed machine learning framework that emphasizes privacy protection. However, it faces significant challenges in addressing statistical heterogeneity. Statistical heterogeneity is come from differences in data distribution across participating nodes, which may lead to problems such as model update biases, performance degradation of the global model, and instability in convergence. Aiming at the above problems, firstly, main issues caused by statistical heterogeneity were analyzed in detail, including inconsistent feature distributions, imbalanced label distributions, asymmetrical data sizes, and varying data quality. Secondly, a systematic review of the existing solutions of statistical heterogeneity in federated learning was provided, including local correction, clustering methods, client selection optimization, aggregation strategy adjustments, data sharing, knowledge distillation, and decoupling optimization, with an evaluation of their advantages, disadvantages, and applicable scenarios. Finally, future related research directions were discussed, such as device computing capacity awareness, model heterogeneity adaptation, optimization of privacy security mechanisms, and enhancement of cross-task transferability, thereby providing references for addressing statistical heterogeneity in practical applications.

    Table and Figures | Reference | Related Articles | Metrics
    Recipe recommendation model based on hierarchical learning of flavor embedding heterogeneous graph
    Wenjing YAN, Ruidong WANG, Min ZUO, Qingchuan ZHANG
    Journal of Computer Applications    2025, 45 (6): 1869-1878.   DOI: 10.11772/j.issn.1001-9081.2024060859
    Abstract439)   HTML5)    PDF (2465KB)(70)       Save

    Aiming at the problems of incomplete information dimension, sparse interaction data and redundant interaction information in recipe recommendation tasks, a Recipe recommendation model based on hierarchical learning of Flavor embedding heterogeneous graph (RecipeFlavor) was proposed. Firstly, the flavor molecule dimension was introduced, and a heterogeneous graph was constructed on the basis of users, foods, ingredients and flavor substances of ingredients to represent the connection among four kinds of nodes effectively. Then, a hierarchical learning module based on heterogeneous graph was constructed on the basis of information transmission mechanism, and combined with Squeeze Attention (SA) mechanism, different node relationships were regarded as different information channels, so that key interaction information between nodes was extracted and noise was suppressed. Finally, a Contrastive Learning (CL) module was constructed on the basis of feature-aware noise, and positive and negative sample discrimination tasks were introduced in model learning, thereby enhancing the information associations among users and recipe nodes and improving the model’s learning ability for features. Experimental results show that compared with HGAT (Hierarchical Graph ATtention network for recipe recommendation) model on Recipe 1M+ large dataset, RecipeFlavor has the Area Under the ROC Curve (AUC) increased by 1.44 percentage points, and the model Precision (Pre), Hit Rate (HR), Mean Average Precision (MAP), and Normalized Discounted Cumulative Gain (NDCG) of Top-10 increased by 0.76, 6.11, 2.68, and 3.05 percentage points, respectively. It can be seen that the introduction of flavor molecule information expands the learning dimension of recipe recommendation, and RecipeFlavor can extract key information in heterogeneous graph effectively, and enhance correlation among users and recipes, and thus improving the precision of recipe recommendations.

    Table and Figures | Reference | Related Articles | Metrics
    Review of open set domain adaptation
    Chuang WANG, Lu YU, Jianwei CHEN, Cheng PAN, Wenbo DU
    Journal of Computer Applications    2025, 45 (9): 2727-2736.   DOI: 10.11772/j.issn.1001-9081.2024091277
    Abstract438)   HTML26)    PDF (859KB)(439)       Save

    As a critical technique in transfer learning, domain adaptation addresses the issue of different distributions in training and test datasets well. However, traditional domain adaptation methods are typically limited to scenarios where the target-domain and source-domain datasets are with same number and types of categories. In practical applications, these scenarios are often difficult to meet. Open Set Domain Adaptation (OSDA) emerges to address this challenge. In order to fill the gap in this field and provide a reference for related research, a summary and analysis of OSDA methods emerged in recent years were conducted. Firstly, the related concepts and basic structure were introduced. Secondly, the related typical methods were sorted out and analyzed from three stages: data augmentation-oriented, feature extraction-oriented, and classifier-oriented. Finally, future development directions of OSDA were prospected.

    Table and Figures | Reference | Related Articles | Metrics
    Review of large language model methods for knowledge graph completion
    Haoyang ZHANG, Liping ZHANG, Sheng YAN, Na LI, Xuefei ZHANG
    Journal of Computer Applications    2026, 46 (3): 683-695.   DOI: 10.11772/j.issn.1001-9081.2025030294
    Abstract436)   HTML115)    PDF (816KB)(342)       Save

    Knowledge Graph (KG) can extract and structurally represent the prior knowledge from massive data, and plays a key role in the construction and application of intelligent systems. Knowledge Graph Completion (KGC) aims to predict missing triples in the KGs to improve integrity and usability, and usually covers encoding and prediction links. However, the traditional KGC methods have difficulties in utilizing additional information and semantic information effectively in the encoding process, the problems of incomplete knowledge coverage and closed world in the prediction process, and the framework of first encoding and then prediction will be limited by embedded representation forms and computing efficiency. Large Language Models (LLMs) can solve these problems with rich knowledge and strong understanding abilities. Therefore, LLM methods for KGC were reviewed. Firstly, the basic concepts and research status of KGs and LLMs were outlined, and the KGC process was explained. Secondly, the existing KGC methods based on LLMs were summarized and sorted out from three aspects: using LLM as an encoder, using LLM as an generator, and basing on prompt guidance. Finally, the performance of the models on different datasets was summed up and the problems and challenges faced by KGC research based on LLMs were discussed.

    Table and Figures | Reference | Related Articles | Metrics
    Research review on explainable artificial intelligence in internet of things applications
    Xiaoyang ZHAO, Xinzheng XU, Zhongnian LI
    Journal of Computer Applications    2025, 45 (7): 2169-2179.   DOI: 10.11772/j.issn.1001-9081.2024070927
    Abstract434)   HTML8)    PDF (2756KB)(2400)       Save

    In the era of Internet of Things (IoT), the integration of Artificial Intelligence (AI) and IoT has become a significant trend driving technological advancements and application innovations. With the exponential growth in the number of connected devices, enhancing end-users’ trust in intelligent systems has become especially critical. Explainable Artificial Intelligence (XAI) refers to AI systems capable of providing their decision-making processes and outcome explanations. The emergence of XAI has propelled the development of AI technology and increased users’ trust in AI systems. Therefore, a research review on XAI in IoT applications was performed. Firstly, the background and significance of IoT and XAI were discussed. Secondly, the definition and key technologies of XAI were presented. Thirdly, the recent progress in traditional AI-driven IoT applications as well as XAI-driven IoT applications were introduced. Finally, the future development directions of XAI in IoT applications were prospected and the associated challenges were summarized.

    Table and Figures | Reference | Related Articles | Metrics
    Aspect-based sentiment analysis model integrating syntax and sentiment knowledge
    Ziliang LI, Guangli ZHU, Yulei ZHANG, Jiajia LIU, Yixuan JIAO, Shunxiang ZHANG
    Journal of Computer Applications    2025, 45 (6): 1724-1731.   DOI: 10.11772/j.issn.1001-9081.2024060903
    Abstract426)   HTML18)    PDF (1499KB)(119)       Save

    Aspect-Based Sentiment Analysis (ABSA) is a fine-grained sentiment analysis task aiming to analyze sentiment polarity of specific aspect words in a given text. Existing ABSA methods use Graph Convolutional Network (GCN) to process syntactic and semantic information, but they treat all syntactic dependencies of aspect words equally, ignoring the impact of distant unrelated words on target aspect words, resulting in inappropriate weight allocation of target aspect words and viewpoint words, and insufficient extraction of semantic information. Aiming at these issues, an ABSA model integrating syntax and sentiment knowledge was proposed. Firstly, a reachability matrix was constructed according to syntactic information. Based on this, a syntactic enhancement graph was constructed by weighting the central position through the aspect words. Secondly, a semantic enhancement graph was constructed by external emotional knowledge and aspect enhancement, and graph convolution was used to fully model the syntactic enhancement graph and semantic enhancement graph, respectively, so as to form different feature channels. Thirdly, biaffine attention was used to integrate syntactic and semantic information effectively. Finally, average-pooling and concatenation operations were used to obtain the final feature vectors corresponding to the aspect words. Experimental results indicate that compared with the deep dependency aware graph convolutional network model — DA-GCN-BERT (deep Dependency Aware GCN+BERT(Bidirectional Encoder Representations from Transformers)), the proposed model achieves the accuracy improvements of 1.71, 1.41, 1.27, 0.17, and 0.43 percentage points on five publicly available datasets, respectively. It can be seen that the proposed model has strong applicability in the ABSA field.

    Table and Figures | Reference | Related Articles | Metrics
    Multi-view entity alignment combining triples and text attributes
    Sheping ZHAI, Yan HUANG, Qing YANG, Rui YANG
    Journal of Computer Applications    2025, 45 (6): 1793-1800.   DOI: 10.11772/j.issn.1001-9081.2024050703
    Abstract426)   HTML9)    PDF (1754KB)(149)       Save

    Entity Alignment (EA) is to identify entities referring to the same thing in the Knowledge Graphs (KGs) of different sources. Most of the existing EA models focus on characteristics of the entities themselves, some of the models introduce entity relationship and attribute information to assist in alignment. However, these models ignore potential neighborhood information and semantic information in the entities. In order to solve the above problems, a Multi-view EA model combining triples and text attributes (MultiEA) was proposed. In the proposed model, entity information was divided into multiple views to achieve alignment. For the lack of neighborhood information, Graph Convolutional Network (GCN) and translation model were used to learn relationship information embedded in entities in parallel. Aiming at the lack of semantic information, word embedding and pre-trained language model were adopted to learn semantic information of attribute text. Experimental results show that on the three sub-datasets of DBP15K, compared to the baseline model EPEA (Entity-Pair Embedding Approach for KG alignment) that yields the optimal results, the Hits@1 value of the proposed model is increased by 2.18,1.36 and 0.96 percentage points, respectively, and the Mean Reciprocal Rank (MRR) of the proposed model is improved by 2.4,0.9 and 0.5 percentage points, respectively, indicating the effectiveness of the proposed model.

    Table and Figures | Reference | Related Articles | Metrics
    Subgraph-aware contrastive learning with data augmentation
    Wen LI, Kairong LI, Kai YANG
    Journal of Computer Applications    2026, 46 (1): 1-9.   DOI: 10.11772/j.issn.1001-9081.2025010110
    Abstract426)   HTML42)    PDF (727KB)(582)       Save

    Graph Neural Network (GNN) is an effective graph representation learning method for processing graph structure data. However, the performance of GNN in practical applications is limited by the problem of missing information. On the one hand, the graph structure is usually sparse, making it difficult for the model to learn node features adequately. On the other hand, model training is limited because supervised learning relies on sparse label data, making it difficult to obtain robust node representations. To address these problems, a Subgraph-aware Contrastive Learning with Data Augmentation (SCLDA) model was proposed. Firstly, the relationship scores among nodes were obtained by learning the original graph through link prediction, and the edges with the highest scores were added to the original graph to generate the enhanced graph. Secondly, local subgraphs of the original and enhanced graphs were sampled by using target nodes respectively, and the target nodes of subgraphs were input to the shared GNN encoder, so as to generate the target node embeddings at subgraph level. Finally, the mutual information between similar instances was maximized on the basis of contrastive learning of the target nodes from the two perspective subgraphs. Experimental results of node classification on six public datasets Cora, Citeseer, Pubmed, Cora_ML, DBLP, and Photo show that SCLDA model improves the accuracy over the traditional GCN model by about 4.4%, 6.3%, 4.5%, 7.0%, 13.2% and 9.3%, respectively.

    Table and Figures | Reference | Related Articles | Metrics
    DU-FastGAN: lightweight generative adversarial network based on dynamic-upsample
    Guoyu XU, Xiaolong YAN, Yidan ZHANG
    Journal of Computer Applications    2025, 45 (10): 3067-3073.   DOI: 10.11772/j.issn.1001-9081.2024101535
    Abstract419)   HTML70)    PDF (3450KB)(307)       Save

    In recent years, Generative Adversarial Networks (GANs) have been widely used for data augmentation, which can solve the problem of insufficient training samples effectively and has important research significance for model training. However, the existing GAN models for data augmentation have problems such as high requirements for datasets and unstable model convergence, which can lead to distortion and deformation of the generated images. Therefore, a lightweight GAN based on dynamic-upsample — DU-FastGAN (Dynamic-Upsample-FastGAN) was proposed for data augmentation. Firstly, a generator was constructed through a dynamic-upsample module, which enables the generator to use upsampling methods of different granularities based on the size of the current feature map, thereby reconstructing textures, and enhancing overall structure and local detail quality of the synthesis. Secondly, in order to enable the model to better obtain global information flow of images, a weight information skip connection module was proposed to reduce the disturbance of convolution and pooling operations on features, thereby improving the model’s learning ability for different features, and making details of the generated images more realistic. Finally, a feature loss function was given to improve the quality of the model generation by calculating relative distance between the corresponding feature maps during the sampling process. Experimental results show that compared with methods such as FastGAN, MixDL (Mixup-based Distance Learning), and RCL-master (Reverse Contrastive Learning-master), DU-FastGAN achieves a maximum reduction of 23.47% in FID (Fréchet Inception Distance) on 10 small datasets, thereby reducing distortion and deformation problems in the generated images effectively, and improving the quality of the generated images. At the same time, DU-FastGAN achieves lightweight overhead with model training time within 600 min.

    Table and Figures | Reference | Related Articles | Metrics
    Vehicular edge computing scheme with task offloading and resource optimization
    Tianyu XUE, Aiping LI, Liguo DUAN
    Journal of Computer Applications    2025, 45 (6): 1766-1775.   DOI: 10.11772/j.issn.1001-9081.2024060905
    Abstract415)   HTML14)    PDF (3414KB)(119)       Save

    In view of the increasing demand for user experience quality, the difficulty in obtaining link status caused by highly mobile vehicles, and the time-varying problem of heterogeneous edge nodes providing resources to vehicles in Vehicle Edge Computing (VEC), a VEC scheme based on Joint Task Offloading and Resource Optimization (JTO-RO) was developed. Firstly, without loss of the generality, a Vehicle-to-Infrastructure (V2I) transmission model was proposed by considering the intra-edge and inter-edge interference comprehensively. In the model, by introducing Non-Orthogonal Multiple Access (NOMA) technology, edge nodes did not rely on link status information and improved the channel capacity at the same time. Secondly, in order to enhance performance and efficiency of the system, a Multi-Agent Twin Delayed Deep Deterministic policy gradient (MATD3) algorithm was designed to formulate task offloading strategies, which were able to be adjusted dynamically through interactive learning with the environment. Thirdly, the synergies of the two strategies were considered jointly, and an optimization scheme was formulated with the goal of maximizing the task service ratio to meet the increasing user experience quality requirements. Finally, simulation was carried out on a real vehicle trajectory dataset. The results show that compared with three current representative schemes (the schemes using Random Offloading (RO) algorithm, D4PG (Distributed Distributional Deep Deterministic Policy Gradient) algorithm, and MADDPG (Multi-Agent Deep Deterministic Policy Gradient) algorithm as task offloading algorithms as task offloading algorithm, respectively), the proposed scheme has the average service ratio improved by more than 20%, 10%, and 29%, respectively, in three scenarios (normal scenario, task-intensive scenario and delay-sensitive scenario), verifying the advantages and effectiveness of the scheme.

    Table and Figures | Reference | Related Articles | Metrics
    Improved multi-layer perceptron and attention model-based power consumption prediction algorithm
    Chao JING, Yutao QUAN, Yan CHEN
    Journal of Computer Applications    2025, 45 (8): 2646-2655.   DOI: 10.11772/j.issn.1001-9081.2024081092
    Abstract410)   HTML0)    PDF (3117KB)(65)       Save

    Although the use of heterogeneous computing systems can accelerate the processing of neural network parameters, it also increases system power consumption significantly. Good power consumption prediction methods are fundamental for optimizing power consumption in heterogeneous systems and handling multi-type workloads. Based on the above, by improving multi-layer perceptron and attention model, a power consumption prediction algorithm was proposed for CPU/GPU heterogeneous computing systems with multi-type workloads. Firstly, considering server power consumption and system features, a workload power consumption model based on features was established. Then, to address the issue that the existing power consumption prediction algorithms cannot solve long-range dependence between system features and system power consumption, an improved power consumption prediction algorithm based on multi-layer perceptron-attention model was proposed, namely Prophet. In the algorithm, the multi-layer perceptron was modified to extract system features at different moments, and the attention mechanism was employed to synthesize these features, so that the long-range dependency problem between system features and power consumption was solved effectively. Finally, the experiments were conducted on real heterogeneous systems, and the proposed algorithm was compared with the power consumption prediction algorithms such as MLSTM_PM (Power consumption Model based on Multi-layer Long Short-Term Memory) and ENN_PM (Power consumption Model based on Elman Neural Network). Experimental results show that Prophet achieves higher prediction accuracy, reducing the Mean Relative Error (MRE) for workloads blk, memtest, and busspd by 1.22, 1.01, and 0.93 percentage points, respectively, compared to MLSTM_PM, and has low complexity, indicating the proposed algorithm’s effectiveness and feasibility.

    Table and Figures | Reference | Related Articles | Metrics
    Blockchain-based data notarization model for autonomous driving simulation testing
    Haiyang PENG, Weixing JI, Fawang LIU
    Journal of Computer Applications    2025, 45 (8): 2421-2427.   DOI: 10.11772/j.issn.1001-9081.2024091280
    Abstract408)   HTML10)    PDF (2223KB)(85)       Save

    In order to solve the problem of safety caused by multi-party data sharing in autonomous driving simulation testing, a blockchain-based model for data notarization of autonomous driving simulation testing was proposed to ensure secure storage and traceability of the data, thereby providing reliable support for auditing work. Firstly, the semi-public characteristics of consortium blockchain were utilized to ensure that on-chain data were only visible to authorized organizations, while a permission verification mechanism based on RBAC (Role-Based Access Control) model was employed to implement access control for these organizations. Secondly, a smart contract template was defined to standardize the data access process, and process extension points were open to support customized functions, for example, allowing extension of associated smart contracts to ensure automatic execution of simulation resource trading activities. Finally, optimization strategies, including on-chain and off-chain hybrid storage of InterPlanetary File System (IPFS), data batch processing, and resource data caching, were proposed to address limitations of blockchain storage resources and processing capabilities. Tests were conducted to evaluate the efficiency of data notarization for 500 data simulation scenarios generated by large language models. Experimental results show that compared to the direct access method, the notarization process applying batch processing strategy reduces the total transaction number by 72.00%, decreasing the performance consumption caused by smart contract calls significantly, and has the average time for writing and reading all data reduced by 85.36% and 52.67%, respectively. It can be seen that the proposed model provides reliable technical support for the data security of multi-party data sharing in autonomous driving simulation testing, while the proposed optimization strategies improve the data memory access efficiency significantly.

    Table and Figures | Reference | Related Articles | Metrics
2026 Vol.46 No.4

Current Issue
Archive
Honorary Editor-in-Chief: ZHANG Jingzhong
Editor-in-Chief: XU Zongben
Associate Editor: SHEN Hengtao XIA Zhaohui
Domestic Post Distribution Code: 62-110
Foreign Distribution Code: M4616
Address:
No. 9, 4th Section of South Renmin Road, Chengdu 610041, China
Tel: 028-85224283-803
  028-85222239-803
Website: www.joca.cn
E-mail: bjb@joca.cn
WeChat
Join CCF