Neural surrogates enable rapid fluid simulation, but learning across diverse three-dimensional (3D) geometries requires costly computational fluid dynamics (CFD) labels. We introduce SimpFlow, a pretraining approach that generates supervision from simplified physics on unlabeled geometry libraries. A source-panel potential-flow solver generates velocity and pressure fields for approximately 9,000 3D geometries, capturing geometry-induced acceleration, stagnation, and suction while omitting viscosity and separated wakes. The solver imports only a surface mesh and reuses precomputed velocity fields across inflow directions, enabling inexpensive label generation. In our benchmark, amortized labeling takes 0.111 s per example using four CPU threads. We pretrain a neural surrogate on these labels and fine-tune it on independent CFD datasets. Across five flow tasks, SimpFlow improves over training from scratch in all 24 task-budget settings. With fine-tuning fixed at 200 epochs, interpolation indicates that SimpFlow requires 35-68% fewer CFD training cases to match the error of scratch models trained at each task's largest data budget. These results demonstrate that simplified physical solutions can provide transferable supervision, offering a practical way to reduce the high-fidelity data requirements of fluid surrogates.
Dance motion combines slowly varying body configurations with rapid local movements. We investigate how explicit temporal-frequency decomposition can guide the temporal resolution and codebook capacity of discrete motion representations. We introduce frequency-factorized motion tokenization (FFMT), which separates root-relative motion into a low-frequency choreographic scaffold and a complementary high-frequency residual. FFMT uses a lower token rate and a smaller codebook for the low-frequency component, and a higher token rate and a larger codebook for the high-frequency residual. This representation further induces a plan-then-articulate autoregressive factorization: low-frequency tokens establish coarse choreography, while high-frequency tokens realize local motion details conditioned on the generated plan and music. Experiments on AIST++ and FineDance show strong distributional fidelity while preserving realistic diversity and music--motion synchronization. Ablations consistently support frequency factorization, asymmetric temporal allocation, and low-to-high conditioning.
He Wang, Yeye Liu, Ruijie Li, Xuemei Jiang, Junyu Wu, Lining Liu Zhuoqi Man, Tao Li, Yanjie Song
原文摘要
Agile Earth observation satellites must coordinate imaging tasks within limited observation windows, while accounting for attitude maneuvering and onboard energy constraints. Competition among observation opportunities makes scheduling performance sensitive to the heuristic rules used for task selection. This letter proposes a large language model (LLM)-assisted adaptive heuristic search method for agile Earth observation satellite scheduling. The LLM generates an initial heuristic rule according to the characteristics of the scheduling instance. During the subsequent ant colony search, search performance and scheduling information are fed back to the LLM to refine the heuristic rule. The proposed modifications are evaluated through paired solution constructions before being incorporated into the search process. A unified scheduling procedure determines task selection, satellite assignment, and observation timing under the operational constraints. Experiments on six scheduling scenarios involving 50--200 imaging tasks demonstrate that the proposed method achieves 4.3\%--9.6\% higher mean observation benefit than the strongest baseline.