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

Zuozhou Chen

dblp:43/4660 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
4since 2021 · last 2026
—ORCID · conflict

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

Computer networks · 3 · 3 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorArtificial intelligence and machine learning · 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 networks
3 papers
Content delivery and video streaming · 64% Edge and fog computing · 36%
Computer graphics and multimedia
2 papers
Multimedia analysis and retrieval · 50% Image and video coding · 50%

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

TopicWeightPapersLastEvidence papers
Content delivery and video streaming
adaptive video streaming
1.822026
Joint Bitrate and Resource Adaptation for Super-Resolution Video Streaming in Multi-Cluster Edge Networks: A New Online Learning Approach · IEEE Trans. Mob. Comput. 2026
Rosevin: Employing Resource- and Rate-Adaptive Edge Super-Resolution for Video Streaming · INFOCOM 2024
Edge and fog computing › resource management
edge resource allocation
1.822026
Joint Bitrate and Resource Adaptation for Super-Resolution Video Streaming in Multi-Cluster Edge Networks: A New Online Learning Approach · IEEE Trans. Mob. Comput. 2026
Rosevin: Employing Resource- and Rate-Adaptive Edge Super-Resolution for Video Streaming · INFOCOM 2024
Content delivery and video streaming › video delivery
super-resolution video streaming
1.822026
Joint Bitrate and Resource Adaptation for Super-Resolution Video Streaming in Multi-Cluster Edge Networks: A New Online Learning Approach · IEEE Trans. Mob. Comput. 2026
Rosevin: Employing Resource- and Rate-Adaptive Edge Super-Resolution for Video Streaming · INFOCOM 2024
Content delivery and video streaming
video delivery
0.812024
Rosevin: Employing Resource- and Rate-Adaptive Edge Super-Resolution for Video Streaming · INFOCOM 2024
Image and video coding
semantic compression
0.712023
VaBUS: Edge-Cloud Real-Time Video Analytics via Background Understanding and Subtraction · IEEE J. Sel. Areas Commun. 2023
Multimedia analysis and retrieval
video content analysis
0.712023
VaBUS: Edge-Cloud Real-Time Video Analytics via Background Understanding and Subtraction · IEEE J. Sel. Areas Commun. 2023
Content delivery and video streaming › quality of experience
quality of experience optimization
0.312026
Joint Bitrate and Resource Adaptation for Super-Resolution Video Streaming in Multi-Cluster Edge Networks: A New Online Learning Approach · IEEE Trans. Mob. Comput. 2026
Edge and fog computing
task-oriented communication
0.212023
VaBUS: Edge-Cloud Real-Time Video Analytics via Background Understanding and Subtraction · IEEE J. Sel. Areas Commun. 2023

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

