Demo Data from VLDB 2026 / reviewers in the wild / expert
Zining Li
dblp:257/5672
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0002-6921-8417ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 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.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › single-cell analysis
cell fate decision |
0.9 | 1 | 2025 | Decoding cell fate: integrated experimental and computational analysis at the single-cell level · Bioinform. 2025 |
Bioinformatics and computational biology
single-cell analysis |
0.9 | 1 | 2025 | Decoding cell fate: integrated experimental and computational analysis at the single-cell level · Bioinform. 2025 |
Bioinformatics and computational biology › single-cell analysis
single-cell multiomics |
0.9 | 1 | 2025 | Decoding cell fate: integrated experimental and computational analysis at the single-cell level · Bioinform. 2025 |
Bioinformatics and computational biology › transcriptomics
spatial transcriptomics |
0.3 | 1 | 2025 | Decoding cell fate: integrated experimental and computational analysis at the single-cell level · Bioinform. 2025 |
Methods — techniques the papers use, named apart from their topics
perturbation modeling · 0.9foundation model · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Decoding cell fate: integrated experimental and computational analysis at the single-cell levelabstractMOTIVATION: Understanding cell fate determination is crucial in developmental biology and regenerative medicine. Although theoretical frameworks such as epigenetic landscape and gene regulatory networks have been proposed for decades, traditional studies have often been limited by population-averaging and low-throughput techniques, which obscure the heterogeneity of individual cells and fail to provide a systematic view of cell fate control. Recent advances in single-cell technologies have provided unprecedented resolution, revealing the complexity of cell fate decisions and driving the need for more sophisticated computational methods. RESULTS: In this review, we first emphasize experimental advances, such as single-cell multi-omics, lineage tracing, and perturbation techniques, which produce novel data modalities and enable dynamic tracking of cell fate transitions. We then discuss the modeling paradigms for cell fate studies and further assess the role of emerging AI tools in perturbation modeling and discuss the potential of single-cell and spatial foundation models. Additionally, we highlight several case studies on predicting and manipulating cell fates, and discuss key challenges and future directions of the field. AVAILABILITY AND IMPLEMENTATION: This work generates no new software. Shuyang Hou, Xinhao Miao, Zining Li, Yongjie Lin |
Bioinform. | 5 |
| 2019 | Joint Heterogeneous Server Placement and Application Configuration in Edge ComputingabstractThe rapid development of the Internet of Things (IoT) has brought profound changes in the cloud computing paradigm. One promising computing model in IoT-related applications is edge computing, which can decrease the request response time by deploying edge servers close to IoT devices. Two fundamental problems in edge computing include how to place a limited number of edge servers on the candidate locations (e.g., the Access Points) and how to configure the applications on each server. In this paper, we jointly study the edge server placement and the application configuration to minimize the weighted sum of the service cost and edge server opening cost. We propose a local-search based algorithm, named SPAC, to solve the problem efficiently with its approximation ratio analyzed. Extensive simulations on Google data traces demonstrate SPAC reduces the total cost by up to 60% compared with state-of-the-art methods, and outperforms the baselines consistently in different parameter settings. Jiaying Meng, Chaoliang Zeng, Haisheng Tan, Zining Li, Bojie Li, Xiang-Yang Li 0001 |
ICPADS | 4 |