Demo Data from VLDB 2026 / reviewers in the wild / expert
Mabel C. Chou
dblp:37/6673 · also Cheng-Feng Mabel Chou
· DBLP profile ↗
5ranked-venue papers
2as first author
3since 2021 · last 2024
0000-0002-8044-8598ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 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.
| Theoretical computer science
2 papers |
Algorithmic game theory and mechanism design · 62% Approximation and online algorithms · 38% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Smart cities and intelligent transportation · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Approximation and online algorithms › online algorithms
online matching |
0.8 | 1 | 2024 | Online Resource Allocation with Non-Stationary Customers · ICML 2024 |
Algorithmic game theory and mechanism design › resource allocation
online resource allocation |
0.8 | 1 | 2024 | Online Resource Allocation with Non-Stationary Customers · ICML 2024 |
Smart cities and intelligent transportation
bike sharing systems |
0.5 | 1 | 2021 | Bike-Repositioning Using Volunteers: Crowd Sourcing with Choice Restriction · AAAI 2021 |
Algorithmic game theory and mechanism design
resource allocation |
0.5 | 1 | 2021 | Bike-Repositioning Using Volunteers: Crowd Sourcing with Choice Restriction · AAAI 2021 |
Methods — techniques the papers use, named apart from their topics
transshipment network design · 1.0threshold-based policy · 1.0simulation · 1.0stochastic contextual bandit with knapsack · 0.8online matching with adversarial arrivals · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Online Resource Allocation with Non-Stationary CustomersabstractWe propose a novel algorithm for online resource allocation with non-stationary customer arrivals and unknown click-through rates. We assume multiple types of customers arriving in a nonstationary stochastic fashion, with unknown arrival rates in each period. Additionally, customers’ click-through rates are assumed to be unknown and only learnable online. By leveraging results from the stochastic contextual bandit with knapsack and online matching with adversarial arrivals, we develop an online scheme to allocate the resources to nonstationary customers. We prove that under mild conditions, our scheme achieves a “best-of-both-world” result: the scheme has a sublinear regret when the customer arrivals are near-stationary, and enjoys an optimal competitive ratio under general (non-stationary) customer arrival distributions. Finally, we conduct extensive numerical experiments to show our approach generates near-optimal revenues for all different customer scenarios. Hanzhang Qin, Mabel C. Chou |
ICML | 3 |
| 2022 | Key Feature Identification for Monitoring Wafer-to-Wafer Variation in Semiconductor ManufacturingabstractTo monitor process and identify the deviation as early as possible, data-driven methods have been applied for process monitoring and fault detection in semiconductor manufacturing. Although various fault detection and classification models had been discussed in the literature, however, little research has been devoted to feature selection from trace data that is important for process monitoring of natural variation. Additionally, the high-mix production mode with different recipes leads to process dynamic of wafer-to-wafer (W2W) variation which should also be identified for safeguarding false alarms and serving as a warning indicator. Therefore, this paper proposes a data-driven framework to identify the key features with respect to the W2W variation. In particular, the self-organizing map is used to annotate the grade of wafer variation among the in-line metrology data. Subsequently, the adaptive boosting (AdaBoost) is adopted to examine the effectiveness of every feature and its processing times, respectively. To validate the proposed framework, an empirical study from a semiconductor fabrication plant is conducted. The experimental results demonstrate that the key feature identification is of critical importance to build highly capable models for process monitoring. Through the dimensionality reduction technique, it has been illustrated that a smaller set of the identified key features are able to pinpoint the W2W variation of different wafer grades more clearly than the whole set of process features.Note to Practitioners— Process monitoring has become more difficult with the shrinking linewidth in semiconductor manufacturing. The challenges of analyzing equipment sensor or raw trace data for process monitoring in high-mix manufacturing processes are to incorporate subject-matter expert knowledge for setting control limit meticulously, to detect the subtle changes by analyzing the whole trace data profile, and to identify W2W variation for reducing false alarms. This paper proposes a data-driven framework for process monitoring by adopting data-driven approaches without recourse to domain judgement. Experimental results demonstrate that the proposed data-driven framework can effectively identify the key features via sensor readings and corresponding processing times, respectively. The engineers can make use of the extracted features to perform a predictive monitoring on metrology data for detection of potential process deterioration. Shu-Kai S. Fan, Du-Ming Tsai, Mabel C. Chou, Chih-Hung Jen, Jen-Hsuan Tsou |
IEEE Trans Autom. Sci. Eng. | 4 |
| 2021 | Bike-Repositioning Using Volunteers: Crowd Sourcing with Choice RestrictionabstractMotivated by the Bike Angels Program in New York's Citi Bike and Boston's Blue Bikes, we study the use of (registered) volunteers to re-position empty bikes for riders in a bike sharing system. We propose a method that can be used to deploy the volunteers in the system, based on the real time distribution of the bikes in different stations. To account for (random) route demand in the network, we solve a related transshipment network design model and construct a sparse structure to restrict the re-balancing activities of the volunteers (concentrating re-balancing activities on essential routes). We also develop a comprehensive simulation model using a threshold-based policy to deploy the volunteers in real time, to test the effect of choice restriction on volunteers (suitably deployed) to re-position bikes. We use the Hubway system in Boston (with 60 stations) to demonstrate that using a sparse structure to concentrate the re-balancing activities of the volunteers, instead of allowing all admissible flows in the system (as in current practice), can reduce the number of re-balancing moves by a huge amount, losing only a small proportion of demand satisfied. Jinjia Huang, Mabel C. Chou, Chung-Piaw Teo |
AAAI | 2 |
| 2006 | Analysis of a Software-Focused Products and Service Supply ChainabstractIn this paper, we study a software-focused products and service supply chain based on the practice of two leading electronic manufacturing services providers in the world and their major corporate clients. We discuss the common and unique issues that a software-focused supply chain has compared with a traditional supply chain. We also indicate the research challenges and opportunities for a software-focused supply chain Mabel C. Chou, Heng-Qing Ye, Xue-Ming Yuan, You Neng Cheng, Li Chua, Yiwen Guam, Siew Ee Lee, Yee Chen Tay |
IEEE Trans. Ind. Informatics | 1 |
| 2001 | The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates
Mabel C. Chou, Maurice Queyranne, David Simchi-Levi |
IPCO | 1 |