Ming Zhong

Ming Zhong

Auto-generated profile, based on publicly available information

Ming Zhong

Zhejiang Normal University, Jinhua, China

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 2022 in Chaos: An Interdisciplinary Journal of Nonlinear Science
Verified
Journal Article
Closed access
PDF file
Hao PengHao Peng
Hao Peng
CQCheng Qian
Cheng Qian
DZDandan Zhao
Dandan Zhao
MZMing Zhong
Ming Zhong
JHJianmin Han
Jianmin Han
WWWei Wang
Wei Wang
In modern systems, from brain neural networks to social group networks, pairwise interactions are not sufficient to express higher-order relationships. The smallest unit of their internal function is not composed of a single functional node but results from multiple functional nodes acting together. Therefore, researchers adopt the hypergraph to describe complex systems. The targeted attack on random hypergraph networks is still a problem worthy of study. This work puts forward a theoretical framework to analyze the robustness of random hypergraph networks under the background of a targeted attack on nodes with high or low hyperdegrees. We discovered the process of cascading failures and the giant connected cluster (GCC) of the hypergraph network under targeted attack by associating the simple mapping of the factor graph with the hypergraph and using percolation theory and generating function. On random hypergraph networks, we do Monte-Carlo simulations and find that the theoretical findings match the simulation results. Similarly, targeted attacks are more effective than random failures in disintegrating random hypergraph networks. The threshold of the hypergraph network grows as the probability of high hyperdegree nodes being deleted increases, indicating that the network’s resilience becomes more fragile. When considering real-world scenarios, our conclusions are validated by real-world hypergraph networks. These findings will help us understand the impact of the hypergraph’s underlying structure on network resilience.

16 April 2024 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
HPHao Peng
Hao Peng
JYJieshuai Yang
Jieshuai Yang
DZDandan Zhao
Dandan Zhao
XXXiaogang Xu
Xiaogang Xu
YPYuwen Pu
Yuwen Pu
SJShouling Ji
Shouling Ji
The rich semantic information in Control Flow Graphs (CFGs) of executable programs has made Graph Neural Networks (GNNs) a key focus for malware detection. However, existing CFG-based detection techniques face limitations in node feature extraction, such as information loss, neglect of execution sequence information, and redundancy in representation vectors. These limitations compromise the balance between high efficiency and precision when training detectors. Addressing this, we introduce an innovative Malware CFG Node Embedding (MalGNE) method. This approach utilizes a novel instruction encoding rule to address the Out-Of-Vocabulary(OOV) problem, generates high-quality initial vectors. Then, it employs aggregation layer and sequence layer to extract node aggregation feature and execution sequence feature, in conjunction with GNNs to develop a pre-trained node embedding model. The model maps the semantic information of node assembly instruction sequences into a compact, low-dimensional continuous space, ensuring high-quality feature extraction, and enhancing the performance and efficiency of the detector. We trained the MalGNE model using the BIG 2015 dataset and validated MalGNE-enhanced detector on the SOREL-20M and BODMAS datasets. MalGNE-enhanced detector demonstrates outstanding performance and efficiency in low-dimensional spaces, especially when the dimensionality of the node feature vector is reduced to 16. MalGNE-enhanced detector not only maintains a high detection accuracy of 95.49%. sacrificing only about 1.7% of accuracy to save approximately 73% of training time compared to 128 dimensions.

6 December 2023 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
Hao PengHao Peng
Hao Peng
SGShixin Guo
Shixin Guo
DZDandan Zhao
Dandan Zhao
XZXuhong Zhang
Xuhong Zhang
JHJianMin Han
JianMin Han
MZMing Zhong
Ming Zhong
Designing a query-efficient attack strategy to generate high-quality adversarial examples under the hard-label black-box setting is a fundamental yet challenging problem, especially in natural language processing (NLP). The process of searching for adversarial examples has many uncertainties (e.g., an unknown impact on the target model's prediction of the added perturbation) when confidence scores cannot be accessed, which must be compensated for with a large number of queries. To address this issue, we propose TextCheater, a decision-based metaheuristic search method that performs a query-efficient textual adversarial attack task by prohibiting invalid searches. The strategies of multiple initialization points and Tabu search are also introduced to keep the search process from falling into a local optimum. We apply our approach to three state-of-the-art language models (i.e., BERT, wordLSTM, and wordCNN) across six benchmark datasets and eight real-world commercial sentiment analysis platforms/models. Furthermore, we evaluate the Robustly optimized BERT pretraining Approach (RoBERTa) and models that enhance their robustness by adversarial training on toxicity detection and text classification tasks. The results demonstrate that our method minimizes the number of queries required for crafting plausible adversarial text while outperforming existing attack methods in the attack success rate, fluency of output sentences, and similarity between the original text and its adversary.

1 August 2023 in Chaos: An Interdisciplinary Journal of Nonlinear Science
Verified
Journal Article
Open access
PDF file
DZDandan Zhao
Dandan Zhao
XLXianwen Ling
Xianwen Ling
XZXiongtao Zhang
Xiongtao Zhang
Hao PengHao Peng
Hao Peng
MZMing Zhong
Ming Zhong
WWWei Wang
Wei Wang
In complex systems, from human social networks to biological networks, pairwise interactions are insufficient to express the directed interactions in higher-order networks since the internal function is not only contained in directed pairwise interactions but rather in directed higher-order interactions. Therefore, researchers adopted directed higher-order networks to encode multinode interactions explicitly and revealed that higher-order interactions induced rich critical phenomena. However, the robustness of the directed higher-order networks has yet to receive much attention. Here, we propose a theoretical percolation model to analyze the robustness of directed higher-order networks. We study the size of the giant connected components and the percolation threshold of our proposed model by the theory and Monte-Carlo simulations on artificial networks and real-world networks. We find that the percolation threshold is affected by the inherent properties of higher-order networks, including the heterogeneity of the hyperdegree distribution and the hyperedge cardinality, which represents the number of nodes in the hyperedge. Increasing the hyperdegree distribution of heterogeneity or the hyperedge cardinality distribution of heterogeneity in higher-order networks will make the network more vulnerable, weakening the higher-order network’s robustness. In other words, adding higher-order directed edges enhances the robustness of the systems. Our proposed theory can reasonably predict the simulations for percolation on artificial and real-world directed higher-order networks.

1 May 2023 in Journal of King Saud University Computer and Information Sciences
Verified
Journal Article
Open access
HPHao Peng
Hao Peng
ZWZhe Wang
Zhe Wang
DZDandan Zhao
Dandan Zhao
YWYiming Wu
Yiming Wu
JHJianming Han
Jianming Han
MZMing Zhong
Ming Zhong

27 January 2025 in Metallurgical and Materials Transactions B
Verified
Journal Article
Closed access
PDF file
HBHangyu Bai
Hangyu Bai
YZYanyun Zhang
Yanyun Zhang
YZYanqing Zhao
Yanqing Zhao
MZMing Zhong
Ming Zhong
ZLZushu Li
Zushu Li
CWCong Wang
Cong Wang