Xingchao Deng
YOU?
Author Swipe
View article: Remaining Useful Life Prediction Based on Cross-Temporal Dynamic Graph Convolutional Network
Remaining Useful Life Prediction Based on Cross-Temporal Dynamic Graph Convolutional Network Open
Taking advantage of deep learning (DL) to extract hidden degradation signals from machinery monitoring data has led to significant advancements in predicting equipment's remaining useful life (RUL). However, existing methods that use simil…
View article: Production Decision Optimization Based on Monte Carlo Simulation and Genetic Algorithm
Production Decision Optimization Based on Monte Carlo Simulation and Genetic Algorithm Open
This study proposes an optimization method based on Monte Carlo simulation and genetic algorithm to explore the production decision-making scheme for assembly products. The study aims to provide efficient production decision support for en…
View article: On the distance-edge-monitoring numbers of graphs
On the distance-edge-monitoring numbers of graphs Open
View article: Simulation of spring discharge using graph neural networks at Niangziguan Springs, China
Simulation of spring discharge using graph neural networks at Niangziguan Springs, China Open
Over past decades, extensive groundwater development in karst aquifers has led to significant declines in groundwater levels and spring discharges. While the recent implementation of sustainable karst aquifer development policies appears t…
View article: A note on a conjecture of star chromatic index for outerplanar graphs
A note on a conjecture of star chromatic index for outerplanar graphs Open
A star edge coloring of a graph $G$ is a proper edge coloring of $G$ without bichromatic paths or cycles of length four. The it star chromatic index, $χ_{st}^{'} (G ),$ of $G$ is the minimum number $k$ for which $G$ has a star edge colorin…
View article: Rainbow connection of bridgeless outerplanar graphs with small diameters
Rainbow connection of bridgeless outerplanar graphs with small diameters Open
In this paper, we investigate rainbow connection number $rc(G)$ of bridgeless outerplanar graphs $G$ with diameter 2 or 3. We proved the following results: If $G$ has diameter $2,$ then $rc(G)=3$ for fan graphs $F_{n}$ with $n\geq 7$ or $C…
View article: Algorithm on rainbow connection for maximal outerplanar graphs
Algorithm on rainbow connection for maximal outerplanar graphs Open
In this paper, we consider rainbow connection number of maximal outerplanar graphs(MOPs) on algorithmic aspect. For the (MOP) $G$, we give sufficient conditions to guarantee that $rc(G) = diam(G).$ Moreover, we produce the graph with given…