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

Jianhan Liu

dblp:74/1739 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
1since 2021 · last 2025
0000-0002-7735-9869ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorComputer networks · 1Software engineering, systems software and programming languages · 1 · 1 since 2021Applied, interdisciplinary, general and emerging 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
Debugging and program repair · 67% Software testing · 33%

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

TopicWeightPapersLastEvidence papers
Debugging and program repair
automated program repair
0.912025
Comprehend, Imitate, and then Update: Unleashing the Power of LLMs in Test Suite Evolution · ASE 2025
Debugging and program repair › automated program repair
test code repair
0.912025
Comprehend, Imitate, and then Update: Unleashing the Power of LLMs in Test Suite Evolution · ASE 2025
Software testing › test maintenance
test suite evolution
0.912025
Comprehend, Imitate, and then Update: Unleashing the Power of LLMs in Test Suite Evolution · ASE 2025

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

large language model · 0.9example imitation · 0.9code comprehension · 0.9
YearPublicationVenuePosition
2025 Comprehend, Imitate, and then Update: Unleashing the Power of LLMs in Test Suite Evolution
abstract
Software testing plays a crucial role in software engineering, ensuring the reliability and correctness of evolving systems. Well-maintained test suites are essential for ensuring software quality. However, in modern development cycles that emphasize rapid feature iteration, the co-evolution of test suites often lags behind, leading to more appearance of obsolete tests. To this end, automated approaches for updating obsolete test code have been proposed, and recent approaches have achieved the state-of-the-art performance with the support of large language models (LLMs). This paper presents COMMITUP, a new approach that leverages LLMs to effectively automate method-level obsolete test code updates. COMMITUP mimics how humans solve the problem, first comprehending the code modifications, searching for similar examples to imitate, and finally performing the update. We evaluate COMMITUP on a curated dataset from real-world Java projects. The results demonstrate the superior performance of COMMITUP, achieving 96.4%, 94.4%, 93.1% success rates for generating compilable, runtime failure-free, and full coverage updates, respectively. We believe our study can provide new insight into LLM-based test code update. The dataset and code are available at https://github.com/SoftWiser-group/CommitUp.
Tangzhi Xu, Jianhan Liu, Yuan Yao 0001, Cong Li 0003, Feng Xu 0007, Xiaoxing Ma
ASE2
2006 Detection of Multiple Heartbeats Using Doppler Radar
abstract
Doppler radar life sensing has shown promise in medical and security applications. The current paper considers the problem of determining the number of persons in a given area (e.g., a room) using the Doppler shift due to heartbeat. The signal is weak and time-varying, and therefore poses a complicated signal processing problem. We develop a generalized likelihood ratio test (GLRT) based on a model of the heartbeat, and show that this can be used to distinguish between the presence of 2, 1, or 0 subjects, even with a single antenna. We further extend this to N antennas. The results show that one can expect to detect up to 2N-1 subjects using this technique
Jianhan Liu, Anders Høst-Madsen, Olga Boric-Lubecke, Victor Lubecke
ICASSP (2)2
2005 Cooperative routing and power allocation in ad-hoc networks
abstract
We consider the minimum energy unicast problem in ad-hoc wireless networks. A source node wants to transmit a sequence of messages to a single destination node. Other nodes in the network may operate as relay nodes. The problem is to do this with the minimum overall power consumption in the network. In this paper we investigate the power saving that can be achieved by using advanced relay-channel signaling rather than traditional multi-hop routing. Under the assumptions that carrier level synchronization is not available and every intermediate node uses a decode-forward scheme, we show that any optimal relaying structure can be converted to a sequential path, for which we find a simple optimal power-allocation policy. Finding an optimal sequential path is still complex, and we therefore present two polynomial heuristic algorithms to find good cooperative routes. Our simulation results show that they can achieve average power savings of up to 3 dB for a network size of 60 nodes in low attenuation regimes. For high attenuation regimes, cooperative routing exhibits limited gain and traditional multi-hop operation is a reasonable choice.
Zigui Yang, Jianhan Liu, Anders Høst-Madsen
GLOBECOM2
2004 Novel communication schemes with blind channel estimation in TDD MIMO system
abstract
We consider practical two-way communication schemes with blind channel estimation in TDD (time-division duplex) MISO (multi-input single-output) and MIMO (multi-input multi-output) systems. In the MISO system, we show that blind channel estimation only needs to be done at a transceiver equipped with multiple antennas and this estimated channel can be efficiently utilized for both uplink and downlink communication. In the MIMO system, we propose a two-stage communication scheme which begins with uplink transmission using differential space-time block codes and follows with two-way beamforming with blind channel estimation. We demonstrate, through simulations, that the novel schemes possess very good performance and compare them with training-based schemes.
Jianhan Liu, Anders Høst-Madsen
ICASSP (2)1
2004 Capacity-achieving multiple coding for MIMO Rayleigh fading systems
abstract
This paper presents the study of transmit power adaption and capacity-approaching coding/decoding in multiple-input-multiple-output (MIMO) Rayleigh fading channels under the assumption that perfect channel state information (CSI) is known at both the transmitter and the receiver. We propose three different simple, but powerful, methods for transforming the MIMO fading channel into a set of additive white noise Gaussian (AWGN) channels. We show that the channel capacity can be closely approached by using only a small number of different codes designed for the Gaussian channel.
Jianhan Liu, Jinghu Chen, Anders Høst-Madsen, Marc P. C. Fossorier
ISIT1