Meiqi Feng

dblp:268/4872 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
7since 2021 · last 2024
0000-0001-8628-6094ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Human-computer interaction and ubiquitous computing · 3 · 3 since 2021Security and privacy · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 since 2021
YearPublicationVenuePosition
2024 OFEI: A Semi-Black-Box Android Adversarial Sample Attack Framework Against DLaaS
abstract
With the growing popularity of Android devices, Android malware is seriously threatening the safety of users. Although such threats can be detected by deep learning as a service (DLaaS), deep neural networks as the weakest part of DLaaS are often deceived by the adversarial samples elaborated by attackers. In this paper, we propose a new semi-black-box attack framework called one-feature-each-iteration (OFEI) to craft Android adversarial samples. This framework modifies as few features as possible and requires less classifier information to fool the classifier. We conduct a controlled experiment to evaluate our OFEI framework by comparing it with the benchmark methods JSMF, GenAttack and pointwise attack. The experimental results show that our OFEI has a higher misclassification rate of 98.25%. Furthermore, OFEI can extend the traditional white-box attack methods in the image field, such as fast gradient sign method (FGSM) and DeepFool, to craft adversarial samples for Android. Finally, to enhance the security of DLaaS, we use two uncertainties of the Bayesian neural network to construct the combined uncertainty, which is used to detect adversarial samples and achieves a high detection rate of 99.28%.
Guangquan Xu, Guohua Xin, Litao Jiao, Jian Liu 0004, Shaoying Liu, Meiqi Feng, James Xi Zheng
IEEE Trans. Computers6
2021 MFF-AMD: Multivariate Feature Fusion for Android Malware Detection
Guangquan Xu, Meiqi Feng, Litao Jiao, Jian Liu 0004, Hongning Dai, Emmanouil A. Panaousis, James Xi Zheng
CollaborateCom (1)2
2021 An Online Fault Tolerance Server Consolidation Algorithm
abstract
We study server consolidation problem in clouds under simultaneous failures of multiple servers, where consolidation means that cloud providers put tenants on shared servers to improve resource utilization and thus reduce operation and maintenance costs. With replicas of each tenant put on multiple servers, our objective is to minimize the total number of opened servers and ensure that a particular failure will not result in overload on any remaining server. In this paper, we propose Rotation algorithm. It packs comparable sizes replicas into the same type of servers and adopts a cyclic shift method to quickly reuse those already-opened servers without the need of new ones for new tenants. Through experimental evaluations, we show that the proposed algorithms can achieve a better performance than existing works and produce near-optimal replications allocation.
Boyu Li 0002, Yuhan Dong, Bin Wu 0002, Meiqi Feng
CSCWD4
2021 Multi-Controller Deployment Strategies Based on Node Weight and Request Flow in Distributed Software Defined Networks
abstract
Distributed multi-controller deployment is a key issue in the innovative Software Defined Network (SDN) to scale network while improving performance and reliability. It is interesting to know how many controllers should be deployed and where to locate under a wide range of performance sensitive and completive constraints, including latency, fair load distribution as well as cost. We solve this problem by minimizing propagation latency and controller cost. The required number of controllers is determined based on requests and controller capacity. Due to the uneven distribution of network load, it is more likely to deploy controllers on nodes with high request density. A clustering algorithm NWDP (Node Weight Deployment Policy) is thus proposed based on node weight to choose location of multi-controller. To achieve effectively, autonomous and dynamic deployment in large-scale networks, we further propose a supervised graph convolution network model with fusion features(FF-GCN). The open network database Internet Topology Zoo is adopted to evaluate the effectiveness of our algorithms. Simulation results show that NWDP efficiently outperforms traditional algorithms in medium-sized topology, and the trained FF-GCN can figure out the deployment in a 702 nodes large-scale topology with an average prediction accuracy of 90%.
Yuhan Dong, Boyu Li 0002, Bin Wu 0002, Meiqi Feng
CSCWD4
2021 TT-SVD: An Efficient Sparse Decision-Making Model With Two-Way Trust Recommendation in the AI-Enabled IoT Systems
abstract
The convergence of AI and IoT enables data to be quickly explored and turned into vital decisions, and however, there are still some challenging issues to be further addressed. For example, lacking of enough data in AI-based decision making [so-called sparse decision making (SDM)] will decrease the efficiency dramatically, or even disable the intelligent IoT networks. Taking the intelligent IoT networks as the network infrastructure, the recommendation systems have been facing such SDM problems. A naive solution is to introduce trust information. However, trust information may also face the difficulty of sparse trust evidence (also known as sparse trust problem). In our work, an accurate SDM model with two-way trust recommendation in the AI-enabled IoT systems is proposed, named TT-SVD. Our model incorporates both trust information and rating information more thoroughly, which can efficiently alleviate the above-mentioned sparse trust problem and therefore be able to solve the cold start and data sparsity problems. Specifically, we first consider the twofold trust influences from both trustees and trusters, which can be represented by a factor named trust propensity. To this end, we propose a dual model, including a truster model (TrusterSVD) and a trustee model (TrusteeSVD) based on an existing rating-only recommendation model called SVD++, which are integrated by the weighted average and yield the final model, TT-SVD. The experimental results show that our model outperforms the state-of-the-art, including SVD and TrustSVD in both the “all users” and “cold start users” cases, and the accuracy improvement can reach a maximum of 29%. Complexity analysis shows that our model is equally suitable for the case of large sparse data sets. In summary, our model can effectively solve the sparse decision problem by introducing the two-way trust recommendation, and hence improve the efficiency of the intelligent recommendation systems.
Guangquan Xu, Litao Jiao, Meiqi Feng, Zhong Ji, Emmanouil A. Panaousis, Si Chen 0009, James Xi Zheng
IEEE Internet Things J.4
2021 FNet: A Two-Stream Model for Detecting Adversarial Attacks against 5G-Based Deep Learning Services
abstract
With the extensive application of artificial intelligence technology in 5G and Beyond Fifth Generation (B5G) networks, it has become a common trend for artificial intelligence to integrate into modern communication networks. Deep learning is a subset of machine learning and has recently led to significant improvements in many fields. In particular, many 5G-based services use deep learning technology to provide better services. Although deep learning is powerful, it is still vulnerable when faced with 5G-based deep learning services. Because of the nonlinearity of deep learning algorithms, slight perturbation input by the attacker will result in big changes in the output. Although many researchers have proposed methods against adversarial attacks, these methods are not always effective against powerful attacks such as CW. In this paper, we propose a new two-stream network which includes RGB stream and spatial rich model (SRM) noise stream to discover the difference between adversarial examples and clean examples. The RGB stream uses raw data to capture subtle differences in adversarial samples. The SRM noise stream uses the SRM filters to get noise features. We regard the noise features as additional evidence for adversarial detection. Then, we adopt bilinear pooling to fuse the RGB features and the SRM features. Finally, the final features are input into the decision network to decide whether the image is adversarial or not. Experimental results show that our proposed method can accurately detect adversarial examples. Even with powerful attacks, we can still achieve a detection rate of 91.3%. Moreover, our method has good transferability to generalize to other adversaries.
Guangquan Xu, Guofeng Feng, Litao Jiao, Meiqi Feng, James Xi Zheng, Jian Liu 0004
Secur. Commun. Networks4
2021 Sparse Trust Data Mining
abstract
As recommendation systems continue to evolve, researchers are using trust data to improve the accuracy of recommendation prediction and help users find relevant information. However, large recommendation systems with trust data suffer from the sparse trust problem, which leads to grade inflation and severely affects the reliability of trust propagation. This paper presents a novel research on sparse trust data mining, which includes the new concept of sparse trust, a sparse trust model, and a trust mining framework. It lays a foundation for the trust-related research in large recommended systems. The new trust mining framework is based on customized normalization functions and a novel transitive gossip trust model, which discovers potential trust information between entities in a large-scale user network and applies it to a recommendation system. We conducts a comprehensive performance evaluation on both real-world and synthetic datasets. The results confirm that our framework mines new trust and effectively ameliorates sparse trust problem.
Pengli Nie, Guangquan Xu, Litao Jiao, Shaoying Liu, Jian Liu 0004, Weizhi Meng 0001, Hongyue Wu, Meiqi Feng, Zhengjun Jing, James Xi Zheng
IEEE Trans. Inf. Forensics Secur.8