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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Qiwen Deng

dblp:198/9123 · DBLP profile ↗
← Back
10ranked-venue papers
3as first author
5since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 3 · 2 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 3Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 92% Performance modeling and evaluation · 8%
Artificial intelligence
1 paper
Time series and sequential data · 33% Learning theory · 33% Deep learning architectures and training · 33%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › serverless computing
cold start mitigation
0.912025
Serverless Cold Starts and Where to Find Them · EuroSys 2025
Cloud and datacenter computing › serverless computing
function scheduling
0.912025
Serverless Cold Starts and Where to Find Them · EuroSys 2025
Cloud and datacenter computing
serverless computing
0.912025
Serverless Cold Starts and Where to Find Them · EuroSys 2025
Machine learning › Time series and sequential data › time series analysis
time series forecasting
0.812024
DAM: Towards a Foundation Model for Forecasting · ICLR 2024
Machine learning › Deep learning architectures and training
transformer
0.812024
DAM: Towards a Foundation Model for Forecasting · ICLR 2024
Machine learning › Learning theory › online learning › sequence prediction
universal prediction
0.812024
DAM: Towards a Foundation Model for Forecasting · ICLR 2024
Cloud and datacenter computing
datacenter workloads
0.312025
Serverless Cold Starts and Where to Find Them · EuroSys 2025
Performance modeling and evaluation
workload characterization
0.312025
Serverless Cold Starts and Where to Find Them · EuroSys 2025

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

