Ming Yan

Ming Yan


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2021 in Applied Soft Computing
Verified
Journal Article
Closed access
MYMing Yan
Ming Yan
XLXiaoMeng Liang
XiaoMeng Liang
Zhihu LuZhihu Lu
Zhihu Lu
JWJie Wu
Jie Wu
WZWei Zhang
Wei Zhang

20 June 2025
Verified
Conference Paper
Open access
JFJingqi Feng
Jingqi Feng
YHYukai Huang
Yukai Huang
RZRui Zhang
Rui Zhang
SLSicheng Liang
Sicheng Liang
MYMing Yan
Ming Yan
JWJie Wu
Jie Wu

14 May 2025 in Future Internet
Verified
Journal Article
Open access
PDF file
JYJiawei Ye
Jiawei Ye
MYMing Yan
Ming Yan
SWShenglin Wu
Shenglin Wu
JTJingxuan Tan
Jingxuan Tan
JWJie Wu
Jie Wu
Container technology is currently one of the mainstream technologies in the field of cloud computing, yet its adoption in resource-constrained, latency-sensitive edge environments introduces unique security challenges. While existing system call-based anomaly-detection methods partially address these issues, they suffer from high false positive rates and excessive computational overhead. To achieve security and observability in edge-native containerized environments and lower the cost of computing resources, we propose an unsupervised anomaly-detection method based on system calls. This method filters out unnecessary system call data through automatic rule generation and an unsupervised classification model. To increase the accuracy of anomaly detection and reduce the false positive rates, this method embeds system calls into sequences using the proposed Syscall2vec and processes the remain sequences in favor of the anomaly detection model’s analysis. We conduct experiments using our method with a background based on modern containerized cloud microservices. The results show that the detection part of our method improves the F1 score by 23.88% and 41.31%, respectively, as compared to HIDS and LSTM-VAE. Moreover, our method can effectively reduce the original processing data to 13%, which means that it significantly lowers the cost of computing resources.

12 August 2024
Verified
Conference Paper
Open access
RZRui Zhang
Rui Zhang
YHYukai Huang
Yukai Huang
SLSicheng Liang
Sicheng Liang
SSShangyi Sun
Shangyi Sun
SMShaonan Ma
Shaonan Ma
JWJie Wu
Jie Wu
Byte-addressable Persistent Storage (BPS), such as persistent memory and CXL-enabled SSDs, has become an extension of main memory. This opens up new possibilities for indexes that operate and persist data directly on the memory bus. Recent learned indexes exploit data distribution and have shown great potential for some workloads. Despite some work proposed for integrating learned indexes into BPS, they are mainly based on Intel’s first-generation persistent memory. The current design suffers from the following problems: 1) Excessive storage line accesses due to large node in learned indexes; 2) Inefficient concurrency control due to volatile cache; 3) Write amplification due to mismatch access granularity. To resolve these challenges, we introduce a new learned index named PFLX, featuring three key design improvements: 1) a Storage Line-Friendly Node Layout that enhances search and insertion operations and minimizes storage line accesses through strategic use of pointers; 2) a Persistent Cache-based Lock-free Concurrency Mechanism that utilizes atomic primitives to serialize operations in leaf nodes effectively; 3) a Selective Data Flush Mechanism designed to reduce write amplification. Evaluations show that PFLX outperforms the state-of-the-art persistent indexes by 1.2 ∼ 3 ×.

26 January 2026 in Journal of King Saud University Computer and Information Sciences
Verified
Journal Article
Open access
PDF file
CHChunpu Huang
Chunpu Huang
YHYukai Huang
Yukai Huang
JFJingqi Feng
Jingqi Feng
SLSicheng Liang
Sicheng Liang
MYMing Yan
Ming Yan
JWJie Wu
Jie Wu
Serverless computing has become a transformative cloud paradigm due to its operational simplicity, cost efficiency, and elastic scalability. Unfortunately, it suffers from cold-start problems caused by container initialization during the first function invocation or after container reclamation. Container caching (i.e., keep-alive policies) is an effective and widely adopted solution to mitigate cold-starts. However, existing keep-alive policies rely on fixed time thresholds or static heuristics, making them inadequate to handle the dynamic and heterogeneous workloads. In this paper, we propose LACE, a learned container caching framework for resource management in serverless computing. Leveraging high-quality features and labels of irregular functions, LACE employs a Mixture-of-Experts (MoE) architecture to model dynamic function invocation patterns. It further incorporates a multi-task learning structure that combines regression for fine-grained interval prediction with auxiliary classification for coarse-grained pattern estimation. Evaluation on Azure workload traces shows that LACE outperforms the state-of-the-art keep-alive policy, reducing cold-start overhead and rate by 32.72% and 22.46%, respectively, while achieving container caching accuracy close to the optimal Belady policy, all without incurring excessive model decision delay or memory footprints.

15 March 2025 in Computer Networks
Verified
Journal Article
Closed access
SSShangyi Sun
Shangyi Sun
RZRui Zhang
Rui Zhang
MYMing Yan
Ming Yan
JWJie Wu
Jie Wu