convex optimization · 2.5online learning · 1.5combinatorial learning · 1.5experience-driven learning · 1.3adaptive encoding · 1.3online combinatorial learning · 1.0
YearPublicationVenuePosition
2026 Joint Bitrate and Resource Adaptation for Super-Resolution Video Streaming in Multi-Cluster Edge Networks: A New Online Learning Approach
abstract
Today's video streaming service providers have exploited cloud-edge collaborative networks for video delivery across geo-distributed edge clusters and end users. The existing content delivery network (CDN) scheduling and adaptive bitrate algorithms may not fully utilize edge resources or lack a global control to optimize resource sharing. The emerging super-resolution (SR) approach can unleash the potential of leveraging computation resources to compensate for bandwidth consumption, by producing high-quality videos from low-resolution contents. Yet the uncertain SR resource sensitivity and its interplay with bitrate adaptation are under-explored. In this work, we proposeRosevin, the first resource scheduler that jointly decides the bitrates and fine-grained resource allocation to perform SR at the edge, which can learn to optimize the long-term QoE for distributed end users. To handle the time-varying and complex space of decisions as well as a non-smooth objective function,Rosevinrealizes a novel online combinatorial learning algorithm, which nicely integrates convex optimization theories and online learning techniques, addressing the switching cost issues. In addition to theoretically analyzing its performance, we implement an SR-assisted video streaming prototype ofRosevinand demonstrate its advantages over several video delivery benchmarks.
Xiaoxi Zhang 0001, Longhao Zou, Jingpu Duan, Chuan Wu 0001, Yali Xue, Zuozhou Chen, Chaoqi Zhou, Xu Chen 0004
IEEE Trans. Mob. Comput.7
2024 Rosevin: Employing Resource- and Rate-Adaptive Edge Super-Resolution for Video Streaming
abstract
Today’s video streaming service providers have exploited cloud-edge collaborative networks for geo-distributed video delivery. The existing content delivery network (CDN) scheduling and adaptive bitrate algorithms may not fully utilize edge resources or lack a global control to optimize resource sharing. The emerging super-resolution (SR) approach can unleash the potential of leveraging computation resources to compensate for bandwidth consumption, by producing high-quality videos from low-resolution contents. Yet the uncertain SR resource sensitivity and its interplay with bitrate adaptation are underexplored. In this work, we propose Rosevin, the first resource scheduler that jointly decides the bitrates and fine-grained resource allocation to perform SR at the edge, which can learn to optimize the long-term QoE for distributed end users. To handle the time-varying and complex space of decisions as well as a non-smooth objective function, Rosevin realizes a novel online combinatorial learning algorithm, which nicely integrates convex optimization theories and online learning techniques. In addition to theoretically analyzing its performance, we implement an SR-assisted video streaming prototype of Rosevin and demonstrate its advantages over several video delivery benchmarks.
Xiaoxi Zhang 0001, Longhao Zou, Jingpu Duan, Chuan Wu 0001, Yali Xue, Zuozhou Chen, Xu Chen 0004
INFOCOM7
2023 EMS-SLAM: Edge-Assisted Multi-Agent System Simultaneous Localization and Mapping
abstract
In recent years, there has been a growing demand for robotic environment perception and autonomous driving due to the increasing popularity of visual and geometry-based localization and mapping techniques, such as simultaneous localization and mapping (SLAM). To address this trend, this paper proposes the EMS-SLAM framework, which utilizes cooperative adaptive wireless communication between servers and multi-robot agents to enhance environment perception and self-localization efficiency and accuracy. EMS-SLAM can reduce mapping time and CPU and memory utilization of individual robots while maintaining high accuracy OctoMap based on multi-map fusion and optimization. EMS-SLAM’s effectiveness and real-time performance have been validated and tested on publicly available datasets and real robots for real-world operations. The experimental results demonstrate that EMS-SLAM can reduce the CPU utilization of a single robot by approximately 10% and improve the efficiency of large-scale SLAM. The constructed OctoMap achieves centimeter-level accuracy. EMS-SLAM provides reliable, agile, and energy-efficient assistance for large-scale environment perception of robots.
Lei Zhan, Longhao Zou, Zuozhou Chen, Gabriel-Miro Muntean
VTC2023-Spring4
2023 VaBUS: Edge-Cloud Real-Time Video Analytics via Background Understanding and Subtraction
abstract
Edge-cloud collaborative video analytics is transforming the way data is being handled, processed, and transmitted from the ever-growing number of surveillance cameras around the world. To avoid wasting limited bandwidth on unrelated content transmission, existing video analytics solutions usually perform temporal or spatial filtering to realize aggressive compression of irrelevant pixels. However, most of them work in a context-agnostic way while being oblivious to the circumstances where the video content is happening and the context-dependent characteristics under the hood. In this work, we propose VaBUS, a real-time video analytics system that leverages the rich contextual information of surveillance cameras to reduce bandwidth consumption for semantic compression. As a task-oriented communication system, VaBUS dynamically maintains the background image of the video on the edge with minimal system overhead and sends only highly confident Region of Interests (RoIs) to the cloud through adaptive weighting and encoding. With a lightweight experience-driven learning module, VaBUS is able to achieve high offline inference accuracy even when network congestion occurs. Experimental results show that VaBUS reduces bandwidth consumption by 25.0%-76.9% while achieving 90.7% accuracy for both the object detection and human keypoint detection tasks.
Hanling Wang, Qing Li 0006, Heyang Sun, Zuozhou Chen, Yingqian Hao, Junkun Peng, Zhenhui Yuan, Junsheng Fu, Yong Jiang 0001
IEEE J. Sel. Areas Commun.4
2010 Pash 3.0: A versatile software package for read mapping and integrative analysis of genomic and epigenomic variation using massively parallel DNA sequencing
abstract
BACKGROUND: Massively parallel sequencing readouts of epigenomic assays are enabling integrative genome-wide analyses of genomic and epigenomic variation. Pash 3.0 performs sequence comparison and read mapping and can be employed as a module within diverse configurable analysis pipelines, including ChIP-Seq and methylome mapping by whole-genome bisulfite sequencing. RESULTS: Pash 3.0 generally matches the accuracy and speed of niche programs for fast mapping of short reads, and exceeds their performance on longer reads generated by a new generation of massively parallel sequencing technologies. By exploiting longer read lengths, Pash 3.0 maps reads onto the large fraction of genomic DNA that contains repetitive elements and polymorphic sites, including indel polymorphisms. CONCLUSIONS: We demonstrate the versatility of Pash 3.0 by analyzing the interaction between CpG methylation, CpG SNPs, and imprinting based on publicly available whole-genome shotgun bisulfite sequencing data. Pash 3.0 makes use of gapped k-mer alignment, a non-seed based comparison method, which is implemented using multi-positional hash tables. This allows Pash 3.0 to run on diverse hardware platforms, including individual computers with standard RAM capacity, multi-core hardware architectures and large clusters.
Cristian Coarfa, Fuli Yu, Christopher A. Miller 0003, Zuozhou Chen, R. Alan Harris, Aleksandar Milosavljevic
BMC Bioinform.4
2006 GO-Diff: Mining functional differentiation between EST-based transcriptomes
abstract
BACKGROUND: Large-scale sequencing efforts produced millions of Expressed Sequence Tags (ESTs) collectively representing differentiated biochemical and functional states. Analysis of these EST libraries reveals differential gene expressions, and therefore EST data sets constitute valuable resources for comparative transcriptomics. To translate differentially expressed genes into a better understanding of the underlying biological phenomena, existing microarray analysis approaches usually involve the integration of gene expression with Gene Ontology (GO) databases to derive comparable functional profiles. However, methods are not available yet to process EST-derived transcription maps to enable GO-based global functional profiling for comparative transcriptomics in a high throughput manner. RESULTS: Here we present GO-Diff, a GO-based functional profiling approach towards high throughput EST-based gene expression analysis and comparative transcriptomics. Utilizing holistic gene expression information, the software converts EST frequencies into EST Coverage Ratios of GO Terms. The ratios are then tested for statistical significances to uncover differentially represented GO terms between the compared transcriptomes, and functional differences are thus inferred. We demonstrated the validity and the utility of this software by identifying differentially represented GO terms in three application cases: intra-species comparison; meta-analysis to test a specific hypothesis; inter-species comparison. GO-Diff findings were consistent with previous knowledge and provided new clues for further discoveries. A comprehensive test on the GO-Diff results using series of comparisons between EST libraries of human and mouse tissues showed acceptable levels of consistency: 61% for human-human; 69% for mouse-mouse; 47% for human-mouse. CONCLUSION: GO-Diff is the first software integrating EST profiles with GO knowledge databases to mine functional differentiation between biological systems, e.g. tissues of the same species or the same tissue cross species. With rapid accumulation of EST resources in the public domain and expanding sequencing effort in individual laboratories, GO-Diff is useful as a screening tool before undertaking serious expression studies.
Zuozhou Chen, Xuefeng Bruce Ling, Jane Jijun Liu, Liangbiao Chen
BMC Bioinform.1
2006 Mining gene expression databases for local causal relationships using a simple constraint-based algorithm
abstract
There is great potential in mining gene expression microarray databases to discover causal relationships in the gene-regulation pathway. Several methods using Bayesian networks have been reported. Most of them use a heuristics search based on the criteria for choosing a network, but these methods are often computationally intractable for microarray data with thousands of genes. In this work, a simple constrained-based, local causal discovery method is presented. This method is computationally feasible but does not attempt to discover complete causal structure. To show the effectiveness of this method, we have conducted simulations and applied this method to the data set from Hughes et al. from 300 expression profiles of yeast. Using this method, results of simulation data tests demonstrated that the accuracy ratios of causal relationships became higher when the sample size increased. From the yeast data set, a number of causal relations were found. A cursory analysis shows some of the relations have biological sense, others need further investigation.
Huijuan Lu, Zuozhou Chen
Int. J. Pattern Recognit. Artif. Intell.3