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.

Xiaojun Cheng

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

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

Applied, interdisciplinary, general and emerging computing · 5 · 2 since 2021Computer networks · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 first-authorSecurity and privacy · 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.

Databases, data mining, and information retrieval
1 paper
Distributed and cloud data management · 33% Transaction processing and concurrency control · 33% Indexing and storage engines · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Distributed and cloud data management › distributed database architecture
distributed relational database
0.612022
OceanBase: A 707 Million tpmC Distributed Relational Database System · Proc. VLDB Endow. 2022
Transaction processing and concurrency control
distributed transaction processing
0.612022
OceanBase: A 707 Million tpmC Distributed Relational Database System · Proc. VLDB Endow. 2022
Indexing and storage engines › storage management
storage engine
0.612022
OceanBase: A 707 Million tpmC Distributed Relational Database System · Proc. VLDB Endow. 2022
Distributed systems
fault tolerance
0.212022
OceanBase: A 707 Million tpmC Distributed Relational Database System · Proc. VLDB Endow. 2022

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

shared-nothing architecture · 1.1multi-tenancy · 1.1
YearPublicationVenuePosition
2026 GTPAN: A GRU-TPA-KAN Integrated Temporal-Pattern-Aware Neural Network for Shared Bicycle Deployment Forecasting and Dynamic Pricing Optimization
abstract
This paper develops GTPAN, an IoT-enabled temporal-pattern-aware neural framework for real-time shared mobility forecasting and dynamic pricing optimization. Within the Internet of Things (IoT) ecosystem of smart urban transportation, massive spatiotemporal data streams are continuously generated from bicycles, docking stations, and user mobile sensors. Traditional pricing and deployment schemes are often static and fail to adapt to this rapidly evolving IoT environment, leading to over-deployment and revenue loss. The proposed GTPAN framework integrates a Gated Recurrent Unit (GRU) for temporal encoding, a Temporal Pattern Attention (TPA) mechanism for adaptive feature weighting, and a Kolmogorov–Arnold Network (KAN) for nonlinear mapping, jointly enabling accurate demand prediction under complex IoT data dependencies. Furthermore, an improved domain-constrained simulated annealing algorithm is incorporated to achieve real-time dynamic pricing with low computational latency, making the model suitable for edge-intelligent deployment. Experimental results on real-world IoT-based shared bicycle datasets demonstrate that GTPAN improves mean prediction accuracy by 5.74% and revenue by 45% compared with state-of-the-art methods. The proposed framework provides an interpretable and scalable solution for IoT-driven smart mobility management, contributing to sustainable and efficient urban transportation systems.
Guiyi Wei, Qinyi Long, Youlin Fu, Xiaojun Cheng, Yuman Zhou, Huangcheng Zhang
IEEE Internet Things J.6
2024 Time-Lagged Functional Ultrasound for Multi-Parametric Cerebral Hemodynamic Imaging
abstract
We introduce an ultrasound speckle decorrelation-based time-lagged functional ultrasound technique (tl-fUS) for the quantification of the relative changes in cerebral blood flow speed (rCBF [Formula: see text]), cerebral blood volume (rCBV) and cerebral blood flow (rCBF) during functional stimulations. Numerical simulations, phantom validations, and in vivo mouse brain experiments were performed to test the capability of tl-fUS to parse out and quantify the ratio change of these hemodynamic parameters. The blood volume change was found to be more prominent in arterioles compared to venules and the peak blood flow changes were around 2.5 times the peak blood volume change during brain activation, agreeing with previous observations in the literature. The tl-fUS shows the ability of distinguishing the relative changes of rCBFspeed, rCBV, and rCBF, which can inform specific physiological interpretations of the fUS measurements.
Bingxue Liu, Natalie Fomin-Thunemann, Martin Thunemann, Kivilcim Kiliç, Anna Devor, Xiaojun Cheng, Jiyong Tan, John Jiang, David A. Boas
IEEE Trans. Medical Imaging7
2023 ALSketch: An adaptive learning-based sketch for accurate network measurement under dynamic traffic distribution
Xiaojun Cheng, Xuyang Jing, Zheng Yan 0002, Pu Wang 0003
J. Netw. Comput. Appl.1
2022 Deceiving Learning-based Sketches to Cause Inaccurate Frequency Estimation
abstract
Learning-based sketches have been widely studied as an improvement of traditional sketches that achieves high efficiency in terms of both time and space. It uses a learning model to reveal and exploit underlying patterns of input data for helping traditional sketches obtain accurate frequency estimation with memory efficient. However, recent studies only focus on the performance improvement of learning-based sketches and pay little attention to security. The potential security problems can be easily exploited by an adversary to make learning-based sketches inaccurate. In this paper, we firstly explore the security issues of learning-based sketches with regard to estimation accuracy and memory overhead. Some adversarial scenarios of learning model and backup sketch are modeled according to the knowledge and capabilities of an adversary. Then, we propose four attacks to deceive learning-based sketch, namely counterfeit attack, targeted point attack, memory occupation attack, and blind increment attack. We conduct a series of experiments based on real-world datasets and verify that the proposed attacks highly degrade the performance of learning-based sketch even when the adversary knows nothing about it.
Xuyang Jing, Xiaojun Cheng, Zheng Yan 0002
TrustCom2
2022 OceanBase: A 707 Million tpmC Distributed Relational Database System
abstract
We have designed and developed OceanBase, a distributed relational database system from the very basics for a decade. Being a scale-out multi-tenant system, OceanBase is cross-region fault tolerant, which is based on the shared-nothing architecture. Besides sharing many similar goals with alternative distributed DBMS, such as horizontal scalability, fault-tolerance, etc., our design has been driven by the demands of typical RDBMS compatibility as well as both on-premise and off-premise deployments. OceanBase has fulfilled its design goal. It implements the salient features of certain mainstream classical RDBMS, and most applications on them can run on OceanBase, with or without a few minor modifications. Tens of thousands of OceanBase servers have been deployed in Alipay.com as well as many other commercial organizations. It has also successfully passed the TPC-C benchmark test and seized the first place with more than 707 million tpmC. This paper presents the goals, design criteria, infrastructure, and key components of OceanBase including its engines for storage and transaction processing. Further, it details how OceanBase achieves the above leading TPC-C benchmark in a distributed cluster with more than 1,500 servers from 3 zones. It also describes lessons what we have learnt in building OceanBase for more than a decade.
Chuanhui Yang, Fusheng Han, Mingqiang Zhuang, Zhifeng Yang, Xiaojun Cheng, Yuzhong Zhao, Wenhui Shi, Huafeng Xi, Huang Yu, Yi Pan 0001, Boxue Yin, Junquan Chen, Quanqing Xu
Proc. VLDB Endow.7
2021 Leaf and Wood Separation for Individual Trees Using the Intensity and Density Data of Terrestrial Laser Scanners
abstract
Terrestrial laser scanning (TLS) is a highly effective and noninvasive technology for retrieving the structural and biophysical attributes of trees using 3-D high-accuracy and high-density point clouds. The separation of leaf and wood points in TLS data is a prerequisite for the accurate and reliable derivation of these attributes. In this study, a new method is proposed to separate the leaf and wood points of individual trees by combining the TLS radiometric (intensity) and geometric (density) data. The leaf points are separated from the wood ones through three steps. First, the corrected intensity data are used to separate a part of the leaf points preliminarily given the differences in reflectance characteristics. Second, the density data are adopted for the further separation of another part of the leaf points because the density of the remaining leaf points is smaller than that of the wood points. Finally, a connectivity clustering algorithm is conducted to form several clusters with different sizes (points) and the remaining leaf points are separated in accordance with the cluster sizes. Eight different trees are selected to evaluate the performance of the proposed method. The averaged overall accuracy and kappa coefficient of the eight trees are approximately 95% and 0.81, respectively. The results suggest that the combination of TLS intensity and density data can perform a superior separation of leaf and wood points in terms of efficiency and accuracy, and the proposed separation method can be accurately and robustly used for various trees with different species, sizes, and structures.
Kai Tan 0002, Zhen Dong 0005, Xiaojun Cheng
IEEE Trans. Geosci. Remote. Sens.5
2020 Distance Effect Correction on TLS Intensity Data Using Naturally Homogeneous Targets
abstract
The intensity data recorded by a terrestrial laser scanner (TLS) are significantly influenced by the distance between the scanned point and the scanner center. In this letter, we propose a new method to estimate the TLS distance-intensity relationship by using naturally homogeneous targets (NHT). Since the original intensity data of the NHT are simultaneously influenced by the incidence angle and distance, the incidence angle effect is first eliminated to obtain a corrected intensity that merely depends on distance. Then, the distance-intensity relationship is derived by analyzing the incidence angle corrected intensity data of the NHT. Results indicate that compared with existing methods the proposed method is accurate and easily implementable. The coefficient of variation for the intensity data can be reduced by 52% after correction by the proposed method.
Kai Tan 0002, Xiaojun Cheng
IEEE Geosci. Remote. Sens. Lett.2
2016 Correction of Mobile TLS Intensity Data for Water Leakage Spots Detection in Metro Tunnels
abstract
Terrestrial laser scanning (TLS) can accurately and thoroughly document the actual geometrical deformations and surface conditions of metro tunnel structures using high-density point clouds. In addition, TLS can record the backscattered intensity values of each point simultaneously. Backscattered intensity values are significant measures of the spectral property of scanned objects in the near-infrared region of the electromagnetic spectrum. The intensity values of water leakage regions are theoretically lower than those of the background because of the high water absorption coefficient in the near-infrared spectrum. Thus, the intensity data can be used in water leakage detection and quantitative analysis. This letter investigates the feasibility of a new mobile system called Faro Focus3DX330 for data collection, processing, and intensity correction to detect and extract water leakage spots in metro tunnels. A case study of the Shanghai Metro was conducted. Results show that the corrected intensity value is an effective physical criterion to detect water leakages in metro tunnels. By combing the 3-D point cloud, the location, area, and even water content of the leakage regions can be accurately determined.
Kai Tan 0002, Xiaojun Cheng, Qiaoqiao Ju, Songbo Wu
IEEE Geosci. Remote. Sens. Lett.2
2014 Novel Image Registration Method Based on Local Structure Constraints
abstract
This letter presents an effective approach to reduce the ambiguity of matching results for image registration based on a coarse-to-fine strategy. In the coarse registration stage, we compute initial transformation parameters via the descriptors. In the fine registration stage, we propose a new matching strategy for an iterative closest point framework, in which the matching pairs are determined by a bidirectional matching criterion in terms of feature similarity and spatial consistency. In this letter, the spatial consistency includes not only spatial distance but also local structure constraints on reference and sensed images. Comparative experiments on multispectral and viewpoint-altered images show that the proposed algorithm achieves higher performance in accuracy and robustness.
Aixia Li, Xiaojun Cheng, Haiyan Guan, Tiantian Feng, Zequn Guan
IEEE Geosci. Remote. Sens. Lett.2
2011 An algorithm for axiom pinpointing in EL+ and its incremental variant
abstract
Axiom pinpointing plays an important role in the development and maintenance of ontologies. It helps the user to comprehend an unwanted entailment of an ontology by presenting all minimal subsets of the ontology which are responsible for the entailment (called MinAs). In this paper, we consider the problem of axiom pinpointing in description logic EL+, which underpins OWL 2 EL, a profile of the latest version of Web Ontology Language (OWL). We propose a novel method to compute all MinAs that utilizes the hierarchy information obtained from the classification of an EL+ ontology. The advantage of our method over an existing labeled classification based method is that we do not attach labels to entailed subsumptions, which can be memory exhaustion for large scale ontologies. We further consider axiom pinpointing in EL+ when ontologies change. An incremental algorithm is given to compute all MinAs by reusing MinAs previously computed.
Xiaojun Cheng, Guilin Qi
CIKM1