Suping Liu

Suping Liu


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
30 June 2025 in Electronics
Verified
Journal Article
Open access
PDF file
ZXZhiyu Xu
Zhiyu Xu
FLfirst name Lu
first name Lu
YDYong Ding
Yong Ding
LTLiwei Tian
Liwei Tian
SLSuping Liu
Suping Liu
Temporal action localization aims to identify the boundaries of the action of interest in a video. Most existing methods take a two-stage approach: first, identify a set of action proposals; then, based on this set, determine the accurate temporal locations of the action of interest. However, the diversely distributed semantics of a video over time have not been well considered, which could compromise the localization performance, especially for ubiquitous short actions or events (e.g., a fall in healthcare and a traffic violation in surveillance). To address this problem, we propose a novel deep learning architecture, namely an adaptive template-guided self-attention network, to characterize the proposals adaptively with their relevant frames. An input video is segmented into temporal frames, within which the spatio-temporal patterns are formulated by a global–Local Transformer-based encoder. Each frame is associated with a number of proposals of different lengths as their starting frame. Learnable templates for proposals of different lengths are introduced, and each template guides the sampling for proposals with a specific length. It formulates the probabilities for a proposal to form the representation of certain spatio-temporal patterns from its relevant temporal frames. Therefore, the semantics of a proposal can be formulated in an adaptive manner, and a feature map of all proposals can be appropriately characterized. To estimate the IoU of these proposals with ground truth actions, a two-level scheme is introduced. A shortcut connection is also utilized to refine the predictions by using the convolutions of the feature map from coarse to fine. Comprehensive experiments on two benchmark datasets demonstrate the state-of-the-art performance of our proposed method: 32.6% mAP@IoU 0.7 on THUMOS-14 and 9.35% mAP@IoU 0.95 on ActivityNet-1.3.

1 September 2025 in Chinese Journal of Electronics
Verified
Journal Article
Closed access
Ding YongDing Yong
Ding Yong
HLHaifeng Lyu
Haifeng Lyu
YCYanan Cao
Yanan Cao
WSWenxiang Song
Wenxiang Song
LTLiwei Tian
Liwei Tian
SLSuping Liu
Suping Liu
Large language models (LLMs) have transformed natural language processing tasks but remain prone to generating confabulations-plausible yet incorrect or nonsensical outputs. Detecting these confabulations is critical for ensuring the reliability of LLM-driven applications. In this paper, we propose similar cluster frequency entropy (SCFE), a novel entropy-based uncertainty estimator for identifying confabulations in LLM outputs. SCFE works by clustering multiple model-generated responses using cosine similarity to capture similar textual instances, followed by estimating the categorical distribution across these clusters. The uncertainty is quantified through the entropy of this distribution, which reflects the spread of the cluster assignment frequency. High entropy indicates a diffuse probability distribution across clusters, signaling uncertainty, while low entropy suggests a concentrated distribution, indicative of higher confidence. Unlike traditional token-likelihood-based measures, SCFE evaluates uncertainty at a textual-level, capturing meaningful variations across responses. Experimental evaluations on diverse LLMs and benchmark datasets demonstrate that SCFE surpasses existing uncertainty estimation techniques in detecting confabulations, offering a robust tool for enhancing the reliability of LLM outputs in practical applications.

21 April 2025 in Electronics
Verified
Journal Article
Open access
PDF file
SWSheng Wen
Sheng Wen
LXLiam Xu
Liam Xu
LTLiwei Tian
Liwei Tian
SLSuping Liu
Suping Liu
Ding YongDing Yong
Ding Yong
The Trusted Execution Environment (TEE) is crucial for safeguarding the ecosystem of embedded systems. It uses isolation to minimize the TCB (Trusted Computing Base) and protect sensitive software. It is vital because devices handle vast, potentially sensitive data. Leveraging ARM TrustZone, widely used in mobile and IoT for TEEs, it ensures hardware protection via security extensions, though needing firmware and software stack support. Despite the reputation of TEEs for high security, TrustZone-aided ones have vulnerabilities. Fuzzing, as a practical bug-finding technique, has seen limited research in the context of TEE. The unique software architecture of TrustZone-assisted TEE complicates the direct application of traditional fuzzing methods. Moreover, simplistic approaches, such as feeding random input values into TEE through the API functions of the rich operating system, fail to uncover deeper, latent bugs within the TEE code. In this paper, we present a fuzzing strategy for TrustZone-assisted TEE that utilizes inferred dependencies between Trusted Kernel system calls to uncover deep-seated TEE bugs. We implemented our approach on OP-TEE, where it successfully identified 17 crashes, including one previously undetected kernel bug.

