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.

Xiaoqiang Zheng

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

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

Human-computer interaction and ubiquitous computing · 5 · 5 first-authorSystems, architecture and hardware · 2Computer networks · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 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
1 paper
Network management and operations · 100%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Distributed systems · 92% Electronic design automation · 8%
Artificial intelligence
2 papers
Efficient and distributed learning · 100%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%

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

TopicWeightPapersLastEvidence papers
Network management and operations › fault management
fault diagnosis
1.012026
Diagnosing and Repairing Distributed Routing Configurations Using Selective Symbolic Simulation · NSDI 2026
Network management and operations
network configuration
1.012026
Diagnosing and Repairing Distributed Routing Configurations Using Selective Symbolic Simulation · NSDI 2026
Machine learning › Efficient and distributed learning
distributed training
0.312018
Dynamic control flow in large-scale machine learning · EuroSys 2018
Distributed systems
distributed machine learning
0.312018
Dynamic control flow in large-scale machine learning · EuroSys 2018
Machine learning › Efficient and distributed learning
large-scale learning
0.212016
TensorFlow: A System for Large-Scale Machine Learning · OSDI 2016
Distributed systems
large-scale machine learning systems
0.212016
TensorFlow: A System for Large-Scale Machine Learning · OSDI 2016
Visualization and visual analytics › scientific visualization
tensor field visualization
0.112005
Topological Lines in 3D Tensor Fields and Discriminant Hessian Factorization · IEEE Trans. Vis. Comput. Graph. 2005
Visualization and visual analytics
topological data analysis
0.112005
Topological Lines in 3D Tensor Fields and Discriminant Hessian Factorization · IEEE Trans. Vis. Comput. Graph. 2005
Electronic design automation
logic synthesis
0.011996
Generalized Partially-Mixed-Polarity Reed-Muller Expansionand Its Fast Computation · IEEE Trans. Computers 1996
Electronic design automation › logic synthesis
reed-muller expansion
0.011996
Generalized Partially-Mixed-Polarity Reed-Muller Expansionand Its Fast Computation · IEEE Trans. Computers 1996
Electronic design automation › logic synthesis › two-level logic minimization
sum-of-products minimization
0.011996
Generalized Partially-Mixed-Polarity Reed-Muller Expansionand Its Fast Computation · IEEE Trans. Computers 1996

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

