Home Latest Articles
Latest Articles
  • Wentao Ye, Jiaqi Hu, Haobo Wang, Gang Chen, Junbo Zhao
    Journal of Computer Research and Development. 2025, 62(7): 1668-1684.

    The recent popularity of large language models (LLMs) has brought a significant impact to boundless fields, particularly through their open-ended ecosystem such as the APIs, open-sourced models, and plugins. However, with their widespread deployment, there is a general lack of research that thoroughly discusses and analyzes the potential risks concealed. In that case, we intend to conduct a preliminary but pioneering study covering the robustness, consistency, and credibility of LLMs systems. With most of the related literature in the era of LLMs uncharted, we propose an automated workflow that copes with an upscaled number of queries/responses. Overall, we conduct over a million queries to the mainstream LLMs including ChatGPT, LLaMA, and OPT. Core to our workflow consists of a data primitive, followed by an automated interpreter that evaluates these LLMs under different adversarial metrical systems. As a result, we draw several and perhaps unfortunate conclusions that are quite uncommon from this trendy community. Briefly, they are: 1) the minor but inevitable error occurrence in the user-generated query input may, by chance, cause the LLM to respond unexpectedly; 2) LLMs possess poor consistency when processing semantically similar query input. In addition, as a side finding, we find that ChatGPT is still capable to yield the correct answer even when the input is polluted at an extreme level. While this phenomenon demonstrates the powerful memorization of the LLMs, it raises serious concerns about using such data for LLM-involved evaluation in academic development. To deal with it, we propose a novel index associated with a dataset that roughly decides the feasibility of using such data for LLM-involved evaluation. Extensive empirical studies are tagged to support the aforementioned claims.

  • Qinxin Li, Wenhao Wu, Zhaohua Wang, Zhenyu Li
    Journal of Computer Research and Development. 2025, 62(7): 1685-1712.

    The domain name system (DNS) recursive resolving service acts as a bridge between users and upstream DNS authoritative servers to enable users to conveniently resolve domain names through local DNS servers. However, as the first gateway for communication with users, DNS recursive resolving services have become a significant target for attacks on Internet infrastructure. Given the vast scale and variety of DNS recursive service deployments, current DNS security enhancements struggle with implementation complexity and compatibility issues. Despite its importance, there is a noticeable lack of research focused on the deployment of security protection mechanisms for DNS recursive services, as well as the comprehensive assessment of the associated security threats. To bridge this gap, we categorize the security risks associated with DNS recursive services into five main types: cache poisoning, DNS hijacking, direct attacks on recursive servers, leveraging recursive servers to target other servers, and exploiting software vulnerabilities. Additionally, we provide a summary of the latest research on DNS recursive service security threats and DNS security enhancement mechanisms. Our review also summarizes measurement methods for assessing the security risks. Finally, we analyze the current state of DNS recursive service security and offer insights into future research directions for improving the security monitoring and governance of DNS recursive services.

  • Dongyue Xu, Yunzhe Tian, Kang Chen, Yike Li, Yalun Wu, Endong Tong, Wenjia Niu, Jiqiang Liu, Zhongzhi Shi
    Journal of Computer Research and Development. 2025, 62(7): 1713-1737.

    With the rapid development of deep learning, signal modulation recognition based on deep neural networks has gained popularity in wireless communications research. However, it has been observed that the deep neural network model is vulnerable to adversarial perturbations, rendering the modulation identification task ineffective. Currently, there are theoretical gaps and bottlenecks in wireless communication security research. Due to the multidimensional nature of wireless communication, including factors such as experimental environments, data structures, and signal characteristics, it is not feasible to transfer the established attack and defense methods from other domains to signal countermeasures. In this paper, we comprehensively summarize the research on adversarial attack and defense technology in the field of signal modulation recognition. We propose a generic classification framework and threat model for adversarial attacks in this field. And we classify the research in this field into two categories: physical self-defense attacks and digital direct access attacks. Then, we systematically integrate and visualize the research as two-dimensional diagrams to demonstratively showcase the methods, models, and techniques of adversarial attack. Additionally, we provide details on the methods and models of adversarial attack. We present the existing research on adversarial attack methods, adversarial examples generation techniques, theoretical formulas, and adversarial detection and defense techniques. We systematically refine the characteristics of the three dimensions of adversarial attacks on wireless communications and summarize the corresponding processing methods. Finally, we summarize the future research and development direction of the attack and defense security field oriented towards signal modulation recognition.

  • Renhua He, Bing Li, Yibo Du, Ying Wang, Xiaowei Li, Yinhe Han
    Journal of Computer Research and Development. 2025, 62(7): 1738-1753.

    With the rapid development of cloud computing, quantum computing and other advanced technologies, data privacy is facing increasingly severe threats. Especially in recent years, more and more users have been storing their sensitive data and applications in the cloud to take advantage of convenient services and powerful computing capabilities. However, traditional security technologies can not fully guarantee the security of cloud computing. Introducing fully homomorphic encryption algorithms is one of the effective ways to address this issue. At the same time, fully homomorphic encryption technology based on lattice theory has the capabilities of natural resistance to quantum attacks and arbitrary calculations on data in an encrypted state, effectively guaranteeing data security in the quantum computing era. Although fully homomorphic encryption shows significant potential, it suffers the problem of the volume explosion of computing and storage. To address the above problem and speed up the widespread adoption of fully homomorphic encryption algorithms, researchers from the fields of algorithms and hardware have proposed a variety of solutions, and significant progress has been made. This work summarizes the progress of mainstream fully homomorphic encryption technology, analysis and compilation of algorithm libraries and fully homomorphic hardware accelerator in the past five years, and finally provides perspective of fully homomorphic encryption technology in the future.

  • Jiahao Xu, Chen Yu, Jian Li, Hai Jin
    Journal of Computer Research and Development. 2025, 62(7): 1754-1770.

    The purpose of computing first network (CFN) is to deeply integrate the ubiquitous computation with network, in order to effectively allocate multi-dimensional basic resources such as computation and storage between clouds, edges and ends through the network, allowing users to use them as transparently as water and electricity resources. Computing resources can be requested on demand and used at any time. Due to heterogeneous computing resources, dynamic network and diverse user needs, it has become one of the core challenging problems to effectively schedule and route resources in computing first network. To address this problem, we design a multi-tier computing resource system (CRS). Different from the existing resource allocation, CRS is a complete computing first network technology solution based on the application layer, considering the computing resources awareness and computational routing. The computing resource system is composed of computing and network resource awareness strategy and computing resource routing protocol. The computing and network resource awareness strategy defines the intra-domain awareness rules within the jurisdiction and the inter-domain awareness rules between different jurisdictions. Based on this, we proposed a greedy-based resource routing algorithm (GBRA), which can dynamically generate a search tree for each task. The computing resource routing protocol completes the allocation of resources through CRS request message, authorization notification message, notification confirmation message and CRS response message. Through extensive simulation experiments, compared with other algorithms, it is demonstrated that CRS can complete the resource allocation of more tasks within the maximum response latency tolerated. In addition, better load balancing can be achieved among the computing nodes within the jurisdiction.

  • Tao Yan, Qihui Shang, Peng Wu, Jiangfeng Zhang, Yuhua Qian, Bin Chen
    Journal of Computer Research and Development. 2025, 62(7): 1771-1785.

    3D shape reconstruction aims to recover the 3D structure information of the scene by using image sequences with different focus levels. Most of the existing 3D shape reconstruction methods evaluate the focus level of the image sequence from a single scale, and guide the reconstruction process by introducing regularization or post-processing methods. Due to the limitation of the selection space of depth information, the reconstruction results often cannot converge effectively. To address this issue, we propose a multi-scale cost aggregation framework for shape from focus (MSCAS). Firstly, non-downsampling multi-scale transformation is introduced to increase the depth information selection space of the input image sequence, and then the cost aggregation is performed by combining the intra-scale sequence correlation and the inter-scale information constraint. Through this expansion-aggregation mode, the doubling of scene depth representation information and the effective fusion of cross-scale and cross-sequence representation information are realized. As a general framework, MSCAS framework can embed existing model design methods and deep learning methods to achieve performance improvement. The experimental results show that MSCAS framework in this paper reduces the root mean square error (RMSE) on average by 14.91% and improves the structural similarity (SSIM) by 56.69% in the four datasets after embedding the model design class SFF method. After embedding the deep learning class SFF method, RMSE in the four datasets decreases by an average of 1.55% and SSIM increases by an average of 1.61%. These results verify the effectiveness of MSCAS framework.

  • Yuanding Zhou, Guopeng Gao, Yaodong Fang, Chuan Qin
    Journal of Computer Research and Development. 2025, 62(7): 1786-1796.

    With the rapid development of multimedia and network technology, the security of digital image content is becoming more and more prominent. In this paper, we propose a deep perceptual image authentication hashing scheme based on window self-attention feature fusion, which can effectively detect whether the perceptual content of the original image has changed. It can be applied to content authentication, tampering recognition, copy detection, and other similar scenarios. This scheme uses a convolutional neural network architecture that integrates a window self-attention mechanism to build a hashing model that encompasses global and local image features. The scheme chunks the shallow features obtained from the backbone network and extracts the corresponding window features, then calculates the correlation between each intermediate local feature and the global feature to filter out the final local features, and finally inputs the local features and global features into the Hash generation module for fusion and compression to obtain the final image Hash code. In the training process, an integrated loss function based on Hash loss and classification loss is used to constrain the model to improve the robustness and discrimination. The experimental results show that this scheme can achieve superior image content authentication performance compared with existing typical perceptual authentication hashing schemes.

  • Qingfeng Li, Yueyan Li, Zhongzhi Luan, Wenlu Zhang, Chunye Gong, Gang Zheng, Bo Kang, Xiangfei Meng
    Journal of Computer Research and Development. 2025, 62(7): 1797-1804.

    The magnetic confinement fusion particle in cell (PIC) gyrokinetic simulation code, VirtEx, has been capable of studying the confinement and transport of the fusion product Alpha, which is the key to fusion energy realization. Alpha particle simulation relies heavily on the computational code of the kinetic ion, which has more complex memory access than the electron, and contains both non-regular accesses and atomic write-back operations, belong to memory-intensive application. MT-3000 as a new heterogeneous acceleration device provided by Tianhe’s new-generation supercomputing platform, has powerful computational performance with its extremely high computational density. Heterogeneous porting of Alpha particle simulations for this device is a great challenge. In order to fully exploit the computational power of the acceleration array in MT-3000, we combine application characteristics and propose some optimization methods, such as recalculation of intermediate variables, customized software cache design, memory locality optimization, and hotspot function merging, which are designed and implemented to reduce the total amount of memory accesses in the program. The medium scale benchmark with gyrokinetic ion shows an overall speedup of 4.2 times, with 10.9, 13.3 and 16.2 times of speedup on hotspot functions Push, Locate and Charge, respectively, meanwhile it shows a good scaling of scalability with 88.4% efficiency with 5 898 240 accelerator cores in 3 840 nodes.

  • Huikang Shi, Zesheng Wang, Kekun Hu, Gang Dong, Youjian Zhao
    Journal of Computer Research and Development. 2025, 62(7): 1805-1815.

    Graph partitioning is a key technique for parallel processing of big graphs. Existing graph partitioning algorithms struggle to balance partition quality and efficiency. Offline partitioning algorithms tend to achieve high partition quality but are time-consuming, while online (or streaming) partitioning algorithms are relatively efficient but suffer from suboptimal partition quality. To address the above problem, we propose a distributed streaming partitioning algorithm with a buffering mechanism in this paper. The algorithm utilizes a multi-loader and multi-partitioner architecture, where multiple loaders read graph data in parallel to improve loading efficiency. Each partitioner maintains a buffer to store graph vertices received from the corresponding loader and sorts them in descending order based on vertex degree, providing better decision-making data for partitioning. Four streaming heuristic rules are pre-configured in the partitioners, which perform parallel partitioning on vertices in the buffer with different goals in mind. A reflow mechanism is employed to fine-tune the partitioning results and improve quality. Experimental results in a distributed system environment show that the proposed algorithm improves partition quality (edge-cut ratio) by more than 18.8% compared with the best existing online partitioning algorithm. Additionally, it reduces the proportion of graph data loading time in the total partitioning time from an average of 30.8% in a single-loader single-partitioner architecture to an average of 20.1%.

  • Xuechao Wei, Zhe Zhou, Yinghui Xu, Jiejing Zhang, Yuan Xie, Guangyu Sun
    Journal of Computer Research and Development. 2025, 62(7): 1816-1832.

    Deploying Transformer models under the conventional pre-train-then-fine-tune paradigm is challenging for multi-task serving, because a full model copy for each downstream task must be maintained, quickly exhausting the storage budget. Recent algorithmic advances in parameter-efficient Transformer (PET) have shown enormous potential to mitigate the storage overhead. They share the pre-trained model among tasks and only fine-tune a small portion of task-specific parameters. Unfortunately, existing serving systems neither have flexible PET task management mechanisms nor can efficiently serve queries to different tasks in batches. Therefore, we propose PetS, a unified framework for multi-task PET serving. Specifically, different PET tasks are expressed by a unified representation in the same framework, which enables flexible PET task management. Based on the unified representation, we design a specialized PET inference engine to batch different tasks’ queries together and execute them with task-agnostic shared operators and task-specific PET operators. Equipped with the PET inference engine, PetS is more scalable with respect to the number of tasks on a single GPU device. To further improve system throughput, we propose a coordinated batching strategy taking query length, PET task type as well as system load balancing together into consideration. To improve the throughput on multiple GPU instances, we also propose a PET-migration based load balancing strategy. We evaluate PetS on platforms with single GPU, including Edge/Desktop/Server GPUs. Comprehensive experiments demonstrate that PetS supports up to 26 times more concurrent tasks and improves the serving throughput by 1.53 times and 1.63 times on desktop and server GPU nodes, respectively. On multiple GPUs, our load-balancing strategy also provides up to 29% speedup.