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.

Mingyu Hao

dblp:344/7193 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2025
0000-0002-0601-6631ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021Software engineering, systems software and programming languages · 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
Blockchain and cryptocurrency security · 50% Cryptographic protocols and secure computation · 50%
Artificial intelligence
1 paper
Planning, search and constraint satisfaction · 100%
Computer networks
1 paper
Wireless sensing and localization · 100%

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

TopicWeightPapersLastEvidence papers
Blockchain and cryptocurrency security
parametric insurance
0.912025
Privacy-Preserving Blockchain-Enabled Parametric Insurance via Remote Sensing and IoT · IEEE Trans. Serv. Comput. 2025
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs
0.912025
Privacy-Preserving Blockchain-Enabled Parametric Insurance via Remote Sensing and IoT · IEEE Trans. Serv. Comput. 2025
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › heuristic search › best-first search
greedy best-first search
0.812024
Guiding GBFS through Learned Pairwise Rankings · IJCAI 2024
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
heuristic search
0.812024
Guiding GBFS through Learned Pairwise Rankings · IJCAI 2024
Wireless sensing and localization
remote sensing
0.312025
Privacy-Preserving Blockchain-Enabled Parametric Insurance via Remote Sensing and IoT · IEEE Trans. Serv. Comput. 2025

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

smart contract · 1.7zk-SNARKs · 0.9zk-SNARK · 0.9pairwise ranking learning · 0.8
YearPublicationVenuePosition
2025 Effective Data Generation and Feature Selection in Learning for Planning
abstract
Previous studies have shown that leveraging data beyond optimal training plans improves the learning of search guidance for planning. Specifically, state ranking information can be extracted from states on optimal plan traces and their siblings. In this paper, we generalise this approach by extracting additional rankings from the A⋆ search tree for generating optimal training plans. As in the previous approach, we incur no additional search effort and negligible computational overhead for data extraction. However, extracting more data in this way may introduce many redundant features and states which slows down training. We formalise the problem of sound, redundant feature pruning and show that it is NP-complete to solve. Furthermore, we introduce several algorithms and approximations for redundant feature pruning. Experiments show that rankings learned by extracting more data from search trees for generating optimal training plans improve planner coverage. However, pairing with unsound pruning methods often results in diminishing performance, while our sound feature pruning methods provide consistent improvements across tested domains.
Mingyu Hao, Dillon Ze Chen, Felipe W. Trevizan, Sylvie Thiébaux
ECAI1
2025 Privacy-Preserving Blockchain-Enabled Parametric Insurance via Remote Sensing and IoT
abstract
Traditional Insurance, a popular approach of financial risk management, has suffered from the issues of high operational costs, opaqueness, inefficiency and a lack of trust. Recently, blockchain-enabledparametric insurancethrough authorized data sources (e.g., remote sensing and IoT) aims to overcome these issues by automating the underwriting and claim processes of insurance policies on a blockchain. However, the openness of blockchain platforms raises a concern of user privacy, as the private user data in insurance claims on a blockchain may be exposed to outsiders. In this paper, we propose a privacy-preserving parametric insurance framework based on succinct zero-knowledge proofs (zk-SNARKs), whereby an insuree submits a zero-knowledge proof (without revealing any private data) for the validity of an insurance claim and the authenticity of its data sources to a blockchain for transparent verification. Moreover, we extend the recent zk-SNARKs to support robust privacy protection for multiple heterogeneous data sources and improve its efficiency to cut the incurred gas cost by 80%. As a proof-of-concept, we implemented a working prototype of bushfire parametric insurance on real-world blockchain platform Ethereum, and present extensive empirical evaluations.
Mingyu Hao, Keyang Qian, Sid Chi-Kin Chau
IEEE Trans. Serv. Comput.1
2024 Guiding GBFS through Learned Pairwise Rankings
Mingyu Hao, Felipe W. Trevizan, Sylvie Thiébaux, Patrick Ferber, Jörg Hoffmann 0001
IJCAI1