Xiaoping Lu

Xiaoping Lu


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
30 September 2023 in Journal of Intelligent Manufacturing
Verified
Journal Article
Closed access
PDF file
KZKai Zhang
Kai Zhang
ZTZhiying Tu
Zhiying Tu
Dianhui ChuDianhui Chu
Dianhui Chu
XLXiaoping Lu
Xiaoping Lu
LCLucheng Chen
Lucheng Chen

4 January 2022 in Neural Processing Letters
Verified
Journal Article
Closed access
PDF file
RXRui Xu
Rui Xu
BLBao-Di Liu
Bao-Di Liu
XLXiaoping Lu
Xiaoping Lu
Kai ZhangKai Zhang
Kai Zhang
WLWeifeng Liu
Weifeng Liu

5 February 2025 in Frontiers in Chemistry
Verified
Journal Article
Open access
PDF file
ZYZhenfa Yang
Zhenfa Yang
XLXiaoping Lu
Xiaoping Lu
LCLucheng Chen
Lucheng Chen
In the Pu’er tea market, the ubiquity of blending different varieties and the fraudulent representation of vintage years present a persistent challenge. Traditional sensory evaluation and experience are often inadequate for discerning the true variety and vintage of tea, highlighting the need for more sophisticated analytical methods to ensure authenticity and quality. Fourier transform near infrared diffuse reflectance spectroscopy combined with radial basis function neural network (RBFNN) was applied for determination of the varieties and vintages of Pu’er tea. For vintage identification, the accuracy, precision, recall, and F1-score of the RBFNN model for the prediction set were 99.2%, 98.2%, 98.0%, and 98.0%, respectively. For identification of varieties adulteration, the corresponding parameters were 98.9%, 97.2%, 96.7%, and 96.6%, respectively. These results illustrated the feasibility to identify the adulteration of varieties and misrepresentation of vintages of Pu’er tea with near infrared spectra and RBFNN model, proving an efficient alternative for Pu’er tea quality inspection, and offering a robust method for combating the pervasive issues within the market.

16 June 2025 in Electronics
Verified
Journal Article
Open access
PDF file
YZYang Zhang
Yang Zhang
XLXiaoping Lu
Xiaoping Lu
YZYating Zhao
Yating Zhao
ZYZhenfa Yang
Zhenfa Yang
In the context of the Internet, the personalization and diversification of customer demands present a significant challenge for research on the identification, combination, and utilization of personalized demand feature elements. A key difficulty lies in achieving real-time perception, processing, and recognition of customer needs to dynamically identify and understand personalized customer intent. To address the limitations, we propose a Personalized customization-based Neural Network (PerNN), designed to enhance the performance and accuracy of recommendation systems in large-scale and complex information environments. The PerNN model introduces a Personalized Features Layer (PF), which effectively integrates multi-dimensional information—including historical interaction data, social network relationships, and users’ temporal behavior patterns—to generate fine-grained, personalized user feature representations. This approach significantly improves the model’s ability to predict user preferences. Extensive experiments conducted on public datasets demonstrate that the PerNN model consistently outperforms existing methods, particularly regarding the accuracy and response speed of personalized recommendations. The results validate the effectiveness and superiority of the proposed model in managing complex and recommendation tasks, offering a novel and efficient solution for personalized customization scenarios.

4 July 2025 in Sustainability
Verified
Journal Article
Open access
PDF file
PCPeng-Hao Cui
Peng-Hao Cui
XLXiaoping Lu
Xiaoping Lu
Manufacturing industries are increasingly focused on enhancing energy efficiency while maintaining high levels of production throughput and product quality. However, most existing energy-saving control (EC) methods overlook the influence of production quality on overall energy performance. To address this challenge, this paper proposes a dynamic EC method for multistage manufacturing systems with product quality scrap. The method utilizes a Markov decision process (MDP) framework to dynamically control the operational states of all machines based on real-time system conditions. Specifically, for two-stage manufacturing systems, the dynamic EC problem is formulated as an MDP, and the optimal EC policy is obtained by a dynamic programming algorithm. For multistage manufacturing systems, to address the curse of dimensionality, an aggregation procedure is proposed to approximate the optimal EC policy for each machine based on the results of two-stage manufacturing systems. Finally, numerical experiments are performed to demonstrate the effectiveness of the proposed dynamic EC method. For a five-stage manufacturing system, the proposed dynamic EC policy achieves a 13.55% reduction in energy consumption costs and a 3.02% improvement in system throughput compared to the baseline. Extensive case studies demonstrate that the dynamic EC policy consistently outperforms three well-studied methods: the station-level EC policy, the upstream-buffer EC policy, and the energy saving opportunity window policy. Moreover, the results confirm the effectiveness of the proposed method in capturing the influence of product quality scrap on the system energy efficiency. This study presents a sensor-integrated methodology for EC, contributing to the advancement of smart manufacturing practices in alignment with Industry 4.0 initiatives.

1 September 2025 in Tsinghua Science and Technology
Verified
Journal Article
Open access
PDF file
MWMin Wang
Min Wang
HBHongya Bian
Hongya Bian
SPShanchen Pang
Shanchen Pang
HHHesuan Hu
Hesuan Hu
HYHao Yue
Hao Yue
XLXiaoping Lu
Xiaoping Lu
This work studies the problem of estimating the Transition Firing Sequences (TFSs) for Petri nets, where each transition is supposed to be either observable or unobservable. Due to the existence of cycles of unobservable transitions, the number of transition firing sequences may potentially be infinite. In this paper, based on the notion of minimal explanation, we can find a finite number of TFSs for which the number of observable transitions is less than or equal to a given bound. In particular, we assume that the initial and target markings are known. We propose a backtracking algorithm to find the least-cost transition firing sequences that will lead to the target state from the initial one. Moreover, two heuristic methods are proposed to reduce computational effort further. A wireless sensor network system example is provided to illustrate the proposed approaches. According to the example and comparative analysis, we verify that the proposed method can achieve the maximum number of least-cost path solutions. Finally, we present a survey and some comparative studies of various approaches in the relevant literature.