Feng Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Feng Wang has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
Lixin Gao
University of Massachusetts, Amherst, MA, USA
5 shared publicationsKenji Fujikawa
National Institute of Information and Communications Technology
3 shared publications- Yongning Tang
School of Information Technology, Illinois State University, Normal, IL 61761, USA
3 shared publications Hiroaki Harai
National Institute of Information and Communications Technology
2 shared publications- Lixin Gao
Department of Electrical and Computer Engineering, University of Massachusetts Amherst, Amherst, MA, USA
2 shared publications Xiaozhe Shao
University of Massachusetts
2 shared publications
Latest Publications
- Open Access
- 23 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 114-115
Evaluation of Large Language Models on Pedagogy-Driven Lesson Plan Generation
Large Language Models (LLMs) have shown remarkable capabilities across a wide range of tasks, including the potential to transform pedagogical practices. While much of the existing research focuses on how LLMs can support student learning, fewer studies have examined their impact on educators and teaching methodologies. This study evaluates LLMs in generating lesson plans for computer science and engineering courses. Analyzing 1,200 outputs under single-task and multi-task prompts, we find that multi-task prompts often cause attention dilution, reducing coherence and specificity. These results highlight the need for educators to refine and synthesize LLM outputs to create high-quality instructional materials.
- 23 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 114-115
Open AccessEvaluation of Large Language Models on Pedagogy-Driven Lesson Plan Generation
Large Language Models (LLMs) have shown remarkable capabilities across a wide range of tasks, including the potential to transform pedagogical practices. While much of the existing research focuses on how LLMs can support student learning, fewer studies have examined their impact on educators and teaching methodologies. This study evaluates LLMs in generating lesson plans for computer science and engineering courses. Analyzing 1,200 outputs under single-task and multi-task prompts, we find that multi-task prompts often cause attention dilution, reducing coherence and specificity. These results highlight the need for educators to refine and synthesize LLM outputs to create high-quality instructional materials.
- 31 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (3) , 1885-1904
Order-Preserving Pattern Matching: Review
Order-preserving pattern matching (OPPM) is a specialized area within the domain of pattern recognition and string matching. This specialized area is dedicated to identifying patterns in sequences where the intrinsic order of elements is crucially important. This comprehensive review provides an in-depth analysis of diverse order-preserving pattern matching techniques, focusing on their algorithms and methodologies. Particular attention is paid to the challenges researchers face in preserving order during pattern matching. The review also evaluates the performance and scalability of various techniques to handle large-scale datasets. By discussing the current state of OPPM research, we identify gaps, opportunities, and potential avenues for future exploration. Through this exploration, we aim to contribute valuable insights that will guide researchers and practitioners in advancing the frontiers of OPPM research, shaping the trajectory of this field in the coming years.
- 31 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (3) , 1885-1904
Order-Preserving Pattern Matching: Review
Order-preserving pattern matching (OPPM) is a specialized area within the domain of pattern recognition and string matching. This specialized area is dedicated to identifying patterns in sequences where the intrinsic order of elements is crucially important. This comprehensive review provides an in-depth analysis of diverse order-preserving pattern matching techniques, focusing on their algorithms and methodologies. Particular attention is paid to the challenges researchers face in preserving order during pattern matching. The review also evaluates the performance and scalability of various techniques to handle large-scale datasets. By discussing the current state of OPPM research, we identify gaps, opportunities, and potential avenues for future exploration. Through this exploration, we aim to contribute valuable insights that will guide researchers and practitioners in advancing the frontiers of OPPM research, shaping the trajectory of this field in the coming years.
- Open Access
- 11 June 2024
- Published by MDPI AG in Journal of Cybersecurity and Privacy
- Vol. 4 (2) , 382-387
Diverse Intrusion and Malware Detection: AI-Based and Non-AI-Based Solutions
In today’s interconnected world, the need for robust intrusion and malware detection and prevention has never been more critical
- 11 June 2024
- Published by MDPI AG in Journal of Cybersecurity and Privacy
- Vol. 4 (2) , 382-387
Open AccessDiverse Intrusion and Malware Detection: AI-Based and Non-AI-Based Solutions
In today’s interconnected world, the need for robust intrusion and malware detection and prevention has never been more critical
- Open Access
- 18 May 2023
- Published by MDPI AG in Journal of Cybersecurity and Privacy
- Vol. 3 (2) , 209-226
Mitigating IoT Privacy-Revealing Features by Time Series Data Transformation
As the Internet of Things (IoT) continues to expand, billions of IoT devices are now connected to the internet, producing vast quantities of data. Collecting and sharing this data has become crucial to improving IoT technologies and developing new applications. However, the publication of privacy-preserving IoT traffic data is exceedingly challenging due to the various privacy concerns surrounding users, IoT networks, and devices. In this paper, we propose a data transformation method aimed at safeguarding the privacy of IoT devices by transforming time series datasets. Based on our measurements, we have found that the transformed datasets retain the intrinsic value of the original IoT data and maintains data utility. This approach will enable non-expert data owners to better understand and evaluate the potential device-level privacy risks associated with their IoT data while simultaneously offering a reliable solution to mitigate their concerns about privacy violations.
- 18 May 2023
- Published by MDPI AG in Journal of Cybersecurity and Privacy
- Vol. 3 (2) , 209-226
Open AccessMitigating IoT Privacy-Revealing Features by Time Series Data Transformation
As the Internet of Things (IoT) continues to expand, billions of IoT devices are now connected to the internet, producing vast quantities of data. Collecting and sharing this data has become crucial to improving IoT technologies and developing new applications. However, the publication of privacy-preserving IoT traffic data is exceedingly challenging due to the various privacy concerns surrounding users, IoT networks, and devices. In this paper, we propose a data transformation method aimed at safeguarding the privacy of IoT devices by transforming time series datasets. Based on our measurements, we have found that the transformed datasets retain the intrinsic value of the original IoT data and maintains data utility. This approach will enable non-expert data owners to better understand and evaluate the potential device-level privacy risks associated with their IoT data while simultaneously offering a reliable solution to mitigate their concerns about privacy violations.
- 4 April 2023
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12617, 1278-1286
Analysis of GEO space debris detection based on near-GEO orbit RPO
The America and Russia set their new space surveillance and detection equipment s to the near GEO orbit , and frequently conducted rendezvous and proximity operations(RPO) tests, which may pose great threats to our effect in protecting the precious GEO satellite assets. But the satellites‟ operator schema, the satellites‟ on-orbit status modes were kept secret by the owners, it was difficult for others to acquire detailed information. Firstly both the America and Russia space surveillance system capacities were investigated and summarized. Secondly, taking the distribution characteristics of GEO debris in mind, simulations were conducted based on the near GEO orbit dynamics and few satellite orbit data, to deduce the satellites trace during the valid TLE intervals. The accuracy verification was checked by the “classified” information disclosed mutually by the America and Russia. Finally, the similarities and differences between the American and Russian near GEO satellites were summarized, and suggestions were towed out when using the near-GEO orbit. According to the suggestion, for a near GEO surveillance equipment, it was proper to take enough flue to pushing themselves for more than 2000km, and was better to satay in every near-GEO orbit for more than 20 days when performing the RPO tests.
- 4 April 2023
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12617, 1278-1286
Analysis of GEO space debris detection based on near-GEO orbit RPO
The America and Russia set their new space surveillance and detection equipment s to the near GEO orbit , and frequently conducted rendezvous and proximity operations(RPO) tests, which may pose great threats to our effect in protecting the precious GEO satellite assets. But the satellites‟ operator schema, the satellites‟ on-orbit status modes were kept secret by the owners, it was difficult for others to acquire detailed information. Firstly both the America and Russia space surveillance system capacities were investigated and summarized. Secondly, taking the distribution characteristics of GEO debris in mind, simulations were conducted based on the near GEO orbit dynamics and few satellite orbit data, to deduce the satellites trace during the valid TLE intervals. The accuracy verification was checked by the “classified” information disclosed mutually by the America and Russia. Finally, the similarities and differences between the American and Russian near GEO satellites were summarized, and suggestions were towed out when using the near-GEO orbit. According to the suggestion, for a near GEO surveillance equipment, it was proper to take enough flue to pushing themselves for more than 2000km, and was better to satay in every near-GEO orbit for more than 20 days when performing the RPO tests.
- Open Access
- 15 August 2022
- Published by MDPI AG in Journal of Cybersecurity and Privacy
- Vol. 2 (3) , 629-639
MOCA: A Network Intrusion Monitoring and Classification System
Optimizing the monitoring of network traffic features to detect abnormal traffic is critical. We propose a two-stage monitoring and classification (MOCA) system requiring fewer features to detect and classify malicious network attacks. The first stage monitors abnormal traffic, and the anomalous traffic is forwarded for processing in the second stage. A small subset of features trains both classifiers. We demonstrate MOCA’s effectiveness in identifying attacks in the CICIDS2017 dataset with an accuracy of 99.84% and in the CICDDOS2019 dataset with an accuracy of 93%, which significantly outperforms previous methods. We also found that MOCA can use a pre-trained classifier with one feature to distinguish DDoS and Botnet attacks from normal traffic in four different datasets. Our measurements show that MOCA can distinguish DDoS attacks from normal traffic in the CICDDOS2019 dataset with an accuracy of 96% and DDoS attacks in non-IoT and IoT traffic with an accuracy of 99.94%. The results emphasize the importance of using connection features to discriminate new DDoS and Bot attacks from benign traffic, especially with insufficient training samples.
- 15 August 2022
- Published by MDPI AG in Journal of Cybersecurity and Privacy
- Vol. 2 (3) , 629-639
Open AccessMOCA: A Network Intrusion Monitoring and Classification System
Optimizing the monitoring of network traffic features to detect abnormal traffic is critical. We propose a two-stage monitoring and classification (MOCA) system requiring fewer features to detect and classify malicious network attacks. The first stage monitors abnormal traffic, and the anomalous traffic is forwarded for processing in the second stage. A small subset of features trains both classifiers. We demonstrate MOCA’s effectiveness in identifying attacks in the CICIDS2017 dataset with an accuracy of 99.84% and in the CICDDOS2019 dataset with an accuracy of 93%, which significantly outperforms previous methods. We also found that MOCA can use a pre-trained classifier with one feature to distinguish DDoS and Botnet attacks from normal traffic in four different datasets. Our measurements show that MOCA can distinguish DDoS attacks from normal traffic in the CICDDOS2019 dataset with an accuracy of 96% and DDoS attacks in non-IoT and IoT traffic with an accuracy of 99.94%. The results emphasize the importance of using connection features to discriminate new DDoS and Bot attacks from benign traffic, especially with insufficient training samples.
- 29 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
The Diminished Importance of Connection-based Features in Intrusion Detection
Today, more and more Machine Learning (ML) and Deep Learning (DL) techniques are adopted to attain efficient feature selection for intrusion detection. Previous efforts have demonstrated that the major challenge of creating efficient ML and DL-based intrusion detection is to determine appropriate features without negatively affecting classification accuracy. This paper explores the impact of connection-based features on performing intrusion detection models, precisely the effect of connection-based features on detecting DDoS attacks in the CICDDoS2019 dataset. We used ML methods where samples trained with Decision Tree (DT) and Random Forest (RF) classifiers with and without connection-based features, understanding the effect on performance, stability, and its diminishing sensitivity with more samples. Our analysis shows that performing connection-based features depends on the available training sample size. Thus, connection-based features significantly impact classification accuracy concerning small training samples, how its importance is diminished along with increased sample size, and their strong effect on imbalanced malicious attacks.
- 29 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-10
The Diminished Importance of Connection-based Features in Intrusion Detection
Today, more and more Machine Learning (ML) and Deep Learning (DL) techniques are adopted to attain efficient feature selection for intrusion detection. Previous efforts have demonstrated that the major challenge of creating efficient ML and DL-based intrusion detection is to determine appropriate features without negatively affecting classification accuracy. This paper explores the impact of connection-based features on performing intrusion detection models, precisely the effect of connection-based features on detecting DDoS attacks in the CICDDoS2019 dataset. We used ML methods where samples trained with Decision Tree (DT) and Random Forest (RF) classifiers with and without connection-based features, understanding the effect on performance, stability, and its diminishing sensitivity with more samples. Our analysis shows that performing connection-based features depends on the available training sample size. Thus, connection-based features significantly impact classification accuracy concerning small training samples, how its importance is diminished along with increased sample size, and their strong effect on imbalanced malicious attacks.
- 1 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 36-44
BC-Sketch: A Simple Reversible Sketch for Detecting Network Anomalies
As 5G/IoT networks constantly growing and evolving, proliferated network traffic bring an unprecedented challenge to detecting and identifying flow anomalies, such as heavy hitters, heavy changes and superspreaders. Many flow data analytics have been proposed to tackle the problem. Sketch-based approaches are the most commonly used flow analytics service, in which a compressed data structure is used to keep a summary of the original data and estimate traffic statistics such as flow size for all traffic flows. However, those approaches either induce information losses due to sampling or incur computational and space overheads for key recovery. In this paper, we propose a new lightweight traffic analytics service, called BC-sketch, for faster and more accurate detection of heavy keys using very small number of counters. BC-sketch provides reversible sketch using an extensible data structure designed to accommodate different sketch-based solutions. BC-sketch can be efficiently provisioned as a traffic analytics service in resource constrained IoT devices, or integrated to various virtual network environments as a virtual service to detect heavy hitter, superspreader and heavy change. To demonstrate its effectiveness, we use BC-sketch to detect heavy hitters, superspreaders, and heavy changes. Both theoretical analysis and experimental evaluations show that BC-sketch can provide higher precision for identifying those traffic anomalies with low memory and computational overheads.
- 1 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 36-44
BC-Sketch: A Simple Reversible Sketch for Detecting Network Anomalies
As 5G/IoT networks constantly growing and evolving, proliferated network traffic bring an unprecedented challenge to detecting and identifying flow anomalies, such as heavy hitters, heavy changes and superspreaders. Many flow data analytics have been proposed to tackle the problem. Sketch-based approaches are the most commonly used flow analytics service, in which a compressed data structure is used to keep a summary of the original data and estimate traffic statistics such as flow size for all traffic flows. However, those approaches either induce information losses due to sampling or incur computational and space overheads for key recovery. In this paper, we propose a new lightweight traffic analytics service, called BC-sketch, for faster and more accurate detection of heavy keys using very small number of counters. BC-sketch provides reversible sketch using an extensible data structure designed to accommodate different sketch-based solutions. BC-sketch can be efficiently provisioned as a traffic analytics service in resource constrained IoT devices, or integrated to various virtual network environments as a virtual service to detect heavy hitter, superspreader and heavy change. To demonstrate its effectiveness, we use BC-sketch to detect heavy hitters, superspreaders, and heavy changes. Both theoretical analysis and experimental evaluations show that BC-sketch can provide higher precision for identifying those traffic anomalies with low memory and computational overheads.
- 29 September 2017
- Published by Springer Nature
- p. 287-292
Labelling and Encoding Hierarchical Addressing for Scalable Internet Routing
- 29 September 2017
- Published by Springer Nature
- p. 287-292
Labelling and Encoding Hierarchical Addressing for Scalable Internet Routing
- 28 May 2017
- Published by Springer Nature
- p. 399-404
Labeling and Encoding Hierarchical Addressing for Scalable Internet Routing
- 28 May 2017
- Published by Springer Nature
- p. 399-404
Labeling and Encoding Hierarchical Addressing for Scalable Internet Routing