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

Xigui Wang

dblp:45/3517 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
1since 2021 · last 2024
—ORCID · conflict

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

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

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
Security and privacy of machine learning · 50% Cryptographic protocols and secure computation · 50%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%
Computer networks
1 paper
Edge and fog computing · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
federated and distributed training
0.812024
PrVFL: Pruning-Aware Verifiable Federated Learning for Heterogeneous Edge Computing · IEEE Trans. Mob. Comput. 2024
Security and privacy of machine learning
federated learning
0.812024
PrVFL: Pruning-Aware Verifiable Federated Learning for Heterogeneous Edge Computing · IEEE Trans. Mob. Comput. 2024
Cryptographic protocols and secure computation › verifiable computation
verifiable federated learning
0.812024
PrVFL: Pruning-Aware Verifiable Federated Learning for Heterogeneous Edge Computing · IEEE Trans. Mob. Comput. 2024
Edge and fog computing › edge computing systems › edge computing architecture
heterogeneous edge computing
0.212024
PrVFL: Pruning-Aware Verifiable Federated Learning for Heterogeneous Edge Computing · IEEE Trans. Mob. Comput. 2024

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

zero-knowledge range proof · 2.3
YearPublicationVenuePosition
2024 PrVFL: Pruning-Aware Verifiable Federated Learning for Heterogeneous Edge Computing
abstract
In the era emphasizing the privacy of personal data, verifiable federated learning has garnered significant attention as a machine learning approach to safeguard user privacy while simultaneously validating aggregated result. However, there are some unresolved issues when deploying verifiable federated learning in edge computing. Due to the constraint resources, edge computing demands cost saving measurements in model training such as model pruning. Unfortunately, there is currently no protocol capable of enabling users to verify pruning results. Therefore, in this paper, we introduce PrVFL, a verifiable federated learning framework that supports model pruning verification and heterogeneous edge computing. In this scheme, we innovatively utilize zero-knowledge range proof protocol to achieve pruning result verification. Additionally, we first propose a heterogeneous delayed verification scheme supporting the validation of aggregated result for pruned heterogeneous edge models. Addressing the prevalent scenario of performance-heterogeneous edge clients, our scheme empowers each edge user to autonomously choose the desired pruning ratio for each training round based on their specific performance. By employing a global residual model, we ensure that every parameter has an opportunity for training. The extensive experimental results demonstrate the practical performance of our proposed scheme.
Xigui Wang, Haiyang Yu 0001, Yuwen Chen 0002, Richard O. Sinnott, Zhen Yang 0004
IEEE Trans. Mob. Comput.1
2015 Usage History-Directed Power Management for Smartphones
Xigui Wang
ICA3PP (1)3
2014 WLCleaner: Reducing Energy Waste Caused by WakeLock Bugs at Runtime
abstract
Energy consumption is a first-order concern for battery-driven smartphones. To maximize battery life, Android employs an aggressive Power Management policy. The WakeLock mechanism is the key feature of Android Power Management, which allows application developers to explicitly prevent the critical resources including CPU, screen and keyboard from entering sleep state using WakeLock API. If abused, the application can drain the battery at a fast rate even when the application is not running. Unfortunately, the current programming environment of Android does not offer a reliable facility to identify Wakelock bugs in programs. To solve this problem, we have implemented a novel tool called WLCleaner that can detect WakeLock bugs and automatically handle it at runtime to minimize the power waste for users. We evaluate WLCleaner with real-world applications running on two Android smartphones, and the results show that when WakeLock bugs are removed by WLCleaner, the energy consumption at screen-off time is reduced by half.
Xigui Wang
DASC1
2007 An SRP Target Mode to Improve Read Performance of SRP-Based IB-SANs
Zhiying Jiang, Jizhong Han, Xigui Wang, Yonghao Zhou, Xubin He
ISPA4