EDBT 2026 Demo / reviewers in the wild / expert
Beichen Liu
dblp:129/8788
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 2019
0000-0001-9757-1456ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2Software engineering, systems software and programming languages · 1 · 1 first-author
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% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Parallel and multicore computing · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics
flow visualization |
0.2 | 1 | 2013 | Parallel Streamline Placement for 2D Flow Fields · IEEE Trans. Vis. Comput. Graph. 2013 |
Visualization and visual analytics › flow visualization
streamline placement |
0.2 | 1 | 2013 | Parallel Streamline Placement for 2D Flow Fields · IEEE Trans. Vis. Comput. Graph. 2013 |
Parallel and multicore computing
parallel programming models |
0.0 | 1 | 2013 | Parallel Streamline Placement for 2D Flow Fields · IEEE Trans. Vis. Comput. Graph. 2013 |
Parallel and multicore computing › parallel programming models
shared-memory parallelization |
0.0 | 1 | 2013 | Parallel Streamline Placement for 2D Flow Fields · IEEE Trans. Vis. Comput. Graph. 2013 |
Methods — techniques the papers use, named apart from their topics
local tracing areas · 0.3heuristic seeding · 0.3cell-based modeling · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | SlimGuard: A Secure and Memory-Efficient Heap AllocatorabstractAttacks on the heap are an increasingly severe threat. State-of-the-art secure dynamic memory allocators can offer protection, however their memory footprint is high, making them suboptimal in many situations. We introduce Slim-Guard, a secure allocator whose design is driven by memory efficiency. Among other features, SlimGuard uses an efficient fine-grain size classes indexing mechanism and implements a novel dynamic canary scheme. It offers a low memory overhead due its size classes optimized for canary usage, its on-demand metadata allocation, and the combination of randomized allocations and over-provisioning into a single memory efficient security feature. SlimGuard protects against widespread heap-related attacks such as overflows, over-reads, double/invalid free, and use-after-free. Evaluation over a wide range of applications shows that it offers a significant reduction in memory consumption compared to the state-of-the-art secure allocator (up to 2x in macro-benchmarks), while offering similar or better security guarantees and good performance. Beichen Liu, Pierre Olivier, Binoy Ravindran |
Middleware | 1 |
| 2013 | A Streamline Illumination Method for 3D Flow FieldsabstractIllumination is an important way to provide cues for spatial perception, and special lighting models are proposed to illuminate lines in 3D space. To achieve better spatial perception of streamlines, a new streamline illumination method is proposed in this paper, which is based on the fact that a streamline is a sample of a stream surface. In our method, a view-dependent tiny surface passing through the streamline is chosen to compute the line's illumination based on the Phong/Blinn model. Compared with existing line illumination models, our method is more simple and realistic. Test results show that it can enhance spatial perception of streamlines significantly. Yuezhu Pei, Beichen Liu, Mengyuan Guan |
ICIG | 3 |
| 2013 | Parallel Streamline Placement for 2D Flow FieldsabstractParallel streamline placement is still an open problem in flow visualization. In this paper, we propose an innovative method to place streamlines in parallel for 2D flow fields. This method is based on our proposed concept of local tracing areas (LTAs). An LTA is defined as a subdomain enclosed by streamlines and/or field borders, where the tracing of streamlines are localized. Given a flow field, it is initialized as an LTA, which is later recursively partitioned into hierarchical LTAs. Streamlines are placed within different LTAs simultaneously and independently. At the same time, to control the density of streamlines, each streamline is associated with an isolation zone and a saturation zone, both of which are center aligned with the streamline but have different widths. None of streamlines can trace into isolation zones of others. And new streamlines are only seeded within valid seeding areas (VSAs) that are enclosed by saturation zones and/or field borders. To implement the parallel strategy and the density control, a cell-based modeling is devised to describe isolation zones and LTAs as well as saturation zones and VSAs. With the help of these cell-based models, a heuristic seeding strategy is proposed to seed streamlines within irregular LTAs, and a cell-marking technique is used to control the seeding and tracing of streamlines. Test results show that the placement method can achieve highly parallel performance on shared memory systems without losing the quality of placements. Jianfeng Zhan, Beichen Liu, Jianguo Ning |
IEEE Trans. Vis. Comput. Graph. | 4 |