Yuxiang Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yuxiang Liu has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Bo Yang
Shanghai Jiao Tong University
8 shared publications - Xinping Guan
Shanghai Jiao Tong University
7 shared publications - Qi Liu
Shanghai Jiao Tong University
5 shared publications - Kai Ma
Yanshan University
3 shared publications - Sicheng Liu
Shanghai Jiao Tong University
3 shared publications - Cailian Chen
Shanghai Jiao Tong University
2 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 34 (11) , 3461-3472
SOA: Improving Simulation Fidelity in Electrical System Modeling via Bilevel Optimization With LLMs and Fuzzy Rules
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 34 (11) , 3461-3472
SOA: Improving Simulation Fidelity in Electrical System Modeling via Bilevel Optimization With LLMs and Fuzzy Rules
- 13 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (4) , 2897-2908
Efficient Optimization of User Costs in Microservice Deployment Through Distributed Column Generation
In microservice architecture, each industrial application is decomposed into multiple microservices and deployed on cloud servers to provide timely services to users. However, existing methods rarely optimize service deployment strategies from the user's perspective to reduce the leasing costs of cloud servers. Furthermore, accurately estimating the required number of instances and resource utilization for microservices remains challenging, and decision-making in large-scale scenarios also faces significant timeliness constraints. To solve this problem, this article proposes a Column Generation deployment strategy, which decomposes the microservice deployment problem into a master problem for scheme selection and subproblems for scheme generation and proves the gap between its convergent solution and the optimal solution. A Distributed Column Generation strategy is further introduced to enable efficient problem-solving. Experimental results based on real-world server pricing demonstrate that the proposed method exhibits a high degree of consistency with the theoretically optimal solution. Compared to the baseline methods, it reduces the average total cost of ownership (TCO) for users by 11.3%, while the decision-making time is only 21.5% of that of the comparative methods. At the same time we used our approach to make deployment decisions for real industrial microservices and deployed them on real cloud servers. Compared to the baseline approach, it reduces TCO by 4%, but decision-making is 97% faster.
- 13 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (4) , 2897-2908
Efficient Optimization of User Costs in Microservice Deployment Through Distributed Column Generation
In microservice architecture, each industrial application is decomposed into multiple microservices and deployed on cloud servers to provide timely services to users. However, existing methods rarely optimize service deployment strategies from the user's perspective to reduce the leasing costs of cloud servers. Furthermore, accurately estimating the required number of instances and resource utilization for microservices remains challenging, and decision-making in large-scale scenarios also faces significant timeliness constraints. To solve this problem, this article proposes a Column Generation deployment strategy, which decomposes the microservice deployment problem into a master problem for scheme selection and subproblems for scheme generation and proves the gap between its convergent solution and the optimal solution. A Distributed Column Generation strategy is further introduced to enable efficient problem-solving. Experimental results based on real-world server pricing demonstrate that the proposed method exhibits a high degree of consistency with the theoretically optimal solution. Compared to the baseline methods, it reduces the average total cost of ownership (TCO) for users by 11.3%, while the decision-making time is only 21.5% of that of the comparative methods. At the same time we used our approach to make deployment decisions for real industrial microservices and deployed them on real cloud servers. Compared to the baseline approach, it reduces TCO by 4%, but decision-making is 97% faster.
- 23 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (10) , 7466-7476
Self-Correcting-Guided Generalized Contrastive Learning Framework for Small-Sample PV Fault Diagnosis With Cloud-Edge Collaboration
Intelligent fault diagnosis of photovoltaic (PV) arrays in small-sample scenarios remains challenging due to poor model accuracy and generalization. Existing methods fail to simultaneously address issues of varied operation conditions and insufficient samples, leading to the limited applicability of models built by few-shot learning. In addition, factors, such as data transmission and computation costs, also need to be considered. Therefore, this article proposes a cloud-edge collaborative self-correcting-guided generalized contrastive learning framework for small-sample PV fault diagnosis. First, an end-to-end self-correcting model is proposed to eliminate the influence of variable environments. Then, a self-correcting scheme is integrated with contrastive learning to achieve model generalization, and a type screening method is designed to improve model accuracy. Furthermore, a fast fault filtering mechanism is proposed to enhance the algorithm efficiency with cloud-edge collaboration. Both simulation and real data are utilized to validate the proposed method.
- 23 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (10) , 7466-7476
Self-Correcting-Guided Generalized Contrastive Learning Framework for Small-Sample PV Fault Diagnosis With Cloud-Edge Collaboration
Intelligent fault diagnosis of photovoltaic (PV) arrays in small-sample scenarios remains challenging due to poor model accuracy and generalization. Existing methods fail to simultaneously address issues of varied operation conditions and insufficient samples, leading to the limited applicability of models built by few-shot learning. In addition, factors, such as data transmission and computation costs, also need to be considered. Therefore, this article proposes a cloud-edge collaborative self-correcting-guided generalized contrastive learning framework for small-sample PV fault diagnosis. First, an end-to-end self-correcting model is proposed to eliminate the influence of variable environments. Then, a self-correcting scheme is integrated with contrastive learning to achieve model generalization, and a type screening method is designed to improve model accuracy. Furthermore, a fast fault filtering mechanism is proposed to enhance the algorithm efficiency with cloud-edge collaboration. Both simulation and real data are utilized to validate the proposed method.
- 12 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (4) , 1519-1532
$E^{2}MS$: An Efficient and Economical Microservice Migration Strategy for Smart Manufacturing
The microservice architecture has gained widespread adoption in smart manufacturing, enabling the collaborative completion of production tasks through the integration of multiple microservices. However, migrating microservices in dynamic environments poses challenges for maintaining production quality and service efficiency. Firstly, there are complex dependencies between microservices, such as layered and chain structures, making microservice migration a difficult process. Secondly, large-scale production scenarios require rapid decisionmaking based on high-dimensional variables to adapt to the dynamic environment. Thirdly, microservice migration can cause interruptions, so careful selection of microservices is crucial to minimize production stagnation during migration. To tackle these challenges, we develop an efficient and economical migration strategy (E 2 MS). This approach considers the complex dependencies between microservices and optimizes the system cost by selecting appropriate microservices for migration. We formulate an integer non-convex quadratic programming problem and employ techniques such as variable reduction, penalty functions, and successive convex approximation (SCA) to solve it. The proposed strategy enables efficient decision-making for microservice migration in dynamic production environments and exhibits strong scalability. Our experimental results demonstrate the exceptional dynamic performance of the proposed method, significantly reducing the time required to obtain migration strategies and achieving a 90% reduction in microservice interruptions compared to other methods.
- 12 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 17 (4) , 1519-1532
$E^{2}MS$: An Efficient and Economical Microservice Migration Strategy for Smart Manufacturing
The microservice architecture has gained widespread adoption in smart manufacturing, enabling the collaborative completion of production tasks through the integration of multiple microservices. However, migrating microservices in dynamic environments poses challenges for maintaining production quality and service efficiency. Firstly, there are complex dependencies between microservices, such as layered and chain structures, making microservice migration a difficult process. Secondly, large-scale production scenarios require rapid decisionmaking based on high-dimensional variables to adapt to the dynamic environment. Thirdly, microservice migration can cause interruptions, so careful selection of microservices is crucial to minimize production stagnation during migration. To tackle these challenges, we develop an efficient and economical migration strategy (E 2 MS). This approach considers the complex dependencies between microservices and optimizes the system cost by selecting appropriate microservices for migration. We formulate an integer non-convex quadratic programming problem and employ techniques such as variable reduction, penalty functions, and successive convex approximation (SCA) to solve it. The proposed strategy enables efficient decision-making for microservice migration in dynamic production environments and exhibits strong scalability. Our experimental results demonstrate the exceptional dynamic performance of the proposed method, significantly reducing the time required to obtain migration strategies and achieving a 90% reduction in microservice interruptions compared to other methods.
- 1 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 72 (00189456) , 1-16
Collaborate Global and Local: An Efficient PV Compound Fault Diagnosis Scheme With Multilabel Learning and Model Fusion
Fast and accurate fault diagnosis of photovoltaic (PV) modules has been the focus of intelligent operation and maintenance for PV systems. Considering efficiency and cost, many machine learning (ML) based methods are widely used in practice. Due to the increasing scale of PV stations, the series-parallel topology of the system becomes more complicated, and multiple faults may inevitably occur together. However, most existing methods only consider the case of a single fault occurrence or the most basic compound faults, which fails to assess the system state comprehensively. For this reason, a novel global-local dual-stream collaborative framework is proposed for multiclass PV compound fault diagnosis. In the proposed method, a local mining algorithm is designed for the characteristics of PV data to extract local details more conveniently and efficiently. Then, we construct a shared CNN network to extract fault features from global and local streams to improve the modeling efficiency. Next, two model fusion mechanisms are proposed for different data conditions to collaboratively utilize the fault features of the global and local streams. Both simulations and experiments are conducted to verify the effectiveness of the proposed method.
- 1 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 72 (00189456) , 1-16
Collaborate Global and Local: An Efficient PV Compound Fault Diagnosis Scheme With Multilabel Learning and Model Fusion
Fast and accurate fault diagnosis of photovoltaic (PV) modules has been the focus of intelligent operation and maintenance for PV systems. Considering efficiency and cost, many machine learning (ML) based methods are widely used in practice. Due to the increasing scale of PV stations, the series-parallel topology of the system becomes more complicated, and multiple faults may inevitably occur together. However, most existing methods only consider the case of a single fault occurrence or the most basic compound faults, which fails to assess the system state comprehensively. For this reason, a novel global-local dual-stream collaborative framework is proposed for multiclass PV compound fault diagnosis. In the proposed method, a local mining algorithm is designed for the characteristics of PV data to extract local details more conveniently and efficiently. Then, we construct a shared CNN network to extract fault features from global and local streams to improve the modeling efficiency. Next, two model fusion mechanisms are proposed for different data conditions to collaboratively utilize the fault features of the global and local streams. Both simulations and experiments are conducted to verify the effectiveness of the proposed method.
- 20 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 16 (4) , 2685-2698
How to Share: Balancing Layer and Chain Sharing in Industrial Microservice Deployment
With the rapid development of smart manufacturing, edge computing-oriented microservice platforms are emerging as an important part of production control. In the containerized deployment of microservices, layer sharing can reduce the huge bandwidth consumption caused by image pulling, and chain sharing can reduce communication overhead caused by communication between microservices. The two sharing methods use the characteristics of each microservice to share resources during deployment. However, due to the limited resources of edge servers, it is difficult to meet the optimization goals of the two methods at the same time. Therefore, it is of critical importance to realize the improvement of service response efficiency by balancing the two sharing methods. This paper studies the optimal microservice deployment strategy that can balance layer sharing and chain sharing of microservices. We build a problem that minimizes microservice image pull delay and communication overhead and transform the problem into a linearly constrained integer quadratic programming problem through model reconstruction. A deployment strategy is obtained through the successive convex approximation (SCA) method. Experimental results show that the proposed deployment strategy can balance the two resource sharing methods. When the two sharing methods are equally considered, the average image pull delay can be reduced to 65% of the baseline, and the average communication overhead can be reduced to 30% of the baseline.
- 20 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 16 (4) , 2685-2698
How to Share: Balancing Layer and Chain Sharing in Industrial Microservice Deployment
With the rapid development of smart manufacturing, edge computing-oriented microservice platforms are emerging as an important part of production control. In the containerized deployment of microservices, layer sharing can reduce the huge bandwidth consumption caused by image pulling, and chain sharing can reduce communication overhead caused by communication between microservices. The two sharing methods use the characteristics of each microservice to share resources during deployment. However, due to the limited resources of edge servers, it is difficult to meet the optimization goals of the two methods at the same time. Therefore, it is of critical importance to realize the improvement of service response efficiency by balancing the two sharing methods. This paper studies the optimal microservice deployment strategy that can balance layer sharing and chain sharing of microservices. We build a problem that minimizes microservice image pull delay and communication overhead and transform the problem into a linearly constrained integer quadratic programming problem through model reconstruction. A deployment strategy is obtained through the successive convex approximation (SCA) method. Experimental results show that the proposed deployment strategy can balance the two resource sharing methods. When the two sharing methods are equally considered, the average image pull delay can be reduced to 65% of the baseline, and the average communication overhead can be reduced to 30% of the baseline.
- Open Access
- 9 August 2022
- Published by Worcester Polytechnic Institute - Gordon Library
Optical Fiber Strain Sensor for Foods in Drying
- 9 August 2022
- Published by Worcester Polytechnic Institute - Gordon Library
Open AccessOptical Fiber Strain Sensor for Foods in Drying
- 9 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (21) , 22022-22033
Joint Task Offloading and Resource Allocation for Multihop Industrial Internet of Things
Task offloading in edge computing is important for the Industrial Internet of Things (IIoT) to implement computation-intensive applications in real time. However, achieving efficient task offloading in IIoT is very challenging due to the limited computing resources of IIoT devices, the coupling of computing and communication resources, and the unreliability in multihop wireless transmission. In this article, we construct a link model by considering the influence of unreliable links in multihop transmission to reveal the relationship between reliability and transmission delay. Then, a nonconvex optimization problem that minimizes task processing delay is formulated, and task offloading is decided by considering transmission path selection, bandwidth allocation, and computational resource allocation. To solve this problem, an algorithm based on the alternating direction method of multipliers (ADMM) is designed using auxiliary variables and reformulation linearization technology (RLT). The simulation results show that our proposed algorithm can fully utilize the computing power of the edge server and reduce the task processing delay. Compared with the centralized algorithms, the performance of the proposed scheme is only 1% worse, but the calculation time can be reduced by 40%.
- 9 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (21) , 22022-22033
Joint Task Offloading and Resource Allocation for Multihop Industrial Internet of Things
Task offloading in edge computing is important for the Industrial Internet of Things (IIoT) to implement computation-intensive applications in real time. However, achieving efficient task offloading in IIoT is very challenging due to the limited computing resources of IIoT devices, the coupling of computing and communication resources, and the unreliability in multihop wireless transmission. In this article, we construct a link model by considering the influence of unreliable links in multihop transmission to reveal the relationship between reliability and transmission delay. Then, a nonconvex optimization problem that minimizes task processing delay is formulated, and task offloading is decided by considering transmission path selection, bandwidth allocation, and computational resource allocation. To solve this problem, an algorithm based on the alternating direction method of multipliers (ADMM) is designed using auxiliary variables and reformulation linearization technology (RLT). The simulation results show that our proposed algorithm can fully utilize the computing power of the edge server and reduce the task processing delay. Compared with the centralized algorithms, the performance of the proposed scheme is only 1% worse, but the calculation time can be reduced by 40%.
- 11 February 2022
- Published by Elsevier in Applied Energy
- Vol. 311
Energy management based on multi-agent deep reinforcement learning for a multi-energy industrial park
- 11 February 2022
- Published by Elsevier in Applied Energy
- Vol. 311
Energy management based on multi-agent deep reinforcement learning for a multi-energy industrial park