Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Junpeng Lv

dblp:35/10920 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
2since 2021 · last 2025
0009-0004-8743-6233ORCID · reported

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

Software engineering, systems software and programming languages · 3 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 1 since 2021Computer networks · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Software testing · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software testing
adaptive testing
0.212014
On the Asymptotic Behavior of Adaptive Testing Strategy for Software Reliability Assessment · IEEE Trans. Software Eng. 2014
Software testing › software reliability
reliability assessment
0.212014
On the Asymptotic Behavior of Adaptive Testing Strategy for Software Reliability Assessment · IEEE Trans. Software Eng. 2014
Software testing › regression testing
test case prioritization
0.212014
On the Asymptotic Behavior of Adaptive Testing Strategy for Software Reliability Assessment · IEEE Trans. Software Eng. 2014
Mathematical optimization
gradient descent
0.112014
On the Asymptotic Behavior of Adaptive Testing Strategy for Software Reliability Assessment · IEEE Trans. Software Eng. 2014

Methods — techniques the papers use, named apart from their topics

simulation · 0.4gradient descent · 0.4
YearPublicationVenuePosition
2025 Achieving Cross-Domain NLOS Localization via Edge-Assisted Semi-Supervised Learning
abstract
The localization of coal mine robots (CMRs) serves as the foundation for intelligent mines. Despite various approaches proposed by academia and industry, existing range-based localization methods generally encounter the non-line-ofsight (NLOS) problem, leading to severe accuracy degradation in complicated underground mines. Facing the above challenge, this paper proposes an edge-assisted cross-domain NLOS localization (CrossDNL) framework based on semi-supervised learning. Specifically, we analyze the channel impulse responses (CIRs) of ultra-wideband (UWB) to identify the multi-channel NLOS conditions and further mitigate ranging errors via the deep neural network (DNN). To achieve reliable localization across various scenarios, CrossDNL adopts an edge-assisted semi-supervised learning architecture that enables it to optimize DNN models by self-training on the edge server and achieve the real-time service on the CMR. Besides, we propose a range-based error state Kalman filter (ESKF) scheme to improve the localization performance. We implement CrossDNL on the CMR and the edge server and evaluate it in various scenarios. Results show that CrossDNL can achieve a 14cm localization error in real time, outperforming the latest solutions by more than 20%.
Shouwan Gao, Kangjia He, Junpeng Lv
IEEE Trans. Wirel. Commun.5
2021 Raman spectra evidence for the covalent-like quasi-bonding between exfoliated MoS2 and Au films
Junpeng Lv, Zhenhua Ni, Yeliang Wang, Xingjiang Zhou
Sci. China Inf. Sci.8
2014 Estimating confidence interval of software reliability with adaptive testing strategy
Junpeng Lv, Beibei Yin, Kai-Yuan Cai
J. Syst. Softw.1
2014 On the Asymptotic Behavior of Adaptive Testing Strategy for Software Reliability Assessment
abstract
In software reliability assessment, one problem of interest is how to minimize the variance of reliability estimator, which is often considered as an optimization goal. The basic idea is that an estimator with lower variance makes the estimates more predictable and accurate. Adaptive Testing (AT) is an online testing strategy, which can be adopted to minimize the variance of software reliability estimator. In order to reduce the computational overhead of decision-making, the implemented AT strategy in practice deviates from its theoretical design that guarantees AT's local optimality. This work aims to investigate the asymptotic behavior of AT to improve its global performance without losing the local optimality. To this end, a new AT strategy named Adaptive Testing with Gradient Descent method (AT-GD) is proposed. Theoretical analysis indicates that AT-GD, a locally optimal testing strategy, converges to the globally optimal solution as the assessment process proceeds. Simulation and experiments are set up to validate AT-GD's effectiveness and efficiency. Besides, sensitivity analysis of AT-GD is also conducted in this study.
Junpeng Lv, Beibei Yin, Kai-Yuan Cai
IEEE Trans. Software Eng.1
2014 Adaptive and Random Partition Software Testing
abstract
Random testing (RT) and subdomain testing are two major software testing strategies. Their simplicity makes them likely the most efficient testing strategies with respect to the time required for test case selection. However, the disadvantage of RT is its defect detection effectiveness. Adaptive testing (AT) is a feedback-based software testing strategy that has been shown to be more effective than RT and partition testing (PT). However, a major concern in the application of AT is its complexity and computational cost for test case selection. In this paper, we propose a hybrid approach that uses AT and random partition testing (RPT) in an alternating manner. The motivation for this approach is that both strategies are employed such that the underlying computational complexity of AT is reduced by introducing RPT into the testing process without affecting the defect detection effectiveness. A case study with seven real-life subject programs is presented. The experimental results demonstrate that this novel strategy considerably reduces the computational overhead of the original AT strategy but still outperforms the pure RT strategy and PT strategy in terms of the number of test cases used to detect and remove a given number of defects. In addition, a sensitivity analysis is conducted to validate the robustness of our strategy.
Junpeng Lv, Kai-Yuan Cai, Tsong Yueh Chen
IEEE Trans. Syst. Man Cybern. Syst.1
2013 On the Gain of Measuring Test Case Prioritization
abstract
Test case prioritization (TCP) techniques aim to schedule the order of regression test suite to maximize some properties, such as early fault detection. In order to measure the abilities of different TCP techniques for early fault detection, a metric named average percentage of faults detected (APFD) is widely adopted. In this paper, we analyze the metric APFD and explore the gain of measuring TCP techniques from a control theory viewpoint. Based on that, we propose a generalized metric for TCP. This new metric focuses on the gain of defining early fault detection and measuring TCP techniques for various needs in different evaluation scenarios. By adopting this new metric, not only flexibility can be guaranteed, but also explicit physical significance for the metric will be provided before evaluation.
Junpeng Lv, Beibei Yin, Kai-Yuan Cai
COMPSAC1