VLDB 2026 Research / reviewers in the wild / expert
Jie Yun
dblp:65/3012
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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.
| Network and information security
1 paper |
Cryptographic primitives and cryptanalysis · 100% | |
| Theoretical computer science
1 paper |
Quantum computing and quantum information · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › random number generation
quantum random number generator |
1.0 | 1 | 2026 | Highly integrated broadband entropy source for quantum random number generators based on vacuum fluctuations · Sci. China Inf. Sci. 2026 |
Cryptographic primitives and cryptanalysis
random number generation |
1.0 | 1 | 2026 | Highly integrated broadband entropy source for quantum random number generators based on vacuum fluctuations · Sci. China Inf. Sci. 2026 |
Quantum computing and quantum information
quantum optics |
0.3 | 1 | 2026 | Highly integrated broadband entropy source for quantum random number generators based on vacuum fluctuations · Sci. China Inf. Sci. 2026 |
Methods — techniques the papers use, named apart from their topics
vacuum fluctuations · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Highly integrated broadband entropy source for quantum random number generators based on vacuum fluctuations
Yuqi Shi, Jie Yun, Yanxiang Jia, Zhenguo Lu |
Sci. China Inf. Sci. | 4 |
| 2016 | Multi-objective population-based incremental learning for community structure detectionabstractThe community structure detection of complex networks has become a hot topic in the past several years. In this paper, a new discrete framework of population-based incremental learning for complex networks problem is proposed. Based on the proposed discrete framework, a novel multi-objective population-based incremental learning algorithm is proposed to solve community structure detection problem. The proposed algorithm combines population-based incremental learning with the multi-objective evolutionary algorithm based on decomposition, this makes the evolution get directionality and converge fast. In order to discourage premature convergence, a random perturbation operator is adopted. The proposed algorithm has two contradictory objective functions termed as negative ratio association and ratio cut, respectively. The community structure detection results are a set of tradeoff solutions by simultaneous optimizing these two contradictory objective functions. Each of these solutions corresponds to a network community structure at one hierarchical level. Experiments on both real-world and synthetic networks prove the effectiveness of the proposed algorithm. Wenping Ma 0001, Yue Wu 0004, Jie Yun |
CEC | 3 |