Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhe Chu

dblp:256/6513 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2024
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
Routing and switching · 93% Wireless networking · 7%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Visualization and visual analytics › interactive visualization
responsive visualization
0.812024
Semi-Automatic Layout Adaptation for Responsive Multiple-View Visualization Design · IEEE Trans. Vis. Comput. Graph. 2024
Visualization and visual analytics
visual analytics
0.812024
Semi-Automatic Layout Adaptation for Responsive Multiple-View Visualization Design · IEEE Trans. Vis. Comput. Graph. 2024
Routing and switching
ad hoc network routing
0.812024
Intelligent Routing in Directional Ad Hoc Networks Through Predictive Directional Heat Map From Spatio-Temporal Deep Learning · IEEE Trans. Mob. Comput. 2024
Routing and switching › adaptive routing
congestion-aware routing
0.812024
Intelligent Routing in Directional Ad Hoc Networks Through Predictive Directional Heat Map From Spatio-Temporal Deep Learning · IEEE Trans. Mob. Comput. 2024
Routing and switching › wireless routing
directional antenna routing
0.812024
Intelligent Routing in Directional Ad Hoc Networks Through Predictive Directional Heat Map From Spatio-Temporal Deep Learning · IEEE Trans. Mob. Comput. 2024
Routing and switching
routing protocol
0.812024
Intelligent Routing in Directional Ad Hoc Networks Through Predictive Directional Heat Map From Spatio-Temporal Deep Learning · IEEE Trans. Mob. Comput. 2024
Wireless networking
directional antenna
0.212024
Intelligent Routing in Directional Ad Hoc Networks Through Predictive Directional Heat Map From Spatio-Temporal Deep Learning · IEEE Trans. Mob. Comput. 2024

Methods — techniques the papers use, named apart from their topics

spatio-temporal deep learning · 0.8simulated annealing · 0.8rule-based auto configuration · 0.8optimization · 0.8
YearPublicationVenuePosition
2024 Intelligent Routing in Directional Ad Hoc Networks Through Predictive Directional Heat Map From Spatio-Temporal Deep Learning
abstract
By applying a simple shortest/minimum-cost routing algorithm, the mobile ad-hoc network (MANET) with heavy data transmissions may be easily congested if multiple routes meet at the same relay node. Therefore, those busy nodes should be avoided when a new path is established. The task of optimal path seeking becomes more challenging when a MANET is equipped with directional antennas that may cause directional interference with neighboring receivers. The motivation of our research is to build an intelligent proactive routing scheme for MANETs with directional antennas. Our directional routing protocol considers not only the global traffic distribution in different areas of the MANET, but also the properties of directional antennas. It uses a spatio-temporal deep learning algorithm to predict the next-time snapshot of a directional heat map (DHM), which shows the traffic density distribution in each network location as well as the coverage of each directional antenna. The DHM is then used to identify the optimal path that can avoid congested areas as well as the interference from all neighboring directional links. Furthermore, an optimization algorithm is designed to perform optimal path selection. It splits a single path into multiple paths converge later on into one path, if the path needs to go around a congested area. Therefore, our routing scheme achieves better quality-of-service (QoS) performance than existing routing schemes.
Zhe Chu, Fei Hu 0001, Elizabeth S. Bentley, Sunil Kumar 0001
IEEE Trans. Mob. Comput.1
2024 Semi-Automatic Layout Adaptation for Responsive Multiple-View Visualization Design
abstract
Multiple-view (MV) visualizations have become ubiquitous for visual communication and exploratory data visualization. However, most existing MV visualizations are designed for the desktop, which can be unsuitable for the continuously evolving displays of varying screen sizes. In this article, we present a two-stage adaptation framework that supports the automated retargeting and semi-automated tailoring of a desktop MV visualization for rendering on devices with displays of varying sizes. First, we cast layout retargeting as an optimization problem and propose a simulated annealing technique that can automatically preserve the layout of multiple views. Second, we enable fine-tuning for the visual appearance of each view, using a rule-based auto configuration method complemented with an interactive interface for chart-oriented encoding adjustment. To demonstrate the feasibility and expressivity of our proposed approach, we present a gallery of MV visualizations that have been adapted from the desktop to small displays. We also report the result of a user study comparing visualizations generated using our approach with those by existing methods. The outcome indicates that the participants generally prefer visualizations generated using our approach and find them to be easier to use.
Wei Zeng 0004, Xi Chen 0072, Yihan Hou, Lingdan Shao, Zhe Chu, Remco Chang
IEEE Trans. Vis. Comput. Graph.5