Qianmu Li

Dr. Qianmu Li

orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
19 June 2020 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
DLDeqiang Li
Deqiang Li
QLQianmu Li
Qianmu Li
Malware remains a big threat to cyber security, calling for machine learning based malware detection. While promising, such detectors are known to be vulnerable to evasion attacks. Ensemble learning typically facilitates countermeasures, while attackers can leverage this technique to improve attack effectiveness as well. This motivates us to investigate which kind of robustness the ensemble defense or effectiveness the ensemble attack can achieve, particularly when they combat with each other. We thus propose a new attack approach, named mixture of attacks, by rendering attackers capable of multiple generative methods and multiple manipulation sets, to perturb a malware example without ruining its malicious functionality. This naturally leads to a new instantiation of adversarial training, which is further geared to enhancing the ensemble of deep neural networks. We evaluate defenses using Android malware detectors against 26 different attacks upon two practical datasets. Experimental results show that the new adversarial training significantly enhances the robustness of deep neural networks against a wide range of attacks, ensemble methods promote the robustness when base classifiers are robust enough, and yet ensemble attacks can evade the enhanced malware detectors effectively, even notably downgrading the VirusTotal service.

20 May 2019 in IEEE Access
Verified
Journal Article
Open access
ARAhmed Raza Rajput
Ahmed Raza Rajput
QLQianmu Li
Qianmu Li
Milad Taleby Taleby AhvanooeyMilad Taleby Taleby Ahvanooey
Milad Taleby Taleby Ahvanooey
IMIsma Masood
Isma Masood
Personal health records (PHRs) are private and vital assets for every patient. There have been introduced many works on various aspects of managing and organizing the PHR so far. However, there is an uncertain remaining issue for the role of PHR in emergencies. In a traditional emergency access system, the patient cannot give consent to emergency staff for accessing his/her PHR. Moreover, there is no secured record management of patient's PHR, which reveals highly confidential personal information, such as what happened, when, and who has access to such information. This paper proposes an emergency access control management system (EACMS) based on permissioned blockchain hyperledger fabric and hyperledger composer. In the proposed system, we defined some rules using the smart contracts for emergency condition and time duration for the emergency access PHR data items that patient can assign some limitations for controlling the PHR permissions. We analyzed the performance of our proposed framework by implementing it through the hyperledger composer based on the response time, privacy, security, and accessibility. The experiments confirm that our framework provides better efficiency compared with the traditional emergency access system.

19 December 2019 in International Journal of Robust and Nonlinear Control
Verified
Journal Article
Closed access
PDF file
MAMuhammad Shamrooz Aslam
Muhammad Shamrooz Aslam
XDXisheng Dai
Xisheng Dai
JHJun Hou
Jun Hou
QLQianmu Li
Qianmu Li
RURizwan Ullah
Rizwan Ullah
YLYaozong Liu
Yaozong Liu

2 May 2021 in IET Control Theory & Applications
Verified
Journal Article
Open access
PDF file
MAMuhammad Shamrooz Aslam
Muhammad Shamrooz Aslam
QLQianmu Li
Qianmu Li
JHJun Hou
Jun Hou
In this article, an adaptive event‐triggered fault detection problem for the asynchronous Takagi–Sugeno fuzzy networked Markov jump systems is investigated based upon the time‐varying delays. The purpose of designing a fault detection filter is to detect the fault signal under the influence of disturbance with network transmission. In the design process, one essential factor, time‐varying delay in the fuzzy filter with appearing in the residual signal, is taken into consideration. In order to rationally utilise network resources and elaborately avoid unnecessary continuous monitoring, an adaptive event‐triggered scheme is designed to guarantee the Takagi–Sugeno fuzzy networked Markov jump systems. Thus it helps to lower the energy consumption of communication while ensuring the performance of the system. Different from the conventional triggering mechanism, in this article, the parameters of the triggering function are based on a new adaptive law which is obtained online rather than a predefined constant. Based on the associated Lyapunov stability theory and appropriate inequality, some sufficient criteria in the form of linear matrix inequalities are obtained to ensure the stability of the resulting error system. Finally, a tunnel diode example is employed to illustrate the effectiveness of the proposed methods.

13 January 2021 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
DLDeqiang Li
Deqiang Li
QLQianmu Li
Qianmu Li
YYYanfang Ye
Yanfang Ye
SXShouhuai Xu
Shouhuai Xu
Machine learning-based malware detection is known to be vulnerable to adversarial evasion attacks. The state-of-the-art is that there are no effective defenses against these attacks. As a response to the adversarial malware classification challenge organized by the MIT Lincoln Lab and associated with the AAAI-19 Workshop on Artificial Intelligence for Cyber Security (AICS'2019), we propose six guiding principles to enhance the robustness of deep neural networks. Some of these principles have been scattered in the literature, but the others are introduced in this paper for the first time. Under the guidance of these six principles, we propose a defense framework to enhance the robustness of deep neural networks against adversarial malware evasion attacks. By conducting experiments with the Drebin Android malware dataset, we show that the framework can achieve a 98.49% accuracy (on average) against grey-box attacks, where the attacker knows some information about the defense and the defender knows some information about the attack, and an 89.14% accuracy (on average) against the more capable white-box attacks, where the attacker knows everything about the defense and the defender knows some information about the attack. The framework wins the AICS'2019 challenge by achieving a 76.02% accuracy, where neither the attacker (i.e., the challenge organizer) knows the framework or defense nor we (the defender) know the attacks. This gap highlights the importance of knowing about the attack.

26 February 2015 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
RXRui Xia
Rui Xia
FXFeng Xu
Feng Xu
CZChengqing Zong
Chengqing Zong
QLQianmu Li
Qianmu Li
YQYong Qi
Yong Qi
TLTao Li
Tao Li
Bag-of-words (BOW) is now the most popular way to model text in statistical machine learning approaches in sentiment analysis. However, the performance of BOW sometimes remains limited due to some fundamental deficiencies in handling the polarity shift problem. We propose a model called dual sentiment analysis (DSA), to address this problem for sentiment classification. We first propose a novel data expansion technique by creating a sentiment-reversed review for each training and test review. On this basis, we propose a dual training algorithm to make use of original and reversed training reviews in pairs for learning a sentiment classifier, and a dual prediction algorithm to classify the test reviews by considering two sides of one review. We also extend the DSA framework from polarity (positive-negative) classification to 3-class (positive-negative-neutral) classification, by taking the neutral reviews into consideration. Finally, we develop a corpus-based method to construct a pseudo-antonym dictionary, which removes DSA's dependency on an external antonym dictionary for review reversion. We conduct a wide range of experiments including two tasks, nine datasets, two antonym dictionaries, three classification algorithms, and two types of features. The results demonstrate the effectiveness of DSA in supervised sentiment classification.