JIE REN

Dr. JIE REN

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
1 October 2019
Verified
Conference Paper
Closed access
RCRunjin Chen
Runjin Chen
HCHao Chen
Hao Chen
GHGe Huang
Ge Huang
JRJie Ren
Jie Ren
QZQuanshi Zhang
Quanshi Zhang

6 September 2022 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
Zhiqiang LiZhiqiang Li
Zhiqiang Li
Hongyu ZhangHongyu Zhang
Hongyu Zhang
XJXiaoyuan Jing
Xiaoyuan Jing
Juanying XieJuanying Xie
Juanying Xie
MGMin Guo
Min Guo
JRJIE REN
JIE REN
Cross-project defect prediction (CPDP) refers to recognizing defective software modules in one project (i.e., target) using historical data collected from other projects (i.e., source), which can help developers find defects and prioritize their testing efforts. Unfortunately, there often exists large distribution difference between the source and target data. Most CPDP methods neglect to select the appropriate source data for a given target at the project level. More importantly, existing CPDP models are parametric methods, which usually require intensive parameter selection and tuning to achieve better prediction performance. This would hinder wide applicability of CPDP in practice. Moreover, most CPDP methods do not address the cross-project class imbalance problem. These limitations lead to suboptimal CPDP results. In this paper, we propose a novel data selection and sampling based domain programming predictor (DSSDPP) for CPDP, which addresses the above limitations. DSSDPP is a non-parametric CPDP method, which can perform knowledge transfer across projects without the need for parameter selection and tuning. By exploiting the structures of source and target data, DSSDPP can learn a discriminative transfer classifier for identifying defects of the target project. Extensive experiments on $ 22$ projects from four datasets indicate that DSSDPP achieves better MCC and AUC results against a range of competing methods both in the single-source and multi-source scenarios. Since DSSDPP is easy, effective, extensible, and efficient, we suggest that future work can use it with the well-chosen source data to conduct CPDP especially for the projects with limited computational budget.

25 January 2024 in IEEE Systems Journal
Verified
Journal Article
Closed access
MLMengge Li
Mengge Li
MMMiao Ma
Miao Ma
LWLiang Wang
Liang Wang
ZPZhao Pei
Zhao Pei
JRJIE REN
JIE REN
BYBo Yang
Bo Yang
Mobile crowdsensing in intelligent transportation systems is a new data acquisition mode that utilizes vehicles to sense a changing traffic environment, where incentive mechanisms play a vital role in motivating vehicles to participate. Nevertheless, existing incentive mechanisms do not simultaneously consider enhancing the efficiency of task allocation, maximizing the benefits of the entire system, and balancing various costs. Therefore, a two-stage incentive mechanism, considering task aggregation, is designed to maximize the benefits of vehicles and the platform. In the first stage, each vehicle, utilizing the multiagent deep reinforcement learning algorithm, dynamically adjusts its path selection strategy to maximize its net income and then uploads the selected path information to the platform. In the second stage, this platform solves an NP-hard problem of maximizing satisfaction by combining the bid price, time consumption, and task coverage to assign tasks to the appropriate vehicles. In particular, vehicle satisfaction is measured by the analytic hierarchy process, and rewards are allocated accordingly. The proposed mechanism is compared with the state-of-the-art method, the greedy, random, and optimal algorithms. Experiments on the real trajectory dataset manifest that the proposed mechanism can fully use the platform budget to achieve the best net income, platform satisfaction, and task completion rate.

28 January 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
WZWeizhe Zeng
Weizhe Zeng
JZJie Zheng
Jie Zheng
GLgao ling
gao ling
JNJinping Niu
Jinping Niu
JRJIE REN
JIE REN
SJShuo Ji
Shuo Ji
Mobile edge computing (MEC) enabled artificial intelligence-generated content (AIGC) has garnered considerable attention. To support AIGC metaverse applications within MEC in internet of things (IoT) networks, it is effective to offload computation tasks, particularly those involving neural networks generative in AIGC, from mobile devices to edge clouds. Existing solutions typically assume the availability of a dedicated and powerful edge server for each user with single modal data, which can handle the entire AIGC service offloading. However, the practical availability of such dedicated and powerful servers may be limited, necessitating the utilization of less capable alternatives. Thus, we propose the multimodal parallel offloading AIGC framework which partitions multimodal content and offloads partial diffusion tasks to multiple servers. Our proposed scheme accelerates mobile deep vision multimodal metaverse applications through parallel offloading provided by multiple servers. We further utilize generative AI scheme to solve offloading problems to adapt the dynamic and available communication and computing resource in wireless IoT network. Our framework proposed a multimodal parallel diffusion offloading scheme with integrating the recurrent region proposal prediction algorithm to optimize communication and computing resources while minimizing delay. Simulation results show that our approach can significantly reduce delay compared to conventional algorithms.

1 June 2023 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
JZJie Zheng
Jie Zheng
HZHaijun Zhang
Haijun Zhang
JKJiawen Kang
Jiawen Kang
LGLing Gao
Ling Gao
JRJIE REN
JIE REN
DNDusit Niyato
Dusit Niyato
Over-the-air computation (OAC) is a promising technology that can achieve rapid model aggregation by utilizing the wireless waveform superposition feature to harness the interference of multiple-access channel for wireless federated learning (FL). However, OAC-based aggregation for OAC faces critical security challenges due to unfavorable and wireless broadcast properties, such as privacy leaks and eavesdropping attacks. In this paper, we propose to utilize an intelligent reflecting surface (IRS) to support covert OAC-based FL. We first derive the optimal condition for covertness in OAC with IRS and formulate a joint optimization problem to select the maximum covert devices participating in the model aggregation while satisfying the mean squared error (MSE) requirement. We then design a covert difference-of-convex-functions program (CDC) to efficiently determine the transmission power of the device, aggregation beamforming of base station (BS), phase shifts, and reflection amplitudes at the IRS. Simulation results demonstrate that our proposed approach can achieve significant performance gain compared to the baseline algorithms by deploying IRS into covert OAC-based FL.

29 June 2021 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
JZJie Zheng
Jie Zheng
GLgao ling
gao ling
HZHaijun Zhang
Haijun Zhang
DNDusit Niyato
Dusit Niyato
JRJIE REN
JIE REN
Zheng WangZheng Wang
Zheng Wang
Interference management and power transfer can provide a significant improvement over the 5th generation mobile networks (5G) dense Internet of Things (IoT) heterogeneous networks (HetNets). In this paper, we present a novel approach to simultaneously manage inferences at the downlink (DL) and uplink (UL), and to identify opportunities for power transfer and additional UL transmissions integrated with existing protocols and infrastructures for enhanced inter-cell interference coordination (eICIC) protocol in dense IoT HetNets, while considering practical non-linear energy harvesting (EH) model. The design is formulated as the joint optimization of interference aware UL/DL decoupling, airtime resource allocation and energy transfer. The key insight of our algorithm is to translate the original, intractable joint-optimization problem into a problem space where a good approximate solution can be quickly found. We evaluate our scheme through theoretical analysis and simulation. The evaluation shows that our approach improves the system utility by over 20% compared to start-of-the-art in dense IoT HetNets. Compared to alternative schemes, our approach maintains the best user fairness and rate experience and can solve the problem in a fast and scalable way.