Junxiao Han

Junxiao Han

Auto-generated profile, based on publicly available information

Junxiao Han

Hangzhou City University, Hangzhou, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 July 2024
Verified
Conference Paper
Open access
YCYinghao Chen
Yinghao Chen
ZHZehao Hu
Zehao Hu
CZChen Zhi
Chen Zhi
JHJunxiao Han
Junxiao Han
Shuguang DengShuguang Deng
Shuguang Deng
JYJianwei Yin
Jianwei Yin
Unit testing is an essential yet frequently arduous task. Various automated unit test generation tools have been introduced to mitigate this challenge. Notably, methods based on large language models (LLMs) have garnered considerable attention and exhibited promising results in recent years. Nevertheless, LLM-based tools encounter limitations in generating accurate unit tests. This paper presents ChatUniTest, an LLM-based automated unit test generation framework. ChatUniTest incorporates an adaptive focal context mechanism to encompass valuable context in prompts and adheres to a generation-validation-repair mechanism to rectify errors in generated unit tests. Subsequently, we have developed ChatUniTest Core, a common library that implements core workflow, complemented by the ChatUniTest Toolchain, a suite of seamlessly integrated tools enhancing the capabilities of ChatUniTest. Our effectiveness evaluation reveals that ChatUniTest outperforms TestSpark and EvoSuite in half of the evaluated projects, achieving the highest overall line coverage. Furthermore, insights from our user study affirm that ChatUniTest delivers substantial value to various stakeholders in the software testing domain. ChatUniTest is available at https://github.com/ZJU-ACES-ISE/ChatUniTest, and the demo video is available at https://www.youtube.com/watch?v=GmfxQUqm2ZQ.

8 April 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YCYishan Chen
Yishan Chen
JWJie Wu
Jie Wu
JHJunxiao Han
Junxiao Han
HZHailiang Zhao
Hailiang Zhao
Shuguang DengShuguang Deng
Shuguang Deng
Vehicle edge computing (VEC), as an emerging computing paradigm, aims to achieve the high efficiencies and quality of service by distributing computation tasks to vehicles and cloud-edge servers. The resource pricing problem focuses on how to reasonably price the resources of VEC to encourage their allocation and utilization. However, VEC server overloading may lead to performance degradation, especially in urban congested areas. Meanwhile, idle resources near VEC roads, such as parked vehicles and RSUs, are underutilized and can provide additional computation and communication resources to the system. Inspired by this, this article introduces a model to assist VEC by attracting idle vehicles (IVs) to share resources. We use a two-stage Stackelberg game model to address the resource pricing and task offloading problem, analyzing the interaction between requesting vehicles and cloud-edge servers. Through a backward induction method, we transform the problem into a convex optimization problem and theoretically prove the existence of a unique Nash equilibrium. In the first stage, optimal offloading ratio strategy is solved using convex optimization theory. In the second stage, the original problem is decomposed into $2N$ subproblems and solved using the Lagrangian dual method and Karush–Kuhn–Tucker (KKT) conditions for optimal resource pricing. Additionally, a price incentive mechanism and a task-vehicle stable matching game model are employed to recruit IVs around the roads to spontaneously participate in the task offloading process. Finally, simulation results reveal our solution effectively reduces offloading costs, latency, energy use, and enhances task completion compared to others.

27 October 2024
Verified
Conference Paper
Open access
GLGuochang Li
Guochang Li
CZChen Zhi
Chen Zhi
JCJialiang Chen
Jialiang Chen
JHJunxiao Han
Junxiao Han
Shuguang DengShuguang Deng
Shuguang Deng
Automated Program Repair (APR) aims to fix bugs by generating patches. And existing work has demonstrated that "pre-training and fine-tuning" paradigm enables Large Language Models (LLMs) improve fixing capabilities on APR. However, existing work mainly focuses on Full-Model Fine-Tuning (FMFT) for APR and limited research has been conducted on the execution-based evaluation of Parameter-Efficient Fine-Tuning (PEFT) for APR. Comparing to FMFT, PEFT can reduce computing resource consumption without compromising performance and has been widely adopted to other software engineering tasks. To fill this gap, we enhance the existing APR dataset by employing prompt engineering to create an instruction dataset, APR-Instruction, at first. Secondly, we fine-tune four pre-trained LLMs using four different PEFT methods with APR-Instruction. The best fine-tuned model fixes 58% more bugs than the state-of-the-art LLM-based APR techniques. The results also show that (IA)3 improves the creativity of LLMs more effectively through fine-tuning and achieves the highest fixing capability compared to the other three PEFT methods. Thirdly, we explore the optimal configuration of PEFT hyperparameters, and assess the impact of instruction dataset size, showing that a larger number of parameters and a larger training dataset do not necessarily result in better performance for PEFT. Lastly, we analyze peak memory usage and trainable parameters to show the efficiency of PEFT. This work provides a comprehensive exploration of PEFT on APR and suggests potentially promising directions for extension to other software engineering downstream tasks. APR-Instruction, PEFT weights, and the fine-tuning code are publicly available as open-source resources.

