Demo Data from EDBT 2026 / reviewers in the wild / expert
Andre Chen
dblp:169/3168
· DBLP profile ↗
3ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 since 2021Computer networks · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 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.
| Computer graphics and multimedia
1 paper |
Computational photography and imaging · 100% | |
| Human-computer interaction and pervasive computing
1 paper |
Wearable and physiological sensing · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational photography and imaging
panoramic imaging |
0.2 | 1 | 2015 | Pan360: INS Assisted 360-Degree Panorama (Demo Description) · ACM Multimedia 2015 |
Wearable and physiological sensing
inertial sensing |
0.1 | 1 | 2015 | Pan360: INS Assisted 360-Degree Panorama (Demo Description) · ACM Multimedia 2015 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Leveraging Cross-Directional Dependency in Realtime Interactive StreamingabstractRealtime interactive streaming, an emerging paradigm that enables instantaneous two-way interactions with diverse streaming traffic, introduces new network challenges. This paper identifies a unique characteristic of this paradigm — cross-directional dependency. By leveraging this dependency, we propose a novel prioritization-based approach to optimize realtime interactive streaming. Our design aligns application-layer demands with transport-layer behavior, prioritizes critical traffic to mitigate buffer overflows caused by streaming microbursts, and transforms chaotic congestion into a predictable process. We extend the QUIC priority system to accommodate unreliable QUIC datagrams and develop an end-to-end framework for evaluating this emerging streaming paradigm. Extensive Internet-scale experiments validate the effectiveness of our system, demonstrating up to 9.4 × reduction in motion-to-photon latency and 82 × reduction in freeze frame rates. Sen Lin 0009, Andre Chen, Kevin Zhikai Chen, Aleksandar Kuzmanovic |
MMAsia | 2 |
| 2024 | Truthful and Optimal Data Preservation in Base Station-less Sensor Networks: An Integrated Game Theory and Network Flow ApproachabstractWe aim to preserve a large amount of data generated inside base station-less sensor networks (BSNs) while considering that sensor nodes are selfish. BSNs refer to emerging sensing applications deployed in challenging and inhospitable environments (e.g., underwater exploration); as such, there do not exist data-collecting base stations in the BSN to collect the data. Consequently, the generated data has to be stored inside the BSN before uploading opportunities become available. Our goal is to preserve the data inside the BSN with minimum energy cost by incentivizing the storage- and energy-constrained sensor nodes to participate in the data preservation process. We refer to the problem as DPP: d ata p reservation p roblem in the BSN. Previous research assumes that all the sensor nodes are cooperative and that sensors have infinite battery power and design a minimum-cost flow-based data preservation solution. However, in a distributed setting and under different control, the resource-constrained sensor nodes could behave selfishly only to conserve their resources and maximize their benefit. In this article, we first solve DPP by designing an integer linear programming (ILP)-based optimal solution without considering selfishness. We then establish a game-theoretical framework that achieves provably truthful and optimal data preservation in BSNs. For a special case of DPP wherein nodes are not energy-constrained, referred to as DPP-W, we design a data preservation game DPG-1 that integrates algorithmic mechanism design (AMD) and a more efficient minimum cost flow-based data preservation solution. We show that DPG-1 yields dominant strategies for sensor nodes and delivers truthful and optimal data preservation. For the general case of DPP (wherein nodes are energy-constrained), however, DPG-1 fails to achieve truthful and optimal data preservation. Utilizing packet-level flow observation of sensor node behaviors computed by minimum cost flow and ILP, we uncover the cause of the failure of the DPG-1. It is due to the packet dropping by the selfish nodes that manipulate the AMD technique. We then design a data preservation game DPG-2 for DPP that traces and punishes manipulative nodes in the BSN. We show that DPG-2 delivers dominant strategies for truth-telling nodes and achieves provably optimal data preservation with cheat-proof guarantees. Via extensive simulations under different network parameters and dynamics, we show that our games achieve system-wide data preservation solutions with optimal energy cost while enforcing truth-telling of sensor nodes about their private cost types. One salient feature of our work is its integrated game theory and network flows approach. With the observation of flow level sensor node behaviors provided by the network flows, our proposed games can synthesize “microscopic” (i.e., selfish and local) behaviors of sensor nodes and yield targeted “macroscopic” (i.e., optimal and global) network performance of data preservation in the BSN. Yuning Yu 0001, Shanglin Hsu, Andre Chen, Bin Tang 0004 |
ACM Trans. Sens. Networks | 3 |
| 2015 | Pan360: INS Assisted 360-Degree Panorama (Demo Description)abstractThis article describes Pan360, a 360 X 180 panorama capturing and viewing product developed and launched by our team, and our demo plan. Yu-Mei Chen, Lun-Cheng Chu, Andre Chen, Scott Chien-Hung Liao, Edward Y. Chang |
ACM Multimedia | 4 |