Xiaohua Jia
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xiaohua Jia has a total of 731 co-authors. Here are the top co-authors by number of shared publications:
- Weifa Liang
Department of Computer Science, City University of Hong Kong, Hong Kong, P. R. China
35 shared publications - Cong Wang
City University of Hong Kong, Hong Kong, China
32 shared publications - Yu Guo
Beijing Normal University
28 shared publications - Yifeng Zheng
The Hong Kong Polytechnic University
24 shared publications Jianxi Fan
23 shared publications- Kan Yang
Department of Computer Science, University of Memphis, Memphis, TN, USA
21 shared publications
Latest Publications
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (12) , 23813-23830
Toward Privacy-Preserving DualRing Signcryption for Mobile IoT Networks
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (12) , 23813-23830
Toward Privacy-Preserving DualRing Signcryption for Mobile IoT Networks
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (12) , 22948-22965
Optimizing Privacy-Preserving Multi-Center Bi-Objective Task Assignment in Spatial Crowdsourcing
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (12) , 22948-22965
Optimizing Privacy-Preserving Multi-Center Bi-Objective Task Assignment in Spatial Crowdsourcing
- 17 October 2026
- Published by Springer Nature
- p. 175-194
Embedding Watermarks in Diffusion Process for Model Intellectual Property Protection
- 17 October 2026
- Published by Springer Nature
- p. 175-194
Embedding Watermarks in Diffusion Process for Model Intellectual Property Protection
- Open Access
- 7 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 4340-4351
No Isolated Evolution, No Blind Search: Memory-Guided Prompt Co-evolution for Industrial Multi-agent Vulnerability Detection
Large Language Model (LLM)-based multi-agent systems have shown promise for automated vulnerability detection, but our industrial deployment reveals two limitations: 1) each agent's prompt is typically optimized in isolation, degrading global end-to-end performance; and 2) evolutionary prompt search lacks memory across iterations, wasting computation costs. To address these limitations, we propose MemCo, a memory-guided prompt co-evolution framework applied to industrial vulnerability detection. First, MemCo takes an end-to-end prompt co-evolution strategy, which evaluates prompts based on the system's final output rather than assessing each agent in isolation. In each evolutionary iteration, only the prompts of agents responsible for the misclassification undergo further evolution, thereby enhancing the system's global accuracy. Second, MemCo adopts a memory-guided search mechanism, which edits prompts based on records of successful and failed modifications. This reduces redundant blind exploration and significantly lowers computation costs. Comprehensive experiments show that MemCo improves Macro-F1 by +8.4 to +18.0 points on public benchmarks and up to 36.9% relative improvement on a proprietary industrial benchmark, while reducing per-generation evolution tokens by 48.5% and inference tokens by 63.8%. MemCo is deployed as a vulnerability detection assistant in our production security pipeline.
- 7 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 4340-4351
Open AccessNo Isolated Evolution, No Blind Search: Memory-Guided Prompt Co-evolution for Industrial Multi-agent Vulnerability Detection
Large Language Model (LLM)-based multi-agent systems have shown promise for automated vulnerability detection, but our industrial deployment reveals two limitations: 1) each agent's prompt is typically optimized in isolation, degrading global end-to-end performance; and 2) evolutionary prompt search lacks memory across iterations, wasting computation costs. To address these limitations, we propose MemCo, a memory-guided prompt co-evolution framework applied to industrial vulnerability detection. First, MemCo takes an end-to-end prompt co-evolution strategy, which evaluates prompts based on the system's final output rather than assessing each agent in isolation. In each evolutionary iteration, only the prompts of agents responsible for the misclassification undergo further evolution, thereby enhancing the system's global accuracy. Second, MemCo adopts a memory-guided search mechanism, which edits prompts based on records of successful and failed modifications. This reduces redundant blind exploration and significantly lowers computation costs. Comprehensive experiments show that MemCo improves Macro-F1 by +8.4 to +18.0 points on public benchmarks and up to 36.9% relative improvement on a proprietary industrial benchmark, while reducing per-generation evolution tokens by 48.5% and inference tokens by 63.8%. MemCo is deployed as a vulnerability detection assistant in our production security pipeline.
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 19 (5) , 3347-3360
AirLoc: A QoS-Aware Mobile Location Service Framework via UAV-Assisted LoRa Networks
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 19 (5) , 3347-3360
AirLoc: A QoS-Aware Mobile Location Service Framework via UAV-Assisted LoRa Networks
- 19 August 2026
- Published by Springer Nature
- p. 197-206
Conclusion, Practical Challenges, and Future Directions
- 19 August 2026
- Published by Springer Nature
- p. 197-206
Conclusion, Practical Challenges, and Future Directions
- 19 August 2026
- Published by Springer Nature
- p. 91-115
Real-Time Data Influence Measurement
- 19 August 2026
- Published by Springer Nature
- p. 147-173
Exact Unlearning for Large Models via Prompt Tuning
- 19 August 2026
- Published by Springer Nature
- p. 147-173
Exact Unlearning for Large Models via Prompt Tuning
- 19 August 2026
- Published by Springer Nature
- p. 3-31
Introduction
- 19 August 2026
- Published by Springer Nature
- p. 33-90
Background of Machine Unlearning