Xiaoying Zheng

Dr. Xiaoying Zheng

orcid

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 November 2019 in Applied Sciences
Verified
Journal Article
Open access
PDF file
XZXiaoying Zheng
Xiaoying Zheng
YZYongxin Zhu
Yongxin Zhu
XSXueming Si
Xueming Si
Blockchain naturally fits multiple industry sectors due its characteristics of decentralization, enhanced security, tamper-proof, improved traceability and transparency. However, there is a significant concern of blockchain’s performance, since blockchain trades off its performance for a completely distributed feature, which enhances its security. In this paper, we investigate the state-of-the-art progress of blockchain, mainly from a performance and security perspective. We extracted 42 primary papers from major scientific databases and 34 online technical articles. The objective is to understand the current research trends, challenges and future directions. We briefly introduce the key technologies of blockchain including distributed ledger, cryptography, consensus, smart contracts and benchmarks. We next summarize the performance and security concerns raised in the investigation. We discuss the architectural choices, performance metrics, database management enhancements, and hybrid blockchains, and try to identify the effort that the state-of-the-art has made to balance between the performance and security. We also make experiments on Ethereum and survey other popular blockchain platforms on the scalability feature of blockchain. We later discuss the potential applications and present the lessons learned. Finally, we attempt to identify the open issues and possible research directions.

31 July 2023 in Proceedings of the National Academy of Sciences
Verified
Journal Article
Open access
YMYudiyang Ma
Yudiyang Ma
BSBinbin Su
Binbin Su
DLDankang Li
Dankang Li
FCFeipeng Cui
Feipeng Cui
LTLinxi Tang
Linxi Tang
XZXiaoying Zheng
Xiaoying Zheng
To date, no study has explored the extent to which genetic susceptibility modifies the effects of air pollutants on the risk of atrial fibrillation (AF). This study was designed to investigate the separate and joint effects of long-term exposure to air pollutants and genetic susceptibility on the risk of AF events. This study included 401,251 participants without AF at baseline from UK Biobank. We constructed a polygenic risk score and categorized it into three categories. Cox proportional hazards models were fitted to assess the separate and joint effects of long-term exposure to air pollutants and genetics on the risk of AF. Additionally, we further evaluated the effect modification of genetic susceptibility. The hazard ratios and corresponding 95% confidence intervals of incident AF for per interquartile range increase in particulate matter with an aerodynamic diameter smaller than 2.5 µm (PM 2.5 ) or 10 µm (PM 10 ), nitrogen dioxide (NO 2 ), and nitrogen oxide (NO x ) were 1.044 (1.025, 1.063), 1.063 (1.044, 1.083), 1.061 (1.042, 1.081), and 1.039 (1.023, 1.055), respectively. For the combined effects, participants exposed to high air pollutants levels and high genetic risk had approximately 149.2% (PM 2.5 ), 181.7% (PM 10 ), 170.2% (NO 2 ), and 157.2% (NO x ) higher risk of AF compared to those with low air pollutants levels and low genetic risk, respectively. Moreover, the significant additive interactions between PM 10 and NO 2 and genetic risk on AF risk were observed, with around 16.4% and 35.1% of AF risk could be attributable to the interactive effects. In conclusion, long-term exposure to air pollutants increases the risk of AF, particularly among individuals with high genetic susceptibility.

