跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1111新增论文
+874其中 AI 相关
+133已有论文修订
+97新增 AI 导读

arXiv 最近完成扫描:2026-11-20 08:48 · 全站最近入库:2026-11-19 19:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-19 09:52 — 2026-11-20 09:52(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-20 08:48最近发现新增版本:2026-11-19 19:09库内论文最新更新时间:2026-11-19 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

27,982 已收录论文23,249 AI 相关8,559 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 261 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 08:46(北京时间)
版本更新 · v3arXiv:2610.11028

Synchronization Reveals Market Structure That Classical Randomness Tests Cannot Detect

Nam H. Le

原文摘要

Whether asset prices contain structure beyond a random walk is classically assessed with variance-ratio tests of the random-walk hypothesis. Synchronization measures from physics, notably the Kuramoto order parameter applied across trading timescales, have been proposed as an alternative diagnostic of market state, but they have been validated on single asset classes and never compared with the variance-ratio test on the same data. We compute a cross-timeframe Kuramoto coherence measure and a heteroskedasticity-robust Lo-MacKinlay variance ratio on identical windows for 61 instruments spanning cryptocurrencies, foreign exchange, metals, equity indices and single-name equities. The two diagnostics are statistically independent. We explain this analytically: coherence decomposes exactly into a direction-agreement channel and a volatility-agreement channel, and under sign-symmetric returns the direction channel is independent of the variance ratio and of every other statistic built from squared returns; simulations confirm the prediction. Coherence tracks the directional cleanliness of recent price moves in all five asset classes, whereas the variance-ratio test cannot reject the random walk for most of the panel. Held to finance benchmarks with strict information timing, however, coherence adds almost nothing to heterogeneous autoregressive volatility forecasts out of sample, and trading rules built on it earn no gross return outside cryptocurrency, where trading the coherence direction at high coherence breaks even at about five basis points per round trip. Failing to reject weak-form efficiency therefore does not rule out directional structure, but the structure that synchronization reveals is mostly descriptive and economically thin.

cs.CE

新论文 · v1arXiv:2611.17931

MineralExp: Benchmarking LLM Agents for Experimental Design in Real-World Mineral Exploration

Bing Wang, Mingyang Wang, Yuanhang Mi, Yue Xu, Kaibo Su, Li'ang Xiao, Chunguo Wu, Changchun Li 等 11 位作者

原文摘要

In mineral exploration, verifying geological hypotheses relies on designing a variety of geochemical experiments. While large language model (LLM) agents increasingly automate downstream geoscientific data analysis, a crucial upstream capability remains largely unexplored: automated geochemical experimental design, i.e., deciding which experiments to conduct before committing to costly laboratory work. Evaluating this capability of LLM agents is difficult for two reasons. First, geochemical experiments exhibit high methodological diversity and subjectivity: to test the same hypothesis, different geologists may choose different minerals and instruments, so no single protocol can serve as the reference answer. Second, open-ended experimental plans resist representation as structured labels, which makes objective scoring difficult. To address these challenges, we introduce MineralExp, a benchmark that reformulates geochemical experimental design as a hypothesis-based experiment selection problem, i.e., a multi-label classification problem. We abstract concrete instrument names and procedural details into a shared taxonomy of 19 experimental types across five mineral-system processes: Source, Transport, Deposition, Modification, and Preservation. This taxonomy yields deterministic multi-label targets while accommodating diverse experimental protocols. Constructed from published ore-deposit literature and verified by domain experts, MineralExp comprises 277 cases and 1,572 reference experimental plans. Given a geological hypothesis and initial context, an LLM agent selects the relevant tasks and generates concrete experimental plans, which are scored by multi-label classification metrics and an LLM-as-a-Judge metric. The experimental results show that current agents generally achieve high recall but low precision, tending to propose more experiments than are necessary to test the hypothesis.

cs.CL · cs.AI · cs.CE

新论文 · v1arXiv:2611.17892

Hierarchical Bayesian physics-augmented neural networks for populations of hyperelastic laws: specimen variability and uncertainty from scarce, noisy data

Vincent C. Scholz, Phaedon-Stelios Koutsourelakis

原文摘要

The hyperelastic law of a material such as soft tissue differs between specimens, and often only a few specimens can be tested. Physics-augmented neural networks (PANNs) learn such laws from data without a prescribed functional form while keeping them physically admissible, and Bayesian versions of related models quantify the uncertainty of the law of one specimen or of a pooled group of specimens. A pooled fit, however, attributes the differences between specimens to measurement noise or to uncertainty about a mean law, and neither describes a new specimen. We first develop a Bayesian PANN for one specimen, whose priors keep the learned law plausible for few, noisy data. We then extend it to a hierarchical Bayesian PANN, a nonlinear mixed-effects model in which all specimens share learned polyconvex features and each specimen is a draw from a population of laws. Features, specimens, and population are inferred jointly by variational inference, with a separate model of the measurement noise, so that the variability between specimens is not mistaken for noise, the population carries its own uncertainty, and every specimen drawn from it is polyconvex. The population predicts the response of new specimens with credible intervals, without data or from a partial test, and assigns them to cohorts with quantified uncertainty, all without a prescribed form of the law. On synthetic populations, it recovers the population from few specimens and predicts new specimens more reliably than three published methods. On Treloar's rubber and on healthy and aneurysmal aortas, it reaches the accuracy of a deterministic PANN and assigns no aorta specimen to the wrong cohort with confidence, although it underestimates the uncertainty of untested curves.

cs.CE · cs.LG · stat.ML

新论文 · v1arXiv:2611.17822

Scalar Entropic Damage Transport: Well-posed softening with a single damage variable

Jonas Nutz, Vikram Laheri, Matti Schneider

原文摘要

Entropic Damage Transport (EDT) represents material softening via a local continuum damage model while ensuring the well-posedness of the mechanical boundary value problem. It is based on a convexification of the time-incremental potential associated with a rate-limited scalar damage model. A one-dimensional distribution of damage states serves as the internal variable, and the number of these states grows with the number of time steps. We show that the emergence of the damage distribution is an artifact of the time discretization. Surprisingly, the distribution concentrates at a single damage state in the time-continuous limit, and EDT converges to a rate-limited damage model with a scalar damage variable, whose free energy is jointly convex in the strain and the reciprocal degradation. We exploit this hidden convexity by a frozen-metric discretization in terms of the reciprocal degradation, which renders every increment jointly convex. The resulting scalar update preserves damage irreversibility, the prescribed damage-rate limitation and thermomechanical consistency, reduces to a scalar equation and provides a symmetric and positive definite algorithmic tangent in closed form. Computational experiments assess the accuracy and the efficiency of both formulations from the material point to the microstructure level, and demonstrate that the scalar update permits a finite-element computation of industrial size with more than 14 million degrees of freedom.

cs.CE · math.NA

新论文 · v1arXiv:2611.17693

SPLIT-MOR: Fast and Accurate Model Order Reduction for Nonlinear Transient Thermal Simulation of 2.5D/3D ICs

Zebin Shi, Tianxiang Zhu, Yibo Lin, Runsheng Wang

原文摘要

Fast and accurate transient thermal simulation is essential to thermal reliability analysis and dynamic thermal management of advanced packages, and model order reduction (MOR) techniques are widely applied to overcome the efficiency bottleneck of rigorous numerical methods. However, nonlinear terms including temperature-dependent leakage power, thermal conductivity, and heat capacity prevent the application of conventional linear MOR, while hyper-reduction solutions require costly nonlinear training data. In this work, we propose SPLIT-MOR (Subdomain-wise Piecewise Linearization with Interval Tensors), a novel nonlinear MOR method that requires no additional training set. SPLIT-MOR computes reduced component tensors by subdomain clustering and temperature-interval partitioning in the offline stage, and updates the reduced coefficient matrices and load vectors efficiently in the online stage. Experimental results show that the online solving time of SPLIT-MOR achieves up to an 830x speedup over COMSOL and a 7.5x speedup over the state-of-the-art hyper-reduction method MDEIM, with a 27x total reduction in the offline time. The relative average error remains below 0.11%, and the maximum error is below 0.86 degrees Celsius, demonstrating the high accuracy of our method.

cs.CE

版本更新 · v2arXiv:2609.37670

MeanFlowAdvantage: Stable Reward Fine-Tuning for Few-Step Average-Velocity Generators

Haocheng Tang, Tianchi Xie, Xingqiao Lin

原文摘要

MeanFlow enables efficient few-step generation by predicting interval-average velocities, but this representation creates a mismatch for reward fine-tuning: existing advantage-based objectives are typically defined on instantaneous velocities or equivalent $x_0$-space predictions, whereas inference directly uses the learned average-velocity map. We introduce MeanFlowAdvantage, a signed advantage-weighted least-squares objective for average-velocity generators. Our key construction uses a shared, detached MeanFlow derivative correction to express the reward objective in prediction space while making rollout and reference regularization exact penalties on the average-velocity network deployed at inference. The resulting formulation preserves MeanFlow's native few-step sampler and provides a direct mechanism for transferring reward improvements to the deployed flow map. On SD3.5-Medium, MeanFlowAdvantage improves all eight reported metrics over the matched four-step MeanFlowNFT baseline and, with only four NFEs, matches or exceeds the 40-step DiffusionNFT baseline on six of eight metrics. The same objective also transfers to DNA promoter design, where it supports both teacher-free on-policy RL for a generator defined on a manifold and teacher-guided reward-graded distillation, with the latter yielding the lowest one-step Sei profile MSE among the compared configurations.

cs.AI · cs.CE · cs.CV

新论文 · v1arXiv:2611.17548

Mechanism-Level Chemical Reaction Simulation with Electron Bookkeeping Transformer

Sarah Cao, Shitong Luo, Connor W. Coley

原文摘要

Modeling chemical reaction mechanisms is central to understanding and predicting chemical reactivity. We present Electron Bookkeeping Transformer (Bookkeeper), a data-driven model that simulates chemical reactions at mechanistic resolution by generating electron movement trajectories. Following the symbolic arrow-pushing formalism in chemistry, Bookkeeper explicitly models each electron as a token and predicts its movement sequentially, ensuring mass and charge conservation during both elementary step and reaction pathway predictions by construction. On reaction-size-balanced test sets, Bookkeeper improves top-1 elementary-step accuracy, top-1 pathway rank accuracy, and top-1 to top-5 product prediction accuracy over FlowER. On the entire test set, it achieves higher elementary-step top-1 accuracy but lower pathway accuracy than FlowER. Bookkeeper also samples elementary steps substantially faster, adapts to several unseen reaction types with minimal fine-tuning, and generates candidate chemical transformations for further screening. These results suggest that explicit electron bookkeeping is a useful framework for virtually screening chemical reactions across diverse reagents, validating computer-assisted synthesis planning predictions, and providing mechanistic interpretations of reactivity.

cs.CE · q-bio.BM

新论文 · v1arXiv:2611.17503

Multifidelity Operator Inference for Dynamical Systems

Vignesh Sella, Anirban Chaudhuri, Karen Willcox

原文摘要

This paper presents a multifidelity (MF) formulation of Operator Inference (OpInf) for learning non-intrusive, physics-based reduced-order models (ROMs) of nonlinear dynamical systems. OpInf learns reduced operators from projections of snapshot data by solving a least squares regression problem. However, generating high-fidelity snapshots can be computationally expensive, limiting parameter coverage and the temporal extent of training trajectories for many aerospace applications, which can lead to inaccurate or unstable ROM predictions. This work proposes MF-OpInf, which combines limited high-fidelity snapshots with more plentiful low-fidelity snapshots through a control-variates-inspired MF least squares formulation to learn a single set of reduced operators across multiple trajectories. Low-fidelity trajectories provide additional parameter coverage and extend beyond the high-fidelity training time horizon. The low-fidelity snapshots are also used to construct an improved reduced basis through weighted proper orthogonal decomposition. We demonstrate MF-OpInf on a nonlinear reaction-diffusion problem with parametrized sinusoidal forcing and a two-dimensional incompressible flow past a cylinder with a parametrized inlet pulse. In these experiments, under an equal training simulation budget, MF-OpInf reduces the mean relative prediction error at unseen parameters by up to $87\%$ for the reaction-diffusion problem and $28\%$ for the cylinder flow problem over the test time regime, which extends beyond the high-fidelity training time horizon. These results demonstrate that MF-OpInf can improve temporal extrapolation and prediction at unseen parameters without increasing the training simulation budget.

stat.ML · cs.CE · cs.LG · math.NA

新论文 · v1arXiv:2611.17498

New Closed-Form Approximations in Statistical Mechanics Obtained by Symbolic Regression

Omkar Kunjir, Alina Popova, Rasul Abdusalamov, Mikhail Itskov

原文摘要

Obtaining accurate and analytically tractable closed-form expressions for complex physical systems remains a fundamental challenge in statistical mechanics. In this work, we investigate three approximation problems in polymer statistical mechanics using two complementary symbolic regression frameworks: Deep Symbolic Optimization (DSO), based on reinforcement learning, and PyOperon, based on genetic programming with nonlinear least-squares constant optimization. First, for the force-extension relationship of the Worm-Like Chain (WLC) model, DSO achieves a maximum relative error below 0.15%, while PyOperon reduces it to 0.05%, outperforming the Marko-Siggia formula (approximately 17%) and the Petrosyan approximation. Second, for the logarithmic factorial, ln(n!), both frameworks recover the dominant structure of Stirling's formula directly from analytical data. Using residual learning on a continued-fraction expansion of the Stirling remainder, PyOperon reduces the maximum relative error by a factor of 1.3 x 10^4 compared with the most accurate of nine classical approximations for n in [1, 30]. Third, for the non-Gaussian radial probability density of the Freely Jointed Chain (FJC) model, physics-informed residual learning improves the approximation by factors of 11.2 over Darabi et al. (2023) and 4.6 over the steepest-descent approximation. The discovered expressions remain analytically tractable across all three applications. These results demonstrate the complementary capabilities of DSO and PyOperon for discovering accurate closed-form approximations in statistical and continuum mechanics.

cs.CE

新论文 · v1arXiv:2611.17258

JOINTS:可重复使用混凝土构件可拆卸干连接分类与解析评估

JOINTS: Classification and analytical evaluation of detachable dry connections for reusable concrete elements

Julius Fründt, Vladislav Gudžulić, Günther Meschke, Roger A. Sauer

AI 速读 基于摘要

提出可拆卸干连接的五维分类体系JOINTS并加入评分维度,对三种后张预应力下的代表性节点构型进行解析评估。

cs.CE

查看原文摘要

This paper presents a systematic classification for detachable dry joints suitable for the structural reuse of reinforced concrete elements, together with an analytical evaluation of representative configurations. The classification, named JOINTS and applicable to concrete connections beyond the reuse context, organizes the design space along five categories whose initials spell JOINT: the Juxtaposition (spatial arrangement of the paired elements), the Origin (their prior structural function), the Interface geometry, the Newly introduced materials at the joint, and the force-Transfer mechanism. A sixth category, the Score, completes the acronym and evaluates each configuration for sustainability, cost-efficiency, and mechanical performance. From this design space, three representative configurations are evaluated analytically under active post-tensioning, differing in both their joint geometry (planar, stepped, and angled) and their tendon inclination. The evaluation covers failure of the anchorage of the post-tensioning member, the contact limit of the interface, and the material limit of the concrete adjacent to the interface. Although complex joint geometries theoretically enhance interlocking, their benefit is limited by the compressive-shear strength of the concrete. The reinforcement of the reused elements may be damaged near the cut, and the splitting reinforcement that a conventional design would require is not guaranteed to exist. The present analysis therefore conservatively assumes that the concrete at the joint face alone resists the combined compression and shear, neglecting any residual contribution from the existing reinforcement. This analytical evaluation represents a first step toward quantifying the score over a parametric range of connections, here focusing on the mechanical criterion.

新论文 · v1arXiv:2611.17226

面向协同过滤的LightGCN层论启发式结构化评分扩展

Sheaf-Inspired Structured Scoring Extensions of LightGCN for Collaborative Filtering

Ksenia Belkovskaya, Timur Lidzhiev, Maria Stebliy, Alexander Tarakanov

AI 速读 基于摘要

在固定三层LightGCN骨干上比较多种成对结构化评分器,考察其对排序质量与目录覆盖度的影响。

cs.IR · cs.CE · cs.CG · cs.LG

查看原文摘要

Graph-based collaborative filtering learns user and item representations by propagating embeddings over a user--item interaction graph. We investigate a modular, sheaf-inspired scoring extension placed on top of a three-layer LightGCN backbone. The motivation comes from cellular sheaves, where local vector spaces are related by linear restriction maps; here, this idea motivates structured, pair-dependent transformations of user and item embeddings rather than a change to graph propagation. We compare the identity inner-product scorer, diagonal, rank-one low-rank, and full matrix residual scorers, and a parameter-matched residual MLP baseline (\texttt{mlp\_full}) on Amazon-Book, Gowalla, MovieLens-1M, and Yelp2018. We report ranking quality and catalog coverage at cutoffs 10 and 20. The selected structured variants show modest, dataset-dependent changes in ranking quality and sometimes substantial changes in coverage. Our method is inspired by sheaf geometry but does not construct a cellular sheaf or implement sheaf-Laplacian diffusion; the experiments therefore do not establish a causal benefit from sheaf geometry itself.

新论文 · v1arXiv:2611.17156

面向颗粒流动力学高效粒子分辨预测的分层图神经网络

A hierarchical graph neural network for efficient particle-resolved prediction of granular flow dynamics

Kuang Shi, Qingqi Zhao, Teng Man, Sergio Andres Galindo-Torres, Yimin Lu

AI 速读 基于摘要

作者提出分层粗粒化图神经网络HCG-GNN,在粗图与粒子图上联合传递信息,以较低计算成本实现颗粒流动力学的粒子级预测。

cs.CE

查看原文摘要

Graph neural surrogates for granular flow can resolve the motion of individual grains, but propagating information across a large amount of grains requires repeated, costly updates on the full particle graph. This study introduce a Hierarchical Coarse-Grained Graph Neural Network (HCG-GNN) that couples direct interactions between neighboring grains with information exchange on two coarser graphs of occupied spatial cells. In discrete element method (DEM) benchmarks of granular flows down incline planes, HCG-GNN captured key flow characteristics, including front propagation, lateral spreading, deposition morphology, free surface evolution, internal shear behavior, and energy conversion. Results also show that preserving grain-specific features as coarse information returned to the particle graph and integrating predicted accelerations to advance particle motion both improved multi-step accuracy. With 5 of its 7 message-passing steps performed on coarse graphs, HCG-GNN achieved accuracy comparable to a conventional particle-level GNN with a 6.47-fold training speedup and 46.2% lower GPU memory use. A model trained on up to 5000 grains predicted a 2 s release of 10000 grains in 31 s, compared with 2000 s for DEM under the benchmark conditions. This combination of speed and grain-scale resolution supports particle-resolved inverse design, with prescribed runout or discharge targets guiding the search for suitable geometries and grain dynamics revealing the basis for differences in performance.

新论文 · v1arXiv:2611.17152

AeroZoo:面向空气动力学基础模型的良定流动问题基准

AeroZoo: A Benchmark of Well-Posed Flow Problems for Foundation Models of Aerodynamics

Peter Sharpe, Carmelo Gonzales, Corey Adams, Mehdi Ataei, Sanjay Choudhry

AI 速读 基于摘要

作者提出 AeroZoo 基准与训练语料,用 3,815 个 RANS 时均解覆盖多几何族、多外罩配置与宽雷诺数范围,并设计按几何族、外罩、边界条件布局和雷诺数范围留出的冻结划分,以检验空气动力学基础模型的跨分布泛化能力。

cs.LG · cs.CE · physics.flu-dyn

查看原文摘要

Neural surrogates for computational fluid dynamics (CFD) are trained and ranked on datasets that each vary one design family in one flow domain. Such datasets cannot test the least that an aerodynamic foundation model must do: predict CFD-quality incompressible flow in seconds for new shapes in new enclosures. On DrivAerML, larger models and longer training barely lower Transolver's error; doubling the training cases cuts it by about 12% up to 400 cases, exhausting the dataset. We introduce AeroZoo, a benchmark and training corpus of 3,815 time-mean solutions to the unsteady Reynolds-averaged Navier--Stokes (RANS) equations with a transition model, across seven geometry families, eight enclosure configurations and Reynolds numbers from $10^3$ to $10^8$. Each sample poses a well-posed PDE problem in the form a solver receives it: the boundary meshes grouped by condition type, the prescribed values and the fluid properties. The 2,816 samples with a stable time mean form the canonical benchmark: two tasks, engineering metrics and 22 frozen splits, disjoint in geometry, that hold out geometry families, enclosures, boundary-condition layouts and Reynolds ranges. On the random split, boundary-condition tokens cut GeoTransolver's median velocity error from 76.9% to 8.4% of the inlet speed in single-seed runs (uniform inlet flow: 11.0%). ISLA, a transformer for boundary-driven PDEs, reaches 5.3% over four seeds, about 4 times the change from a finer mesh. On the same test samples, a held-out geometry family barely changes ISLA's error relative to uniform flow, and a held-out enclosure or boundary-condition layout raises it 2.4 to 9.2 times. The data and the scoring code will be released.

新论文 · v1arXiv:2611.16874

随机核模态分解:信息、不确定性与条件状态推断

Stochastic Kernel Mode Decomposition: Information, Uncertainty, and Conditional Regime Inference

Boumediene Hamzi, Houman Owhadi

AI 速读 基于摘要

sKMD 研究在测量质量变化时模态能量能否保留状态信息,并给出能量充分性的理论条件与实验验证。

stat.ML · cs.CE · cs.LG · math.DS · nlin.PS

查看原文摘要

When do mode energies preserve regime information as measurement quality changes? Stochastic Kernel Mode Decomposition (sKMD) fits joint regime laws on signed KMD mode coordinates and transfers the reference mode posterior to regime probabilities and conditional reconstructions. For centered Gaussian regimes with independently varying known noise variances, fixed coordinate energies retain the full regime posterior precisely when all classes share their cross-covariances and class variances can differ only at isolated vertices of the covariance graph. We extend the characterization to nonzero means and show that freely varying correlated noise forces a fixed linear log-odds decoder to retain the full quadratic feature span even for two distinct centered regimes. At fixed quality, a three-regime example has no sufficient two-energy basis. Its smallest Bayes log-loss gap over bases of condition number at most $κ$ has sharp order $κ^{-1}$. Exact Bayes energy posteriors supply numerical gap estimates for specified bases. Additional bounds relate feature compression, independently learned mode spans and sensor-noise error to log loss. Two controlled experiments with 64 independent panels each show that signed information can improve prediction over energy summaries, while integration gives small gains over strong signed controls and depends on how the competing point rule is calibrated and how accurately observation noise is measured.

版本更新 · v2arXiv:2610.31996

面向目标结构动态减振的多材料拓扑优化

Multi-Material Topology Optimization for Targeted Structural Dynamic Vibration Attenuation

Bir Bahadur Chaudhary, Bidhan Pandey, Bin Ouyang, Shiguang Deng

AI 速读 基于摘要

提出一种多材料拓扑优化框架,通过新型插值方案、基于界的优化列式和平滑频带约束,解决基于特征频率的减振优化中的数值困难,并系统比较三种动态减振优化列式。

cs.CE

查看原文摘要

Resonance-induced structural vibrations can compromise the performance, reliability, and service life of engineering structures. Multi-material topology optimization (MMTO) offers a promising approach to vibration attenuation by tailoring the spatial distributions of material constituents to optimize structural stiffness, mass, and natural frequencies. However, existing eigenfrequency-based MMTO methods face several challenges, including the need for flexible interpolation of multiple material properties, non-smooth optimization objectives associated with mode switching and repeated eigenvalues, and numerical difficulties in imposing differentiable constraints to exclude natural frequencies from prescribed operating frequency ranges. To address these challenges, we propose a novel MMTO framework for structural vibration attenuation based on several innovations: (1) a novel multivariate weight-based multi-material interpolation scheme to simultaneously represent material stiffness and mass density, (2) a bound-based optimization formulation to improve the smoothness and stability of gradient-based optimization by addressing mode switching, and (3) a smooth frequency-band formulation to smoothly approximate the discontinuous Heaviside function while enabling differentiable frequency-band constraints. Additionally, we systematically investigate and compare three different topology optimization formulations for dynamic vibration attenuation, including maximizing the fundamental eigenfrequency, maximizing the gap between adjacent eigenfrequencies, and excluding natural frequencies from prescribed frequency bands. Furthermore, we present the detailed derivation of analytical design sensitivities for the three formulations.

新论文 · v1arXiv:2611.16798

赫兹球体与无限瑞利梁的横向冲击

Transverse impact of a Hertzian sphere with an infinite Rayleigh beam

Saranya Biswas, Anindya Chatterjee

AI 速读 基于摘要

研究赫兹球体对无限瑞利梁的冲击,通过伽辽金投影降阶并揭示三种冲击区域。

cs.CE

查看原文摘要

We study the impact of a Hertzian sphere on an infinite Rayleigh beam, which presents both interesting possibilities for numerical approximation as well as new insights in the multiple-contact-event regime. Here, Galerkin projection using an abstract continuous variable replaces the history-dependent convolution in the impact equations by a system of local-in-time ordinary differential equations. The corresponding approximate solutions are validated against direct numerical solution of the convolution-based formulation and show agreement. Unlike the corresponding Euler-Bernoulli beam impact problem, which is governed by a single nondimensional parameter, the Rayleigh beam impact dynamics is governed by two nondimensional parameters. A parametric study reveals three distinct impact regimes: one regime with a single contact followed by permanent separation, a second regime with a single contact that is sustained thereafter, and an intervening regime with initial separation followed by multiple contact events with diminishing amplitudes, leading eventually to sustained contact. Short- and long-time asymptotic analyses are used to characterize the boundaries between the permanent separation and the re-contact regimes in different parameter regimes. The three significant new aspects of this paper are the system itself (Rayleigh beam instead of Euler Bernoulli beam), the model order reduction achieved through Galerkin projection in an abstract domain, and the detailed parametric study leading to a simple qualitative picture of possible behaviours.

版本更新 · v2arXiv:2610.11522

A joint error metric for scoring CFD against wind tunnel data, scaled by the robust spread of the participants (AutoCFD5 Case 2)

Hendrik Hetmann, Charles Mockett

原文摘要

Case 2 of the 5th Automotive CFD Prediction Workshop (AutoCFD5) compares the participants' CFD results with wind tunnel measurements of surface pressure, velocity profiles and force coefficients. To place each run on a diagram of error against computational cost, these quantities must be combined into one number. This note defines that number, the joint error. Following the practice of interlaboratory proficiency testing (ISO 13528), every deviation from the experiment is expressed in units of the spread of the participants' results at that point, estimated robustly with the standard's Algorithm A. The point-wise spreads are pooled into one scale per component, so that every measurement point carries equal weight within its component. Configurations 2a and 2b share these scales and are compared only on the measurements both have, so that their errors can be shown on one diagram. The joint error is a fixed weighted sum of five component errors. The scales are computed once from all AutoCFD5 submissions received by 28 October 2026 and then frozen, so that scores are reproducible and comparable across workshops.

cs.CE

新论文 · v1arXiv:2611.16357

Optimal Seat Movement Strategies Among Modular Bus Units

Shiyue Wang, Yuhao Liu, Zhibin Chen, Mingyang Pei, Changhong Lu

原文摘要

Movable seats enable passengers to transfer between coupled modular bus units while remaining seated, but require physical reconfiguration that existing modular transit models largely abstract away. We model seat reconfiguration as a colored generalized sliding-tile puzzle on the physical track graph, capturing simultaneous movements, seat indistinguishability within destination groups, and vertex, edge, and corner-following conflicts. A lexicographic objective minimizes makespan first and then the sum of costs (SoC), which penalizes movements and waiting at non-target positions. We develop an exact time-expanded mixed-integer linear programming formulation and a Boundary-Sequence Dynamic Programming (BSDP) algorithm. BSDP decomposes the problem at single-edge module interfaces and coordinates local schedules through compressed boundary-crossing sequences, provably preserving feasibility and optimal costs. On two- and three-module benchmarks, BSDP achieves mean per-instance speedups of 3.24x and 6.30x over Gurobi, respectively. In fixed-horizon tests with four to seven modules, both methods start from identical greedy schedules and receive a 300 s budget. BSDP obtains lower final SoC than Gurobi on 197 of 200 instances and ties on three, reducing mean final SoC by 17.93%-69.07% across the four size classes. Geometry sensitivity and ablation studies further clarify the contribution of boundary compression to computational performance. The framework links seat reconfiguration to the timing and operational cost of modular bus decoupling.

cs.CE · math.OC

新论文 · v1arXiv:2611.16197

Mechanical behaviour of the intact brain-skull interface under tension, compression and shear

Sajjad Arzemanzadeh, Karol Miller, Ron Kikinis, Adam Wittek

原文摘要

The brain-skull interface governs the boundary/contact conditions of the brain in computational head models, yet its mechanical behaviour remains poorly characterised experimentally. We characterised the brain-skull interface by testing brain-skull complex samples (skull bone, meninges and brain tissue in their native arrangement) excised from 19 sheep cadaver heads under uniaxial tension and compression at strain rates of 0.002, 0.02 and 0.2 s$^{-1}$ and simple shear at 0.02 s$^{-1}$. Histology confirmed that the meningeal layers remained intact and attached to the brain and skull after excision. We acquired magnetic resonance images of every sample, reconstructed their geometry and developed a sample-specific finite element model of each experiment. We represented the brain tissue using a second-order Ogden hyperelastic model and the brain-skull interface using a cohesive zone model. Using inverse finite element analysis, we first calibrated the brain tissue parameters for each subject. Keeping these parameters fixed, we then identified the interface parameters from the corresponding brain-skull complex specimen. The brain tissue shear modulus increased with strain rate from 0.94 $\pm$ 0.16 kPa at 0.002 s$^{-1}$ to 1.60 $\pm$ 0.30 kPa at 0.2 s$^{-1}$. In contrast, the interface properties (maximum normal traction 2.35 $\pm$ 0.81 kPa, maximum tangential traction 4.14 $\pm$ 0.97 kPa, and fracture energy 0.35 $\pm$ 0.14 N m$^{-1}$) showed no significant dependence on strain rate or loading mode. In all samples, failure occurred within the subarachnoid space. Neither a rigid brain-skull connection nor frictionless sliding contact with separation reproduced the measured mechanical response or failure mode of the brain-skull interface. Our experimentally derived cohesive zone model provides a realistic representation of the brain-skull interface for computational head models.

cs.CE

版本更新 · v2arXiv:2606.31248

Scaling Storm-Resolving Atmospheric AI Simulation to the Entire Planet

Zeyuan Hu, Akshay Subramaniam, Noel Keen, Tao Ge, Jaideep Pathak, Mohammad Shoaib Abbas, Suman Ravuri, Karthik Kashinath 等 12 位作者

原文摘要

Kilometer-scale convection shapes precipitation extremes, tropical organization, and cloud feedbacks, but most global atmospheric models approximate these processes at 25-100 km resolution. Global storm-resolving physics models resolve convective systems explicitly, but at a cost (roughly one MWh per simulated day on exascale supercomputers) that limits long-duration simulation. We introduce STRATA (Storm-resolving Tile-based autoRegressive Atmosphere Transformer Architecture), the first autoregressive AI emulator for global storm-resolving atmospheric dynamics. STRATA is trained on the highest-resolution atmospheric dataset yet used for global AI emulation: 17 days of SCREAM physics-model output at 4.9-km resolution (~25 million grid cells) sampled every 10 minutes. Our central premise is that on 10-minute timescales atmospheric dynamics are predominantly local, so training on small spatial tiles trades scarce global temporal samples for abundant local spatial samples and enables global rollout via overlapping-tile blending. STRATA combines 3D patch embedding and local 3D neighborhood attention, a novel Stereographic Rotary Position Embedding (StereoRoPE) for grid-invariant encoding, and a pixel-space de-aliasing decoder that suppresses patch-scale rollout artifacts. An iso-FLOP scaling study reveals that km-scale emulation requires ~10x more FLOPs per grid point than coarse-resolution AI weather models, consistent with the higher information density of convective-scale dynamics. Trained on only 17 days of data, STRATA produces stable 24-hour global rollouts with realistic km-scale dynamics across diverse regimes, though large-scale biases develop with lead time. It achieves 48 simulated days per megawatt-hour (more than 50 times better energy efficiency than the SCREAM physics model) and 741 simulated days per wall-clock day at 512 H100 GPUs.

physics.ao-ph · cs.CE · cs.LG

新论文 · v1arXiv:2611.15950

Modeling the Travel Time-Pollution Exposure Trade-off in Urban Route Choice

Cafer Avci, Zhaoyao Bao, Maximilian Dittgen, Danni Lu, Alireza Yazdiani, Mohammad Tayarani, H. Oliver Gao

原文摘要

Traffic-related air pollution is a major contributor to respiratory and cardiovascular disease, and travel time disproportionately drives daily exposure. Conventional routing algorithms minimize time or distance, ignoring street-level pollutant variability and leaving travelers exposed to avoidable risk. We develop a bi-objective routing framework that couples a high-resolution AERMOD-based PM2.5 dispersion surface with a shortest-path algorithm. The algorithm uses a deterministic, gradient-based weight-update scheme to enumerate Pareto-optimal paths along the time-exposure frontier. We apply the framework to 790,000 origin-destination pairs on New York City's road network, covering 1.48 million daily commuters. Link-level concentrations differed by a factor of two or more between adjacent parallel streets. Exposure-aware routes reduced cumulative exposure by about 38% at a median travel time increase of about 28%. The algorithm ran in 30 milliseconds per query and recovered more frontier paths than uniform weight sampling (4.5 vs. 2.4). These results show that exposure-aware routing is computationally practical at metropolitan scale and suitable for real-time navigation and infrastructure planning.

cs.CE · cs.CY

新论文 · v1arXiv:2611.15924

The Distributed Run Manager A C++ Library for Distributed Processing

Brian Harrawood

原文摘要

The DistributedRunManager (DRM) is a C++ library for distributing a computing task among a number of computer systems for parallel processing on a network. The library was originally designed to accelerate synthetic image production for tomographic images, but is also a general solution for distributing a software task across diverse, multiple hardware platforms. The DRM self-configures using a novel C++ class, the ElectionManager. This class selects a server cooperatively at runtime and eliminates the need for a priori distribution configuration. All communication, logging, and fault-tolerance mechanisms are encapsulated by the DRM, providing a "black-box" interface to the application developer.

cs.CE

新论文 · v1arXiv:2611.15814

Large Payments Model

Natraj Raman, Abhenandhan Manoharan, Vishwasreddy Thuniki, Dhvani Kansara, Anirudh Som, Hassan Firouzi, Kostis Gourgoulias, Laukik Hoshing 等 15 位作者

原文摘要

Payment applications such as fraud detection, authorization prediction, and payment optimization draw on overlapping transaction information. This motivates a reusable payments intelligence layer that shares learned representations and predictive signals, rather than developing predictive models independently for each task. Realizing this shared capability requires handling heterogeneous transaction fields, high-cardinality identifiers, lifecycle-dependent attributes, long histories, and rare outcomes while meeting latency and cost constraints. We present Large Payments Model (LPM), a domain-specific foundation model designed for operational use and trained from scratch on large-scale structured transaction data to learn reusable representations for payment prediction tasks. LPM employs field-specific encodings and lifecycle-aware self-supervision in two complementary architectures: the Independent variant uses hybrid masking and supports efficient per-transaction inference, while the Sequence variant incorporates entity-linked histories through compact latent representations for richer temporal context. Optional distillation enables resource-constrained deployment. We pretrain LPM on up to 400 billion tokens and study scaling, downstream performance, and representation reuse. LPM improves over strong task-specific baselines across multiple prediction tasks in Merchant and Treasury Services, demonstrating applicability in distinct payment domains. Its representations also facilitate adaptation to a target not observed during pretraining through compact task-specific components. Together with production deployment, these results position LPM as a practical basis for reusable payments intelligence.

cs.LG · cs.AI · cs.CE

版本更新 · v2arXiv:2610.12537

Market Impact Estimation via Causal Foundation Models

Dennis Thumm, Ying Chen

原文摘要

When a trader executes a large order, the relevant question is not \emph{what will the price be?} but \emph{what would the price have been had I not traded?} Market impact is thus a causal quantity, yet classical models (Almgren--Chriss, propagators) regress price on flow, which is biased whenever informed flow moves prices through information as well as trading. We present a proof-of-concept \emph{Causal Market Simulator}: a continuous-time causal prior-data fitted network (PFN) trained on a synthetic market prior in which a hidden informational flow confounds the flow--price relation by construction, with confounding strength an exact per-episode knob. On this prior, the naive estimator's bias follows a closed form we confirm empirically (up to 68\% overestimation), while the PFN tracks the unbiased true-parameter oracle at high confounding. Its \emph{do-ablated twin}, the same model with the intervention inputs removed, collapses onto the pre-window mean. Zero-shot, the model responds at the ground-truth scale to metaorders in an ABIDES limit-order book (+0.38 pre-onset standard deviations against seed-replay counterfactuals), and its intervention response replicates on about 2,300 detected flow bursts in BTC/ETH/SOL perpetuals and 3,800 on Nasdaq equities, evidence consistent with, though not proof of, causal transfer. Off-prior the response degrades gracefully, and split-conformal recalibration repairs interval calibration. Transfer hinges on encoding the metaorder as added flow rather than a clamped price level, not on more training. A recurrent state-space variant closes the remaining shape gap: its impact accrues over execution duration where the transformer's stays flat, raising the correlation with measured metaorder impact from +0.68 to between +0.92 and +0.96, at the cost of weaker on-prior deconfounding that traces to the training recipe rather than to recurrence.

cs.LG · cs.CE · q-fin.TR

新论文 · v1arXiv:2611.15338

Matrix-Based Ant Colony Search with Batched Decoding for Hierarchical Replenishment Routing: A Stylized Case Study Based on Korean City Data

Jun Zhang, Wei-Jie Yu, Tong Qian, Eui Jeong Kwak, Sang-Woon Jeon, Hua Ding, Qijia Jiang, Hu Jin 等 10 位作者

原文摘要

We study a stylized single-vehicle replenishment-routing problem in which the cities of a national logistics network are both demand points and supply points: a vehicle of limited capacity delivers to every city once, and when its load is insufficient for the next city it must detour to a city already served that can still supply goods. A 100-node benchmark is built from Korean population and geographic data, with the cities divided into 10 levels; the per-visit supply coefficient and the allowed number of stops decrease geometrically with the level. Building on matrix-based ant colony optimization, we keep the states of the whole colony in arrays, couple route construction with a fixed greedy replenishment-decoding policy, and evaluate the candidate moves of a local search in batches. With frozen parameters and 30 runs on seeds never used for tuning, the matrix-based ant colony search with the batch local search (MACO) reaches a mean total distance of 3081.7 km; a genetic algorithm equipped with the same local search at the same frequency reaches 3074.9 km (no significant difference), and a MAX-MIN ant system with the same local search 3142.2 km. Ablation identifies the batch local search as the main contributor to solution quality; a load-aware transition factor gives no significant gain. Within the parameter ranges tested, raising the supply coefficients of the cities below the top level shortens the route more than relaxing the stop limits, which are not binding here.

cs.NE · cs.AI · cs.CE · math.OC

新论文 · v1arXiv:2611.15154

SciSelect-Gym: An Environment and Benchmark for Active Learning and Bayesian Optimization Configuration Selection

Ying-Peng Tang, Tianle Zhang, Wanlong Fang, Ng Jing Xiang, Alvin Chan

原文摘要

In many scientific tasks, scientists repeatedly choose a small set of candidates to test, learn from the results, and use the observations to guide the next selection. Methods based on active learning~(AL) or Bayesian optimization~(BO) have been proposed for these iterative screening campaigns with a surrogate model. Yet, selecting the surrogate model and acquisition function for a new dataset remains challenging due to limited empirical evidence, while the effectiveness of large language models (LLMs) in making such decisions remains unclear. To address these gaps, we introduce SciSelect-Gym, an environment for simulating AL/BO data selection campaigns and evaluating configuration choices. We conducted simulations of AL/BO data selection campaigns across several settings and more than 100 molecular datasets. Using completed simulation campaigns as context improves LLM recommendation shortlists on held-out datasets more consistently than it improves the quality of their first choice. SciSelect-Gym provides a simulation platform and recommendation protocols for learning how to choose configurations before an acquisition campaign. An implemented agent use case connects these campaign records and simulation tools to LLM-generated configuration-selection policies. The code is provided as supplementary material.

cs.CE

新论文 · v1arXiv:2611.14796

Selecting and verifying load-bearing periodic cells for elastic-wave band gaps with numerical acceptance checks

Shaoliang Yang, Jun Wang

原文摘要

A lattice mount must be stiff enough to support equipment and block vibration over a specified frequency range. Fast simulations help rank designs, but their errors can lead to a wrong acceptance decision. We present AMM (AgenticMetamaterials), an open-source Python tool that searches repeating cubic cells for targets on stiffness, the fraction of the cell that is solid, and band gaps. A complete band gap is an interval with no elastic-wave propagation in any direction. A separate checker allows for changes as the simulation grid gets finer. For gaps, it also tests for modes at sampled wave directions and wavelengths, so it can miss modes between samples. In 1,500 near-threshold tests of stiffness and solid fraction, the checker accepted 454 of 750 claims supported by the reference and none of the 750 false claims. Using the finest grid estimate alone accepted 42 false claims. In an independent finite-element comparison on ten new cells built from cubes joined by bars, the checker accepted one of two true gap claims and left all 17 false claims undecided. The reference could not classify the remaining claim. The protocol required every reported edge to err on the side of a narrower gap. The checker failed this test when it placed one upper edge too high, even though it left that thin-bar cell's claim undecided. Separating search from acceptance shows which targets the evidence supports and where a calculation needs further refinement.

cs.CE · physics.comp-ph

新论文 · v1arXiv:2611.14770

Nonlinear homogenization of periodic unit cells composed of mixed continuum and structural elements with variationally consistent boundary-member reduction

Jonathan Stollberg, Dominik Schillinger

原文摘要

Periodic architected materials may be represented by representative volume elements (RVEs) combining continuum, truss, beam, and shell constituents. Their mixed translational and rotational kinematics complicate a consistent scale transition to a macroscale Cauchy continuum. We establish a nonlinear first-order computational homogenization framework for such mixed-dimensional RVEs. An auxiliary finite-strain Cosserat continuum serves solely as a power-equivalent carrier of their virtual power and generalized boundary kinematics. Its uniform rotation is identified with the macroscopic polar rotation and its wryness vanishes, so the effective medium remains of Cauchy type. Under periodic translational and rotational constraints, the Hill-Mandel condition yields a common nodal-force virial for the effective first Piola-Kirchhoff stress, independent of element type. For lower-dimensional members on periodically identified cell boundaries, fractional ownership of internal virtual work is shown to be variationally equivalent to a topology-preserving reduction retaining one representative of each set of periodic element copies. Because this equivalence covers the complete element virtual work and consistent linearization, it applies to geometrically and materially nonlinear and path-dependent constituents without rescaling section properties, constitutive parameters, or internal variables. Numerical examples recover the analytical small-strain response and cubic symmetry of a mixed continuum-shell-beam cell, verify the reduction and discrete power balance, and demonstrate finite-rotation buckling of a hyperelastic Octet lattice and history-dependent yield-surface evolution of an elastoplastic sandwich cell. The open-source implementation abqhom couples the framework to Abaqus.

cs.CE

版本更新 · v4arXiv:2511.04556

Flow Reconstruction from Sparse Measurements in Urban Drainage Networks: A Simulation-Based Evaluation of Data-Driven Sparse Sensing

Zihang Ding, Amit Kumar, Imran Md. Azizul Islam, Mila Avellar Montezuma, Ruihang Zhang, Kun Zhang

原文摘要

Urbanization and increasingly frequent intense storms are placing stress on urban drainage networks. While dense monitoring is desirable, practical constraints in time, budget, and technology hinder its full implementation. How to monitor and predict flow conditions across the entire network under constrained resources is a major challenge. To address this, we evaluated data-driven sparse sensing (DSS), which selects sensor locations and reconstructs network-wide flow from the same reduced basis, in a 76-conduit urban drainage network. Simulations of a calibrated SWMM model were used to construct an event-weighted spatial basis using singular value decomposition (SVD), select rank-specific layouts using pivoted QR, and define the reconstruction decoder. Applied to 225 held-out simulations combining 25 plausible calibrated parameter sets with nine rainfall events, monitoring 5 of the 76 conduits (6.6%) achieved a median system-level Nash-Sutcliffe efficiency (NSE) of 0.992 (10th percentile 0.973) for observed storms, and a median NSE of 0.967 at the active unmonitored conduits. Pivoted QR performed comparably to genetic-algorithm layouts without requiring iterative layout searches, whereas largest-upstream-area placement failed with the DSS decoder and trailed QR even with a weighted regression decoder. The DSS flow reconstruction performance was insensitive to prescribed multiplicative Gaussian measurement noise, additive noise up to about 2 L/s and a 10 L/s detection floor, but showed location-dependent responses to loss of a monitored conduit, which a refitted regression decoder largely removed. This study supports the use of DSS, driven by physics-based simulations, for deciding how many flow sensors to install and where.

cs.AI · cs.CE

版本更新 · v2arXiv:2606.02618

Closed-Loop Molecular Design with Calibrated Deference

Newman Cheng, Gordon Broadbent, Jason Dong, Syed Mohammed Ali Hussaini, Farman Ullah, Morris Sharp, Gabrielle Barnes, Nanlin Guo 等 19 位作者

原文摘要

As AI systems become increasingly capable scientific collaborators, a fundamental challenge that arises is not only generating explanations, but calibrating confidence in them. We present Discovery, a multi-agent scientific system designed to assess the reliability of tools and data during adaptive reasoning, track evidence and assumptions while resolving uncertainty using a persistent graph memory. Discovery enables a capability we term calibrated deference: the ability to adjust confidence in its tool use, assumptions, and mechanistic explanations based on these assessments, communicate uncertainty to human collaborators, and adapt strategies accordingly. We evaluated Discovery in a closed-loop human-AI campaign to design an aqueous organic redox flow battery negative electrolyte. Discovery proposed candidates and interpreted results in collaboration with chemists, who synthesized, characterized, and guided design. Across 17 candidates over three rounds, Discovery converged on a candidate with a redox potential improved by 130 mV relative to the literature baseline. However, experimental characterization revealed poor electrochemical reversibility that the predictors used in the campaign could not anticipate. In response, Discovery generated competing mechanistic hypotheses, prioritized discriminating diagnostics, and traced the behavior to phosphonate-potassium ion pairing. Discovery designed a sulfonate analog to reduce potassium-ion pairing, and the resulting compound improved electrochemical reversibility while maintaining a 90 mV improvement in redox potential, closing the design-make-test-redesign loop. Across the campaign, Discovery demonstrated the ability to maintain a coherent world model, updating in response to unexpected results, and leverage it to drive molecular design.

cs.CE · cs.AI · cs.MA · physics.chem-ph