Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Qihua Hu

dblp:375/2372 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
—ORCID · conflict

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

Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Malware analysis · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Malware analysis › mobile malware detection
android malware detection
0.912025
ASDroid: Resisting Evolving Android Malware With API Clusters Derived From Source Code · IEEE Trans. Inf. Forensics Secur. 2025
Malware analysis
malware evolution
0.912025
ASDroid: Resisting Evolving Android Malware With API Clusters Derived From Source Code · IEEE Trans. Inf. Forensics Secur. 2025
Malware analysis
malware detection
0.312025
ASDroid: Resisting Evolving Android Malware With API Clusters Derived From Source Code · IEEE Trans. Inf. Forensics Secur. 2025

Methods — techniques the papers use, named apart from their topics

heterogeneous information graph · 0.9embedding · 0.9API clustering · 0.9
YearPublicationVenuePosition
2025 ASDroid: Resisting Evolving Android Malware With API Clusters Derived From Source Code
abstract
Machine learning-based Android malware detection has consistently demonstrated superior results. However, with the continual evolution of the Android framework, the efficacy of the deployed models declines markedly. Existing solutions necessitate frequent and expensive model retraining to resist the constant evolution of malware accompanying Android framework updates. To address this, we introduce a solution called ASDroid, which generalizes specific APIs into similar API clusters to counteract evolving Android malware threats. One primary challenge lies in identifying analogous API clusters that correspond to specific APIs. Our approach involves extracting semantic information from open-source API source code to construct a heterogeneous information graph, and utilizing embedding algorithms to obtain semantic vector representations of APIs. APIs that are close in embedding distance are presumed to have similar semantics. Our dataset encompasses Android applications spanning nine years from 2011 to 2019. In comparison to existing Android malware detection model aging mitigation solutions like APIGraph, SDAC and MaMaDroid, ASDroid demonstrates greater accuracy and more effective at resisting continuously evolving malware.
Qihua Hu, Weiping Wang 0003, Hong Song 0004, Song Guo 0001, Jian Zhang 0048, Shigeng Zhang
IEEE Trans. Inf. Forensics Secur.1
2024 Data Synchronization Optimization Algorithm for The Digital Twin with Grouped Load Balance and Mask-assisted Power Control
abstract
The digital twin acquires the environment states through device data synchronization, providing robust support for improving collaboration efficiency in edge-end collaborative networks. Grouping is an effective way to reduce competition and simplify scheduling, with multiple devices sharing spectrum resources within the group through power control to synchronize data. However, unreasonable grouping and power control will lead to uneven load and frequent collisions. We propose a data synchronization optimization algorithm for the digital twin based on grouped load balance and mask-assisted power control to handle this problem. First, we allocate periodic devices to groups that maximize the least common multiple of the period in the group to reduce collisions. Event-triggered devices are allocated to groups based on balancing each group’s cumulative average packet generation rate. Second, we apply multi-agent reinforcement learning for power control of grant-free devices. Masks are used to shield prohibited actions to reduce the impact on grant-based devices, and agents can utilize auxiliary experiences to learn the impact of prohibited actions without interaction. Finally, we design some experiments, and the results show that our schemes can reduce collisions while balancing the load and perform better than other schemes after convergence.
Junping Gao, Qihua Hu, Hongju Cheng
HPCC2
2024 CRNG-PBFT: An Efficient PBFT Algorithm Based on Comprehensive Reputation and Node Grouping for Data Sharing in Digital Twins
abstract
Data sharing helps the digital twin builders obtain the necessary data to construct a virtual replica of the physical entity. The consortium blockchain is one of the effective ways to solve the lack of trust among these participants, but the traditional PBFT cannot distinguish abnormal nodes and has poor scalability. We propose an efficient PBFT algorithm based on comprehensive reputation and node grouping for data sharing in digital twins. First, we design a comprehensive reputation evaluation mechanism to distinguish normal and abnormal nodes according to their behavior in the processes of data sharing and consensus. Secondly, a node grouping algorithm is proposed, in which nodes with high reputation form a committee, while other nodes are randomly assigned to different groups. Finally, we design consensus processes separately for the group and committee. Each transaction is recorded in the consortium blockchain when the group and committee have reached a consensus on it in sequence. Experimental results show that the CRNG-PBFT algorithm can effectively identify abnormal nodes, reduce transaction delay, and improve throughput.
Qihua Hu, Hongju Cheng, Yang Yang 0026, Longfei Guo
MSN1