Demo Data from EDBT 2026 / reviewers in the wild / expert
Tingting Xuan
dblp:237/3564
· DBLP profile ↗
3ranked-venue papers
2as first author
2since 2021 · last 2023
—ORCID · none
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 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 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.
| Artificial intelligence
1 paper |
Graph learning · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational science and engineering · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning
graph classification |
0.7 | 1 | 2023 | End-to-End Pipeline for Trigger Detection on Hit and Track Graphs · AAAI 2023 |
Machine learning › Graph learning
graph neural network |
0.7 | 1 | 2023 | End-to-End Pipeline for Trigger Detection on Hit and Track Graphs · AAAI 2023 |
Computational science and engineering
high energy physics |
0.7 | 1 | 2023 | End-to-End Pipeline for Trigger Detection on Hit and Track Graphs · AAAI 2023 |
Machine learning › Graph learning
link prediction |
0.2 | 1 | 2023 | End-to-End Pipeline for Trigger Detection on Hit and Track Graphs · AAAI 2023 |
Methods — techniques the papers use, named apart from their topics
multi-task learning · 1.3graph neural network · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | End-to-End Pipeline for Trigger Detection on Hit and Track GraphsabstractThere has been a surge of interest in applying deep learning in particle and nuclear physics to replace labor-intensive offline data analysis with automated online machine learning tasks. This paper details a novel AI-enabled triggering solution for physics experiments in Relativistic Heavy Ion Collider and future Electron-Ion Collider. The triggering system consists of a comprehensive end-to-end pipeline based on Graph Neural Networks that classifies trigger events versus background events, makes online decisions to retain signal data, and enables efficient data acquisition. The triggering system first starts with the coordinates of pixel hits lit up by passing particles in the detector, applies three stages of event processing (hits clustering, track reconstruction, and trigger detection), and labels all processed events with the binary tag of trigger versus background events. By switching among different objective functions, we train the Graph Neural Networks in the pipeline to solve multiple tasks: the edge-level track reconstruction problem, the edge-level track adjacency matrix prediction, and the graph-level trigger detection problem. We propose a novel method to treat the events as track-graphs instead of hit-graphs. This method focuses on intertrack relations and is driven by underlying physics processing. As a result, it attains a solid performance (around 72% accuracy) for trigger detection and outperforms the baseline method using hit-graphs by 2% higher accuracy. Tingting Xuan, Giorgian Borca-Tasciuc, Ming Xiong Liu, Yu Sun 0075, Cameron Dean, Yasser Corrales Morales, Zhaozhong Shi, Dantong Yu |
AAAI | 1 |
| 2022 | Trigger Detection for the sPHENIX Experiment via Bipartite Graph Networks with Set Transformer
Tingting Xuan, Giorgian Borca-Tasciuc, Yu Sun 0075, Cameron Dean, Zhaozhong Shi, Dantong Yu |
ECML/PKDD (3) | 1 |
| 2019 | Designing deployable 3D scissor structures with ball-and-socket jointsabstractAbstract Scissor structures, which transform from a compact state to an expanded state, are widely used in various fields, ranging from architectural design to aerospace applications. We focus on a challenging problem that breaks through the restriction of planarity: to design scissor structures that expand from one given 3D shape to another 3D shape. To achieve this purpose, we propose a three‐step algorithm to construct a 3D scissor structure that realizes non‐uniform concentration between two different 3D curves. First, the input shapes are divided into scissor segments, which are composed of a sequence of planar scissor units based on the shape correspondence. Secondly, we compute the scissor unit geometry of each segment in a suggestive manner. Finally, the ball‐and‐socket joints with parameterized guide slits are integrated in order to connect the scissor segments, thereby completing the 3D deployment. Judging from a series of simulation and fabrication results, we demonstrate that our approach generates deployable structures for a wide range of 3D shape pairs. Xuejin Chen, Haoming Jiang, Tingting Xuan, Lihan Huang, Ligang Liu 0001 |
Comput. Animat. Virtual Worlds | 3 |