Demo Data from EDBT 2026 / reviewers in the wild / expert
Qu Lu
dblp:230/8671
· DBLP profile ↗
6ranked-venue papers
2as first author
4since 2021 · last 2026
0009-0004-0524-6277ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 1 since 2021Artificial intelligence and machine learning · 1 · 1 first-authorComputer networks · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Human-computer interaction and ubiquitous 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.
| Databases, data mining, and information retrieval
1 paper |
Spatial and temporal data management · 100% | |
| Network and information security
1 paper |
Privacy and data protection · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
GPUs and heterogeneous computing · 59% Cloud and datacenter computing · 41% | |
| Artificial intelligence
1 paper |
Efficient and distributed learning · 77% Deep learning architectures and training · 23% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Spatial and temporal data management › trajectory data management
trajectory query processing |
0.9 | 1 | 2025 | Privacy-Preserving Contact Query Processing Over Trajectory Data in Mobile Cloud Computing · IEEE Trans. Mob. Comput. 2025 |
Privacy and data protection
privacy-preserving query processing |
0.9 | 1 | 2025 | Privacy-Preserving Contact Query Processing Over Trajectory Data in Mobile Cloud Computing · IEEE Trans. Mob. Comput. 2025 |
Machine learning › Efficient and distributed learning
memory-efficient training |
0.4 | 1 | 2019 | A GPU memory efficient speed-up scheme for training ultra-deep neural networks: poster · PPoPP 2019 |
GPUs and heterogeneous computing › GPU memory management
GPU memory optimization |
0.4 | 1 | 2019 | A GPU memory efficient speed-up scheme for training ultra-deep neural networks: poster · PPoPP 2019 |
Cloud and datacenter computing
mobile cloud computing |
0.3 | 1 | 2025 | Privacy-Preserving Contact Query Processing Over Trajectory Data in Mobile Cloud Computing · IEEE Trans. Mob. Comput. 2025 |
Methods — techniques the papers use, named apart from their topics
secure encoding · 2.6index structure · 2.6performance-model-guided swapping · 0.8hyperparameter tuning · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | RV-WINO: A RISC-V Neural Network Accelerator Based on Winograd Algorithm Fabricated in 55-nm CMOS ProcessabstractThe rapid evolution of artificial intelligence (AI) in IoT applications necessitates the execution of inference tasks on edge devices. However, the deployment of computation-intensive neural networks on resource-constrained edge systems presents a significant challenge. This brief presents the RV-WINO processor, the first silicon implementation of a RISC-V processor based on the Winograd algorithm for convolution and general matrix multiplication (GEMM) acceleration. The processor incorporates a Winograd module, which significantly reduces multiplication operations during convolutions, leading to a substantial decrease in energy consumption. In addition, the processor includes a matrix multiplication module that reuses the multipliers of the Winograd module, accelerating fully connected and dot product operations in neural networks. The RV-WINO processor fabricated in a 55-nm CMOS process achieves the peak computational performance of 0.95 and 2.39 GOPS in INT32 and INT8 modes, with its peak energy efficiency reaching 112 and 237 GOPS/W. In convolutional neural network (CNN) inference tasks, the execution time is reduced by over 80% compared with the baseline processor. Yucong Huang, Qu Lu, Xinyu Kang, Yuru Li, Qi Wang 0051, Terry Tao Ye |
IEEE Trans. Very Large Scale Integr. Syst. | 3 |
| 2025 | Privacy-Preserving Contact Query Processing Over Trajectory Data in Mobile Cloud ComputingabstractWith the expansion of mobile devices and cloud computing, massive spatial trajectory data is generated and outsourced to the cloud for storage and analysis, enabling location-based mobile computing services. However, due to the sensitivity of the trajectory data, sharing it in plaintext could lead to privacy risks, especially in operations like contact queries. Thus, achieving secure and efficient contact queries based on the trajectory data in the cloud is a significant challenge. In this paper, we propose a privacy-preserving contact query processing over trajectory data in mobile cloud computing. The projection-based secure trajectory encoding is designed to convert trajectories into secure codes such that the comparison between the distance of two moving objects and the contact distance threshold is transformed into a problem of secure code matching. Adopting the secure code matching method, a baseline privacy-preserving contact query processing is proposed. To improve the query accuracy and efficiency, an amplification factor, an HTG-index and a filter table are designed for query processing optimization, based on which an enhanced privacy-preserving contact query processing is proposed. The game stimulation-based security analysis and experimental results show that the proposed query scheme is secure and performs well in query accuracy and efficiency. Qu Lu, Hua Dai 0003, Pengyue Li, Shuyan Wan, Geng Yang 0002, Yang Xiang 0001, Fu Xiao 0001 |
IEEE Trans. Mob. Comput. | 1 |
| 2024 | KCPMA: k-degree Contact Pattern Mining Algorithms for Moving ObjectsabstractDuring infectious disease outbreaks, tracking contacted objects is important for suppressing the spread of the virus and using trajectories of moving objects to discover contacted objects is one of effective approaches. Existing algorithms focus on individual contact event discovery but lack the ability to obtain the k-degree contact events. In this paper, we propose efficient k-degree contact pattern mining algorithms that are capable of mining k-degree contact events. The definition of k-degree contact event is first formulated. Based on the definition, a sliding window-based baseline k-degree contact pattern mining algorithm (KCPMA) is presented. To improve the mining efficiency, the sample-point checking strategy and R-tree index are adopted and the optimized mining algorithm (KCPMA+) is proposed. Comprehensive experiments on real datasets demonstrate that the proposed algorithms are effective and efficient in mining k-degree contact events. Hua Dai 0003, Mingfeng Jiang, Qu Lu, Pengyue Li, Bohan Li 0001, Geng Yang 0002 |
CSCWD | 4 |
| 2023 | Improving Few-Shot Learning for Talking Face System with TTS Data AugmentationabstractAudio-driven talking face has attracted broad interest from academia and industry recently. However, data acquisition and labeling in audio-driven talking face are labor-intensive and costly. The lack of data resource results in poor synthesis effect. To alleviate this issue, we propose to use TTS (Text-To-Speech) for data augmentation to improve few-shot ability of the talking face system. The misalignment problem brought by the TTS audio is solved with the introduction of soft-DTW, which is first adopted in the talking face task. Moreover, features extracted by HuBERT are explored to utilize underlying information of audio, and found to be superior over other features. The proposed method achieves 17%, 14%, 38% dominance on MSE score, DTW score and user study preference repectively over the baseline model, which shows the effectiveness of improving few-shot learning for talking face system with TTS augmentation. Qi Chen 0009, Ziyang Ma 0001, Tao Liu 0068, Xu Tan 0003, Qu Lu, Kai Yu 0004, Xie Chen 0001 |
ICASSP | 5 |
| 2019 | A GPU memory efficient speed-up scheme for training ultra-deep neural networks: posterabstractUltra-deep neural network(UDNN) tends to yield higher-quality model but its training process is often difficult to handle. Scarce GPU DRAM capacity is the primary bottleneck that limits the depth of neural network and the range of trainable minibatch size. In this paper, we present a scheme that dedicates to make the utmost use of finite GPU memory resource to speed up the training process for UDNN. Firstly, a performance-model guided dynamic swap out/in strategy between GPU and host memory is carefully orchestrated to tackle the out-of-memory problem without introducing performance penalty. Then, a hyperparameter (minibatch size, learning rate) tuning policy is designed to explore the optimal configuration after applying the swap strategy from the perspectives of training time and final accuracy simultaneously. Finally, we verify the effectiveness of our scheme in both single and distributed GPU mode. Jinrong Guo, Wantao Liu, Wang Wang, Qu Lu, Songlin Hu 0001, Jizhong Han, Ruixuan Li 0001 |
PPoPP | 4 |
| 2018 | Multi-stage Gradient Compression: Overcoming the Communication Bottleneck in Distributed Deep Learning
Qu Lu, Wantao Liu, Jizhong Han, Jinrong Guo |
ICONIP (1) | 1 |