8 April 2021 in Electronics
Verified
Journal Article
Open access
PDF file
JWJixiang Wan
Jixiang Wan
XMxia ming
xia ming
ZHZunkai Huang
Zunkai Huang
LTLi Tian
Li Tian
XZXiaoying Zheng
Xiaoying Zheng
HWHui Wang
Hui Wang
Pedestrian detection has attracted great research attention in video surveillance, traffic statistics, and especially in autonomous driving. To date, almost all pedestrian detection solutions are derived from conventional framed-based image sensors with limited reaction speed and high data redundancy. Dynamic vision sensor (DVS), which is inspired by biological retinas, efficiently captures the visual information with sparse, asynchronous events rather than dense, synchronous frames. It can eliminate redundant data transmission and avoid motion blur or data leakage in high-speed imaging applications. However, it is usually impractical to directly apply the event streams to conventional object detection algorithms. For this issue, we first propose a novel event-to-frame conversion method by integrating the inherent characteristics of events more efficiently. Moreover, we design an improved feature extraction network that can reuse intermediate features to further reduce the computational effort. We evaluate the performance of our proposed method on a custom dataset containing multiple real-world pedestrian scenes. The results indicate that our proposed method raised its pedestrian detection accuracy by about 5.6–10.8%, and its detection speed is nearly 20% faster than previously reported methods. Furthermore, it can achieve a processing speed of about 26 FPS and an AP of 87.43% when implanted on a single CPU so that it fully meets the requirement of real-time detection.

14 December 2022 in Journal of Systems Architecture
Verified
Journal Article
Closed access
YHYing Huang
Ying Huang
XZXiaoying Zheng
Xiaoying Zheng
YZYongxin Zhu
Yongxin Zhu

1 May 2024 in Electronics
Verified
Journal Article
Open access
PDF file
YZYueying Zhou
Yueying Zhou
GDGaoxiang Duan
Gaoxiang Duan
TQTianchen Qiu
Tianchen Qiu
LZLin Zhang
Lin Zhang
LTLi Tian
Li Tian
YZYongxin Zhu
Yongxin Zhu
Edge devices employing federated learning encounter several obstacles, including (1) the non-independent and identically distributed (Non-IID) nature of client data, (2) limitations due to communication bottlenecks, and (3) constraints on computational resources. To surmount the Non-IID data challenge, personalized federated learning has been introduced, which involves training tailored networks at the edge; nevertheless, these methods often exhibit inconsistency in performance. In response to these concerns, a novel framework for personalized federated learning that incorporates adaptive pruning of edge-side data is proposed in this paper. This approach, through a two-staged pruning process, creates customized models while ensuring strong generalization capabilities. Concurrently, by utilizing sparse models, it significantly condenses the model parameters, markedly diminishing both the computational burden and communication overhead on edge nodes. This method achieves a remarkable compression ratio of 3.7% on the Non-IID dataset FEMNIST, with the training accuracy remaining nearly unaffected. Furthermore, the total training duration is reduced by 46.4% when compared with the standard baseline method.

22 April 2019 in IEEE Access
Verified
Journal Article
Open access
HZHang Zhang
Hang Zhang
XZXiaoying Zheng
Xiaoying Zheng
YXYe Xia
Ye Xia
MLMingqi Li
Mingqi Li
We study a difficult problem of how to schedule complex workflows with precedence constraints under a limited budget in the cloud environment. We first formulate the scheduling problem as an integer programming problem, which can be optimized and used as the baseline of performance. We then consider the traditional approach of scheduling jobs in a prioritized order based on the upward-rank of each job. For those jobs with no precedence constraints among themselves, the plain upward-rank priority scheme assigns priorities in an arbitrary way. We propose a job prioritization scheme that uses the Markovian chain stationary probabilities as a measure of the importance of jobs. The scheme keeps the precedence order for the jobs that have precedence constraints between each other and assigns priorities according to the jobs' importance for the jobs without precedence constraints. We finally design a uniform spare budget-splitting strategy that splits the spare budget uniformly across all the jobs. We test our algorithms on a variety of workflows, including the Fast Fourier transform (FFT), the Gaussian elimination, typical scientific workflows, randomly generated workflows, and workflows from an in-production cluster of an online streaming service company. We compare our algorithms with state-of-the-art algorithms. The empirical results show that the uniform spare budget splitting scheme outperforms the splitting scheme in proportion to extra demand on average for most cases, and the Markovian-based prioritization further improves the workflow makespan.