用拓扑方法首次定义了混乱流,并修正了经典流动图谱的预测偏差。
Topological Characterization of Churn Flow and Unsupervised Correction to the Wu Flow-Regime Map in Small-Diameter Vertical Pipes
- 基于欧拉特征表面构建拓扑描述符,结合气体速度进行无监督学习
- 在37组实验中86%的权重来自拓扑特征,提升对混乱流的识别精度
- 无需标注数据即可达到95.6%准确率,适合小样本流动分析场景
垂直两相流中的混乱流(churn flow)长期缺乏定量数学定义。本文首次提出基于欧拉特征表面(ECS)的拓扑表征方法,将无监督流型发现建模为多核学习(MKL),融合时间对齐($L^1$距离于$χ(s,t)$表面)与振幅统计(均值、标准差、最大/最小值)两类拓扑核,以及气相速度。在蒙大拿科技学院37组未标注气水实验中,自校准框架学习到权重:$β_{ECS}=0.14$,$β_{amp}=0.50$,$β_{ugs}=0.36$,其中拓扑特征占比达64%。基于拓扑推断的液塞/混乱流转变点比吴等(2017)预测值高3.81 m/s(2英寸管)。跨设施验证在德州农工大学947张图像上确认混乱流拓扑复杂度是液塞流的1.9倍($p < 10^{-5}$)。对45组伪实验应用同一框架,实现95.6%四分类准确率与100%混乱流召回率,无需任何标注数据,性能媲美甚至超越需数千标注样本的有监督模型。本工作首次提供混乱流的数学定义,并证明无监督拓扑描述符可挑战并修正广泛采用的机理模型。
原文摘要 · Abstract (English)
Churn flow-the chaotic, oscillatory regime in vertical two-phase flow-has lacked a quantitative mathematical definition for over $40$ years. We introduce the first topology-based characterization using Euler Characteristic Surfaces (ECS). We formulate unsupervised regime discovery as Multiple Kernel Learning (MKL), blending two complementary ECS-derived kernels-temporal alignment ($L^1$ distance on the $χ(s,t)$ surface) and amplitude statistics (scale-wise mean, standard deviation, max, min)-with gas velocity. Applied to $37$ unlabeled air-water trials from Montana Tech, the self-calibrating framework learns weights $β_{ECS}=0.14$, $β_{amp}=0.50$, $β_{ugs}=0.36$, placing $64\%$ of total weight on topology-derived features ($β_{ECS} + β_{amp}$). The ECS-inferred slug/churn transition lies $+3.81$ m/s above Wu et al.'s (2017) prediction in $2$-in. tubing, quantifying reports that existing models under-predict slug persistence in small-diameter pipes where interfacial tension and wall-to-wall interactions dominate flow. Cross-facility validation on $947$ Texas A&M University images confirms $1.9\times$ higher topological complexity in churn vs. slug ($p < 10^{-5}$). Applied to $45$ TAMU pseudo-trials, the same unsupervised framework achieves $95.6\%$ $4$-class accuracy and $100\%$ churn recall-without any labeled training data-matching or exceeding supervised baselines that require thousands of annotated examples. This work provides the first mathematical definition of churn flow and demonstrates that unsupervised topological descriptors can challenge and correct widely adopted mechanistic models.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。