Demo Data from EDBT 2026 / reviewers in the wild / expert
Liangjun Liu
dblp:250/4678
· DBLP profile ↗
3ranked-venue papers
0as first author
2since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1
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 |
Visualization and visual analytics · 100% |
Topics — the 1 heaviest of 1, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics › graph visualization
graph layout |
0.5 | 1 | 2021 | DRGraph: An Efficient Graph Layout Algorithm for Large-scale Graphs by Dimensionality Reduction · IEEE Trans. Vis. Comput. Graph. 2021 |
Methods — techniques the papers use, named apart from their topics
sparse distance matrix approximation · 0.5negative sampling · 0.5multi-level layout · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | DRGraph: An Efficient Graph Layout Algorithm for Large-scale Graphs by Dimensionality ReductionabstractEfficient layout of large-scale graphs remains a challenging problem: the force-directed and dimensionality reduction-based methods suffer from high overhead for graph distance and gradient computation. In this paper, we present a new graph layout algorithm, called DRGraph, that enhances the nonlinear dimensionality reduction process with three schemes: approximating graph distances by means of a sparse distance matrix, estimating the gradient by using the negative sampling technique, and accelerating the optimization process through a multi-level layout scheme. DRGraph achieves a linear complexity for the computation and memory consumption, and scales up to large-scale graphs with millions of nodes. Experimental results and comparisons with state-of-the-art graph layout methods demonstrate that DRGraph can generate visually comparable layouts with a faster running time and a lower memory requirement. Minfeng Zhu 0001, Wei Chen 0001, Yuxuan Hou, Liangjun Liu, Kaiyuan Zhang 0002 |
IEEE Trans. Vis. Comput. Graph. | 5 |
| 2021 | A Random Label and Lightweight Hash-Based Security Authentication Mechanism for a UAV SwarmabstractNowadays, the application of a UAV swarm is becoming more and more widespread in the military field, and more and more attention is paid to the security of mission resource allocation. However, the relay node forwarding in the wireless transmission process brings greater risks to data leakage, and the computing power and energy of the UAV consumption is limited, so a lighter solution is required. This paper proposes a mechanism for the safe allocation of UAV swarm mission resources based on random labels. Each task has a random label to solve the problem of database security and wireless transmission security in the process of UAV task assignment. Furthermore, a lightweight stream cipher encryption scheme is illustrated to ensure the security of the UAV database. The irreversible hash function SHA‐256 and the lightweight foam structure hash function SPONGENT‐128 are used to generate random labels and then allocate task resources. In the case of energy consumption, it reduces the possibility of the enemy successfully obtaining private data. The simulation results show that the scheme has good performance in terms of security and has better performance than existing methods in terms of throughput and delay, without increasing too much energy consumption. Feng Hu 0003, Hongyan Qian, Liangjun Liu |
Wirel. Commun. Mob. Comput. | 3 |
| 2019 | Location2vec: A Situation-Aware Representation for Visual Exploration of Urban LocationsabstractUnderstanding the relationship between urban locations is an essential task in urban planning and transportation management. Although prior works have focused on studying urban locations by aggregating location-based properties, our scheme preserves the mutual influence between urban locations and mobility behavior, and thereby enables situation-aware exploration of urban regions. By leveraging word embedding techniques, we encode urban locations with a vectorized representation while retaining situational awareness. Specifically, we design a spatial embedding algorithm that is precomputed by incorporating the interactions between urban locations and moving objects. To explore our proposed technique, we have designed and implemented a web-based visual exploration system that supports the comprehensive analysis of human mobility, location functionality, and traffic assessment by leveraging the proposed visual representation. The case studies demonstrate the effectiveness of our approach. Minfeng Zhu 0001, Wei Chen 0001, Jiazhi Xia, Yuxin Ma 0001, Yankong Zhang, Yuetong Luo, Zhaosong Huang, Liangjun Liu |
IEEE Trans. Intell. Transp. Syst. | 8 |