Qiang Zhou 0007

dblp:43/3182-7 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
7since 2021 · last 2026
0000-0002-4577-0581ORCID · conflict

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

Databases, data management, data science and information retrieval · 4 · 4 since 2021Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 2 · 1 since 2021Security and privacy · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2026 Efficient Instruction Vulnerability Prediction With Heterogeneous SDC Propagation Knowledge Graph
Bao Wen, Jingjing Gu, Dazhong Shen, Qiang Zhou 0007, Fuzhen Zhuang, Yang Liu 0390, Haocheng Song, Xinyi Huang 0001
IEEE Trans. Dependable Secur. Comput.4
2026 Exploring the Vulnerability of Basic Blocks for Control Flow Error Detection
abstract
Control flow errors (CFEs) pose a serious threat to the reliability of embedded systems, particularly under increasing integration density and shrinking feature sizes. Existing CFE detection techniques typically rely on coarse-grained analysis and uniform checking strategies, lacking fine-grained awareness of structural and runtime characteristics. This limitation often leads to considerable overhead, making such approaches less suitable for resource-constrained embedded systems. To tackle this shortcoming, we propose a CFE Detection approach guided by Basic block Vulnerability Analysis (CDBVA) that aims to strike a balance between the detection effectiveness and the overhead. Specifically, we first extract the CFE-related structural and execution features to characterize basic block vulnerability. Then, we train a learning-based model to predict basic blocks that are vulnerable to CFEs. Finally, we design a hybrid signature checking strategy that performs appropriate checks on vulnerable and non-vulnerable basic blocks separately. Experimental results demonstrate that CDBVA achieves an average prediction accuracy of 86.2% and an average CFE coverage of 95.79%, outperforming state-of-the-art approaches. While maintaining high CFE coverage, CDBVA improves the evaluation factor by 12.14%–20.82%, achieving a favorable tradeoff between detection effectiveness and overhead. In addition, CDBVA demonstrates stable performance across diverse input conditions and heterogeneous hardware architectures.
Yang Liu 0390, Jingjing Gu, Bao Wen, Qiang Zhou 0007, Zhiteng Dong, Yi Zhuang 0002
ACM Trans. Embed. Comput. Syst.5
2025 Long-Term Urban Flow Prediction Against Data Distribution Shift: A Causal Perspective
abstract
The demand for more precise and timely urban resource allocation and management has driven the extension of urban flow prediction from short-term to long-term horizons. As the time scale expands, the issue of urban flow distribution shift becomes increasingly prominent due to various impact factors, such as weather, events, city changes, etc. Traditionally, comprehensively analyzing and addressing the causal relationships underlying the distribution shift caused by these factors has been challenging. In this paper, we propose that these impact factors can be partitioned in two major types, i.e., context factors and structural factors. We then present a decomposition-based model for long-term urban flow prediction from a causal perspective, namedDeCau, which can discriminate between the two types of factors for effectively solving the problem of urban flow distribution shift. First, we employ a decomposition module to decompose urban flow into seasonal part and trend part. The seasonal part contains high frequency irregular variations caused by context factors. We advise a shared distribution estimator to approximate the unavailable prior distributions of context factors, and then apply causal intervention to mitigate the confounding impact of context factors. The distribution shift in the trend part is induced by structural factors. We design a dual causal dependency extractor to model the causality between POIs distribution and urban flow, and then eliminate spurious correlations through causal adjustment. Finally, we design an end-to-end framework for long-term urban flow prediction by combining the embeddings from two parts, enabling the model to generalize to unseen distribution. Extensive experimental results demonstrateDeCauoutperforms state-of-the-art baselines.
Yuting Liu 0001, Qiang Zhou 0007, Hanzhe Li 0001, Fuzhen Zhuang, Jingjing Gu
IEEE Trans. Knowl. Data Eng.2
2024 Exploring Idealized Regional Match for Cross-City Cross-Mode Traffic Flow Prediction
Guoliang Shi, Qiang Zhou 0007, Jingjing Gu
DASFAA (1)2
2023 Prediction in Long-term Evolution: Exploiting the Interaction Between Urban Crowd Flow Variation and POI Transition Patterns
abstract
Long-term urban crowd flow prediction involving the evolution trends of crowd flow is of great importance of traffic management, public safety and urban planning. However, learning long-term crowd flow is very challenging due to the latent effect of varied urban Point-of-Interests distribution, which is quite different from the short-term crowd flow mainly influenced by readily available external factors like weather, date, etc. The key issue for us is how to learn the interaction between POI distribution and human mobility in a dynamic way. To address this problem, we propose a POI-flow interaction based spatial-temporal framework (PFIST) for long-term crowd flow prediction. First, we model the long-term evolution representations of crowd flow and POI distribution. Then we study the dynamic interaction between POI transition patterns and crowd flow variation on different POI periods and categories. Afterwards, we decompose the flow sequence into long-term trend and daily variation parts and apply the normalized POI-flow interaction attention to the long-term trend parts. Finally, we model the spatial and multi-scale temporal dependencies to predict long-term crowd flow. Extensive experiments on Beijing map query track dataset and NYC taxi dataset demonstrate the superiority of PFIST.
Jingjing Gu, Qiang Zhou 0007, Xinjiang Lu
ICDM3
2022 Exploiting Interpretable Patterns for Flow Prediction in Dockless Bike Sharing Systems
abstract
Unlike the traditional dock-based systems, dockless bike-sharing systems are more convenient for users in terms of flexibility. However, the flexibility of these dockless systems comes at the cost of management and operation complexity. Indeed, the imbalanced and dynamic use of bikes leads to mandatory rebalancing operations, which impose a critical need for effective bike traffic flow prediction. While efforts have been made in developing traffic flow prediction models, existing approaches lack interpretability, and thus have limited value in practical deployment. To this end, we propose an Interpretable Bike Flow Prediction (IBFP) framework, which can provide effective bike flow prediction with interpretable traffic patterns. Specifically, by dividing the urban area into regions according to flow density, we first model the spatio-temporal bike flows between regions with graph regularized sparse representation, where graph Laplacian is used as a smooth operator to preserve the commonalities of the periodic data structure. Then, we extract traffic patterns from bike flows using subspace clustering with sparse representation to construct interpretable base matrices. Moreover, the bike flows can be predicted with the interpretable base matrices and learned parameters. Finally, experimental results on real-world data show the advantages of the IBFP method for flow prediction in dockless bike sharing systems. In addition, the interpretability of our flow pattern exploitation is further illustrated through a case study where IBFP provides valuable insights into bike flow analysis.
Jingjing Gu, Qiang Zhou 0007, Jingyuan Yang 0001, Yanchi Liu, Fuzhen Zhuang, Yanchao Zhao, Hui Xiong 0001
IEEE Trans. Knowl. Data Eng.2
2021 Modeling Heterogeneous Relations across Multiple Modes for Potential Crowd Flow Prediction
abstract
Potential crowd flow prediction for new planned transportation sites is a fundamental task for urban planners and administrators. Intuitively, the potential crowd flow of the new coming site can be implied by exploring the nearby sites. However, the transportation modes of nearby sites (e.g. bus stations, bicycle stations) might be different from the target site (e.g. subway station), which results in severe data scarcity issues. To this end, we propose a data-driven approach, named MOHER, to predict the potential crowd flow in a certain mode for a new planned site. Specifically, we first identify the neighbor regions of the target site by examining the geographical proximity as well as the urban function similarity. Then, to aggregate these heterogeneous relations, we devise a cross-mode relational GCN, a novel relation-specific transformation model, which can learn not only the correlation but also the differences between different transportation modes. Afterward, we design an aggregator for inductive potential flow representation. Finally, an LTSM module is used for sequential flow prediction. Extensive experiments on real-world data sets demonstrate the superiority of the MOHER framework compared with the state-of-the-art algorithms.
Qiang Zhou 0007, Jingjing Gu, Xinjiang Lu, Fuzhen Zhuang, Yanchao Zhao, Xiao Zhang 0015
AAAI1
2020 Dynamic-Static-based Spatiotemporal Multi-Graph Neural Networks for Passenger Flow Prediction
abstract
Various sensing and computing technologies have gradually outlined the future of the intelligent city. Passenger flow prediction of public transports has become an important task in Intelligent Transportation System (ITS), which is the prerequisite for traffic management and urban planning. There exist many methods based on deep learning for learning the spatiotemporal features from high non-linearity and complexity of traffic flows. However, they only utilize temporal correlation and static spatial correlation, such as geographical distance, which is insufficient in the mining of dynamic spatial correlation. In this paper, we propose the Dynamic-Static-based Spatiotemporal Multi-Graph Neural Networks model (DSSTMG) for predicting traffic passenger flows, which can concurrently incorporate the temporal and multiple static and dynamic spatial correlations. Firstly, we exploit the multiple static spatial correlations by multi-graph fusion convolution operator, including adjacent relation, station functional zone similarity and geographical distance. Secondly, we exploit the spatial dynamic correlations by calculating the similarity between the flow pattern of stations over a period of time, and build the dynamic spatial attention. Moreover, we use time attention and encoder-decoder architecture to capture temporal correlation. The experimental results on two realworld datasets show that the proposed DSSTMG outperforms state-of-the-art methods.
Jingyan Ma, Jingjing Gu, Qiang Zhou 0007
ICPADS3