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

Yucheng Zheng

dblp:250/2854 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
6since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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 architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 54% Cloud and datacenter computing · 46%
Computer graphics and multimedia
2 papers
Computational photography and imaging · 57% Visual content generation and editing · 43%

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

TopicWeightPapersLastEvidence papers
Memory systems
cache
1.012026
SpiderSense: Lightweight Last-Level Cache Management via Time Period Tagging for LLC-Critical Workloads · ACM Trans. Archit. Code Optim. 2026
Memory systems › cache management
cache partitioning
1.012026
SpiderSense: Lightweight Last-Level Cache Management via Time Period Tagging for LLC-Critical Workloads · ACM Trans. Archit. Code Optim. 2026
Memory systems › memory hierarchy › cache hierarchy
last-level cache
1.012026
SpiderSense: Lightweight Last-Level Cache Management via Time Period Tagging for LLC-Critical Workloads · ACM Trans. Archit. Code Optim. 2026
Cloud and datacenter computing › multi-tenancy
multi-tenant cloud
1.012026
SpiderSense: Lightweight Last-Level Cache Management via Time Period Tagging for LLC-Critical Workloads · ACM Trans. Archit. Code Optim. 2026
Cloud and datacenter computing
performance isolation
1.012026
SpiderSense: Lightweight Last-Level Cache Management via Time Period Tagging for LLC-Critical Workloads · ACM Trans. Archit. Code Optim. 2026
Computational photography and imaging
depth estimation
0.512021
A Simple Framework for 3D Lensless Imaging with Programmable Masks · ICCV 2021
Computational photography and imaging › computational optics
lensless imaging
0.512021
A Simple Framework for 3D Lensless Imaging with Programmable Masks · ICCV 2021
Cloud and datacenter computing
virtualization
0.312026
SpiderSense: Lightweight Last-Level Cache Management via Time Period Tagging for LLC-Critical Workloads · ACM Trans. Archit. Code Optim. 2026
Cloud and datacenter computing › virtualization
virtual machine monitor
0.312026
SpiderSense: Lightweight Last-Level Cache Management via Time Period Tagging for LLC-Critical Workloads · ACM Trans. Archit. Code Optim. 2026

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

