Demo Data from EDBT 2026 / reviewers in the wild / expert
Xinyao Nie
dblp:242/4516
· DBLP profile ↗
3ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0003-3754-8280ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorComputer networks · 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 networks
1 paper |
Network optimization and economics · 67% Internet architecture and protocols · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network optimization and economics › resource allocation
constrained markov decision process |
0.9 | 1 | 2025 | Multicast Scheduling Over Multiple Channels: A Distribution-Embedding Deep Reinforcement Learning Method · IEEE Trans. Mob. Comput. 2025 |
Internet architecture and protocols › multicast
multicast scheduling |
0.9 | 1 | 2025 | Multicast Scheduling Over Multiple Channels: A Distribution-Embedding Deep Reinforcement Learning Method · IEEE Trans. Mob. Comput. 2025 |
Network optimization and economics
resource allocation |
0.9 | 1 | 2025 | Multicast Scheduling Over Multiple Channels: A Distribution-Embedding Deep Reinforcement Learning Method · IEEE Trans. Mob. Comput. 2025 |
Methods — techniques the papers use, named apart from their topics
multi-agent proximal policy optimization · 0.9distribution embedding · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Multicast Scheduling Over Multiple Channels: A Distribution-Embedding Deep Reinforcement Learning MethodabstractMulticasting is an efficient technique for simultaneously transmitting common messages from the base station (BS) to multiple mobile users (MUs). Multicast scheduling over multiple channels, which aims to jointly minimize the energy consumption of the BS and the latency of serving asynchronized requests from the MUs, is formulated as an infinite-horizon Markov decision process (MDP) problem with a large discrete action space, multiple time-varying constraints, and multiple time-invariant constraints. To address these challenges, this paper proposes a novel distribution-embedding multi-agent proximal policy optimization (DE-MAPPO) algorithm, which consists of one modified MAPPO and one distribution-embedding module. The former one handles the large discrete action space and time-varying constraints by modifying the structure of the actor networks and the training kernel of the conventional MAPPO; and the latter one iteratively adjusts the action distribution to satisfy the time-invariant constraints. Moreover, a performance upper bound of the considered MDP is derived by solving a two-step optimization problem. Finally, numerical results demonstrate that our proposed algorithm outperforms the existing ones in terms of applicability, effectiveness, and robustness, and achieves comparable performance to the derived upper bound. Chuan Huang 0001, Xiaoqi Qin, Dong Yang 0001, Xinyao Nie |
IEEE Trans. Mob. Comput. | 5 |
| 2020 | Pulse localization networks with infrared cameraabstractPulse localization is the basic task of the pulse diagnosis with robot. More accurate location can reduce the misdiagnosis caused by different types of pulse. Traditional works usually use a collection surface with a certain area for contact detection, and move the collection surface to collect changes of power for pulse localization. These methods often require the subjects place their wrist in a given position. In this paper, we propose a novel pulse localization method which uses the infrared camera as the input sensor, and locates the pulse on wrist with the neural network. This method can not only reduce the contact between the machine and the subject, reduce the discomfort of the process, but also reduce the preparation time for the test, which can improve the detection efficiency. The experiments show that our proposed method can locate the pulse with high accuracy. And we have applied this method to pulse diagnosis robot for pulse data collection. Bohong Yang, Hong Lu 0001, Xinyao Nie, Guanhao Huang, Jingjing Luo |
MMAsia | 4 |
| 2019 | Weakly Supervised Image Retrieval via Coarse-scale Feature Fusion and Multi-level Attention BlocksabstractIn this paper, we propose an end-to-end Attention-Block network for image retrieval (ABIR), which greatly increases the retrieval accuracy without human annotations like bounding boxes. Specifically, our network utilizes coarse-scale feature fusion, which generates the attentive local features via combining the information from different intermediate layers. Detailed feature information is extracted with the application of two attention blocks. Extensive experiments show that our method outperforms the state-of-the-art by a significant margin on four public datasets for image retrieval tasks. Xinyao Nie, Hong Lu 0001, Zehua Guo 0003 |
ICMR | 1 |