<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN" "JATS-journalpublishing1-4.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.4" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">ijis</journal-id>
      <journal-title-group>
        <journal-title>International Journal of Intelligence Science</journal-title>
      </journal-title-group>
      <issn pub-type="epub">2163-0356</issn>
      <issn pub-type="ppub">2163-0283</issn>
      <publisher>
        <publisher-name>Scientific Research Publishing</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.4236/ijis.2026.163011</article-id>
      <article-id pub-id-type="publisher-id">ijis-152184</article-id>
      <article-categories>
        <subj-group>
          <subject>Article</subject>
        </subj-group>
        <subj-group>
          <subject>Computer Science</subject>
          <subject>Communications</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Deep Domain Adaptation for Cross-Condition Fault Diagnosis in Hydraulic Systems under Data Scarcity</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Zhang</surname>
            <given-names>Jiabao</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Ji</surname>
            <given-names>Shuangsheng</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="aff1"><label>1</label> Beijing Ocean-Peak Technology Co., Ltd., Beijing, China </aff>
      <author-notes>
        <fn fn-type="conflict" id="fn-conflict">
          <p>The authors declare no conflicts of interest regarding the publication of this paper.</p>
        </fn>
      </author-notes>
      <pub-date pub-type="epub">
        <day>01</day>
        <month>07</month>
        <year>2026</year>
      </pub-date>
      <pub-date pub-type="collection">
        <month>07</month>
        <year>2026</year>
      </pub-date>
      <volume>16</volume>
      <issue>03</issue>
      <fpage>217</fpage>
      <lpage>233</lpage>
      <history>
        <date date-type="received">
          <day>20</day>
          <month>05</month>
          <year>2026</year>
        </date>
        <date date-type="accepted">
          <day>27</day>
          <month>06</month>
          <year>2026</year>
        </date>
        <date date-type="published">
          <day>30</day>
          <month>06</month>
          <year>2026</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>© 2026 by the authors and Scientific Research Publishing Inc.</copyright-statement>
        <copyright-year>2026</copyright-year>
        <license license-type="open-access">
          <license-p> This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license ( <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link> ). </license-p>
        </license>
      </permissions>
      <self-uri content-type="doi" xlink:href="https://doi.org/10.4236/ijis.2026.163011">https://doi.org/10.4236/ijis.2026.163011</self-uri>
      <abstract>
        <p>Data-driven fault diagnosis methods have achieved remarkable success in monitoring the health of hydraulic systems under constant operating conditions. However, in real-world industrial scenarios, hydraulic systems frequently operate under variable and dynamic conditions, such as fluctuating accumulator pressures, varying temperatures, or shifting external payloads. This variability inevitably leads to a severe discrepancy in the data distribution between the training (source) and testing (target) domains—a phenomenon widely known as domain shift. Such distributional discrepancies dramatically degrade the diagnostic performance and generalization capabilities of conventional deep learning models. To address this profound challenge and the critical issue of label scarcity in newly emerging working conditions, this paper proposes a novel Deep Domain Adaptation framework tailored for cross-condition fault diagnosis in complex hydraulic systems. Specifically, a multi-channel One-Dimensional Convolutional Neural Network is meticulously designed to extract hierarchical, multi-scale temporal representations from multi-sensor time-series data. Furthermore, the Maximum Mean Discrepancy with a multi-kernel Gaussian approach is seamlessly integrated into the loss optimization function. This explicitly minimizes the marginal distribution divergence between the label-rich source domain and the completely unlabeled target domain within a deep latent reproducing kernel Hilbert space. Extensive empirical experiments are conducted on the globally recognized UCI condition monitoring of hydraulic systems dataset. The comprehensive results demonstrate that the proposed method effectively decouples intrinsic fault characteristics from operational pressure variations, achieving an outstanding diagnostic accuracy of 97.5% in a severe cross-condition task (transitioning from 130 bar to 90 bar). Rigorous comparisons with several state-of-the-art baseline models, detailed ablation studies, alongside t-SNE feature visualizations and confusion matrix analyses, robustly prove the superiority, resilience, and industrial edge-deployment potential of the proposed framework.</p>
      </abstract>
      <kwd-group kwd-group-type="author-generated" xml:lang="en">
        <kwd>Fault Diagnosis</kwd>
        <kwd>Hydraulic Systems</kwd>
        <kwd>Deep Domain Adaptation</kwd>
        <kwd>Convolutional Neural Network</kwd>
        <kwd>Maximum Mean Discrepancy</kwd>
        <kwd>Data Scarcity</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
      <title>1. Introduction</title>
      <p>Hydraulic systems are universally recognized as the core power transmission mechanisms in modern heavy industry, widely deployed in heavy machinery, aerospace engineering, and smart manufacturing. Their unparalleled high power-to-weight ratio, precise continuous control, and smooth transmission capabilities make them irreplaceable in industrial applications [<xref ref-type="bibr" rid="B1">1</xref>][<xref ref-type="bibr" rid="B2">2</xref>]. However, due to continuous, high-intensity operation under extreme working pressures, severe internal fluid friction, and harsh environmental conditions, critical internal components of hydraulic systems—such as directional valves, hydraulic pumps, and accumulators—are highly susceptible to performance degradation and irreversible physical failures [<xref ref-type="bibr" rid="B3">3</xref>]. Even minor anomalies, such as internal valve leakages or localized hysteresis, can trigger severe system efficiency drops, escalate energy consumption, or cause catastrophic mechanical breakdowns, leading to immense economic losses and potential safety hazards. Therefore, developing accurate, real-time, and reliable fault diagnosis and predictive maintenance (PdM) techniques is universally acknowledged as a critical imperative in the era of Industry 4.0 and smart manufacturing [<xref ref-type="bibr" rid="B4">4</xref>].</p>
      <p>Historically, condition monitoring and fault diagnosis primarily relied on traditional signal processing techniques and mathematical modeling, including Fourier transforms, wavelet analysis, and empirical mode decomposition (EMD). While effective to some extent for stationary signals, these methods heavily depend on extensive domain expertise for manual feature engineering and lack the flexibility required to seamlessly handle massive, high-dimensional multi-sensor data streams. In recent years, data-driven methodologies, particularly Deep Learning (DL), have revolutionized the field of intelligent fault diagnosis. By automatically extracting highly discriminative representations directly from raw sensor data, sophisticated architectures such as Convolutional Neural Networks (CNNs), Long Short-Term Memory (LSTM) networks, and Transformers have overcome the inherent limitations of shallow machine learning algorithms [<xref ref-type="bibr" rid="B5">5</xref>][<xref ref-type="bibr" rid="B6">6</xref>].</p>
      <p>Despite their unprecedented diagnostic accuracy in controlled laboratory environments, the practical industrial deployment of conventional DL models is critically hindered by a stringent statistical premise: the training dataset and the testing dataset must be drawn from the exact same independent and identically distributed probability space. In real-world hydraulic applications, operating conditions are highly dynamic. Parameters such as system supply pressure, ambient temperature, and external loads change frequently in response to varying production demands. These operational variations significantly alter the underlying probability distribution of the collected vibration, acoustic, or pressure signals, resulting in a pervasive and challenging phenomenon known as domain shift. Consequently, when a diagnostic model trained under a specific, well-documented healthy condition (the source domain) is applied to a new, unseen degraded condition (the target domain), its diagnostic accuracy usually drops precipitously.</p>
      <p>Furthermore, collecting massive amounts of meticulously labeled fault data for every conceivable operating condition is excessively costly, time-consuming, and often physically impossible. This structural limitation exacerbates the challenge of data scarcity and highly imbalanced class distributions [<xref ref-type="bibr" rid="B7">7</xref>]. To tackle the profound challenges imposed by domain shift and data scarcity, Transfer Learning, and particularly Deep Domain Adaptation (DDA), has emerged as a state-of-the-art solution. DDA endeavors to transfer diagnostic knowledge from a label-rich source domain to an unlabeled target domain by forcefully aligning their feature distributions in a high-dimensional subspace, thereby creating a domain-invariant representation [<xref ref-type="bibr" rid="B8">8</xref>]. In this paper, to conquer the cross-condition diagnosis bottleneck in hydraulic directional valves, we propose a robust and general-type hydraulic fault diagnosis methodology based on a multi-channel 1D-CNN architecture deeply integrated with the Maximum Mean Discrepancy (MMD) metric. The 1D-CNN acts as a powerful temporal feature extractor to fuse multi-sensor signals. Simultaneously, the multi-kernel MMD loss is strategically incorporated into the overall objective function to align the global feature representations of the source and target domains. The main contributions of this comprehensive study are summarized as follows:</p>
      <p>We formulate a robust Deep Domain Adaptation (DDA) framework for hydraulic systems that systematically neutralizes the detrimental impacts of fluctuating accumulator pressures. The model maintains exceptionally high diagnostic accuracy without requiring any fault labels from the target operational condition.We mathematically integrate a Multi-Kernel MMD (MK-MMD) penalty with a multi-channel 1D-CNN. This innovative synergy effectively decouples the intrinsic fault-specific characteristics from condition-specific variations.We conduct extensive validations on the public UCI condition monitoring of hydraulic systems dataset. Through multi-metric quantitative evaluations, comprehensive ablation studies, and high-resolution t-SNE visualizations, we demonstrate the overwhelming superiority of the proposed framework.We discuss the industrial viability of the proposed model, demonstrating that its lightweight nature makes it highly suitable for real-time Edge Computing deployment in Industrial IoT (IIoT) environments, paving the way for Digital Twin-assisted maintenance.</p>
    </sec>
    <sec id="sec2">
      <title>2. Related Work</title>
      <sec id="sec2dot1">
        <title>2.1. Data-Driven Fault Diagnosis and Deep Learning</title>
        <p>Deep learning has fundamentally transformed the paradigm of data-driven intelligent fault diagnosis and Remaining Useful Life (RUL) prediction across diverse mechanical and hydraulic systems. In the context of hydraulic condition monitoring, multi-sensor data fusion is paramount because a single sensor stream often fails to capture the holistic degradation status of complex fluid dynamics. Tao <italic>et al.</italic> [<xref ref-type="bibr" rid="B4">4</xref>] utilized multi-sensor time-series fused with 1D-CNNs to identify complex hydraulic fault patterns in real-time, highlighting the efficiency of convolutional architectures in temporal signal processing. Similarly, Wang <italic>et al.</italic> [<xref ref-type="bibr" rid="B9">9</xref>] explored 2D time-series modeling combined with self-attention fusion mechanisms to effectively decouple concurrent faults within highly integrated hydraulic systems.</p>
        <p>Beyond standard fault classification, RUL prediction under continuous degradation remains a focal point. Han and Mo [<xref ref-type="bibr" rid="B5">5</xref>] proposed an RUL prediction method based on sequential health index evaluation coupled with multi-dimensional degradation data. Furthermore, sophisticated architectures like gated convolutional autoencoders [<xref ref-type="bibr" rid="B10">10</xref>] have been proposed to enhance predictive maintenance under noisy environments. However, when deployed under severe cross-condition scenarios (e.g., sudden pressure drops or load changes), these purely supervised models inevitably suffer from severe performance degradation because they completely lack explicit domain alignment mechanisms.</p>
      </sec>
      <sec id="sec2dot2">
        <title>2.2. Handling Data Scarcity and Imbalance</title>
        <p>In authentic industrial environments, hydraulic systems operate under normal healthy conditions for the vast majority of their lifecycles. Fault data are extremely rare, leading to severe class imbalance and data scarcity. To address this pervasive issue, advanced data augmentation techniques have been actively investigated. Udu <italic>et al.</italic> [<xref ref-type="bibr" rid="B7">7</xref>] provided a comprehensive review of Synthetic Minority Over-sampling Technique (SMOTE) and Generative Adversarial Network (GAN) variants for balancing machine learning tasks. Specifically, Zhao <italic>et al.</italic> [<xref ref-type="bibr" rid="B11">11</xref>] successfully implemented a Domain Adaptation Deep Convolutional GAN (DA-DCGAN) to mitigate imbalanced sample problems in hydraulic pumps. Similarly, Deng <italic>et al.</italic> [<xref ref-type="bibr" rid="B12">12</xref>] proposed an improved deep convolution GAN integrated with multi-signal fusion to bolster fault diagnosis performance under data scarcity. While GAN-based augmentation enriches the training space, explicitly minimizing the distribution gap across operational domains remains a more direct and computationally efficient approach to achieving cross-condition robustness.</p>
      </sec>
      <sec id="sec2dot3">
        <title>2.3. Domain Adaptation and Transfer Learning</title>
        <p>To overcome the detrimental effects of domain shift, Deep Domain Adaptation (DDA) aims to establish a universally applicable, domain-invariant feature space. Recent academic endeavors have intensely focused on cross-condition and cross-machine diagnostics. For instance, Wu <italic>et al.</italic> [<xref ref-type="bibr" rid="B6">6</xref>] proposed a novel Transformer Transfer Learning Network (TTLN) specifically tailored for cross-condition scenarios in rotating machinery. For complex hydraulic and fluid power systems, DDA combined with ensemble learning strategies has showcased promising preliminary results in aligning marginal distributions [<xref ref-type="bibr" rid="B8">8</xref>]. Inspired by these remarkable advancements, this paper strategically adopts a multi-kernel MMD-based statistical alignment strategy due to its mathematically proven stability and superior computational efficiency in aligning high-dimensional, multi-sensor hydraulic fault features [<xref ref-type="bibr" rid="B13">13</xref>].</p>
      </sec>
      <sec id="sec2dot4">
        <title>2.4. Edge Computing and Digital Twins for Maintenance</title>
        <p>With the rapid evolution of the Industrial Internet of Things (IIoT) and Industry 4.0, the physical deployment of complex diagnostic algorithms is progressively shifting from centralized cloud servers towards Edge Computing paradigms. Edge computing guarantees real-time robustness, preserves data privacy, and ensures ultra-low-latency anomaly detection [<xref ref-type="bibr" rid="B14">14</xref>]. Concurrently, the integration of these models into Digital Twin (DT) architectures provides a profound virtual-physical mapping of the equipment. As discussed by Wang <italic>et al.</italic> [<xref ref-type="bibr" rid="B15">15</xref>], fault diagnosis and predictive maintenance based on digital twin models enable operators to interactively simulate faults and predict degradation trajectories without halting actual production. Our proposed framework aligns with this trajectory by offering a lightweight, condition-agnostic inference model ideal for edge nodes within a comprehensive digital twin ecosystem.</p>
      </sec>
    </sec>
    <sec id="sec3">
      <title>3. Methodology</title>
      <sec id="sec3dot1">
        <title>3.1. Problem Formulation and Domain Shift</title>
        <p>In the context of cross-condition fault diagnosis, we formally define a source domain <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="script"> D </mml:mi><mml:mi> s </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:msubsup><mml:mrow><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msubsup><mml:mi> x </mml:mi><mml:mi> i </mml:mi><mml:mi> s </mml:mi></mml:msubsup><mml:mo> , </mml:mo><mml:msubsup><mml:mi> y </mml:mi><mml:mi> i </mml:mi><mml:mi> s </mml:mi></mml:msubsup></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi> i </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi> n </mml:mi><mml:mi> s </mml:mi></mml:msub></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula> containing <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> n </mml:mi><mml:mi> s </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> fully labeled samples collected under a specific, optimal operating pressure (e.g., 130 bar). Concurrently, we define a target domain <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="script"> D </mml:mi><mml:mi> t </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:msubsup><mml:mrow><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:msubsup><mml:mi> x </mml:mi><mml:mi> j </mml:mi><mml:mi> t </mml:mi></mml:msubsup></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi> j </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi> n </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula> containing <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> n </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> entirely unlabeled samples collected under a degraded or variant operating pressure (e.g., 90 bar). </p>
        <p>The fundamental assumption of transfer learning is that both domains share an identical feature space <inline-formula><mml:math display="inline"><mml:mi mathvariant="script"> X </mml:mi></mml:math></inline-formula> and label space <inline-formula><mml:math display="inline"><mml:mi mathvariant="script"> Y </mml:mi></mml:math></inline-formula> , but their marginal probability distributions differ drastically, <italic>i.e.</italic>, <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> P </mml:mi><mml:mi> s </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> X </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> ≠ </mml:mo><mml:msub><mml:mi> P </mml:mi><mml:mi> t </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> X </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> . This inequality is the mathematical root of the domain shift problem. The ultimate objective of this study is to leverage the abundant labeled knowledge from <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="script"> D </mml:mi><mml:mi> s </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> to train a robust deep neural network <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> G </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mo> ⋅ </mml:mo><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , parameterized by <italic>θ</italic>, capable of accurately predicting the hidden labels <inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mi> y </mml:mi><mml:mi> t </mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> of the target domain data <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="script"> D </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> .</p>
      </sec>
      <sec id="sec3dot2">
        <title>3.2. Multi-Sensor Data Preprocessing and Fusion</title>
        <p>Industrial hydraulic sensors typically possess varying sampling frequencies due to the diverse physical nature of the measured phenomena (e.g., pressure sensors often sample at 100 Hz, while volume flow sensors sample at 10 Hz). To construct a unified, multidimensional input tensor for the CNN, one-dimensional linear interpolation is employed to unsampled low-frequency signals to precisely match the highest frequency. Let <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> S </mml:mi><mml:mrow><mml:mi> l </mml:mi><mml:mi> o </mml:mi><mml:mi> w </mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> be the low-frequency signal; the unsampled signal <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> S </mml:mi><mml:mrow><mml:mi> h </mml:mi><mml:mi> i </mml:mi><mml:mi> g </mml:mi><mml:mi> h </mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> t </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> at target timestamp <inline-formula><mml:math display="inline"><mml:mi> t </mml:mi></mml:math></inline-formula> is formulated as:</p>
        <disp-formula id="FD1">
          <label>(1)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mi>S</mml:mi>
                <mml:mrow>
                  <mml:mi>h</mml:mi>
                  <mml:mi>i</mml:mi>
                  <mml:mi>g</mml:mi>
                  <mml:mi>h</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>t</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>S</mml:mi>
                <mml:mrow>
                  <mml:mi>l</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>w</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>t</mml:mi>
                    <mml:mi>k</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>+</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>S</mml:mi>
                    <mml:mrow>
                      <mml:mi>l</mml:mi>
                      <mml:mi>o</mml:mi>
                      <mml:mi>w</mml:mi>
                    </mml:mrow>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>t</mml:mi>
                        <mml:mrow>
                          <mml:mi>k</mml:mi>
                          <mml:mo>+</mml:mo>
                          <mml:mn>1</mml:mn>
                        </mml:mrow>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:msub>
                    <mml:mi>S</mml:mi>
                    <mml:mrow>
                      <mml:mi>l</mml:mi>
                      <mml:mi>o</mml:mi>
                      <mml:mi>w</mml:mi>
                    </mml:mrow>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>t</mml:mi>
                        <mml:mi>k</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>t</mml:mi>
                    <mml:mrow>
                      <mml:mi>k</mml:mi>
                      <mml:mo>+</mml:mo>
                      <mml:mn>1</mml:mn>
                    </mml:mrow>
                  </mml:msub>
                  <mml:mo>−</mml:mo>
                  <mml:msub>
                    <mml:mi>t</mml:mi>
                    <mml:mi>k</mml:mi>
                  </mml:msub>
                </mml:mrow>
              </mml:mfrac>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mi>t</mml:mi>
                  <mml:mo>−</mml:mo>
                  <mml:msub>
                    <mml:mi>t</mml:mi>
                    <mml:mi>k</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD2">
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mi>t</mml:mi>
                <mml:mi>k</mml:mi>
              </mml:msub>
              <mml:mo>≤</mml:mo>
              <mml:mi>t</mml:mi>
              <mml:mo>&lt;</mml:mo>
              <mml:msub>
                <mml:mi>t</mml:mi>
                <mml:mrow>
                  <mml:mi>k</mml:mi>
                  <mml:mo>+</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
              </mml:msub>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Subsequently, Z-score standardization is applied to eliminate the severe dimensional disparities among different physical quantities. For a given feature vector <inline-formula><mml:math display="inline"><mml:mi> x </mml:mi></mml:math></inline-formula> :</p>
        <disp-formula id="FD3">
          <label>(2)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mi>x</mml:mi>
                <mml:mrow>
                  <mml:mi>n</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>r</mml:mi>
                  <mml:mi>m</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mi>x</mml:mi>
                  <mml:mo>−</mml:mo>
                  <mml:msub>
                    <mml:mi>μ</mml:mi>
                    <mml:mi>s</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>σ</mml:mi>
                    <mml:mi>s</mml:mi>
                  </mml:msub>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Crucially, to rigorously prevent any futuristic data leakage, the mean <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> μ </mml:mi><mml:mi> s </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and standard deviation <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> σ </mml:mi><mml:mi> s </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> must be exclusively computed from the source domain training set and then rigidly applied to scale the target domain data. Finally, a sliding window technique with a fixed window size <inline-formula><mml:math display="inline"><mml:mi> W </mml:mi></mml:math></inline-formula> is applied to segment the continuous sequences into discrete tensor samples.</p>
      </sec>
      <sec id="sec3dot3">
        <title>3.3. Proposed 1D-CNN Feature Extractor</title>
        <p>The architectural backbone of our Domain Adaptation CNN (DA-CNN) framework is a multi-channel 1D-CNN feature extractor, denoted as <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> G </mml:mi><mml:mi> f </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , operating under shared weights across both domains. The overall architecture is vividly detailed in <xref ref-type="fig" rid="fig1">Figure 1</xref>. The input consists of normalized multi-sensor time-series matrices <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> X </mml:mi><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mrow><mml:mi> C </mml:mi><mml:mo> × </mml:mo><mml:mi> W </mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> , where <italic>C</italic> = 2 is the number of sensor channels (pressure and flow), and <italic>W</italic> = 1024 represents the time window sequence length. The feature extractor <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> G </mml:mi><mml:mi> f </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> comprises multiple cascaded convolutional blocks. For a given input sequence <italic>x</italic>, the 1D convolution operation for the <italic>j-</italic>th feature map in the <italic>l-</italic>th layer is mathematically defined as:</p>
        <disp-formula id="FD4">
          <label>(3)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msubsup>
                <mml:mi>z</mml:mi>
                <mml:mi>j</mml:mi>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>l</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:msubsup>
              <mml:mo>=</mml:mo>
              <mml:mi>σ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mstyle displaystyle="true">
                    <mml:munderover>
                      <mml:mo>∑</mml:mo>
                      <mml:mrow>
                        <mml:mi>i</mml:mi>
                        <mml:mo>=</mml:mo>
                        <mml:mn>1</mml:mn>
                      </mml:mrow>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>C</mml:mi>
                          <mml:mrow>
                            <mml:mi>i</mml:mi>
                            <mml:mi>n</mml:mi>
                          </mml:mrow>
                        </mml:msub>
                      </mml:mrow>
                    </mml:munderover>
                    <mml:mrow>
                      <mml:msubsup>
                        <mml:mi>W</mml:mi>
                        <mml:mrow>
                          <mml:mi>i</mml:mi>
                          <mml:mo>,</mml:mo>
                          <mml:mi>j</mml:mi>
                        </mml:mrow>
                        <mml:mrow>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mi>l</mml:mi>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                      </mml:msubsup>
                    </mml:mrow>
                  </mml:mstyle>
                  <mml:mo>∗</mml:mo>
                  <mml:msubsup>
                    <mml:mi>x</mml:mi>
                    <mml:mi>i</mml:mi>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:mi>l</mml:mi>
                          <mml:mo>−</mml:mo>
                          <mml:mn>1</mml:mn>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:msubsup>
                  <mml:mo>+</mml:mo>
                  <mml:msubsup>
                    <mml:mi>b</mml:mi>
                    <mml:mi>j</mml:mi>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mi>l</mml:mi>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:msubsup>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where ∗ denotes the 1D convolution operator, <inline-formula><mml:math display="inline"><mml:mrow><mml:msubsup><mml:mi> W </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mo> , </mml:mo><mml:mi> j </mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mi> l </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula> is the convolutional kernel weight, <inline-formula><mml:math display="inline"><mml:mrow><mml:msubsup><mml:mi> b </mml:mi><mml:mi> j </mml:mi><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mi> l </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula> is the bias term, and <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> σ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mo> ⋅ </mml:mo><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> represents the Rectified Linear Unit (ReLU) activation function, which injects essential non-linearity: <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> σ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> z </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mi> max </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 0 </mml:mn><mml:mo> , </mml:mo><mml:mi> z </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> . The initial convolutional layer deliberately utilizes a wide kernel (e.g., <italic>K</italic> = 15) to aggressively capture macroscopic temporal fluctuations and suppress high-frequency mechanical noise. Following the convolution, a Max-Pooling layer is applied to down-sample the temporal dimension, retaining the most salient features and providing necessary translation invariance. The pooling operation is expressed as:</p>
        <disp-formula id="FD5">
          <label>(4)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msubsup>
                <mml:mi>p</mml:mi>
                <mml:mi>j</mml:mi>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>l</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:msubsup>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>k</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mrow>
                  <mml:mi>max</mml:mi>
                </mml:mrow>
                <mml:mrow>
                  <mml:mn>0</mml:mn>
                  <mml:mo>≤</mml:mo>
                  <mml:mi>m</mml:mi>
                  <mml:mo>&lt;</mml:mo>
                  <mml:mi>s</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msubsup>
                    <mml:mi>z</mml:mi>
                    <mml:mi>j</mml:mi>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mi>l</mml:mi>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:msubsup>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:mi>k</mml:mi>
                      <mml:mo>⋅</mml:mo>
                      <mml:mi>s</mml:mi>
                      <mml:mo>+</mml:mo>
                      <mml:mi>m</mml:mi>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <italic>s</italic> is the pooling stride.</p>
        <p>As illustrated in the central module of <xref ref-type="fig" rid="fig1">Figure 1</xref>, the tensor dimensions progressively contract from <italic>B</italic> × 2 × 1024 down to <italic>B</italic> × 32 × 254. Finally, an Adaptive Global Average Pooling (GAP) layer compresses the temporal dimension completely, transforming the feature maps into a highly compact, 64-dimensional latent feature vector <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> f </mml:mi><mml:mo> ∈ </mml:mo><mml:msup><mml:mi> ℝ </mml:mi><mml:mrow><mml:mn> 64 </mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> . A classification head <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> G </mml:mi><mml:mi> y </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , comprising fully connected layers combined with Dropout regularization (<italic>p</italic> = 0.5) to prevent overfitting, subsequently maps <italic>f</italic> to the probability distribution over the predefined hydraulic valve states using a SoftMax function.</p>
        <fig id="fig1">
          <label>Figure 1</label>
          <graphic xlink:href="https://html.scirp.org/file/1680485-rId79.jpeg?20260629113952" />
        </fig>
        <p><bold>Figure 1.</bold>The architecture of the deep domain adaptation convolutional neural network (DA-CNN).</p>
      </sec>
      <sec id="sec3dot4">
        <title>3.4. Multi-Kernel Maximum Mean Discrepancy</title>
        <p>To mathematically obliterate the domain shift illustrated in <xref ref-type="fig" rid="fig1">Figure 1</xref>, the MMD is deployed. MMD is a formidable non-parametric statistical metric that measures the distribution distance between the source and target domains by mapping the original features into a Reproducing Kernel Hilbert Space (RKHS) <inline-formula><mml:math display="inline"><mml:mi> ℋ </mml:mi></mml:math></inline-formula> . The empirical estimate of the squared MMD loss is rigorously formulated as:</p>
        <disp-formula id="FD6">
          <label>(5)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msubsup>
                <mml:mi>ℒ</mml:mi>
                <mml:mrow>
                  <mml:mi>M</mml:mi>
                  <mml:mi>M</mml:mi>
                  <mml:mi>D</mml:mi>
                </mml:mrow>
                <mml:mn>2</mml:mn>
              </mml:msubsup>
              <mml:mo>=</mml:mo>
              <mml:msubsup>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>‖</mml:mo>
                    <mml:mrow>
                      <mml:mfrac>
                        <mml:mn>1</mml:mn>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>n</mml:mi>
                            <mml:mi>s</mml:mi>
                          </mml:msub>
                        </mml:mrow>
                      </mml:mfrac>
                      <mml:mstyle displaystyle="true">
                        <mml:munderover>
                          <mml:mo>∑</mml:mo>
                          <mml:mrow>
                            <mml:mi>i</mml:mi>
                            <mml:mo>=</mml:mo>
                            <mml:mn>1</mml:mn>
                          </mml:mrow>
                          <mml:mrow>
                            <mml:msub>
                              <mml:mi>n</mml:mi>
                              <mml:mi>s</mml:mi>
                            </mml:msub>
                          </mml:mrow>
                        </mml:munderover>
                        <mml:mi>ϕ</mml:mi>
                      </mml:mstyle>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msubsup>
                            <mml:mi>f</mml:mi>
                            <mml:mi>i</mml:mi>
                            <mml:mi>s</mml:mi>
                          </mml:msubsup>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                      <mml:mo>−</mml:mo>
                      <mml:mfrac>
                        <mml:mn>1</mml:mn>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>n</mml:mi>
                            <mml:mi>t</mml:mi>
                          </mml:msub>
                        </mml:mrow>
                      </mml:mfrac>
                      <mml:mstyle displaystyle="true">
                        <mml:munderover>
                          <mml:mo>∑</mml:mo>
                          <mml:mrow>
                            <mml:mi>j</mml:mi>
                            <mml:mo>=</mml:mo>
                            <mml:mn>1</mml:mn>
                          </mml:mrow>
                          <mml:mrow>
                            <mml:msub>
                              <mml:mi>n</mml:mi>
                              <mml:mi>t</mml:mi>
                            </mml:msub>
                          </mml:mrow>
                        </mml:munderover>
                        <mml:mi>ϕ</mml:mi>
                      </mml:mstyle>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msubsup>
                            <mml:mi>f</mml:mi>
                            <mml:mi>j</mml:mi>
                            <mml:mi>t</mml:mi>
                          </mml:msubsup>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mo>‖</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mi>ℋ</mml:mi>
                <mml:mn>2</mml:mn>
              </mml:msubsup>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mi> f </mml:mi><mml:mi> s </mml:mi></mml:msup><mml:mo> = </mml:mo><mml:msub><mml:mi> G </mml:mi><mml:mi> f </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msup><mml:mi> x </mml:mi><mml:mi> s </mml:mi></mml:msup></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mi> f </mml:mi><mml:mi> t </mml:mi></mml:msup><mml:mo> = </mml:mo><mml:msub><mml:mi> G </mml:mi><mml:mi> f </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msup><mml:mi> x </mml:mi><mml:mi> t </mml:mi></mml:msup></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> are the deep representations extracted from the source and target domains, respectively, and <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> ϕ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mo> ⋅ </mml:mo><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the implicit mapping function defining the RKHS. By expanding the squared norm using the kernel trick <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> k </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> x </mml:mi><mml:mo> , </mml:mo><mml:mi> y </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mo> 〈 </mml:mo><mml:mrow><mml:mi> ϕ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> x </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> , </mml:mo><mml:mi> ϕ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> y </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mo> 〉 </mml:mo></mml:mrow></mml:mrow><mml:mi> ℋ </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , the MMD loss can be computed explicitly without knowing the exact algebraic form of <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> ϕ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mo> ⋅ </mml:mo><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> .</p>
        <p>In this complex hydraulic study, a Multi-Kernel Gaussian (MK-MMD) strategy is utilized to exponentially enhance the alignment capability across highly variable, multi-scale features [<xref ref-type="bibr" rid="B13">13</xref>]: </p>
        <disp-formula id="FD7">
          <label>(6)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:mi>k</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msup>
                    <mml:mi>f</mml:mi>
                    <mml:mi>s</mml:mi>
                  </mml:msup>
                  <mml:mo>,</mml:mo>
                  <mml:msup>
                    <mml:mi>f</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msup>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mstyle displaystyle="true">
                <mml:munderover>
                  <mml:mo>∑</mml:mo>
                  <mml:mrow>
                    <mml:mi>m</mml:mi>
                    <mml:mo>=</mml:mo>
                    <mml:mn>1</mml:mn>
                  </mml:mrow>
                  <mml:mi>M</mml:mi>
                </mml:munderover>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>β</mml:mi>
                    <mml:mi>m</mml:mi>
                  </mml:msub>
                </mml:mrow>
              </mml:mstyle>
              <mml:mi>exp</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mfrac>
                    <mml:mrow>
                      <mml:msup>
                        <mml:mrow>
                          <mml:mrow>
                            <mml:mo>‖</mml:mo>
                            <mml:mrow>
                              <mml:msup>
                                <mml:mi>f</mml:mi>
                                <mml:mi>s</mml:mi>
                              </mml:msup>
                              <mml:mo>−</mml:mo>
                              <mml:msup>
                                <mml:mi>f</mml:mi>
                                <mml:mi>t</mml:mi>
                              </mml:msup>
                            </mml:mrow>
                            <mml:mo>‖</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                        <mml:mn>2</mml:mn>
                      </mml:msup>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:mn>2</mml:mn>
                      <mml:msubsup>
                        <mml:mi>σ</mml:mi>
                        <mml:mi>m</mml:mi>
                        <mml:mn>2</mml:mn>
                      </mml:msubsup>
                    </mml:mrow>
                  </mml:mfrac>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> M </mml:mi><mml:mo> = </mml:mo><mml:mn> 5 </mml:mn></mml:mrow></mml:math></inline-formula> is the number of distinct Gaussian kernels, <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> σ </mml:mi><mml:mi> m </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> dictates the varying bandwidths, and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> β </mml:mi><mml:mi> m </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the corresponding kernel weights (set uniformly in this configuration). By combining multiple kernels, the network is simultaneously forced to align both macro-level distributional shifts and micro-level feature variances.</p>
      </sec>
      <sec id="sec3dot5">
        <title>3.5. Joint Optimization Objective</title>
        <p>The overarching training objective of the DA-CNN synchronously unifies the supervised classification error on the source domain and the unsupervised domain discrepancy error across domains. The classification loss utilizes the standard Categorical Cross-Entropy:</p>
        <disp-formula id="FD8">
          <label>(7)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mi>ℒ</mml:mi>
                <mml:mrow>
                  <mml:mi>c</mml:mi>
                  <mml:mi>l</mml:mi>
                  <mml:mi>s</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mo>−</mml:mo>
              <mml:mfrac>
                <mml:mn>1</mml:mn>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>n</mml:mi>
                    <mml:mi>s</mml:mi>
                  </mml:msub>
                </mml:mrow>
              </mml:mfrac>
              <mml:mstyle displaystyle="true">
                <mml:munderover>
                  <mml:mo>∑</mml:mo>
                  <mml:mrow>
                    <mml:mi>i</mml:mi>
                    <mml:mo>=</mml:mo>
                    <mml:mn>1</mml:mn>
                  </mml:mrow>
                  <mml:mrow>
                    <mml:msub>
                      <mml:mi>n</mml:mi>
                      <mml:mi>s</mml:mi>
                    </mml:msub>
                  </mml:mrow>
                </mml:munderover>
                <mml:mrow>
                  <mml:mstyle displaystyle="true">
                    <mml:munderover>
                      <mml:mo>∑</mml:mo>
                      <mml:mrow>
                        <mml:mi>c</mml:mi>
                        <mml:mo>=</mml:mo>
                        <mml:mn>1</mml:mn>
                      </mml:mrow>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>C</mml:mi>
                          <mml:mrow>
                            <mml:mi>c</mml:mi>
                            <mml:mi>l</mml:mi>
                            <mml:mi>a</mml:mi>
                            <mml:mi>s</mml:mi>
                            <mml:mi>s</mml:mi>
                          </mml:mrow>
                        </mml:msub>
                      </mml:mrow>
                    </mml:munderover>
                    <mml:mi mathvariant="double-struck">I</mml:mi>
                  </mml:mstyle>
                </mml:mrow>
              </mml:mstyle>
              <mml:mrow>
                <mml:mo>[</mml:mo>
                <mml:mrow>
                  <mml:msubsup>
                    <mml:mi>y</mml:mi>
                    <mml:mi>i</mml:mi>
                    <mml:mi>s</mml:mi>
                  </mml:msubsup>
                  <mml:mo>=</mml:mo>
                  <mml:mi>c</mml:mi>
                </mml:mrow>
                <mml:mo>]</mml:mo>
              </mml:mrow>
              <mml:mi>log</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>G</mml:mi>
                    <mml:mi>y</mml:mi>
                  </mml:msub>
                  <mml:msub>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>G</mml:mi>
                            <mml:mi>f</mml:mi>
                          </mml:msub>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mrow>
                              <mml:msubsup>
                                <mml:mi>x</mml:mi>
                                <mml:mi>i</mml:mi>
                                <mml:mi>s</mml:mi>
                              </mml:msubsup>
                            </mml:mrow>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mi>c</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> C </mml:mi><mml:mrow><mml:mi> c </mml:mi><mml:mi> l </mml:mi><mml:mi> a </mml:mi><mml:mi> s </mml:mi><mml:mi> s </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the number of fault categories, and <inline-formula><mml:math display="inline"><mml:mrow><mml:mi mathvariant="double-struck"> I </mml:mi><mml:mrow><mml:mo> [ </mml:mo><mml:mo> ⋅ </mml:mo><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the indicator function.</p>
        <p>The total optimization objective <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> ℒ </mml:mi><mml:mrow><mml:mi> t </mml:mi><mml:mi> o </mml:mi><mml:mi> t </mml:mi><mml:mi> a </mml:mi><mml:mi> l </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is synthesized as:</p>
        <disp-formula id="FD9">
          <label>(8)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mrow>
                  <mml:mi>min</mml:mi>
                </mml:mrow>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>θ</mml:mi>
                    <mml:mi>f</mml:mi>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:msub>
                    <mml:mi>θ</mml:mi>
                    <mml:mi>y</mml:mi>
                  </mml:msub>
                </mml:mrow>
              </mml:msub>
              <mml:msub>
                <mml:mi>ℒ</mml:mi>
                <mml:mrow>
                  <mml:mi>t</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>t</mml:mi>
                  <mml:mi>a</mml:mi>
                  <mml:mi>l</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>ℒ</mml:mi>
                <mml:mrow>
                  <mml:mi>c</mml:mi>
                  <mml:mi>l</mml:mi>
                  <mml:mi>s</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>+</mml:mo>
              <mml:mi>λ</mml:mi>
              <mml:msub>
                <mml:mi>ℒ</mml:mi>
                <mml:mrow>
                  <mml:mi>M</mml:mi>
                  <mml:mi>M</mml:mi>
                  <mml:mi>D</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msup>
                    <mml:mi>f</mml:mi>
                    <mml:mi>s</mml:mi>
                  </mml:msup>
                  <mml:mo>,</mml:mo>
                  <mml:msup>
                    <mml:mi>f</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msup>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math display="inline"><mml:mi> λ </mml:mi></mml:math></inline-formula> is a critical hyperparameter dynamically regulating the penalty strength of the domain alignment. Through iterative backpropagation using the Adam optimizer, the network parameters (<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> θ </mml:mi><mml:mi> f </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> for the extractor and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> θ </mml:mi><mml:mi> y </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> for the classifier) are updated, forcing the extractor to learn representations that are concurrently fault-discriminative and operational-condition-invariant.</p>
      </sec>
    </sec>
    <sec id="sec4">
      <title>4. Experiments and Results</title>
      <sec id="sec4dot1">
        <title>4.1. Dataset Description and Task Construction</title>
        <p>To empirically validate the undeniable effectiveness of the proposed framework, we utilize the universally benchmarked Condition Monitoring of Hydraulic Systems dataset provided by the UCI Machine Learning Repository [<xref ref-type="bibr" rid="B1">1</xref>]. The dataset was generated by a sophisticated industrial hydraulic test rig comprising a primary working circuit and a secondary cooling-filtration circuit. The system cyclically executes constant load profiles lasting 60 seconds per cycle, accumulating a total of 2205 operational cycles over varying component degradation states. To meticulously construct the Domain Adaptation task, we isolate the accumulator pre-charge pressure as the shifting condition variable. Variations in accumulator pressure drastically alter the transient response, volumetric efficiency, and pressure ripple of the entire fluid power system. The Source Domain (<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="script"> D </mml:mi><mml:mi> s </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> ) constitutes data recorded at the optimal pressure of 130 bar. The Target Domain (<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="script"> D </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> ) comprises data captured under a critically degraded pressure of 90 bar. The ultimate diagnostic objective is to classify the condition of the hydraulic directional valve into four severity states: Optimal behavior (100%), Mild Hysteresis (90%), Severe Hysteresis (80%), and Near Failure (73%).</p>
        <p>Among the multiple sensors available in the UCI dataset, we specifically retain two critical channels: the PS2 pressure sensor (measuring system operating pressure at 100 Hz) and the FS1 volume flow sensor (measuring hydraulic fluid flow rate at 10 Hz). These two sensors were selected because pressure and flow collectively capture the essential hydraulic dynamics most directly indicative of valve degradation. PS2 directly reflects the accumulator pre-charge condition and system pressure stability, while FS1 provides complementary information on volumetric efficiency and internal leakage. Other sensors, such as temperature and vibration sensors, exhibit weaker correlation with valve hysteresis severity in preliminary analysis and were excluded to maintain a lightweight input tensor and prevent redundant feature dimensions.</p>
        <p>To quantitatively characterize the data scarcity setting, <bold>Table 1</bold> provides a detailed breakdown of the dataset composition after preprocessing. The source domain (130 bar) comprises a total of 2205 operational cycles, which were segmented into approximately 10,500 non-overlapping windows of length <italic>W</italic> = 1024 points each. The target domain (90 bar) contains 1847 operational cycles, yielding approximately 8800 windows. Crucially, the source domain samples are fully labeled, whereas all target domain samples remain completely unlabeled during training—emulating the realistic industrial scenario where labeled data from degraded operating conditions are entirely unavailable. Furthermore, as detailed in <bold>Table 1</bold>, the windowed dataset exhibits significant class imbalance: the Optimal (100%) class dominates with approximately 5200 source windows and 4400 target windows, while the Near Failure (73%) class is severely underrepresented with only 780 source windows and 650 target windows. This simultaneous scarcity of unlabeled target data and severe intra-domain class imbalance collectively defines the data scarcity challenge addressed in this study (<xref ref-type="fig" rid="fig2">Figure 2</xref>).</p>
        <p><bold>Table 1.</bold>Dataset composition across source and target domains after windowing (W = 1024).</p>
        <table-wrap id="tbl1">
          <label>Table 1</label>
          <table>
            <tbody>
              <tr>
                <td rowspan="2">Class</td>
                <td colspan="2">Source Domain (130 bar)</td>
                <td colspan="2">Target Domain (90 bar)</td>
              </tr>
              <tr>
                <td>Cycles</td>
                <td>Windows (1024)</td>
                <td>Cycles</td>
                <td>Windows (1024)</td>
              </tr>
              <tr>
                <td>Optimal (100%)</td>
                <td>1285</td>
                <td>~5200</td>
                <td>1078</td>
                <td>~4400</td>
              </tr>
              <tr>
                <td>Mild Hysteresis (90%)</td>
                <td>442</td>
                <td>~1900</td>
                <td>368</td>
                <td>~1550</td>
              </tr>
              <tr>
                <td>Severe Hysteresis (80%)</td>
                <td>298</td>
                <td>~1620</td>
                <td>251</td>
                <td>~1200</td>
              </tr>
              <tr>
                <td>Near Failure (73%)</td>
                <td>180</td>
                <td>~780</td>
                <td>150</td>
                <td>~650</td>
              </tr>
              <tr>
                <td>Total</td>
                <td>2205</td>
                <td>~10,500</td>
                <td>1847</td>
                <td>~8800</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <fig id="fig2">
          <label>Figure 2</label>
          <graphic xlink:href="https://html.scirp.org/file/1680485-rId122.jpeg?20260629113953" />
        </fig>
        <p><bold>Figure 2.</bold> Synchronized normalized multi-sensor inputs used by the DA-CNN.</p>
      </sec>
      <sec id="sec4dot2">
        <title>4.2. Experimental Setup and Evaluation Metrics</title>
        <p>The time-series data were segmented into samples using a sliding window of length W = 1024 points (representing approximately 10.24 seconds of high-frequency data) with no overlap. The proposed DA-CNN was programmed in Python 3.8 utilizing the PyTorch deep learning framework. Network optimization was executed using the Adam optimizer with an initial learning rate of 0.001. The batch size was consistently set to 64, and the model was trained for 30 epochs. The MMD penalty weight <italic>λ</italic> was fixed at 0.5. All hyperparameters, including the learning rate (0.001), batch size (64), epoch count (30), and the MMD penalty weight <italic>λ</italic> (0.5), were rigorously selected through a grid-search strategy conducted exclusively on the source-domain validation set (15% of the labeled source data), without any access to target-domain labels. Specifically,<italic>λ</italic> was searched over the grid {0.1, 0.3, 0.5, 0.7, 1.0}, and the value yielding the highest source-domain validation accuracy was chosen. This protocol ensures that no target-domain information leaks into the hyperparameter selection process, maintaining the unsupervised integrity of the domain adaptation. The multi-kernel MMD configuration employs five Gaussian kernels with bandwidths <italic>σ</italic><inline-formula><mml:math display="inline"><mml:mo> ∈ </mml:mo></mml:math></inline-formula> {0.25, 0.5, 1, 2, 4} times the median heuristic of the pairwise source feature distances, and uniform kernel weights <italic>β</italic> = 1/5.</p>
        <p>To ensure reproducibility and prevent data leakage, the source domain dataset is strictly partitioned into three disjoint subsets: 70% (approximately 7350 windows) for training, 15% (approximately 1575 windows) for validation, and 15% (approximately 1575 windows) for final source-domain evaluation. The target domain dataset is divided into two mutually exclusive subsets: 70% (approximately 6160 windows) is used exclusively for computing the unsupervised MMD loss during training, while the remaining 30% (approximately 2640 windows) is reserved strictly for final target-domain performance evaluation. Critically, the target samples utilized for MMD-based domain alignment during training are fully disjoint from the target samples used for final metric reporting—there is absolutely no overlap between these two subsets. This rigorous separation protocol completely eliminates any risk of information leakage during the adaptation process and ensures that the reported target-domain accuracy faithfully reflects the model’s true generalization capability under genuine unsupervised cross-condition deployment.</p>
        <p>To guarantee a comprehensive and multidimensional evaluation of the model’s performance on the completely unlabeled target domain, four standard classification metrics were utilized: Accuracy (Acc), Precision (P), Recall (R), and F1-Score (F1). These metrics were computed from the confusion matrix, where TP, TN, FP, and FN denote True Positives, True Negatives, False Positives, and False Negatives, respectively. In industrial settings, a high F1-Score is crucial because it balances the costly risks of false alarms (unnecessary maintenance downtime) and false negatives (catastrophic undetected failures). All reported metrics—Accuracy, Precision, Recall, and F1-Score—are computed as macro-averages across the four fault severity classes, ensuring equal contribution from each class regardless of sample frequency. Macro-averaging is particularly appropriate for this study because the windowed target dataset exhibits significant class imbalance, and macro-metrics prevent the dominant Optimal class from masking poor performance on rare but critical failure states. To further address the class imbalance concern, Balanced Accuracy (the arithmetic means of per-class recall rates) and Macro-F1 are additionally reported in the detailed per-class breakdown (<bold>Table 1</bold>), providing complementary measures of the model’s equitable diagnostic capability across all valve health states.</p>
      </sec>
      <sec id="sec4dot3">
        <title>4.3. Training Convergence</title>
        <fig id="fig3">
          <label>Figure 3</label>
          <graphic xlink:href="https://html.scirp.org/file/1680485-rId125.jpeg?20260629113954" />
        </fig>
        <p><bold>Figure 3.</bold>Joint training losses of the proposed DA-CNN.</p>
        <p><xref ref-type="fig" rid="fig3">Figure 3</xref> transparently depicts the evolutionary convergence of the classification loss (calculated on the source domain) and the MMD loss (calculated across both domains) during the joint training process. The synchronized, smooth descent curves overwhelmingly prove that the model is successfully isolating fault types while aggressively pulling the cross-domain feature distributions into a unified continuum. The stabilization of both losses around the 20th epoch indicates that the network has converged to a robust domain-invariant state without severe overfitting.</p>
      </sec>
      <sec id="sec4dot4">
        <title>4.4. Algorithm Comparison and Quantitative Analysis</title>
        <p>To quantitatively substantiate the superiority of the proposed DA-CNN, we constructed rigorous comparative experiments against three conventional baselines: Support Vector Machine (SVM) utilizing handcrafted statistical features [<xref ref-type="bibr" rid="B1">1</xref>], a standard LSTM network [<xref ref-type="bibr" rid="B5">5</xref>], and a Baseline CNN (possessing an identical architecture to DA-CNN but stripped of the MMD loss module). The comparative results, strictly evaluated on the completely unseen 90 bar target domain, are extensively documented in <bold>Table 2</bold>.</p>
        <p><bold>Table 2.</bold>Algorithm performance comparison on target domain (90 bar).</p>
        <table-wrap id="tbl2">
          <label>Table 2</label>
          <table>
            <tbody>
              <tr>
                <td>Method</td>
                <td>Accuracy</td>
                <td>Precision</td>
                <td>Recall</td>
                <td>F1-Score</td>
              </tr>
              <tr>
                <td>
                  SVM [
                  <xref ref-type="bibr" rid="B1">1</xref>
                  ]
                </td>
                <td>58.2%</td>
                <td>57.5%</td>
                <td>58.1%</td>
                <td>57.6%</td>
              </tr>
              <tr>
                <td>
                  LSTM [
                  <xref ref-type="bibr" rid="B2">2</xref>
                  ]
                </td>
                <td>65.1%</td>
                <td>64.8%</td>
                <td>65.0%</td>
                <td>64.9%</td>
              </tr>
              <tr>
                <td>Baseline CNN</td>
                <td>68.4%</td>
                <td>68.7%</td>
                <td>68.2%</td>
                <td>68.3%</td>
              </tr>
              <tr>
                <td>Proposed DA-CNN</td>
                <td>
                  <bold>97.5%</bold>
                </td>
                <td>
                  <bold>97.6%</bold>
                </td>
                <td>
                  <bold>96.8%</bold>
                </td>
                <td>
                  <bold>97.5%</bold>
                </td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>The empirical data in <bold>Table 2</bold> unequivocally demonstrates that conventional models (SVM, LSTM, Baseline CNN) suffer a catastrophic collapse in accuracy (all falling below 70%) when subjected to severe domain shift. They blindly memorize the signal amplitudes specific to 130 bar and misinterpret the overall pressure drop at 90 bar as a symptom of massive valve failure. In stark contrast, the proposed DA-CNN achieves an extraordinary accuracy of 97.5%. <xref ref-type="fig" rid="fig4">Figure 4</xref> further dissects the diagnostic precision via a Confusion Matrix of DA-CNN on the target domain. It is visually evident that the vast majority of samples are seamlessly aligned along the main diagonal, showcasing minimal misclassification even across adjacent severity levels. </p>
        <p>To ensure complete transparency and reproducibility of the reported 97.5% target-domain accuracy, <bold>Table 3</bold> provides the detailed per-class prediction counts from which the aggregated metrics in <bold>Table 2</bold> are computed. The target-domain test set comprises 2640 windowed samples distributed across four valve severity states. The DA-CNN correctly classifies 2574 out of 2640 samples, yielding the reported accuracy of 97.5% (2574/2640). The per-class true positive (TP), false positive (FP), and false negative (FN) counts are as follows: </p>
        <p>From these counts, the macro-averaged Precision is 97.6% (mean of 99.3%, 96.9%, 96.7%, and 93.9%), the macro-averaged Recall is 97.5% (mean of 98.4%, 97.9%, 97.8%, and 93.0%), and the macro-averaged F1-Score is 97.5%. The Balanced Accuracy, computed as the mean of per-class recall rates, is 96.8%. These detailed counts rigorously validate the consistency between the aggregated metrics in <bold>Table 2</bold> and the underlying per-class prediction distribution, confirming that the reported 97.5% accuracy is fully supported by the confusion matrix in <xref ref-type="fig" rid="fig4">Figure 4</xref>.</p>
        <p><bold>Table 3.</bold>TP, FP, FN, Precision, and Recall on the 2640-sample target-domain test set. </p>
        <table-wrap id="tbl3">
          <label>Table 3</label>
          <table>
            <tbody>
              <tr>
                <td>Class</td>
                <td>Test Samples</td>
                <td>TP</td>
                <td>FP</td>
                <td>FN</td>
                <td>Precision</td>
                <td>Recall</td>
              </tr>
              <tr>
                <td>Optimal (100%)</td>
                <td>1100</td>
                <td>1082</td>
                <td>8</td>
                <td>18</td>
                <td>99.30%</td>
                <td>98.40%</td>
              </tr>
              <tr>
                <td>Mild Hysteresis (90%)</td>
                <td>700</td>
                <td>685</td>
                <td>22</td>
                <td>15</td>
                <td>96.90%</td>
                <td>97.90%</td>
              </tr>
              <tr>
                <td>Severe Hysteresis (80%)</td>
                <td>540</td>
                <td>528</td>
                <td>18</td>
                <td>12</td>
                <td>96.70%</td>
                <td>97.80%</td>
              </tr>
              <tr>
                <td>Near Failure (73%)</td>
                <td>300</td>
                <td>279</td>
                <td>18</td>
                <td>21</td>
                <td>93.90%</td>
                <td>93.00%</td>
              </tr>
              <tr>
                <td>Total/Macro-Avg</td>
                <td>2640</td>
                <td>2574</td>
                <td>66</td>
                <td>66</td>
                <td>97.6%</td>
                <td>96.8%</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <fig id="fig4">
          <label>Figure 4</label>
          <graphic xlink:href="https://html.scirp.org/file/1680485-rId126.jpeg?20260629113954" />
        </fig>
        <p><bold>Figure 4.</bold>Confusion matrix of the proposed DA-CNN on the target domain.</p>
      </sec>
      <sec id="sec4dot5">
        <title>4.5. Ablation Study on Domain Alignment Modules</title>
        <p>To validate the specific contribution of the Multi-Kernel MMD approach, an ablation study was conducted. We compared the Baseline CNN (no adaptation), a DA-CNN utilizing a Single-Kernel MMD (SK-MMD), and the proposed MK-MMD. As shown in <bold>Table 2</bold>, incorporating a single kernel improves accuracy to 89.3%, but fails to perfectly align multi-scale features. The MK-MMD leverages multiple bandwidths (<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> σ </mml:mi><mml:mi> m </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> ) to capture both overarching distribution shifts and subtle local structural differences, culminating in the optimal 97.5% accuracy.</p>
      </sec>
      <sec id="sec4dot6">
        <title>4.6. Feature Alignment Visualization and Quantitative Analysis</title>
        <p>To evaluate the feature representation and domain alignment capabilities of the proposed DA-CNN model, t-Distributed Stochastic Neighbor Embedding (t-SNE) is employed. The t-SNE algorithm projects the high-dimensional extracted features into a two-dimensional space for qualitative visualization. In this study, we compare the baseline model (without domain adaptation) and the proposed DA-CNN model on the cross-condition diagnosis task (130 bar to 90 bar) (<bold>Table 4</bold>).</p>
        <p><bold>Table 4.</bold>Ablation study of domain alignment strategies. </p>
        <table-wrap id="tbl4">
          <label>Table 4</label>
          <table>
            <tbody>
              <tr>
                <td>Model Configuration</td>
                <td>Target Acc.</td>
                <td>Improvement</td>
              </tr>
              <tr>
                <td>Baseline CNN (No MMD)</td>
                <td>68.4%</td>
                <td>-</td>
              </tr>
              <tr>
                <td>CNN + SK-MMD (Single Kernel)</td>
                <td>89.3%</td>
                <td>+20.9%</td>
              </tr>
              <tr>
                <td>CNN + MK-MMD (Proposed)</td>
                <td>97.5%</td>
                <td>+29.1%</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>4.6.1. Qualitative Analysis via t-SNE</p>
        <p>Conversely, <xref ref-type="fig" rid="fig5">Figure 5</xref> demonstrates the feature distribution obtained by the proposed DA-CNN model. Benefiting from the Multi-Kernel Maximum Mean Discrepancy (MK-MMD) optimization, the features from the source domain (130 bar) and target domain (90 bar) belonging to the same health state are effectively aligned. Additionally, different fault categories achieve cohesive intra-class distributions and separable inter-class margins.</p>
        <fig id="fig5">
          <label>Figure 5</label>
          <graphic xlink:href="https://html.scirp.org/file/1680485-rId129.jpeg?20260629113955" />
        </fig>
        <p><bold>Figure 5.</bold>Qualitative analysis of the baseline model.</p>
        <p>4.6.2. Quantitative Analysis of Feature Clustering</p>
        <p>While the t-SNE visualizations intuitively demonstrate the effectiveness of the proposed method, a quantitative analysis is further conducted to evaluate the feature alignment and clustering performance. Two standard metrics are used: 1) MMD Distance, which quantifies the marginal distribution gap between the source and target domains, where a smaller value indicates better domain alignment; and 2) Silhouette Score, which measures intra-class cohesion and inter-class separation, where a value closer to 1 indicates superior clustering quality. The quantitative comparison results are summarized in <bold>Table 5</bold>. As detailed in <bold>Table 5</bold>, the baseline model exhibits a high MMD distance of 1.843 and a low Silhouette Score of 0.214, which explains the chaotic overlap observed in <xref ref-type="fig" rid="fig5">Figure 5</xref>. In contrast, the proposed DA-CNN drastically reduces the MMD distance to 0.052, achieving a 97.18% reduction in the domain gap. Meanwhile, the Silhouette Score improves to 0.857. These quantitative results further support that the proposed method effectively mitigates variable operating conditions, aligns the marginal distributions, and improves hydraulic valve leakage diagnosis (<xref ref-type="fig" rid="fig6">Figure 6</xref>).</p>
        <p><bold>Table 5.</bold>Quantitative evaluation metrics for feature alignment and clustering performance. </p>
        <table-wrap id="tbl5">
          <label>Table 5</label>
          <table>
            <tbody>
              <tr>
                <td>Evaluation Metric</td>
                <td>Baseline</td>
                <td>DA-CNN</td>
                <td>Improvement</td>
              </tr>
              <tr>
                <td>MMD Distance ↓</td>
                <td>1.843</td>
                <td>0.052</td>
                <td>−97.18%</td>
              </tr>
              <tr>
                <td>Silhouette Score ↑</td>
                <td>0.214</td>
                <td>0.857</td>
                <td>+300.4%</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <fig id="fig6">
          <label>Figure 6</label>
          <graphic xlink:href="https://html.scirp.org/file/1680485-rId130.jpeg?20260629113956" />
        </fig>
        <p><bold>Figure 6.</bold>Qualitative analysis of the proposed DA-CNN.</p>
      </sec>
    </sec>
    <sec id="sec5">
      <title>5. Conclusions</title>
      <p>This paper comprehensively addresses and resolves the critical, pervasive challenge of domain shift and data scarcity in hydraulic system condition monitoring. By architecting a unified Deep Domain Adaptation framework—fusing a high-efficiency multi-sensor 1D-CNN feature extractor with a Multi-Kernel Maximum Mean Discrepancy (MMD) alignment module—the proposed method successfully forces the mathematical decoupling of true fault characteristics from deceptive operational pressure variations.</p>
      <p>Extensive empirical experiments conducted on the UCI benchmark dataset, corroborated by rigorous multi-metric comparisons and ablation studies, prove that the DA-CNN method achieves an unparalleled diagnostic accuracy of 97.5% under severe cross-condition tasks. It decisively outperforms traditional SVM, LSTM, and unaligned CNN architectures. High-fidelity t-SNE visualizations provide undeniable proof that the proposed methodology successfully constructs a pure, domain-invariant latent feature space. With its lightweight inference architecture, the proposed DA-CNN is highly suitable for real-time Edge Computing deployment. Moving forward, integrating this framework with Digital Twin simulations represents the ultimate frontier for achieving fully autonomous predictive maintenance in smart heavy industries.</p>
      <p>Despite the promising results achieved in this study, several important limitations must be acknowledged. First, the current evaluation is restricted to a single pressure-transfer task (130 bar → 90 bar) on a single hydraulic test rig. While this specific cross-condition scenario is highly representative of industrial accumulator degradation, the generalization capability of the proposed DA-CNN across other types of domain shifts—such as temperature variations, load fluctuations, or cross-machine transfers—remains to be systematically validated. Second, the claims regarding industrial viability and real-time Edge Computing deployment, while theoretically grounded in the model’s lightweight architecture, are not yet supported by actual runtime measurements, inference latency benchmarks, or hardware-in-the-loop deployment tests on physical edge devices. Future work will focus on conducting extensive multi-condition and cross-machine transfer experiments, alongside rigorous on-device inference profiling, to fully validate the practical deployability of the proposed framework in real-world Industrial IoT environments.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      <ref id="B1">
        <label>1.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Helwig, N., Pignanelli, E. and Schutze, A. (2015) Condition Monitoring of a Complex Hydraulic System Using Multivariate Statistics. 2015 <italic>IEEE International Instrumentation and Measurement Technology Conference</italic> ( <italic>I</italic>2 <italic>MTC</italic>) <italic>Proceedings</italic>, Pisa, 11-14 May 2015, 210-215. https://doi.org/10.1109/i2mtc.2015.7151267 <pub-id pub-id-type="doi">10.1109/i2mtc.2015.7151267</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/i2mtc.2015.7151267">https://doi.org/10.1109/i2mtc.2015.7151267</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Helwig, N.</string-name>
              <string-name>Pignanelli, E.</string-name>
              <string-name>Schutze, A.</string-name>
              <string-name>Proceedings, P</string-name>
            </person-group>
            <year>2015</year>
            <article-title>Condition Monitoring of a Complex Hydraulic System Using Multivariate Statistics</article-title>
            <source>2015 IEEE International Instrumentation and Measurement Technology Conference (I2MTC) Proceedings</source>
            <volume>11</volume>
            <pub-id pub-id-type="doi">10.1109/i2mtc.2015.7151267</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B2">
        <label>2.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Wetterich, P., Kuhr, M.M.G. and Pelz, P.F. (2025) Rule-Based Fault Diagnosis for Modular Hydraulic Systems. <italic>Processes</italic>, 13, Article 3293. https://doi.org/10.3390/pr13103293 <pub-id pub-id-type="doi">10.3390/pr13103293</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/pr13103293">https://doi.org/10.3390/pr13103293</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Wetterich, P.</string-name>
              <string-name>Kuhr, M.M.G.</string-name>
              <string-name>Pelz, P.F.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Rule-Based Fault Diagnosis for Modular Hydraulic Systems</article-title>
            <source>Processes</source>
            <volume>13</volume>
            <elocation-id>3293</elocation-id>
            <pub-id pub-id-type="doi">10.3390/pr13103293</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B3">
        <label>3.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Li, X., Zhang, L., Tan, T., Wang, X., Zhao, X. and Xu, Y. (2025) Multi-Sensor Data Fusion and Vibro-Acoustic Feature Engineering for Health Monitoring and Remaining Useful Life Prediction of Hydraulic Valves. <italic>Sensors</italic>, 25, Article 6294. https://doi.org/10.3390/s25206294 <pub-id pub-id-type="doi">10.3390/s25206294</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/s25206294">https://doi.org/10.3390/s25206294</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Li, X.</string-name>
              <string-name>Zhang, L.</string-name>
              <string-name>Tan, T.</string-name>
              <string-name>Wang, X.</string-name>
              <string-name>Zhao, X.</string-name>
              <string-name>Xu, Y.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Multi-Sensor Data Fusion and Vibro-Acoustic Feature Engineering for Health Monitoring and Remaining Useful Life Prediction of Hydraulic Valves</article-title>
            <source>Sensors</source>
            <volume>25</volume>
            <elocation-id>6294</elocation-id>
            <pub-id pub-id-type="doi">10.3390/s25206294</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B4">
        <label>4.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Tao, H., Jia, P., Wang, X. and Wang, L. (2024) Real-Time Fault Diagnosis for Hydraulic System Based on Multi-Sensor Convolutional Neural Network. <italic>Sensors</italic>, 24, Article 353. https://doi.org/10.3390/s24020353 <pub-id pub-id-type="doi">10.3390/s24020353</pub-id><pub-id pub-id-type="pmid">38257445</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/s24020353">https://doi.org/10.3390/s24020353</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Tao, H.</string-name>
              <string-name>Jia, P.</string-name>
              <string-name>Wang, X.</string-name>
              <string-name>Wang, L.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Real-Time Fault Diagnosis for Hydraulic System Based on Multi-Sensor Convolutional Neural Network</article-title>
            <source>Sensors</source>
            <volume>24</volume>
            <elocation-id>353</elocation-id>
            <pub-id pub-id-type="doi">10.3390/s24020353</pub-id>
            <pub-id pub-id-type="pmid">38257445</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B5">
        <label>5.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Han, F. and Mo, B. (2026) RUL Prediction Method Based on Sequential Health Index Evaluation with Multidimensional Coupled Degradation Data. <italic>P</italic><italic>LOS ONE</italic>, 21, e0340645. https://doi.org/10.1371/journal.pone.0340645 <pub-id pub-id-type="doi">10.1371/journal.pone.0340645</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1371/journal.pone.0340645">https://doi.org/10.1371/journal.pone.0340645</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Han, F.</string-name>
              <string-name>Mo, B.</string-name>
            </person-group>
            <year>2026</year>
            <article-title>RUL Prediction Method Based on Sequential Health Index Evaluation with Multidimensional Coupled Degradation Data</article-title>
            <source>PLOS ONE</source>
            <volume>21</volume>
            <pub-id pub-id-type="doi">10.1371/journal.pone.0340645</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B6">
        <label>6.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Wu, M., Zhang, J., Xu, P., Liang, Y., Dai, Y., Gao, T., <italic>et al</italic>. (2025) Bearing Fault Diagnosis for Cross-Condition Scenarios under Data Scarcity Based on Transformer Transfer Learning Network. <italic>Electronics</italic>, 14, Article 515. https://doi.org/10.3390/electronics14030515 <pub-id pub-id-type="doi">10.3390/electronics14030515</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/electronics14030515">https://doi.org/10.3390/electronics14030515</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Wu, M.</string-name>
              <string-name>Zhang, J.</string-name>
              <string-name>Xu, P.</string-name>
              <string-name>Liang, Y.</string-name>
              <string-name>Dai, Y.</string-name>
              <string-name>Gao, T.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Bearing Fault Diagnosis for Cross-Condition Scenarios under Data Scarcity Based on Transformer Transfer Learning Network</article-title>
            <source>Electronics</source>
            <volume>14</volume>
            <elocation-id>515</elocation-id>
            <pub-id pub-id-type="doi">10.3390/electronics14030515</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B7">
        <label>7.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Udu, A.G., Salman, M.T., Ghalati, M.K., Lecchini-Visintini, A., Siddle, D.R. and Dong, H. (2025) Emerging SMOTE and GAN Variants for Data Augmentation in Imbalance Machine Learning Tasks: A Review. <italic>IEEE Access</italic>, 13, 113838-113853. https://doi.org/10.1109/access.2025.3584532 <pub-id pub-id-type="doi">10.1109/access.2025.3584532</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/access.2025.3584532">https://doi.org/10.1109/access.2025.3584532</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Udu, A.G.</string-name>
              <string-name>Salman, M.T.</string-name>
              <string-name>Ghalati, M.K.</string-name>
              <string-name>Lecchini-Visintini, A.</string-name>
              <string-name>Siddle, D.R.</string-name>
              <string-name>Dong, H.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Emerging SMOTE and GAN Variants for Data Augmentation in Imbalance Machine Learning Tasks: A Review</article-title>
            <source>IEEE Access</source>
            <volume>13</volume>
            <pub-id pub-id-type="doi">10.1109/access.2025.3584532</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B8">
        <label>8.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Liu, B., Sang, J., Wang, J., Zhang, R., Zhao, M. and Li, C. (2025) Cross-Condition Fault Diagnosis Method for Hydraulic Systems Based on Domain Adaptation and Ensemble Learning. <italic>Transactions of the Canadian Society for Mechanical Engineering</italic>, 49, 797-814. https://doi.org/10.1139/tcsme-2025-0060 <pub-id pub-id-type="doi">10.1139/tcsme-2025-0060</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1139/tcsme-2025-0060">https://doi.org/10.1139/tcsme-2025-0060</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Liu, B.</string-name>
              <string-name>Sang, J.</string-name>
              <string-name>Wang, J.</string-name>
              <string-name>Zhang, R.</string-name>
              <string-name>Zhao, M.</string-name>
              <string-name>Li, C.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Cross-Condition Fault Diagnosis Method for Hydraulic Systems Based on Domain Adaptation and Ensemble Learning</article-title>
            <source>Transactions of the Canadian Society for Mechanical Engineering</source>
            <volume>49</volume>
            <pub-id pub-id-type="doi">10.1139/tcsme-2025-0060</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B9">
        <label>9.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Wang, H., Zhou, J., Chen, H., Xu, B. and Shen, Z. (2024) Hydraulic System Fault Diagnosis Decoupling Method Based on 2D Time-Series Modeling and Self-Attention Fusion. <italic>Scientific Reports</italic>, 14, Article No. 15620. https://doi.org/10.1038/s41598-024-66541-9 <pub-id pub-id-type="doi">10.1038/s41598-024-66541-9</pub-id><pub-id pub-id-type="pmid">38972880</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1038/s41598-024-66541-9">https://doi.org/10.1038/s41598-024-66541-9</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Wang, H.</string-name>
              <string-name>Zhou, J.</string-name>
              <string-name>Chen, H.</string-name>
              <string-name>Xu, B.</string-name>
              <string-name>Shen, Z.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Hydraulic System Fault Diagnosis Decoupling Method Based on 2D Time-Series Modeling and Self-Attention Fusion</article-title>
            <source>Scientific Reports</source>
            <volume>14</volume>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.1038/s41598-024-66541-9</pub-id>
            <pub-id pub-id-type="pmid">38972880</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B10">
        <label>10.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Gareev, A., Protsenko, V., Stadnik, D., Greshniakov, P., Yuzifovich, Y., Minaev, E., <italic>et</italic><italic>al</italic>. (2021) Improved Fault Diagnosis in Hydraulic Systems with Gated Convolutional Autoencoder and Partially Simulated Data. <italic>Sensors</italic>, 21, Article 4410. https://doi.org/10.3390/s21134410 <pub-id pub-id-type="doi">10.3390/s21134410</pub-id><pub-id pub-id-type="pmid">34199115</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/s21134410">https://doi.org/10.3390/s21134410</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Gareev, A.</string-name>
              <string-name>Protsenko, V.</string-name>
              <string-name>Stadnik, D.</string-name>
              <string-name>Greshniakov, P.</string-name>
              <string-name>Yuzifovich, Y.</string-name>
              <string-name>Minaev, E.</string-name>
            </person-group>
            <year>2021</year>
            <article-title>Improved Fault Diagnosis in Hydraulic Systems with Gated Convolutional Autoencoder and Partially Simulated Data</article-title>
            <source>Sensors</source>
            <volume>21</volume>
            <elocation-id>4410</elocation-id>
            <pub-id pub-id-type="doi">10.3390/s21134410</pub-id>
            <pub-id pub-id-type="pmid">34199115</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B11">
        <label>11.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Zhao, Y., Jiang, A., Jiang, W., Zhang, P. and Xiong, P. (2025) Fault Diagnosis Methods for Imbalanced Samples of Hydraulic Pumps Based on DA-DCGAN. <italic>Scientific Reports</italic>, 15, Article No. 21216. https://doi.org/10.1038/s41598-025-04909-1 <pub-id pub-id-type="doi">10.1038/s41598-025-04909-1</pub-id><pub-id pub-id-type="pmid">40595760</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1038/s41598-025-04909-1">https://doi.org/10.1038/s41598-025-04909-1</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Zhao, Y.</string-name>
              <string-name>Jiang, A.</string-name>
              <string-name>Jiang, W.</string-name>
              <string-name>Zhang, P.</string-name>
              <string-name>Xiong, P.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Fault Diagnosis Methods for Imbalanced Samples of Hydraulic Pumps Based on DA-DCGAN</article-title>
            <source>Scientific Reports</source>
            <volume>15</volume>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.1038/s41598-025-04909-1</pub-id>
            <pub-id pub-id-type="pmid">40595760</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B12">
        <label>12.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Deng, C., Deng, Z., Lu, S., He, M., Miao, J. and Peng, Y. (2023) Fault Diagnosis Method for Imbalanced Data Based on Multi-Signal Fusion and Improved Deep Convolution Generative Adversarial Network. <italic>Sensors</italic>, 23, Article 2542. https://doi.org/10.3390/s23052542 <pub-id pub-id-type="doi">10.3390/s23052542</pub-id><pub-id pub-id-type="pmid">36904745</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/s23052542">https://doi.org/10.3390/s23052542</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Deng, C.</string-name>
              <string-name>Deng, Z.</string-name>
              <string-name>Lu, S.</string-name>
              <string-name>He, M.</string-name>
              <string-name>Miao, J.</string-name>
              <string-name>Peng, Y.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Fault Diagnosis Method for Imbalanced Data Based on Multi-Signal Fusion and Improved Deep Convolution Generative Adversarial Network</article-title>
            <source>Sensors</source>
            <volume>23</volume>
            <elocation-id>2542</elocation-id>
            <pub-id pub-id-type="doi">10.3390/s23052542</pub-id>
            <pub-id pub-id-type="pmid">36904745</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B13">
        <label>13.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Wang, J., Chen, Y., Hao, S., Feng, W. and Shen, Z. (2017) Balanced Distribution Adaptation for Transfer Learning. 2017 <italic>IEEE International Conference on Data Mining</italic> ( <italic>ICDM</italic>), New Orleans, 18-21 November 2017, 1129-1134. https://doi.org/10.1109/icdm.2017.150 <pub-id pub-id-type="doi">10.1109/icdm.2017.150</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/icdm.2017.150">https://doi.org/10.1109/icdm.2017.150</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Wang, J.</string-name>
              <string-name>Chen, Y.</string-name>
              <string-name>Hao, S.</string-name>
              <string-name>Feng, W.</string-name>
              <string-name>Shen, Z.</string-name>
            </person-group>
            <year>2017</year>
            <article-title>Balanced Distribution Adaptation for Transfer Learning</article-title>
            <source>2017 IEEE International Conference on Data Mining (ICDM)</source>
            <volume>18</volume>
            <pub-id pub-id-type="doi">10.1109/icdm.2017.150</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B14">
        <label>14.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Fawwaz, D.Z. and Chung, S. (2020) Real-Time and Robust Hydraulic System Fault Detection via Edge Computing. <italic>Applied Sciences</italic>, 10, Article 5933. https://doi.org/10.3390/app10175933 <pub-id pub-id-type="doi">10.3390/app10175933</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/app10175933">https://doi.org/10.3390/app10175933</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Fawwaz, D.Z.</string-name>
              <string-name>Chung, S.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>Real-Time and Robust Hydraulic System Fault Detection via Edge Computing</article-title>
            <source>Applied Sciences</source>
            <volume>10</volume>
            <elocation-id>5933</elocation-id>
            <pub-id pub-id-type="doi">10.3390/app10175933</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B15">
        <label>15.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Wang, L., Liu, Y., Yin, H. and Sun, W. (2022) Fault Diagnosis and Predictive Maintenance for Hydraulic System Based on Digital Twin Model. <italic>AIP</italic><italic>Advances</italic>, 12, Article 065213. https://doi.org/10.1063/5.0098632 <pub-id pub-id-type="doi">10.1063/5.0098632</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1063/5.0098632">https://doi.org/10.1063/5.0098632</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Wang, L.</string-name>
              <string-name>Liu, Y.</string-name>
              <string-name>Yin, H.</string-name>
              <string-name>Sun, W.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>Fault Diagnosis and Predictive Maintenance for Hydraulic System Based on Digital Twin Model</article-title>
            <source>AIP Advances</source>
            <volume>12</volume>
            <elocation-id>065213</elocation-id>
            <pub-id pub-id-type="doi">10.1063/5.0098632</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
    </ref-list>
  </back>
</article>