A Distributed Computing Framework for Satellite Swarms
本文提出一种基于CRDT的分布式计算框架,用于解决大规模卫星群的自主控制和容错问题,减少了地面与卫星间的通信量。
本文提出一种基于CRDT的分布式计算框架,用于解决大规模卫星群的自主控制和容错问题,减少了地面与卫星间的通信量。
FPScan通过基于抽象解释的静态分析和SMT求解器检测浮点程序中的吸收和灾难性抵消问题。
To address the scarcity of labeled images in GNSS multipath interference detection, this paper proposes a semi-supervised manifold learning method based on the Wasserstein distance. The method leverages optimal transport theory to construct an implicit graph structure, embedding the Wasserstein distance—as a geometrically meaningful similarity metric between samples—into a label propagation mechanism within a deep convolutional neural network framework, enabling robust classification under low-labeling-rate regimes. Compared with fully supervised baselines, the proposed approach achieves significant improvements in classification accuracy across diverse signal conditions, especially when the labeling rate falls below 20%. Its core contribution lies in the first integration of the Wasserstein distance into semi-supervised graph-based learning, effectively capturing both geometric structure and distributional discrepancies in high-dimensional feature spaces. This enhances model sensitivity to sparse annotations and improves generalization capability.
本文提出一种基于CRDT的分布式计算框架,用于解决大规模卫星群的自主控制和容错问题,减少了地面与卫星间的通信量。
FPScan通过基于抽象解释的静态分析和SMT求解器检测浮点程序中的吸收和灾难性抵消问题。
To address the scarcity of labeled images in GNSS multipath interference detection, this paper proposes a semi-supervised manifold learning method based on the Wasserstein distance. The method leverages optimal transport theory to construct an implicit graph structure, embedding the Wasserstein distance—as a geometrically meaningful similarity metric between samples—into a label propagation mechanism within a deep convolutional neural network framework, enabling robust classification under low-labeling-rate regimes. Compared with fully supervised baselines, the proposed approach achieves significant improvements in classification accuracy across diverse signal conditions, especially when the labeling rate falls below 20%. Its core contribution lies in the first integration of the Wasserstein distance into semi-supervised graph-based learning, effectively capturing both geometric structure and distributional discrepancies in high-dimensional feature spaces. This enhances model sensitivity to sparse annotations and improves generalization capability.