data amplification learning · 1.5time period tagging · 1.0dynamic sampling · 1.0refinement network · 0.5inverse problem solving · 0.5
YearPublicationVenuePosition
2026 Pharmacovigilance service recommendation with multilayered tripartite contrastive learning
Zijian Bai, Yucheng Zheng
Expert Syst. Appl.4
2026 SpiderSense: Lightweight Last-Level Cache Management via Time Period Tagging for LLC-Critical Workloads
abstract
Multi-tenant clouds enhance resource sharing among Virtual Machines (VMs) to boost overall utilization and reduce power consumption. However, this also introduces interference among workloads from different tenants and impedes VM performance isolation. In this article, we first demonstrate that the last-level cache (LLC) in CPUs, which is inherently shared by all VMs on the same physical machine, becomes a significant contending resource for LLC-critical workloads, leading to notable performance imbalances under the default hardware caching strategy. Although recent studies on LLC scheduling have progressed, they often require detailed profiling of user workloads or rely on hyperparameter tuning, limiting their applicability to private clusters or specific scenarios. We propose SpiderSense, a software-initiated LLC partitioner for managing Virtual Machine Monitors (VMM), to address these limitations. SpiderSense leverages modern yet off-the-shelf server CPU features to adaptively orchestrate LLC allocation among running black-boxed user VMs. SpiderSense dynamically samples VMs and calculates their fair share of LLC to allocate them while fully improving performance isolation among VMs. We experiment with SpiderSense using typical LLC-critical workloads, representative of the types of applications that stress LLC performance, such as Memcached and Llama. Our results show that SpiderSense improves performance by up to 40% in numerous colocation scenarios compared to current solutions.
Zhixiang Wei, Zhibai Huang, James Yen, Tianlei Xiong, Kailiang Xu, Yucheng Zheng, Xingzi Yu, Yun Wang 0039, Zhengwei Qi
ACM Trans. Archit. Code Optim.6
2025 A Novel Formation Control Strategy for USVs With Improved DDPG: Simulation and Field Test
abstract
An efficient formation-keeping strategy is essential for unmanned surface vehicles (USVs) to achieve complex cooperation missions in the Marine Internet of Things (MIoT) system. However, traditional methods make generating an efficient strategy to adapt to different formation patterns difficult in dynamic MIoT. To address this, we enhance the deep deterministic policy gradient (DDPG) algorithm and propose a novel formation control strategy generation approach. First, we design a generic reward mechanism based on the virtual leader–follower strategy to adapt to different formation patterns, simplify the design process, and optimize the formation control. Then, we adopt the intrinsic curiosity module (ICM) to alleviate the problem of sparse rewards and the prioritized experience replay (PER) mechanism to improve the utilization of experience and accelerate the learning rate. In addition, a Gaussian noise model is integrated into the DDPG approach to simulate various external disturbances, which can improve the robustness of the generated strategy. Finally, we built a virtual simulation environment based on Unity3D and conducted field tests to verify the feasibility and superiority of our approach.
Xiaofei Yang 0001, Yucheng Zheng, Jianzhen Li, Shihong Ding, Zhengrong Xiang, Bin Zhang 0008
IEEE Internet Things J.3
2025 DCRLRec: Dual-domain contrastive reinforcement large language model for recommendation
Zijian Bai, Yucheng Zheng, Yuanyuan Chang
Inf. Process. Manag.2
2024 Toward Tiny and High-Quality Facial Makeup with Data Amplify Learning
Qiaoqiao Jin, Xuanhong Chen, Meiguang Jin, Yucheng Zheng, Yupeng Zhu, Bingbing Ni
ECCV (27)6
2021 A Simple Framework for 3D Lensless Imaging with Programmable Masks
abstract
Lensless cameras provide a framework to build thin imaging systems by replacing the lens in a conventional camera with an amplitude or phase mask near the sensor. Existing methods for lensless imaging can recover the depth and intensity of the scene, but they require solving computationally-expensive inverse problems. Furthermore, existing methods struggle to recover dense scenes with large depth variations. In this paper, we propose a lensless imaging system that captures a small number of measurements using different patterns on a programmable mask. In this context, we make three contributions. First, we present a fast recovery algorithm to recover textures on a fixed number of depth planes in the scene. Second, we consider the mask design problem, for programmable lensless cameras, and provide a design template for optimizing the mask patterns with the goal of improving depth estimation. Third, we use a refinement network as a post-processing step to identify and remove artifacts in the reconstruction. These modifications are evaluated extensively with experimental results on a lensless camera prototype to showcase the performance benefits of the optimized masks and recovery algorithms over the state of the art.
Yucheng Zheng, Aswin C. Sankaranarayanan, Muhammad Salman Asif
ICCV1
2020 Coded Illumination and Multiplexing for Lensless Imaging
abstract
Mask-based lensless cameras offer an alternative option to conventional cameras. Compared to conventional cameras, lensless cameras can be extremely thin, flexible, and lightweight. Despite these advantages, the quality of images recovered from the lensless cameras is often poor because of the ill-conditioning of the underlying linear system. In this paper, we propose a new method to address the problem of illconditioning by combining coded illumination patterns with the mask-based lensless imaging. We assume that the object is illuminated with multiple binary patterns and the camera acquires a sequence of images for different illumination patterns. We propose a low-complexity, recursive algorithm that avoids storing all the images or creating a large system matrix. We present simulation results on standard test images under various extreme conditions and demonstrate that the quality of the image improves significantly with a small number of illumination patterns.
Yucheng Zheng, Rongjia Zhang, Muhammad Salman Asif
ICASSP1