Home Latest Articles
Latest Articles
  • Mingrui Lao, Zheng Li, Zhaoyun Ding, Xueyi Zhang, Xianghu Yue, Yanming Guo
    Journal of Computer Research and Development. 2026, 63(6): 1506-1521.

    With the widespread application of lightweight models in resource-constrained scenarios such as edge computing, their insufficient adversarial robustness has become increasingly prominent. While adversarial distillation serves as a primary approach to enhance lightweight models’ robustness, existing methods predominantly employ KL (Kullback-Leibler) divergence-based rigid constraints for robust knowledge transfer, which still suffer from flawed knowledge modeling and limited transfer efficiency. To address these issues, we propose an adversarial ranking distillation (ARD) method that significantly improves lightweight models’ robustness through a priority ranking constraint mechanism and a multi-level consistency framework. Specifically, the priority ranking constraint mechanism organizes the output elements of vision models on adversarial samples by importance ranking, enforces teacher-student ranking consistency, and implements differentiable loose coupling constraints by approximating discontinuous ranking processes through hyperbolic tangent functions. Building upon this, the multi-level ranking consistency distillation framework models transfer robustness knowledge from three perspectives: categorical semantic correlation, sample semantic correlation, and adversarial discrepancy correlation, enabling multi-perspective transmission of teachers’ adversarial defense capabilities while synergistically improving lightweight models’ clean sample accuracy and adversarial robustness. Extensive experiments on CIFAR-10, CIFAR-100, and Tiny-ImageNet datasets validate the effectiveness of our method, demonstrating substantial performance advantages over state-of-the-art adversarial distillation approaches. Furthermore, the proposed ARD exhibits enhanced adaptability and generalization capabilities under scenarios of limited training data and black-box attacks, providing an efficient security solution for lightweight model deployment in edge computing environments.

  • Zeyu Zhou, Yan Lin, Shengnan Guo, Youfang Lin, Huaiyu Wan
    Journal of Computer Research and Development. 2026, 63(6): 1522-1533.

    Spatial-temporal trajectory mining plays a crucial role in location-based services. Trajectory representation learning transforms complex trajectory features into low-dimensional representation vectors, enabling various downstream tasks. This process requires effectively extracting spatial-temporal features and motion patterns from trajectories. However, trajectory representation learning faces numerous challenges due to limitations in model capacity and issues with the scale of trajectory datasets. Large language model (LLM), pre-trained on massive high-quality datasets, have demonstrated remarkable capabilities in multi-task applications. Given the similarities between trajectories and natural language, it is feasible to develop an efficient trajectory representation method leveraging LLM. Nevertheless, vanilla LLMs cannot directly handle the unique spatial-temporal characteristics of trajectories or effectively extract motion patterns. To address these issues, we propose a trajectory representation learning model, MPTraj, which leverages LLMs to extract motion patterns. MPTraj introduces a novel trajectory semantic embedder that enables LLMs to process spatial-temporal features and extract movement patterns effectively. Additionally, a trajectory encoder with prompt tuning is integrated to generate high-quality trajectory representations. Furthermore, two pre-training tasks—next trajectory point prediction and movement pattern classification—are designed to enhance the model’s performance on downstream tasks. Experimental results on two real-world datasets and four representative tasks demonstrate the effectiveness of MPTraj.

  • Cunhang Fan, Junling Li, Jingjing Zhang, Youdian Gao, Ying Chen, Jiangyan Yi, Zhao Lü
    Journal of Computer Research and Development. 2026, 63(6): 1534-1547.

    Neuro-oriented speaker extraction is an intelligent speech processing technique that emulates human auditory attention mechanisms, enabling target speaker extraction from mixed speech by decoding the attentional focus embedded in listeners’ EEG (electroencephalogram) signals. This technology offers novel insights into resolving the “cocktail party problem” and holds significant implications for developing intelligent hearing-assistive devices. However, existing approaches confront three critical challenges: inefficient multimodal feature fusion, inadequate local speech feature extraction, and high computational complexity, which collectively constrain practical application efficacy. We propose GALENet, a novel end-to-end time-domain speaker extraction model, featuring three innovative modules: 1) A gated cross-attention fusion mechanism that establishes cross-modal correlations between EEG and speech through bidirectional cross-attention, while adaptively modulating modal contributions via dynamic gating weights to overcome the information interaction limitations of conventional linear fusion; 2) An E-DPRNN network incorporating Conv-U modules within the dual-path architecture to reinforce local short-term feature capture, synergized with residual connections to enhance gradient propagation efficiency; 3) A single-path global modulation (SPGM) block that replaces traditional inter-block modeling with parameter-free pooling and feature modulation, preserves global semantic modeling capability while reducing parameters. These modules collectively achieve efficient multimodal fusion and precise speaker extraction. Experimental validation demonstrates that the proposed method attains average SI-SDR scores of 13.59 dB, 10.44 dB, and 10.17 dB on the Cocktail Party, AVED, and MM-AAD datasets respectively, outperforming the baseline model MSFNet by 5.4%−8.2% while reducing parameters by 49.7%−55.6%. These results substantiate the model’s application potential and effectiveness in neuro-oriented speaker extraction.

  • Qichong Hua, Weiping Ding, Yuepeng Chen, Tianyi Zhou
    Journal of Computer Research and Development. 2026, 63(6): 1548-1562.

    With the continuous development of big data technology, high-dimensional datasets have been increasingly widely applied in various fields. These datasets typically feature high dimensionality and excessive redundancy, which tend to induce model overfitting and increase computational costs. Feature selection helps extracting an informative subset from them, reducing dimensionality and enhancing model interpretability. Although deep neural networks have shown potential in feature extraction, their performance is vulnerable to noise and outliers. To address these challenges, a novel feature selection algorithm based on the intuitionistic fuzzy deep autoencoder (IFDAE) is proposed. First, the algorithm fuses membership and non-membership degree information and applies intuitionistic fuzzy weights to handle uncertainty, thereby suppressing the impact of noise and outliers. Then, it fully learns the highly non-linear latent representations in the deep autoencoder, uses weight transfer to migrate pre-trained knowledge into the target network, and imposes a regularizer on the connection weight matrix between the input layer and the first hidden layer via the structured sparse norm to obtain a structurally sparse weight matrix, thus deriving the weight of each feature. Finally, to verify the effectiveness of the proposed IFDAE algorithm, experiments are conducted on twelve public datasets and one real-world schizophrenia dataset. The results demonstrate that the proposed algorithm exhibits significant superiority in both reconstruction capability and classification performance.

  • Zijie Song, Xin Guan, Zhenzhen Hu, Jia Li, Richang Hong
    Journal of Computer Research and Development. 2026, 63(6): 1563-1573.

    Keyframe selection is an important method for long-form video question answering, as it accurately identifies key content from redundant information and establishes an interpretable reasoning path. However, existing keyframe selection methods face challenges with insufficient semantic sensitivity during end-to-end training, leading to the introduction of a significant amount of irrelevant frame noise, which affects the model’s accuracy and interpretability. To address this, we propose a pseudo-labels guided keyframe selection (PGKS) model. This model first utilizes large language models (LLMs) to semantically integrate questions and answers, generating global descriptive text. It then employs a multimodal alignment model to compute semantic similarity scores between the description and video sampled frames, thereby constructing frame-level pseudo-labels. By guiding the calculation of frame-level similarity scores with these pseudo-labels, the model effectively suppresses irrelevant frame noise, enhancing both the accuracy and interpretability of keyframe selection. The decoupling between the utilization of LLMs and the training of the backbone network is architecturally designed to provide a cost-effective solution for leveraging LLMs in resource-constrained scenarios. Furthermore, our method balances differentiable and non-differentiable sorting results, and introduces a sliding time window mechanism to further improve the model’s understanding of temporal relationships in videos. Experimental results demonstrate that PGKS model achieves an accuracy of 62.67% on the long-form video question answering dataset NExT-QA, outperforming existing methods of comparable size and improving by 8.51% over the baseline without pseudo-label guidance.

  • Linhao Li, Xuandi Zeng, Yibin Tang, Bosheng Liu, Jigang Wu
    Journal of Computer Research and Development. 2026, 63(6): 1574-1583.

    With the rapid advancement of artificial intelligence technologies, large language models (LLMs) have emerged as foundational components in modern intelligent systems. However, the ever-increasing model size—ranging from billions to hundreds of billions of parameters—poses significant challenges in terms of memory footprint and computational overhead, particularly on latency-sensitive and resource-constrained platforms. While low-bit integer quantization (e.g., INT8) has demonstrated effectiveness in reducing memory consumption and improving inference efficiency, it suffers from notable quantization limitations when applied to large-scale models, including quantization-induced accuracy degradation and inefficient storage utilization. To address these issues, we propose a numerical quantization framework, termed low bit sharing (LBS). Built upon conventional integer quantization, LBS provides a structured high-low bit decomposition scheme that preserves only the most significant bits for each parameter and shares the less significant bits within a tensor group. The shared solution can reduce storage requirements while upholding the numerical representational capability. Furthermore, to mitigate accuracy degradation caused by the quantization of high-impact weights, we develop a salient value aware quantization strategy. By employing a Top-K selection algorithm, we isolate the most influential weights—typically residing in the tail of the parameter distribution—and assign them dedicated scaling factors. This targeted treatment effectively suppresses error accumulation during quantization and improves robustness in downstream performance. Experimental results across several state-of-the-art LLMs show that LBS achieves substantial storage reduction while preserving high model accuracy, making it a practical and scalable solution for deployment of large-scale models.

  • Tianyu Li, Xingwei Wang, Rongfei Zeng
    Journal of Computer Research and Development. 2026, 63(6): 1584-1596.

    In recent years, edge-cloud-end collaboration (ECEC) has emerged as an efficient and promising technology for empowering various computation-intensive applications, effectively bridging the gap between data analytics and physical states. Within ECEC, there is an urgent need for a reliable and optimal task scheduling scheme to maximize resource utilization and provide satisfactory services to end users. However, existing scheduling schemes still face numerous challenges, such as the instability and complexity of network topologies, the highly dynamic nature of task priorities, and the lack of trust mechanisms among end users. We propose a blockchain-assisted dynamic priority scheduling strategy capable of transmitting large-scale tasks to edge or cloud servers in dynamic scenarios. We first model the resource allocation and task scheduling problem, establish a dynamic priority assignment model, and employ the analytic hierarchy process to determine the priority of sub-tasks generated from large-scale tasks. Subsequently, we adopt a blockchain-based Lagrangian multiplier distributed island genetic algorithm, which transforms the formulated problem into a convex optimization form to achieve optimal resource allocation under specific schemes. Furthermore, the proposed architecture incorporates a blockchain verification mechanism to enhance system stability and strengthen data privacy protection. Extensive simulation results demonstrate that, compared with several baseline schemes, the proposed solution achieves a 10% reduction in both total system delay and privacy overhead in ECEC.

  • Fangzhou Chen, Qingnan Wang, Danfeng Shan
    Journal of Computer Research and Development. 2026, 63(6): 1597-1612.

    ABR (adaptive bitrate) algorithms play a crucial role in enhancing the QoE (quality of experience) for online video streaming. Existing ABR algorithms rely on network characteristics observed at the application layer for bitrate decisions. However, this approach has inherent limitations: accurate video chunk download times cannot be fully derived from application layer observations. Specifically, these algorithms overlook critical factors such as RTT (round-trip time) and packet loss rate, which impact video chunk transmission, and they exhibit limited responsiveness to rapid network fluctuations. To address this, we propose Prophet, a adaptive bitrate algorithm based on transport layer information. Unlike traditional ABR algorithms, Prophet directly calculates network parameters such as bandwidth, packet loss rate, and RTT at the transport layer, enabling a more accurate assessment of network conditions. Additionally, a download time prediction model is developed based on transport-layer feedback, taking factors into account, like packet loss retransmission and tail latency to achieve precise download time predictions. Experiments conducted in real-world network environments demonstrate that the Prophet algorithm performs well under various network conditions. Compared with existing ABR algorithms, Prophet achieves an average QoE improvement of 0.3%−117.9%, with a notable average QoE increase of 31.7%−117.9% in cellular network conditions.

  • Xiaoguang Li, Jiahong Xie, Lingfeng Li, Yuefeng Du, Junlu Wang
    Journal of Computer Research and Development. 2026, 63(6): 1613-1626.

    An efficient and robust Byzantine fault tolerance (BFT) consensus protocol serves as the cornerstone of consortium blockchain applications. In existing proposal processes, most protocols require the primary node to transmit O(n2) signatures, which significantly impairs protocol efficiency. Some protocols achieve linear view change, where the primary node only needs to send O(n) signatures to verify the validity of proposals, but at the cost of sacrificing optimistic responsiveness or introducing an extra round of message exchange. To address these inherent trade-offs, we propose Climber, a novel BFT consensus protocol that integrates linear view change, optimistic responsiveness, and two-phase commit into a unified framework. Specifically, during view change, the newly-elected primary node enumerates all unlocked commitments generated in the previous view to prove proposal validity without adding extra commit phases, ensuring the protocol’s operational efficiency. Furthermore, the new primary node leverages aggregate signature technology to aggregate unlocked commitments from the same view into an unlocked certificate, reducing the communication complexity of view change to O(n). Additionally, a blacklist mechanism for malicious nodes is introduced, enabling the primary node to verify signatures with a time complexity of O(n). Simulation experiments are conducted under different network scales and malicious node ratios, and the results show that Climber not only maintains competitive throughput and latency performance but also exhibits superior robustness compared with Fast-HotStuff, making it more suitable for large-scale consortium blockchain scenarios.

  • Xinyu Zhao, Si Li
    Journal of Computer Research and Development. 2026, 63(6): 1627-1638.

    The defense methods against adversarial perturbations holds significant importance for the secure application of recognition models. Existing adversarial defense methods typically either leverage fixed adversarial samples to augment classifier training or perform sample reconstruction prior to model input. However, in practical defense scenarios, such approaches suffer from inherent limitations, including inadequate generalizability, loss of critical sample components, and unstable data distribution. To tackle this problem, we propose probability distribution bidirectional guidance for adversarial purification with diffusion model. Specifically, we propose a novel bidirectional guidance strategy encompassing inter-class loops and intra-class aggregation. For the inter-class loop component, cross-domain mapping between adversarial and clean domains is achieved by leveraging the inverse time sequence of stochastic differential equations (SDEs), with targeted interference elimination enabled via the circular consistency principle. Subsequently, latent variable refinement is employed for distribution regularization, enhancing the integrity of noise-free components and the stability of distribution characteristics. For the intra-class aggregation component, it is exploited to strengthen the confidence of category attributes at each time step along the path from the clean domain to the adversarial domain, thereby facilitating the shift toward high-density intervals of the probability distribution. Extensive experiments conducted on benchmark datasets including CIFAR-10, CIFAR-100, and ImageNet demonstrate that our proposed method achieves state-of-the-art (SOTA) performance. Specifically, it yields a 10.9 percentage point (pp) improvement in Standard Acc and a 4.36 pp gain in Robust Acc compared with existing approaches. Furthermore, our method exhibits remarkable advantages in preserving the integrity of noise-free components and demonstrates robust stability throughout the purification process.