trace analysis · 0.9transformer · 0.8basis function composition · 0.8
YearPublicationVenuePosition
2026 Tackling Workload Forecasting Challenges with an Offline-Online Dynamic Framework
Qiwen Deng, Zhibo Zhu, Xingyu Lu 0004, Lintao Ma
ICDE6
2025 Serverless Cold Starts and Where to Find Them
abstract
This paper analyzes a month-long trace of 85 billion user requests and 11.9 million cold starts from Huawei's serverless cloud platform. Our analysis spans workloads from five data centers. We focus on cold starts and provide a comprehensive examination of the underlying factors influencing the number and duration of cold starts. These factors include trigger types, request synchronicity, runtime languages, and function resource allocations. We investigate components of cold starts, including pod allocation time, code and dependency deployment time, and scheduling delays, and examine their relationships with runtime languages, trigger types, and resource allocation. We introduce pod utility ratio to measure the pod's useful lifetime relative to its cold start time, giving a more complete picture of cold starts, and see that some pods with long cold start times have longer useful lifetimes. Our findings reveal the complexity and multifaceted origins of the number, duration, and characteristics of cold starts, driven by differences in trigger types, runtime languages, and function resource allocations. For example, cold starts in Region 1 take up to 7 seconds, dominated by dependency deployment time and scheduling. In Region 2, cold starts take up to 3 seconds and are dominated by pod allocation time. Based on this, we identify opportunities to reduce the number and duration of cold starts using strategies for multi-region scheduling. Finally, we suggest directions for future research to address these challenges and enhance the performance of serverless cloud platforms.
Artjom Joosen, Martin Asenov, Rajkarn Singh, Luke Nicholas Darlow, Qiwen Deng, Adam Barker
EuroSys7
2025 Structure-Aware Human Body Reshaping with Adaptive Affinity-Graph Network
abstract
Given a source portrait, the automatic human body reshaping task aims at editing it to an aesthetic body shape. As the technology has been widely used in media, several methods have been proposed mainly focusing on generating optical flow to warp the body shape. However, those previous works only consider the local transformation of different body parts (arms, torso, and legs), ignoring the global affinity, and limiting the capacity to ensure consistency and quality across the entire body. In this paper, we propose a novel Adaptive Affinity-Graph Network (AAGN), which extracts the global affinity between different body parts to enhance the quality of the generated optical flow. Specifically, our AAGN primarily introduces the following designs: (1) we propose an Adaptive Affinity-Graph (AAG) Block that leverages the characteristic of a fully connected graph. AAG represents different body parts as nodes in an adaptive fully connected graph and captures all the affinities between nodes to obtain a global affinity map. The design could better improve the consistency between body parts. (2) Besides, for high-frequency details are crucial for photo aesthetics, a Body Shape Discriminator (BSD) is designed to extract information from both high-frequency and spatial domains. Particularly, an SRM filter is utilized to extract high-frequency details, which are combined with spatial features as input to the BSD. With this design, BSD guides the Flow Generator (FG) to pay attention to various fine details rather than rigid pixel-level fitting. Extensive experiments conducted on the BR-5K dataset demonstrate that our framework significantly enhances the aesthetic appeal of reshaped photos, surpassing all previous work to achieve state-of-the-art in all evaluation metrics. Our code is available at https://github.com/Randle-Github/AGGN.
Qiwen Deng, Yangcen Liu
WACV1
2024 DAM: Towards a Foundation Model for Forecasting
abstract
It is challenging to scale time series forecasting models such that they forecast accurately for multiple distinct domains and datasets, all with potentially different underlying collection procedures (e.g., sample resolution), patterns (e.g., periodicity), and prediction requirements (e.g., reconstruction vs. forecasting). We call this general task universal forecasting. Existing methods usually assume that input data is regularly sampled, and they forecast to pre-determined horizons, resulting in failure to generalise outside of the scope of their training. We propose the DAM -- a neural model that takes randomly sampled histories and outputs an adjustable basis composition as a continuous function of time for forecasting to non-fixed horizons. It involves three key components: (1) a flexible approach for using randomly sampled histories from a long-tail distribution, that enables an efficient global perspective of the underlying temporal dynamics while retaining focus on the recent history; (2) a transformer backbone that is trained on these actively sampled histories to produce, as representational output, (3) the basis coefficients of a continuous function of time. We show that a single univariate DAM, trained on 25 time series datasets, either outperformed or closely matched existing SoTA models at multivariate long-term forecasting across 18 datasets, including 8 held-out for zero-shot transfer, even though these models were trained to specialise for each dataset-horizon combination. This single DAM excels at zero-shot transfer and very-long-term forecasting, performs well at imputation, is interpretable via basis function composition and attention, can be tuned for different inference-cost requirements, is robust to missing and irregularly sampled data by design.
Luke Nicholas Darlow, Qiwen Deng, Martin Asenov, Rajkarn Singh, Artjom Joosen, Adam Barker, Amos J. Storkey
ICLR2
2023 Learning to Score: Tuning Cluster Schedulers through Reinforcement Learning
abstract
Efficiently allocating incoming jobs to nodes in large-scale clusters can lead to substantial improvements in both cluster utilization and job performance. In order to allocate incoming jobs, cluster schedulers usually rely on a set of scoring functions to rank feasible nodes. Results from individual scoring functions are usually weighted equally, which could lead to suboptimal deployments as the one-size-fits-all solution does not take into account the characteristics of each workload. Tuning the weights of scoring functions, however, requires expert knowledge and is computationally expensive.This paper proposes a reinforcement learning approach for learning the weights in scheduler scoring algorithms with the overall objective of improving the end-to-end performance of jobs for a given cluster. Our approach is based on percentage improvement reward, frame-stacking, and limiting domain information. We propose a percentage improvement reward to address the objective of multi-step parameter tuning. The inclusion of frame-stacking allows for carrying information across an optimization experiment. Limiting domain information prevents overfitting and improves performance in unseen clusters and workloads. The policy is trained on different combinations of workloads and cluster setups. We demonstrate the proposed approach improves performance on average by 33% compared to fixed weights and 12% compared to the best-performing baseline in a lab-based serverless scenario.
Martin Asenov, Qiwen Deng, Gingfung Yeung, Adam Barker
IC2E2
2019 Efficient living subject localization and weak vital-sign signal enhancement using impulse radio based UWB radar
abstract
In recent years, with the help of Ultra-wideband (UWB) radar, contactless measurement of vital signs become possible. This type of radar has sufficient range accuracy for micro-motion such as chest displacement or belly displacement. However, ambient clutter is strong in some scenarios such as a vehicle cabin so that a vital sign of living subject could be obscured and hard to extract. In addition, for multi-person vital signs detection, the sign of people sitting further away from the radar could become weaker due to the strong signal reflected by people in front. This paper describes an efficient way of a vital sign signal localization and a cross-correlation based method to enhance vital signs. The localization method proposed a threshold-based searching method to reduce searching range and save computational power for localization computation. The purpose of vital signs enhancement is 1) to make the weak vital sign signal observable and 2) to increase the signal-to-noise ratio (SNR) of a living subject sitting in at some distance for better localization and vital sign signal extraction accuracy. The enhancement algorithm is to cross-correlate the adjacent bins of the original signal for vital sign signal amplification. Tests are made with multiple people sitting in indoor space with strong reflected material around to simulate vehicle cabin environment. This method has been proved effective for vital sign enhancement in which the SNR increased by more than 40%. In addition, the speed of localization has increased by more than 20% for the two executed test scenarios.
Qiwen Deng, Jialiang Le, Saeed Barbat, Renran Tian, Yaobin Chen
IV1
2018 Skeleton model based behavior recognition for pedestrians and cyclists from vehicle sce ne camera
abstract
With the significant advances in computer vision research, skeleton model based human pose recognition has become more accurate and time-efficient, although most of the applications are limited in laboratory environment or on surveillance videos. This paper proposes a pose tracking and behavior recognition method from in-vehicle scene camera. It will not only detect pedestrians on the road, but also generate their skeleton models describing head, limb, and trunk movements. Based on these more detailed movements of body parts, the proposed method is designed to track poses of pedestrians and cyclists with the potentials to enable automated pedestrian gesture reading and non-verbal interactions between autonomous vehicles and pedestrians. The proposed algorithm has been tested on different databases including TASI 110-car naturalistic driving database and Joint Attention for Autonomous Driving (JAAD) database. Results show that key frames describing different pedestrian and cyclist negotiation gestures are detected from the raw video streams using the proposed method. These results will improve our understanding of pedestrian and cyclist's intentions and can be further used for autonomous vehicle control algorithm development.
Qiwen Deng, Renran Tian, Yaobin Chen, Kang Li 0004
Intelligent Vehicles Symposium1
2016 CMedTEX: A Rule-based Temporal Expression Extraction and Normalization System for Chinese Clinical Notes
Zengjian Liu, Buzhou Tang, Xiaolong Wang 0001, Qingcai Chen, Haodi Li, Junzhao Bu, Jingzhi Jiang, Qiwen Deng, Suisong Zhu
AMIA8
2015 An automatic system to identify heart disease risk factors in clinical texts over time
abstract
Despite recent progress in prediction and prevention, heart disease remains a leading cause of death. One preliminary step in heart disease prediction and prevention is risk factor identification. Many studies have been proposed to identify risk factors associated with heart disease; however, none have attempted to identify all risk factors. In 2014, the National Center of Informatics for Integrating Biology and Beside (i2b2) issued a clinical natural language processing (NLP) challenge that involved a track (track 2) for identifying heart disease risk factors in clinical texts over time. This track aimed to identify medically relevant information related to heart disease risk and track the progression over sets of longitudinal patient medical records. Identification of tags and attributes associated with disease presence and progression, risk factors, and medications in patient medical history were required. Our participation led to development of a hybrid pipeline system based on both machine learning-based and rule-based approaches. Evaluation using the challenge corpus revealed that our system achieved an F1-score of 92.68%, making it the top-ranked system (without additional annotations) of the 2014 i2b2 clinical NLP challenge.
Qingcai Chen, Haodi Li, Buzhou Tang, Xiaolong Wang 0001, Xin Liu 0054, Zengjian Liu, Weida Wang, Qiwen Deng, Suisong Zhu, Yangxin Chen
J. Biomed. Informatics9
2015 Automatic de-identification of electronic medical records using token-level and character-level conditional random fields
abstract
De-identification, identifying and removing all protected health information (PHI) present in clinical data including electronic medical records (EMRs), is a critical step in making clinical data publicly available. The 2014 i2b2 (Center of Informatics for Integrating Biology and Bedside) clinical natural language processing (NLP) challenge sets up a track for de-identification (track 1). In this study, we propose a hybrid system based on both machine learning and rule approaches for the de-identification track. In our system, PHI instances are first identified by two (token-level and character-level) conditional random fields (CRFs) and a rule-based classifier, and then are merged by some rules. Experiments conducted on the i2b2 corpus show that our system submitted for the challenge achieves the highest micro F-scores of 94.64%, 91.24% and 91.63% under the "token", "strict" and "relaxed" criteria respectively, which is among top-ranked systems of the 2014 i2b2 challenge. After integrating some refined localization dictionaries, our system is further improved with F-scores of 94.83%, 91.57% and 91.95% under the "token", "strict" and "relaxed" criteria respectively.
Zengjian Liu, Yangxin Chen, Buzhou Tang, Xiaolong Wang 0001, Qingcai Chen, Haodi Li, Qiwen Deng, Suisong Zhu
J. Biomed. Informatics8