EDBT 2026 Demo / reviewers in the wild / expert
Shuren Li
dblp:45/5892
· DBLP profile ↗
5ranked-venue papers
1as first author
4since 2021 · last 2024
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2 · 2 since 2021Human-computer interaction and ubiquitous computing · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1
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 graphics and multimedia
1 paper |
Geometric modeling and processing · 100% | |
| Theoretical computer science
1 paper |
Computational geometry · 100% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing
curve reconstruction |
0.1 | 1 | 2008 | A distance-based parameter free algorithm for curve reconstruction · Comput. Aided Des. 2008 |
Methods — techniques the papers use, named apart from their topics
distance-based parameter free algorithm · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | A Fine-Grained Packet Loss Tolerance Transmission Algorithm for Communication Optimization in Distributed Deep LearningabstractCommunication overhead is a significant challenge in distributed deep learning (DDL) training, often hindering efficiency. While existing solutions like gradient compression, compute/communication overlap, and layer-wise flow scheduling have been proposed, they are often coarse-grained and insufficient, especially under network congestion. These congestion-unaware methods can lead to long flow completion times, known as the tail latency, resulting in extended training time. In this paper, we argue that packet loss tolerance methods can mitigate the tail latency issue without sacrificing training accuracy, with the tolerance bound varying across different DDL model layers. We introduce PLOT, a fine-grained packet loss tolerance algorithm, which optimizes communication overhead by leveraging the layer-specific loss tolerance of the DNN model. PLOT employs a UDP-based transmission mechanism for gradient transfer, addressing the tail latency issue and maintaining training accuracy through packet loss tolerance. Our evaluations on both small-scale testbeds and large-scale simulations show that PLOT outperforms other congestion algorithms, effectively reducing tail latency and DDL training time. Yifei Lu 0001, Jingqi Li 0004, Shuren Li, Chanying Huang |
IEEE Trans. Netw. Serv. Manag. | 3 |
| 2022 | CAD-IDS: A Cooperative Adaptive Distributed Intrusion Detection System with Fog ComputingabstractNowadays, the IoT (internet of things) botnet has become a huge threat to network security. In response to this threat, we present a cooperative adaptive network intrusion detection system (IDS) framework with fog computing. The core part is cooperation detection architecture based on online adaptive machine learning algorithms. Our CAD-IDS aims to decrease the new attack detection time for all the IoT nodes and reduce the complexity of the cooperative IDS framework. The results of the experiment indicate that our CAD-IDS can detect IoT attacks efficiently and timely. Our ML code is available in https://github.com/LiQianchang/CAD-IDS-ML-Code. Shuren Li, Yifei Lu 0001, Jingqi Li 0004 |
CSCWD | 1 |
| 2022 | MILP: A Memory Improved LSTM Prediction Algorithm for Gradient Transmission Time in Distributed Deep LearningabstractIn recent years, distributed deep learning (DDL) has been widely used to scale out and accelerate deep neural network training. In DDL, each worker trains a copy of the deep learning model with different training inputs and synchronizes the model gradients at the end of each iteration. However, it is well known that the network communication for synchronizing model parameters is the main bottleneck in DDL. In this paper, we propose a new idea to relieve network congestion. Through the gradient transmission time prediction, we can predict the arrival time of burst traffic in advance. It provides support for prevention efforts ahead of time. We propose a memory improved LSTM prediction algorithm called MILP to predict gradient transmission time. MILP designs an improving memory for LSTM to overcome the drawback of LSTM that is too conservative in predicting gradient transmission time. We compare the performance of MILP with other time series forecasting (TSF) models on our data sets. Our experiments show that MILP is more accurate than other classical TSF models in predicting gradient transmission time. The average error rate is 13.17 % lower than the LSTM model. Our code is available at https://github.com/surprisejxb789/MILP. Jingqi Li 0004, Yifei Lu 0001, Zhengzhi Xu, Shuren Li |
ICC | 4 |
| 2021 | EZAC: Encrypted Zero-day Applications Classification using CNN and K-MeansabstractWith the rapid development of traffic encryption technology and the continuous emergence of various network services, the classification of encrypted zero-day applications has become a major challenge in network supervision. More seriously, many attackers will utilize zero-day applications to hide their attack behaviors and make attack undetectable. However, there are very few existing studies on zero-day applications. Existing works usually select and label zero-day applications from unlabeled datasets, and these are not true zero-day applications classification. To address the classification of zero-day applications, this paper proposes an Encrypted Zero-day Applications Classification (EZAC) method that combines Convolutional Neural Network (CNN) and K-Means, which can effectively classify zero-day applications. We first use CNN to classify the flows, and for the flows that may be zero-day applications, we use K-Means to divide them into several categories, which are then manually labeled. Experimental results show that the EZAC achieves 97.4% accuracy on a public dataset (CIC-Darknet2020), which outperforms the state-of-the-art methods. Yan Li 0085, Yifei Lu 0001, Shuren Li |
CSCWD | 3 |
| 2008 | A distance-based parameter free algorithm for curve reconstruction
Yong Zeng 0004, Thanh An Nguyen, Baiquan Yan, Shuren Li |
Comput. Aided Des. | 4 |