Demo Data from EDBT 2026 / reviewers in the wild / expert
Ziyu Shen
dblp:257/1586
· DBLP profile ↗
10ranked-venue papers
4as first author
8since 2021 · last 2026
0000-0001-7137-2846ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 1 first-author · 3 since 2021Systems, architecture and hardware · 3 · 2 first-author · 2 since 2021Computer networks · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.
| Artificial intelligence
2 papers |
Reinforcement learning · 57% Language models and text generation · 43% | |
| Human-computer interaction and pervasive computing
1 paper |
Ubiquitous computing and smart environments · 50% Wearable and physiological sensing · 50% | |
| Network and information security
1 paper |
Authentication and access control · 100% |
Topics — the 5 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation › alignment
constitutional AI |
0.9 | 1 | 2025 | Governance in Motion: Co-evolution of Constitutions and AI models for Scalable Safety · EMNLP 2025 |
Machine learning › Reinforcement learning
off-policy evaluation |
0.8 | 1 | 2024 | Policy Learning for Balancing Short-Term and Long-Term Rewards · ICML 2024 |
Machine learning › Reinforcement learning
policy learning |
0.8 | 1 | 2024 | Policy Learning for Balancing Short-Term and Long-Term Rewards · ICML 2024 |
Authentication and access control
continuous authentication |
0.3 | 1 | 2026 | MagPrint++: Continuous User Fingerprinting on Mobile Devices Using Electromagnetic Signals · IEEE Trans. Mob. Comput. 2026 |
Natural language and speech › Language models and text generation
large language model safety |
0.3 | 1 | 2025 | Governance in Motion: Co-evolution of Constitutions and AI models for Scalable Safety · EMNLP 2025 |
Methods — techniques the papers use, named apart from their topics
electromagnetic signal analysis · 2.0classification · 2.0co-evolutionary optimization · 0.9semiparametric estimation · 0.8regret analysis · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | MagPrint++: Continuous User Fingerprinting on Mobile Devices Using Electromagnetic SignalsabstractUnderstanding the nature of user-device interactions (e.g., who is using the device and what he/she is doing with it) is critical for many applications including time management, user profiles, and privacy protection. However, in scenarios where mobile devices are shared among family members or multiple employees in a company, conventional account-based statistics are not meaningful. This poses an even bigger problem when dealing with sensitive data. Moreover, fingerprint readers and front-facing cameras were not designed to continuously identify users. In this study, we developedMagPrint++, a novel approach to fingerprint users based on unique patterns in the electromagnetic (EM) signals associated with the specific use patterns of users. Initial experiments showed that time-varying EM patterns are unique to individual users. They are also temporally and spatially consistent, which makes them suitable for fingerprinting.MagPrint++has a number of advantages over existing schemes: i) Non-intrusive fingerprinting, ii) implementation both on COTS mobile phones and a small and easy-to-deploy device, and iii) high accuracy thanks to the proposed classification algorithm. In experiments involving 30 users,MagPrint++achieves$94.3\%$accuracy in classifying users from these traces, which represents a$10.9\%$improvement over the state-of-the-art classification method. Lanqing Yang, Xinqi Chen, Hao Pan 0003, Yi-Chao Chen 0001, Guangtao Xue, Zechen Li 0005, Yiheng Bian, Dian Ding, Linghe Kong, Jiadi Yu, Feng Lyu 0001, Minglu Li 0001, Ziyu Shen, Bo Zhang 0004 |
IEEE Trans. Mob. Comput. | 13 |
| 2025 | Governance in Motion: Co-evolution of Constitutions and AI models for Scalable SafetyabstractChenhao Huang, Ziyu Shen, Yicong Ren, Huiyuan Zheng, Jiazheng Zhang, Mingxu Chai, Ming Zhang, Shihan Dou, Fan Mo, Jie Shi, Tao Gui, Qi Zhang, Xuanjing Huang. Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing. 2025. Chenhao Huang, Ziyu Shen, Yicong Ren, Huiyuan Zheng, Jiazheng Zhang, Mingxu Chai, Ming Zhang 0030, Shihan Dou, Tao Gui, Qi Zhang 0001, Xuanjing Huang 0001 |
EMNLP | 2 |
| 2025 | Temporal characteristics-based adversarial attacks on time series forecasting
Ziyu Shen, Yun Li 0009 |
Expert Syst. Appl. | 1 |
| 2025 | Edge-Centric Pricing Mechanisms with Selfish Heterogeneous Users
Haisheng Tan, Guopeng Li 0002, Ziyu Shen, Zhenhua Han, Mingjun Xiao, Xiang-Yang Li 0001, Guoliang Chen 0001 |
J. Comput. Sci. Technol. | 3 |
| 2024 | Policy Learning for Balancing Short-Term and Long-Term RewardsabstractEmpirical researchers and decision-makers spanning various domains frequently seek profound insights into the long-term impacts of interventions. While the significance of long-term outcomes is undeniable, an overemphasis on them may inadvertently overshadow short-term gains. Motivated by this, this paper formalizes a new framework for learning the optimal policy that effectively balances both long-term and short-term rewards, where some long-term outcomes are allowed to be missing. In particular, we first present the identifiability of both rewards under mild assumptions. Next, we deduce the semiparametric efficiency bounds, along with the consistency and asymptotic normality of their estimators. We also reveal that short-term outcomes, if associated, contribute to improving the estimator of the long-term reward. Based on the proposed estimators, we develop a principled policy learning approach and further derive the convergence rates of regret and estimation errors associated with the learned policy. Extensive experiments are conducted to validate the effectiveness of the proposed method, demonstrating its practical applicability. Peng Wu 0012, Ziyu Shen, Feng Xie 0002, Zhongyao Wang, Yan Zeng 0002 |
ICML | 2 |
| 2023 | PM$^{2}$2VE: Power Metering Model for Virtualization Environments in Cloud Data CentersabstractVirtualization technologies provide solutions for cloud computing. Virtual resource scheduling is a crucial task in data centers, and the power consumption of virtual resources is a critical foundation of virtualization scheduling. Containers are the smallest unit of virtual resource scheduling and migration. Although many practical models for estimating the power consumption of virtual machines (VMs) have been proposed, few power estimation models of containers have been put forth. In this paper, we propose a fast-training piecewise regression model based on a decision tree for VM power metering and estimate the power of containers configured on the VM by treating the container as a group of processes on the VM. We select appropriate features from the collected metrics of VMs/containers to help our model fit the nonlinear relationship between power and features well. Besides, we optimize the leaf nodes of the regression tree, realizing the effective power metering of virtualization environments. We evaluate the proposed model on 13 tasks in PARSEC and compare it with several commonly used models in data centers. The experimental results prove the effectiveness of the proposed model, and the estimated power of containers is in line with expectations. Ziyu Shen, Zheng Liu 0001, Yun Li 0009 |
IEEE Trans. Cloud Comput. | 1 |
| 2023 | Cost-sensitive Tensor-based Dual-stage Attention LSTM with Feature Selection for Data Center Server Power ForecastingabstractPower forecasting has a guiding effect on power-aware scheduling strategies to reduce unnecessary power consumption in data centers. Many metrics related to power consumption can be collected in physical servers, such as the status of CPU, memory, and other components. However, most existing methods empirically exploit a small number of metrics to forecast power consumption. To this end, this article uses feature selection based on causality to explore the metrics that strongly influence the power consumption of different tasks. Moreover, we propose a tensor-based dual-stage attention LSTM to forecast the non-linear and non-periodic power consumption. In the proposed model, a multi-way delay embedding transform is utilized to convert the time series into tensors along the temporal direction. The LSTM combines with the tensor technique and the attention mechanism to capture the temporal pattern effectively. In addition, we adopt the cost-sensitive loss function to optimize the specific power forecasting problem in data centers. The experimental results demonstrate that our method can achieve up to 1.4% to 4.3% forecasting accuracy improvement compared with the state-of-the-art models. Ziyu Shen, Binghui Liu, Zheng Liu 0001, Bin Xia 0003, Yun Li 0009 |
ACM Trans. Intell. Syst. Technol. | 1 |
| 2022 | Data characteristics aware prediction model for power consumption of data center serversabstractSummary Due to the rapid increase in the number and scale of data centers, the information and communication technology (ICT) equipment in data centers consumes an enormous amount of power. A power prediction model is therefore essential for decision‐making optimization and power management of ICT equipment. However, it is difficult to predict the power consumption of data centers accurately due to the complex power patterns and nonlinear interdependencies among components. Existing methods either rely on standard formulas, or simply treat it as time series, both leading to poor power prediction accuracy. To overcome those limitations, in this article, we present a systematic power prediction framework called characteristic aware attention‐augmented deep learning‐based prediction method. In particular, we first analyze the different power consumption series to illustrate their different temporal characteristics. Second, we perform different data processing for the corresponding characteristics of power series samples. Third, we propose an accurate and efficient neural network model to predict future power consumption with the pretreated data. The experimental results show that the proposed model is able to achieve superior prediction accuracy. Ziyu Shen, Bin Xia 0003, Zheng Liu 0001, Yun Li 0009 |
Concurr. Comput. Pract. Exp. | 1 |
| 2020 | Estimating Power Consumption of Containers and Virtual Machines in Data CentersabstractVirtualization technologies provide solutions of cloud computing. Virtual resource scheduling is a crucial task in data centers, and the power consumption of virtual resources is a critical foundation of virtualization scheduling. Containers are the smallest unit of virtual resource scheduling and migration. Although many effective models for estimating power consumption of virtual machines (VM) have been proposed, few power estimation models of containers have been put forth. In this paper, we offer a fast-training piecewise regression model based on decision tree to build a VM power estimation model and estimate the containers' power by treating the container as a group of processes on the VM. In our model, we characterize the nonlinear relationship between power and features and realize the effective estimation of the containers on the VM. We evaluate the proposed model on 13 workloads in PARSEC and compare it with several models. The experimental results prove the effectiveness of our proposed model on most workloads. Moreover, the estimated power of the containers is in line with expectations. Ziyu Shen, Bin Xia 0003, Zheng Liu 0001, Yun Li 0009 |
CLUSTER | 2 |
| 2020 | DPAST-RNN: A Dual-Phase Attention-Based Recurrent Neural Network Using Spatiotemporal LSTMs for Time Series Prediction
Shajia Shan, Ziyu Shen, Bin Xia 0003, Zheng Liu 0001, Yun Li 0009 |
ICONIP (3) | 2 |