symbolic simulation · 1.0data flow graphs · 0.6data flow graph · 0.6hessian factorization · 0.1discriminant analysis · 0.1two-dimensional data flow computation · 0.0
YearPublicationVenuePosition
2026 Scalable Simulation-based Configuration Verification of DCNs via Destination-Independent Compression
Mengrui Zhang, Xiaoqiang Zheng, Letian Zhu, Lizhao You, Ziyang Yao, Yang Wang 0161, Zhi Zhang 0016, Ronghua Sun, Yuanhui Zhong, Fei Yuan 0014, Qiao Xiang
IWQoS2
2026 Diagnosing and Repairing Distributed Routing Configurations Using Selective Symbolic Simulation
Rulan Yang, Gao Han, Hanyang Shao, Xiaoqiang Zheng, Lizhao You, Ruiting Zhou, Linghe Kong, Ennan Zhai, Qiao Xiang, Jiwu Shu
NSDI4
2020 Multi-label Contrastive Focal Loss for Pedestrian Attribute Recognition
abstract
Pedestrian Attribute Recognition (PAR) has received extensive attention during the past few years. With the advances of deep convolutional neural networks (CNNs), the performance of PAR has been significantly improved. Existing methods tend to acquire attribute-specific features by designing various complex network structures with additional modules. Such additional modules, however, dramatically increase the number of network parameters. Meanwhile, the problems of class imbalance and hard attribute retrieving remain underestimated in PAR. In this paper, we explore the optimization mechanism of the training processing to account for these problems and propose a new loss function called Multi-label Contrastive Focal Loss (MCFL). This proposed MCFL emphasizes the hard and minority attributes by using a separated re-weighting mechanism for different positive and negative classes to alleviate the impact of the imbalance. MCFL is also able to enlarge the gaps between the intra-class of multi-label attributes, to force CNNs to extract more subtle discriminative features. We evaluate the proposed MCFL on three large public pedestrian datasets, including RAP, PA-100K, and PETA. The experimental results indicate that the proposed MCFL with the ResNet-50 backbone is able to outperform other state-of-the-art approaches in term of mean accuracy.
Xiaoqiang Zheng, Zhenxia Yu, Lin Chen 0023
ICPR1
2018 Dynamic control flow in large-scale machine learning
abstract
Many recent machine learning models rely on fine-grained dynamic control flow for training and inference. In particular, models based on recurrent neural networks and on reinforcement learning depend on recurrence relations, data-dependent conditional execution, and other features that call for dynamic control flow. These applications benefit from the ability to make rapid control-flow decisions across a set of computing devices in a distributed system. For performance, scalability, and expressiveness, a machine learning system must support dynamic control flow in distributed and heterogeneous environments.
Martín Abadi, Paul Barham 0001, Eugene Brevdo, Michael Burrows, Andy Davis, Jeffrey Dean, Sanjay Ghemawat, Tim Harley, Peter Hawkins, Michael Isard, Manjunath Kudlur, Rajat Monga, Derek Gordon Murray, Xiaoqiang Zheng
EuroSys15
2016 TensorFlow: A System for Large-Scale Machine Learning
Martín Abadi, Paul Barham 0001, Jianmin Chen, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Geoffrey Irving, Michael Isard, Manjunath Kudlur, Josh Levenberg, Rajat Monga, Sherry Moore, Derek Gordon Murray, Benoit Steiner, Paul A. Tucker, Vijay Vasudevan, Pete Warden, Martin Wicke, Xiaoqiang Zheng
OSDI22
2005 2D Asymmetric Tensor Analysis
abstract
Analysis of degenerate tensors is a fundamental step in finding the topological structures and separatrices in tensor fields. Previous work in this area have been limited to analyzing symmetric second order tensor fields. In this paper, we extend the topological analysis to 2D general (asymmetric) second order tensor fields. We show that it is not sufficient to define degeneracies based on eigenvalues alone, but one must also include the eigenvectors in the analysis. We also study the behavior of these eigenvectors as they cross from one topological region into another.
Xiaoqiang Zheng, Alex T. Pang
IEEE Visualization1
2005 Topological Structures of 3D Tensor Fields
abstract
Tensor topology is useful in providing a simplified and yet detailed representation of a tensor field. Recently the field of 3D tensor topology is advanced by the discovery that degenerate tensors usually form lines in their most basic configurations. These lines form the backbone for further topological analysis. A number of ways for extracting and tracing the degenerate tensor lines have also been proposed. In this paper, we complete the previous work by studying the behavior and extracting the separating surfaces emanating from these degenerate lines. First, we show that analysis of eigenvectors around a 3D degenerate tensor can be reduced to 2D. That is, in most instances, the 3D separating surfaces are just the trajectory of the individual 2D separatrices which includes trisectors and wedges. But the proof is by no means trivial since it is closely related to perturbation theory around a pair of singular slate. Such analysis naturally breaks down at the tangential points where the degenerate lines pass through the plane spanned by the eigenvectors associated with the repeated eigenvalues. Second, we show that the separatrices along a degenerate line may switch types (e.g. trisectors to wedges) exactly at the points where the eigenplane is tangential to the degenerate curve. This property leads to interesting and yet complicated configuration of surfaces around such transition points. Finally, we apply the technique to several common data sets to verify its correctness.
Xiaoqiang Zheng, Beresford N. Parlett, Alex T. Pang
IEEE Visualization1
2005 Topological Lines in 3D Tensor Fields and Discriminant Hessian Factorization
abstract
This paper addresses several issues related to topological analysis of 3D second order symmetric tensor fields. First, we show that the degenerate features in such data sets form stable topological lines rather than points, as previously thought. Second, the paper presents two different methods for extracting these features by identifying the individual points on these lines and connecting them. Third, this paper proposes an analytical form of obtaining tangents at the degenerate points along these topological lines. The tangents are derived from a Hessian factorization technique on the tensor discriminant and leads to a fast and stable solution. Together, these three advances allow us to extract the backbone topological lines that form the basis for topological analysis of tensor fields.
Xiaoqiang Zheng, Beresford N. Parlett, Alex T. Pang
IEEE Trans. Vis. Comput. Graph.1
2004 Topological Lines in 3D Tensor Fields
abstract
Visualization of 3D tensor fields continues to be a major challenge in terms of providing intuitive and uncluttered images that allow the users to better understand their data. The primary focus of this paper is on finding a formulation that lends itself to a stable numerical algorithm for extracting stable and persistent topological features from 2nd order real symmetric 3D tensors. While features in 2D tensors can be identified as either wedge or trisector points, in 3D, the corresponding stable features are lines, not just points. These topological feature lines provide a compact representation of the 3D tensor field and are essential in helping scientists and engineers understand their complex nature. Existing techniques work by finding degenerate points and are not numerically stable, and worse, produce both false positive and false negative feature points. This work seeks to address this problem with a robust algorithm that can extract these features in a numerically stable, accurate, and complete manner.
Xiaoqiang Zheng, Alex T. Pang
IEEE Visualization1
2003 HyperLIC
abstract
We introduce a new method for visualizing symmetric tensor fields. The technique produces images and animations reminiscent of line integral convolution (LIC). The technique is also slightly related to hyperstreamlines in that it is used to visualize tensor fields. However, the similarity ends there. HyperLIC uses a multi-pass approach to show the anisotropic properties in a 2D or 3D tensor field. We demonstrate this technique using data sets from computational fluid dynamics as well as diffusion-tensor MRI.
Xiaoqiang Zheng, Alex T. Pang
IEEE Visualization1
2002 Volume Deformation For Tensor Visualization
abstract
Visualizing second-order 3D tensor fields continue to be a challenging task. Although there are several algorithms that have been presented, no single algorithm by itself is sufficient for the analysis because of the complex nature of tensor fields. In this paper, we present two new methods, based on volume deformation, to show the effects of the tensor field upon its underlying media. We focus on providing a continuous representation of the nature of the tensor fields. Each of these visualization algorithms is good at displaying some particular properties of the tensor field.
Xiaoqiang Zheng, Alex T. Pang
IEEE Visualization1
1996 Generalized Partially-Mixed-Polarity Reed-Muller Expansionand Its Fast Computation
abstract
Generalized partially-mixed-polarity Reed-Muller (GPMPRM) expansion, a canonical subfamily of exclusive sum of products (ESOP), is presented. An efficient algorithm in two-dimensional data flow is proposed for computation of the GPMPRM forms. MCNC benchmark experimental results show that the minimal GPMPRM forms of these functions, on the average, have similar number of terms to their sum of products (SOP) counterparts while there are many functions for which the GPMPRM circuits are much smaller.
Marek A. Perkowski, Xiaoqiang Zheng, Nan Zhuang
IEEE Trans. Computers3