Ming-Chang Lee

Dr. Ming-Chang Lee


Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
23 February 2016 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
JLJia‐Chun Lin
Jia‐Chun Lin
MLMing-Chang Lee
Ming-Chang Lee

3 August 2015 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
MLMing-Chang Lee
Ming-Chang Lee
JLJia-Chun Lin
Jia-Chun Lin
RYRamin Yahyapour
Ramin Yahyapour
It is cost-efficient for a tenant with a limited budget to establish a virtual MapReduce cluster by renting multiple virtual private servers (VPSs) from a VPS provider. To provide an appropriate scheduling scheme for this type of computing environment, we propose in this paper a hybrid job-driven scheduling scheme (JoSS for short) from a tenant's perspective. JoSS provides not only job-level scheduling, but also map-task level scheduling and reduce-task level scheduling. JoSS classifies MapReduce jobs based on job scale and job type and designs an appropriate scheduling policy to schedule each class of jobs. The goal is to improve data locality for both map tasks and reduce tasks, avoid job starvation, and improve job execution performance. Two variations of JoSS are further introduced to separately achieve a better map-data locality and a faster task assignment. We conduct extensive experiments to evaluate and compare the two variations with current scheduling algorithms supported by Hadoop. The results show that the two variations outperform the other tested algorithms in terms of map-data locality, reduce-data locality, and network overhead without incurring significant overhead. In addition, the two variations are separately suitable for different MapReduce-workload scenarios and provide the best job performance among all tested algorithms.

21 March 2015 in World Wide Web
Verified
Journal Article
Closed access
PDF file
MLMing-Chang Lee
Ming-Chang Lee
FLFang-Yie Leu
Fang-Yie Leu
YCYing-ping Chen
Ying-ping Chen

3 November 2024 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Open access
MLMing-Chang Lee
Ming-Chang Lee
Jia-Chun LinJia-Chun Lin
Jia-Chun Lin
Sokratis KatsikasSokratis Katsikas
Sokratis Katsikas
Summary: Real‐time, lightweight, adaptive time series anomaly detection is increasingly critical in cybersecurity, industrial control, finance, healthcare, and many other domains due to its capability to promptly process time series and detect anomalies without requiring extensive computation resources. While numerous anomaly detection approaches have emerged recently, they generally employ a single type of recurrent neural network (RNN) and are implemented using a single type of deep learning framework. The impacts of using various RNN types across different deep learning frameworks on the performance of these approaches remain unclear due to a lack of comprehensive evaluations. In this article, we aim to investigate the impact of different RNN variants and deep learning frameworks on real‐time, lightweight, and adaptive time series anomaly detection. We reviewed several state‐of‐the‐art anomaly detection approaches and implemented a representative approach using several RNN variants supported by three popular deep learning frameworks. A thorough evaluation was conducted to analyze the detection accuracy, time efficiency, and resource consumption of each implementation using four real‐world, open‐source time series datasets. The results show that RNN variants and deep learning frameworks have a significant impact. Therefore, it is crucial to carefully select appropriate RNN variants and deep learning frameworks for the implementation.