12 January 2024 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
JHJunxiao Han
Junxiao Han
JZJiahao Zhang
Jiahao Zhang
DLDavid Lo
David Lo
XXXin Xia
Xin Xia
Shuguang DengShuguang Deng
Shuguang Deng
MWMinghui Wu
Minghui Wu
Attracting and retaining newcomers are critical for the sustainable development of Open Source Software (OSS) projects. Considerable efforts have been made to help newcomers identify and overcome barriers in the onboarding process. However, fewer studies focus on newcomers’ activities before their successful onboarding. Given the rising popularity of deep learning (DL) techniques, we wonder what the onboarding process of DL newcomers is, and if there exist commonalities or differences in the onboarding process for DL and non-DL newcomers. Therefore, we reported a study to understand the growth trends of DL and non-DL newcomers, mine DL and non-DL newcomers’ activities before their successful onboarding (i.e., past activities), and explore the relationships between newcomers’ past activities and their first commit patterns and retention rates. By analyzing 20 DL projects with 9,191 contributors and 20 non-DL projects with 9,839 contributors, and conducting email surveys with contributors, we derived the following findings: 1) DL projects have attracted and retained more newcomers than non-DL projects. 2) Compared to non-DL newcomers, DL newcomers encounter more deployment, documentation, and version issues before their successful onboarding. 3) DL newcomers statistically require more time to successfully onboard compared to non-DL newcomers, and DL newcomers with more past activities (e.g., issues, issue comments, and watch) are prone to submit an intensive first commit (i.e., a commit with many source code and documentation files being modified). Based on the findings, we shed light on the onboarding process for DL and non-DL newcomers, highlight future research directions, and provide practical suggestions to newcomers, researchers, and projects.

29 July 2024 in Computing
Verified
Journal Article
Closed access
PDF file
YCYishan Chen
Yishan Chen
XLXiansong Luo
Xiansong Luo
PLPeng Liang
Peng Liang
JHJunxiao Han
Junxiao Han
.X. Zhonghui Xu
. Zhonghui Xu

26 August 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YCYishan Chen
Yishan Chen
JZJianwei Zhang
Jianwei Zhang
WDWenshuo Dai
Wenshuo Dai
JHJunxiao Han
Junxiao Han
MCMiaojiang Chen
Miaojiang Chen
Ahmed FaroukAhmed Farouk
Ahmed Farouk
With the rapid evolution of 5G and the ongoing development of 6G technologies, the Internet of Vehicles (IoV) is expected to play a critical role in next-generation intelligent transportation systems. Applications, such as autonomous driving, augmented reality, and smart mobility not only require ultralow latency and high computational efficiency, but also demand enhanced trustworthiness and privacy assurance. To address these demands, vehicular edge computing (VEC) has emerged as a foundational paradigm for 6G-IoT, enabling intelligent services by offloading tasks from vehicles to edge nodes. However, task offloading in IoV-VEC systems still faces critical challenges, including the need for responsible AI decision-making under dynamic network conditions and the protection of sensitive vehicular data. This article proposes federated vehicle task offloading (FedVTO), a privacy-preserving FedVTO framework that integrates federated learning (FL) and deep reinforcement learning (DRL) to optimize task offloading decisions and resource allocation strategies in VEC networks. By incorporating information entropy models and dynamically adjusting weighting parameters using an entropy-based method within a three-tier architecture (vehicles, roadside unit, and cloud server), FedVTO minimizes latency, energy consumption, and privacy leakage. Experimental results show that FedVTO significantly improves task offloading efficiency and mitigates privacy risks compared to traditional methods in dynamic VEC environments.