23 June 2025 in Electronics
Verified
Journal Article
Open access
PDF file
ZXZhiyu Xu
Zhiyu Xu
YDYong Ding
Yong Ding
LTLiwei Tian
Liwei Tian
SLSuping Liu
Suping Liu
Internet of Things (IoT) devices are frequent targets of cyber attacks, and firmware emulation is essential for enabling automated techniques like fuzzing to uncover vulnerabilities. However, the growing use of encryption in firmware poses significant challenges for building accurate emulated environments. To overcome this, we present EncryptAFL, the first IoT fuzzer specifically tailored for devices with encrypted firmware. In contrast to existing methods that primarily focus on peripheral emulation, EncryptAFL places greater emphasis on automating the decryption process. We evaluate EncryptAFL using real-world firmware and known vulnerabilities, demonstrating its effectiveness in both emulation and vulnerability detection.

25 September 2025 in Electronics
Verified
Journal Article
Open access
PDF file
SWSheng Wen
Sheng Wen
LTLiwei Tian
Liwei Tian
SLSuping Liu
Suping Liu
Fuzzing has established itself as a cornerstone technique for uncovering defects in both stand-alone executables and software libraries. In the domain of library testing, prior research has predominantly concentrated on the automated generation of fuzz drivers-code harnesses that invoke individual Application Programming Interfaces (APIs) under test. While these approaches successfully orchestrate API calls in the correct sequence, they often neglect a critical factor: the semantic relevance and structural validity of the input data supplied to each API parameter. Unlike monolithic programs, where inputs are typically drawn from well-defined file or network formats, API parameters may span a broad spectrum of primitive and composite data types-ranging from integers and floating-point values to strings, containers, and user-defined aggregates—each of which demands tailored mutation strategies to exercise deep code paths and trigger latent faults. To address this gap, we introduce PointFuzz, a novel fuzzing framework that integrates type-aware input generation into existing harness generation pipelines. PointFuzz begins by statically analyzing the API’s function signatures and associated type definitions to accurately identify the data type of every parameter. It then applies a suite of specialized mutation operators. This data-type-guided mutation maximizes the likelihood of traversing previously untested execution branches. Moreover, PointFuzz incorporates an innovative feedback mechanism that dynamically adjusts mutation priorities based on real-time coverage gains. By assigning quantitative scores to parameter-specific operators, our system continuously learns which strategies yield the most valuable inputs, and reallocates computational effort accordingly. Empirical evaluation across multiple widely used C/C++ libraries demonstrates that PointFuzz achieves superior API coverage compared to generic, agnostic-type fuzzers. These results validate the efficacy of combining type-aware mutation with adaptive feedback to advance the state of library API fuzzing.

1 September 2021 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
SLSuping Liu
Suping Liu
This paper first addresses the problem of excessively long neural network coding on high-dimensional data, and introduces the indirect coding neural evolution algorithm HyperNEAT, so that the neural network for high-dimensional data can also be coded with fewer genes, greatly reducing search space. Next, in order to solve the problem that the neuroevolution algorithm is difficult to effectively filter the features in the classification problem, this paper uses the feature-related information as the basis for the position of the input neuron. With the help of HyperNEAT, the advantage of the neuron geometric information can be effectively used, and an embedded feature is proposed. The selection method can improve the feature selection ability of the neuroevolution algorithm without increasing the time complexity.