EDBT 2026 Demo / reviewers in the wild / expert
Zhen Chen 0001
dblp:11/1266-1
· DBLP profile ↗
3ranked-venue papers in the field
1as first author
2since 2021 · last 2025
0000-0001-5503-2630ORCID · conflict
Domains — venue-derived; a paper can count in several
Big Data, Cloud & Distributed Data Systems · 2 (1 first)Other / Interdisciplinary · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Edge-Optimized Voice Control with 0.26 M Parameters: Distilling 86M Adaptive Window Audio Transformer for Real-World Variable-Length Inputs
Pinze Ren, Zhen Chen 0001, Yinjun Wu, Weiran Lin, Qilong Shi, Chao Li 0012, Jianxin Yang |
IEEE Big Data | 2 |
| 2024 | An Empirical Study on the Power Consumption of LLMs with Different GPU PlatformsabstractThis paper researches on the power consumption of AIGC applications based on LLM with different parameter scales across different hardware platforms. Artificial Intelligence Generated Content (AIGC) represents a leading-edge application of AI technology, primarily driven by large language models (LLMs) and their associated technologies. The deployment of LLM typically relies on critical facilities with three layers, i.e., the hardware, model, and application layers. This empirical study aims to identify key factors in power consumption when a large model is serving in the inference stage, which will hint the insights for improving the energy efficiency of computational infrastructures. In the context of the "dual carbon" goals, i.e., carbon peaking and carbon neutrality, this study aims to find an effective way to reduce the energy cost of AIGC applications, thereby supporting sustainable AI development in industry. Zhen Chen 0001, Weiran Lin, Xinyu Xie, Yaodong Hu, Chao Li 0012, Qiaojuan Tong, Yinjun Wu, Shuangshou Li |
IEEE Big Data | 1 |
| 2008 | Enhancing Tit-for-Tat Strategy to Cope with Free-Riding in Unreliable P2P NetworksabstractP2P applications suffer from free-riding. In economics terminology, free-riding is the rational behavior of the participants. So it's feasible to use game theory to analyze this problem and design countermeasures. Tit-For-Tat is a simple and efficient equilibrium strategy in repeated game environments. In this paper, we construct a game model in P2P environments and deduce the constraint under which the strict tit-for-tat is an equilibrium strategy. We then improve and adapt the tit-for-tat strategy to the dynamic property in P2P networks, and deduce the constraint under which it is still an equilibrium strategy. Finally we study through simulations the performance improvement of the enhanced tit-for-tat and give suggestion of how to choose proper system parameters under different network conditions. Dongsheng Peng, Weidong Liu 0001, Chuang Lin 0002, Zhen Chen 0001, Xuehai Peng |
ICIW | 4 |