Ruqian Zhang

dblp:240/2918 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
5since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 since 2021Software engineering, systems software and programming languages · 2 · 2 since 2021
YearPublicationVenuePosition
2025 Toward Native Intelligence: An Efficient and Flexible AI Services Provision Scheme in Multilayer Heterogeneous Networks
abstract
To fulfill future diverse user requirements, 6G networks are envisioned to provide everyone-centric customized services ubiquitously and precisely. However, the diversity in user requirements and the heterogeneity in network resources challenge conventional network operators in network management and service provision. In this article, we investigate the artificial intelligence (AI) service provision in the multilayer heterogeneous network. To provide ubiquitous intelligence to users with different computing requirements, an intelligence-native network architecture is designed. Based on the proposed architecture and the AI model stitching mechanism, we formulate the joint AI provision and access selection problem as a mixed integer nonlinear programming (MINLP) problem to maximize the average user satisfaction value and user satisfaction rate. Then, a heuristic solution based on Dung Beetle algorithm is proposed to optimize the AI model selection, AI service deployment, user access, and stitching coefficient jointly. Extensive simulations are conducted to evaluate the performance of our proposed architecture and algorithm.
Jingchao He, Nan Cheng 0001, Ruijin Sun, Ruqian Zhang, Conghao Zhou, Wei Quan 0001, Changle Li
IEEE Internet Things J.4
2025 Correction to "Toward Native Intelligence: An Efficient and Flexible AI Services Provision Scheme in Multilayer Heterogeneous Networks"
abstract
Presents corrections to the paper, (Correction to “Toward Native Intelligence: An Efficient and Flexible AI Services Provision Scheme in Multilayer Heterogeneous Networks”).
Jingchao He, Nan Cheng 0001, Ruijin Sun, Ruqian Zhang, Conghao Zhou, Wei Quan 0001, Changle Li
IEEE Internet Things J.4
2024 On the Effectiveness of Function-Level Vulnerability Detectors for Inter-Procedural Vulnerabilities
abstract
Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter-Procedural Vulnerability Dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers; and (ii) function-level vulnerability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities.
Zhen Li 0027, Ning Wang 0098, Deqing Zou, Ruqian Zhang, Shouhuai Xu, Chao Zhang 0008, Hai Jin 0001
ICSE5
2023 Robin: A Novel Method to Produce Robust Interpreters for Deep Learning-Based Code Classifiers
abstract
Deep learning has been widely used in source code classification tasks, such as code classification according to their functionalities, code authorship attribution, and vulnerability detection. Unfortunately, the black-box nature of deep learning makes it hard to interpret and understand why a classifier (i.e., classification model) makes a particular prediction on a given example. This lack of interpretability (or explainability) might have hindered their adoption by practitioners because it is not clear when they should or should not trust a classifier's prediction. The lack of interpretability has motivated a number of studies in recent years. However, existing methods are neither robust nor able to cope with out-of-distribution examples. In this paper, we propose a novel method to produce Robust interpreters for a given deep learning-based code classifier; the method is dubbed Robin. The key idea behind Robin is a novel hybrid structure combining an interpreter and two approximators, while leveraging the ideas of adversarial training and data augmentation. Experimental results show that on average the interpreter produced by Robin achieves a 6.11% higher fidelity (evaluated on the classifier), 67.22% higher fidelity (evaluated on the approximator), and 15.87x higher robustness than that of the three existing interpreters we evaluated. Moreover, the interpreter is 47.31% less affected by out-of-distribution examples than that of LEMNA.
Zhen Li 0027, Ruqian Zhang, Deqing Zou, Ning Wang 0098, Shouhuai Xu, Chen Chen 0001, Hai Jin 0001
ASE2
2023 Service-Oriented Resource Allocation in SDN Enabled LEO Satellite Networks
abstract
As an integral component of space-air-ground integrated networks (SAGINs), the low Earth orbit (LEO) satellite networks have displayed immense potential in providing ubiquitous connectivity and broadband mobile communication. However, the intrinsic dynamics of LEO satellites poses unprecedented challenges in network management, multi-dimensional resource scheduling, and service delivery. In this paper, we study the service function chain (SFC) orchestration in dynamic LEO satellite networks, with the aim of achieving flexible and efficient service provision. Considering the service requirements and the load fairness of LEO satellite networks, we formulate the SFC deployment problem as an integer nonlinear programming (INLP) problem. We then introduce a load-aware SFC orchestration algorithm to improve serving capacity and load fairness. Additionally, we address the issue of SFC migration in dynamic LEO satellite networks to ensure service continuity. To minimize the service interruption and network resource wastes, a Tabu search (TS)-based approach is presented to optimize the virtual network function (VNF) migration. Simulation results demonstrate that our proposed approaches outperform the benchmark by a substantial margin in terms of load fairness, without compromising service acceptance.
Jingchao He, Nan Cheng 0001, Zhisheng Yin, Wenchao Xu 0001, Haixia Peng, Conghao Zhou, Ruqian Zhang
PIMRC8