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.

Xinyong Peng

dblp:357/5728 · DBLP profile ↗
← Back
8ranked-venue papers
0as first author
8since 2021 · last 2026
—ORCID · conflict

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

Computer networks · 3 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

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 maintenance and evolution · 50% Program analysis · 50%
Network and information security
1 paper
Systems and software security · 100%

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

TopicWeightPapersLastEvidence papers
Program analysis
dynamic analysis
0.912025
JSidentify-V2: Leveraging Dynamic Memory Fingerprinting for Mini-Game Plagiarism Detection · ASE 2025
Software maintenance and evolution › code clone detection
software plagiarism detection
0.912025
JSidentify-V2: Leveraging Dynamic Memory Fingerprinting for Mini-Game Plagiarism Detection · ASE 2025
Systems and software security › software protection
code obfuscation
0.312025
JSidentify-V2: Leveraging Dynamic Memory Fingerprinting for Mini-Game Plagiarism Detection · ASE 2025

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

memory fingerprinting · 1.7instrumentation · 1.7graph-based similarity analysis · 1.7
YearPublicationVenuePosition
2026 Mitigating LLM hallucinations in Text-to-SQL parsing with a self-refinement feedback loop and memory augmentation
Chenxu Jin, Xinyong Peng, Yuming Lin
J. Intell. Inf. Syst.3
2026 Span labeling with sentiment-aware GCN and multi-channel contrastive learning for aspect sentiment triplet extraction
You Li 0007, Xinyong Peng, Yuming Lin 0001
Multim. Syst.3
2025 JSidentify-V2: Leveraging Dynamic Memory Fingerprinting for Mini-Game Plagiarism Detection
abstract
The explosive growth of mini-game platforms has led to widespread code plagiarism, where malicious users access popular games’ source code and republish them with modifications. While existing static analysis tools can detect simple obfuscation techniques like variable renaming and dead code injection, they fail against sophisticated deep obfuscation methods such as encrypted code with local or cloud-based decryption keys that completely destroy code structure and render traditional Abstract Syntax Tree analysis ineffective. To address these challenges, we present JSidentify-V2, a novel dynamic analysis framework that detects mini-game plagiarism by capturing memory invariants during program execution. Our key insight is that while obfuscation can severely distort static code characteristics, runtime memory behavior patterns remain relatively stable. JSidentify-V2 employs a four-stage pipeline: (1) static pre-analysis and instrumentation to identify potential memory invariants, (2) adaptive hot object slicing to maximize execution coverage of critical code segments, (3) Memory Dependency Graph construction to represent behavioral fingerprints resilient to obfuscation, and (4) graph-based similarity analysis for plagiarism detection.We evaluate JSidentify-V2 against eight obfuscation methods on a comprehensive dataset of 1,200 mini-games. Our framework achieves over 90% similarity detection across all tested obfuscation techniques, maintaining high accuracy even against advanced decryption-based methods where existing tools achieve near 0% detection rates. In real-world deployment, JSidentify-V2 achieves 100% precision and 99.8% recall while delivering an 8× speedup compared to previous methods. Our production deployment demonstrates that plagiarism complaints have decreased by over 80%, proving JSidentify-V2’s effectiveness in protecting intellectual property rights in mini-game ecosystems.
Chaozheng Wang, Zongjie Li, Xinyong Peng, Qun Xia, Haochuan Lu, Shuzheng Gao, Cuiyun Gao 0001, Shuai Wang 0011, Yuetang Deng, Huafeng Ma
ASE4
2025 RDF-TDAA: Optimizing RDF indexing and querying with a trie based on Directly Addressable Arrays and a path-based strategy
Yuming Lin 0001, Xinyong Peng, You Li 0007, Jingwei Zhang 0003
Expert Syst. Appl.3
2025 A multi-notary cross-chain system with supervision and identity tracking
Hai Liang, Xiaoye Lu, Xinyong Peng
Peer Peer Netw. Appl.3
2025 Efficient feature extraction of radio-frequency fingerprint using continuous wavelet transform
Mutala Mohammed, Xinyong Peng, Mingye Li, Rahel Abayneh, Xuelin Yang
Wirel. Networks2
2024 Channel-Robust RF Fingerprint Identification Using Multi-Task Learning and Receiver Collaboration
abstract
Robust radio frequency fingerprint identification (RFFI) is crucial for physical layer authentication, while it suffers from channel effects and requires extra overhead to increase recognition accuracy (RA). To address this, an efficient channel-robust RFFI scheme is proposed, employing a specialized multi-task learning (MTL) framework to direct the neural network (NN) toward extracting channel-robust features. In addition, receiver collaboration (RC) is utilized for data augmentation and output calibration. Experimental results demonstrate that the RA is significantly increased from 51.72% to 99.97% when using the open-resource Wi-Fi signal datasets collected from different time periods. Meanwhile, the requirements for extra data transmission, NN structure, and feature crafting in the inferring stage are dramatically simplified.
Xinyong Peng, Mingye Li, Xuelin Yang
IEEE Signal Process. Lett.2
2023 Lightweight and Fast Physical-Layer Key Generation in FDD Systems using Random Forest
Xinyong Peng, Xuetong Chen, Liuming Zhang, Xuelin Yang
Ad Hoc Networks2