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

Jiawei Qiu

dblp:287/9481 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
5since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 3 · 3 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 91% Approximation and online algorithms · 9%
Network and information security
1 paper
Security and privacy of machine learning · 100%
Artificial intelligence
1 paper
Vision and language · 100%

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

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design
fair division
1.012026
All-but-one MMS Allocation for Chores · WWW 2026
Algorithmic game theory and mechanism design › fair division
indivisible chores allocation
1.012026
All-but-one MMS Allocation for Chores · WWW 2026
Algorithmic game theory and mechanism design › fair division › share-based fairness
maximin share
1.012026
All-but-one MMS Allocation for Chores · WWW 2026
Security and privacy of machine learning › adversarial attack › large language model attack
adversarial prompts
0.912025
Automated Red Teaming for Text-to-Image Models Through Feedback-Guided Prompt Iteration with Vision-Language Models · ICCV 2025
Security and privacy of machine learning
red teaming
0.912025
Automated Red Teaming for Text-to-Image Models Through Feedback-Guided Prompt Iteration with Vision-Language Models · ICCV 2025
Security and privacy of machine learning › red teaming
text-to-image model red teaming
0.912025
Automated Red Teaming for Text-to-Image Models Through Feedback-Guided Prompt Iteration with Vision-Language Models · ICCV 2025
Approximation and online algorithms › approximation algorithms
approximation guarantees
0.312026
All-but-one MMS Allocation for Chores · WWW 2026
Computer vision › Vision and language
vision-language model
0.312025
Automated Red Teaming for Text-to-Image Models Through Feedback-Guided Prompt Iteration with Vision-Language Models · ICCV 2025

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

vision-language model · 1.7feedback-guided prompt iteration · 1.7
YearPublicationVenuePosition
2026 All-but-one MMS Allocation for Chores
abstract
We study the problem of fairly allocating m indivisible chores among n agents with additive cost functions. While the maximin share (MMS) is a prominent fairness criterion in theory, exact MMS allocations do not always exist. This has motivated relaxation that guarantees MMS fairness for only a subset of agents, aiming to maximize the number of satisfied agents. However, for chore allocation, guaranteeing most agents their full MMS is trivial but highly unsatisfactory, e.g., overburdening a single agent, which is undesirable in real-world platforms aiming for user retention and satisfaction. To address this, we propose a stronger and more practical notion called α-approximate all-but-one MMS (α-AMMS), which guarantees that n-1 agents receive their full MMS value, while the remaining agent receives an α-approximation. This model reflects common platform design goals, where satisfying the vast majority of users is critical, and near-fairness for the rest is acceptable. We show that there exist α-AMMS allocations, with α = 9/8 for three agents; α = 4/3 for four agents; and α = (n+1)2/4n for n ≥ 5 agents.
Jiawei Qiu, Xiaowei Wu 0001, Cong Zhang 0008, Shengwei Zhou 0002
WWW1
2026 GLGF-CR: A Gated Local-Global Fusion approach for cloud removal in real-world remote sensing
Ganchao Liu, Jiawei Qiu, Yuan Yuan 0001
Pattern Recognit.2
2025 AKD: an Asymmetric Knowledge Distillation Algorithm for Time Series Models in Cloud Service Performance Monitoring
Pengwei Liu, Weipeng Cao, Jiawei Qiu, Chuanfei Xu, Zhong Ming 0001
ICA3PP (6)3
2025 Automated Red Teaming for Text-to-Image Models Through Feedback-Guided Prompt Iteration with Vision-Language Models
Wei Xu 0039, Kangjie Chen, Jiawei Qiu, Run Wang 0001, Tianwei Zhang 0004, Lina Wang 0001
ICCV3
2024 An Efficient Anomaly Detection Method for Industrial Control Systems: Deep Convolutional Autoencoding Transformer Network
abstract
Industrial control systems (ICSs), as critical national infrastructures, are increasingly susceptible to sophisticated security threats. To address this challenge, our study introduces the CAE-T, a deep convolutional autoencoding transformer network designed for efficient anomaly detection and real-time fault monitoring in ICS. The CAE-T utilizes unsupervised deep learning, employing a convolutional autoencoder for spatial feature extraction from multidimensional time-series data, and combines this with a transformer architecture to capture long-term temporal dependencies. The design of the model facilitates rapid training and inference, while its dual-component approach, utilizing an optimization function based on support vector data description (SVDD), enhances detection accuracy. This integration synergistically combines spatiotemporal feature extraction, significantly improving the robustness and precision of anomaly detection in ICS environments. The CAE-T model demonstrated notable performance enhancements across three industrial control system datasets. Notably, the CAE-T model achieved approximately a 70.8% increase in F1 score and a 9.2% rise in AUC on the WADI dataset. On the SWaT dataset, the model showed improvements of approximately 2.8% in F1 score and 5% in AUC. The power system dataset saw more modest gains, with an approximately 0.1% uptick in F1 score and a 1% increase in AUC. These improvements validate the CAE-T model’s efficacy and robustness in anomaly detection across various scenarios.
Jiawei Qiu, Lei Ding 0010, Yanjun Xiao 0001
Int. J. Intell. Syst.2