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.
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.
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.
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.
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.
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.
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.
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.
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.
Lucas Fourel, Paul Devianne, Marine Debouvry, Tristan Destruhaut, Russell Gunn, Ashwini Gupta, Lori Graham-Brady, Jean-François Molinari
原文摘要
Computational homogenization and coupled multiscale simulations of heterogeneous materials require repeated solution of mechanical fields on Representative Volume Elements, which becomes prohibitively expensive for high-resolution three-dimensional microstructures. Machine-learning surrogates can accelerate these computations, yet most existing approaches predict fields for fixed macroscopic loadings and provide limited guidance on how to scale network architectures for high-resolution 3D tensor-field prediction. This work presents a U-Net surrogate trained to predict the full 36-component strain localization tensor field in voxelized concrete mesostructures at resolutions up to $256^3$. Training localization tensors are generated with an FFT-based linear elastic solver, and an extensive hyperparameter optimization is performed to derive scaling rules and an accuracy-speed trade-off analysis. The results show that only network width and depth need to be scaled with problem complexity, while several conventional U-Net design choices, such as doubling channels after downsampling, are suboptimal for this problem. The final neural network achieves a Mean Absolute Error of 1.118% on both the validation and the held-out test sets, and an inference speedup of approximately 8.7x over the FFT-based solver on an Nvidia H100 GPU. Generalization experiments reveal transfer across aggregate volume fractions and highlight the importance of training on diverse morphologies. To safeguard reliability, a Maximum Mean Discrepancy metric computed on internal feature maps is proposed for detecting out-of-distribution microstructures without costly reference computations.
Antoine Quiriny, Jonathan Lambrechts, Michel Henry, Nicolas Moës, Jean-François Remacle
原文摘要
We present a marker-based X-Mesh framework for incompressible N-phase flow simulations with sharp, explicitly tracked interfaces. The interface is represented by Lagrangian marker chains, while the computational mesh is deformed so that selected mesh edges conform to the tracked geometry without changing mesh connectivity. This combination preserves the advantages of body-fitted finite element discretizations while allowing highly distorted and nearly degenerated elements to capture fine interfacial features on relatively coarse meshes without requiring mesh refinement. The arbitrary Lagrangian-Eulerian (ALE) finite element solver uses a pressure field that is continuous within each phase and discontinuous across the fitted interface. Surface tension is introduced through a variational membrane, so the pressure jump is resolved without prescribing a curvature-dependent correction; a Young wall energy provides the corresponding treatment of fluid-fluid-solid triple points. Topological changes are handled geometrically from the marker representation. Numerical experiments illustrate the ability of the approach to transport complex interfaces and to control topology changes through marker-based feature-size criteria.
Accurate localization of the epileptogenic zone (EZ) is essential for presurgical evaluation of patients with drug-resistant focal epilepsy. Intracranial electroencephalography (iEEG) provides direct recordings of seizure-related brain activity, yet identifying epileptogenic contacts remains challenging because background electrophysiological activity and electrode coverage vary substantially across patients. These differences complicate the interpretation of absolute signal measurements and highlight the need to account for patient-specific recording context. We propose a patient-relative (PR) plug-in that expresses physiological features or learned representations relative to the distribution of recorded channels within each patient. This label-free operation can be incorporated as an input transformation or a lightweight correction to an existing predictor. We further introduce DREChanNet, a compact ictal localization model integrating six physiological descriptors with learned raw-signal representations. Same-channel pre-onset contrasts characterize seizure-related changes, cross-seizure aggregation preserves response magnitude and variability, and PR contextualizes both branches before prediction. We investigate within-patient physiological associations and held-out-channel reference prediction, followed by baseline comparisons, component ablations, cross-source transfer, seizure-sufficiency analysis, and channel ranking. Evaluation includes an ictal cohort of 80 patients and a patient-based interictal cohort of 124 patients. PR improves macro-F1 by an average of 9.03 percentage points across eight ictal baselines and improves the separately fitted interictal readout. These findings support patient-relative contextualization as a reusable approach to channel-level localization and establish DREChanNet as an integrated model for ictal iEEG analysis.
Yuqi Wang, Fengyuan Liu, Mukai Li, Haochen Luo, Lei Li, Qi Liu
原文摘要
Much of the variation in financial time series is driven by market-wide shocks that cannot be predicted from an asset's own history. Per-asset self-supervised learning treats this variation as irreducible noise. Under a latent factor model, we show that conditioning prediction on the realized market factor makes the asset's market exposure necessary for optimal prediction, while reducing the noise against which the asset-specific component is learned. Building on this insight, we introduce Market-Conditioned JEPA (MC-JEPA), a joint-embedding predictive architecture for financial time series. During training, we construct a leave-one-out market condition for each asset from the future target embeddings of other assets and incorporate it through factor loadings derived from the asset's own representation. On 11 years of minute-level Chinese A-share data, MC-JEPA improves over per-asset JEPA across nine targets spanning returns, market exposure, risk, and liquidity, with the strongest and most statistically significant gains in exposure, risk, and liquidity. It achieves the best RankIC on all liquidity targets and on return horizons from two hours to five days, outperforming time-series foundation models and self-supervised baselines, and delivers the best portfolio performance in a historical backtest. Ablations show that the return and exposure gains require the condition to be aligned with the realized market movement. After restoring the volatility scale removed by normalization, the predictor's factor loadings rank stocks by market beta nearly as well as a supervised probe, without labels. A synthetic factor-model study with known parameters shows that conditioning improves the recovery of both market exposure and the asset-specific component.
Partial differential equation (PDE) solvers underpin modern computer graphics, geometry processing, and scientific computing. Classical Monte Carlo PDE solvers such as Walk-on-Spheres (WoS) provide mesh-free estimations that are unbiased, but with accuracy limited by sampling and numerical approximation. Learned solvers are fast but biased and brittle under distribution shift. We therefore present MC$^2$, a hybrid Neural Network-Monte Carlo PDE solver that treats a low-budget Monte Carlo solution as a structured estimator of the true field and learns a single-pass neural correction to recover a high-fidelity solution. MC$^2$ matches the accuracy of solutions using over $1000\times$ more Monte Carlo samples, outperforming all evaluated mesh-free classical, denoising, and neural-operator baselines. To enable reproducible study of finite-compute PDE solving, we additionally release PDEZoo, the largest standardized elliptic PDE benchmark to date: 2 million PDEs spanning 5 elliptic families and unlimited geometric compositions, with analytic ground truth and multi-budget Monte Carlo trajectories. Together, MC$^2$ and PDEZoo (1) empirically establish that finite-sample Monte Carlo error is structured, learnable, and correctable in a single forward pass, (2) show that we can solve PDEs $\sim$218$\times$ faster than WoS at matched accuracy and achieve a $\sim$171$\times$ reduction in inference time relative to state-of-the-art diffusion methods while attaining higher accuracy, and (3) provide the reproducible evaluation infrastructure the field has so far lacked. Code & Data: https://mc-error-correction.github.io
Finite-element surrogates predict the stresses of a new design in one evaluation, but are usually trained on solutions with a displacement loss and compared by it, although engineering decisions rest on stresses. Application in engineering: stress analysis of perforated plates and solids with cavities, parametric families in which holes concentrate stress. Contribution to artificial intelligence: training and evaluating such surrogates in the energy norm, with or without solutions, and screening their predictions without solutions. For linear elastostatics, minimising the assembled discrete potential energy is exactly supervised regression in this norm: the energy gap of a prediction is the strain energy of its stress error. A displacement loss under-weights the stiff modes that carry the strains. In pre-registered comparisons, changing only the norm of the supervised loss cut a three-dimensional transformer's median energy-norm error 7.5-fold and its median von Mises error 6.1-fold; in two dimensions it more than halved the von Mises error, also on held-out instances. In three dimensions, the transformer trained on the energy alone came within a factor of 1.3 of the energy-norm-supervised one in median energy-norm and von Mises error. It was more accurate than the displacement-supervised one on all five metrics in every seed. Given the stiffness matrix, a Ritz projection was more accurate than the label-free transformer, in the seed means, on every metric but peak stress. No network transferred to a substantially finer mesh. The energy ranks predictions of a load case, and its sign flags those worse than the zero field.
We present an automated framework for the shape optimisation of a geometrically nonlinear, five-parameter Naghdi model on faceted triangulations. By recovering directors numerically, we remove the requirement for an analytic or spline parameterisation of the mid-surface, whereas partial selective reduced integration alleviates locking. The residual and tangent of symbolic energies are generated in an automated fashion building on Firedrake's and UFL's symbolic differentiation capabilities. Additionally, UFL's and pyadjoint's algorithmic differentiation enables automated first and second shape derivative evaluations that are verifiably correct via Taylor tests. The forward model agrees with the Sze/Abaqus semi-cylinder reference. A three-model mesh-refinement study indicates that geometry recovery and surface faceting have small effects on the predicted deflection. Numerical experiments show that 100 trust-region iterations suffice to reduce the squared-displacement functional of a semi-cylinder by 98.4% and the elastic strain energy of a bracket by 94.6%. The latter result is validated against a COMSOL benchmark. Non-uniqueness of optimal shapes is demonstrated by optimising initial designs subject to small perturbations. Comparisons with linearised designs distinguish optimisation performance from the accuracy of the predicted nonlinear response.
In the last decades, energy-based models (EBMs) have become an important class of probabilistic models in which a component of the likelihood is intractable and therefore cannot be evaluated explicitly. Consequently, parameter estimation in EBMs is challenging for conventional inference methods. This work is a review paper that brings together these different methodological contributions within a unified framework, highlighting the connections among noise contrastive estimation (NCE), reverse logistic regression (RLR), Bennett's acceptance-ratio (BAR) method, multiple importance sampling (MIS), and bridge sampling within the context of EBMs. Some of them are equivalent under specific conditions. This unified perspective clarifies relationships among existing methods and enables the development of new estimators, with the potential to improve statistical and computational efficiency. Furthermore, this study helps elucidate the success of NCE in terms of its flexibility and robustness, while also identifying scenarios in which its performance can be further improved. Our aim is to provide a self-contained and accessible treatment, with clear and straightforward derivations, that brings together these contributions within a common framework and makes the main results and their underlying ideas understandable to a broader readership. The contribution is twofold. First, this work serves as a comprehensive tutorial for researchers entering the field, introducing the fundamental concepts and derivations. Second, it offers a thorough review for experienced practitioners. The code used in the numerical experiments is available to support the reproducibility of the results.
Harikrishnan Vijayakumaran, Shunyu Yin, Martin Abendroth, Miguel A. Bessa, Karl A. Kalina
原文摘要
Neural network material models can represent yield surfaces and hardening laws with far more flexibility than classical closed-form plasticity formulations, but training such a model end-to-end through an implicit return map introduces non-trivial challenges. This work presents a thermodynamically consistent neural constitutive model for rate-independent, isotropic elastoplasticity that jointly learns a flexible yield function together with its evolution laws. For non-associative flow, the yield function extends the convex flow potential by a jointly trained additive term, which renders the model thermodynamically consistent by construction. Isotropy and convexity are enforced simultaneously across all learnable components through a permutation-invariant, spectral (eigenvalue-based) representation. Training proceeds through a backward-Euler return map, with gradients propagated by the implicit function theorem together with an eigenvalue-degeneracy-aware scheme for safe differentiation. The robustness and generality of the approach are demonstrated by reproducing known constitutive models, including non-associative flow, learning material behavior from stress--strain data extracted from a full-field finite element simulation, and capturing unknown non-associative behavior from homogenized representative volume elements of a foam. Finally, the proposed neural plasticity model is evaluated within finite element simulations to solve boundary-value-problem under plane stress.
Effective search and rescue (SAR) operations require autonomous systems capable of coordinating multiple heterogeneous agents, adapting to dynamic hazards, and aligning with human mission intent. Existing language-guided reinforcement learning (RL) methods primarily focus on single-agent instruction following and lack mechanisms for team-level coordination in complex, partially observable environments. This paper presents a Cognitive Multi-Agent Framework based on Language-Grounded Hierarchical Reinforcement Learning (LG-HRL) that integrates natural-language understanding, hierarchical policy decomposition, and a shared cognitive workspace to achieve cohesive multi-agent behavior in SAR scenarios. Human instructions are interpreted by a large language model (LLM) and transformed into structured semantic cues that guide high-level strategy selection and role assignment across UAV and UGV agents. A formal Language-Grounded Multi-Agent Hierarchical Decision Process (LG-MAHDP) is introduced to model the interplay between semantic grounding, hierarchical control, and distributed coordination. Comprehensive experiments in a simulated disaster environment show that LG-HRL improves learning speed by 2.3 times, increases coordination coherence by 37%, and enhances subgoal accuracy and hazard avoidance by 46% and 31%, respectively. The system achieves 20-30% higher victim rescue rates, demonstrates emergent role specialization, and adapts immediately to human verbal updates. Ablation studies confirm that both the shared cognitive workspace and language grounding are critical to overall system performance. Overall, this work establishes a new paradigm for language-guided multi-agent SAR robotics, demonstrating that semantic grounding combined with hierarchical reasoning enables safer, more efficient, and more interpretable autonomous rescue operations.
Xue-Ling Luo, Marco Conte, Peter Yichen Chen, Nikolaos Bouklas
原文摘要
AI agents can automate software engineering because a compiler or a test suite checks that the code does what the user or the agent intended. In engineering analysis, however, the steps that precede the computation have few easily verifiable checks: modeling a design or an object, deciding how it is used, where supports and loads are applied, and what material each part is made of. A human expert therefore makes these decisions, carries out the steps, and judges the result, one object at a time. We present MechFoundry, an agentic loop coupled with bespoke software that automates structural analyses of real-world objects without a human in the loop. From an object's lexical description, it generates a shape, poses a loading case relevant to how the object is used, assigns a material to each part, solves the nonlinear structural response, and improves the design against the loads it carries. A differentiable GPU solver built on an adaptive octree that need not conform to the surface enables the transition from shape generation to simulation and optimization. Across 50 everyday and engineering objects, the agent posed and solved a loading case in 6.5 minutes and for US$1.3 per object on average. Without a test suite to check against, we had language-model reviewers grade each session, as a first indication of where the agent's engineering judgment holds and where it fails.
A fixed structural edit can preserve a spike sequence under one input and change it under another. We study this dependence using statistics-preserving edge swaps, controlled inputs and finite-horizon parameter certificates. The original 125-chunk numerical model is tested on ten artificial graphs from three connection rules. Despite identical total external drive at every slot, global and focal inputs change the visibility of 4--13 of nineteen fixed swaps per graph. A paired homogeneous and heterogeneous leaky integrate-and-fire validation in brian2-atlas reuses three originals and extends observation from 30 to 300 ms under a constant background drive sufficient for isolated-cell firing. Heterogeneous short-window switching persists, but by 300 ms every tested swap differs from its reference, saturating the binary visibility readout. Fixed-support weight families provide a complementary regional guarantee. Positive certified intervals cover 4,308 of 4,320 LIF direction conditions and include distinct floating-point configurations. A post hoc comparison finds a long-window failure inside the short-window certified interval in 710 of 720 heterogeneous conditions; 394 of 829 direction pairs ordered under both matched-drive inputs change order at 300 ms. Input-specific filtering and threshold-margin scores retain useful ordering but degrade with horizon and do not consistently beat activity controls. Earlier temporal-error, paired-dose and unsuccessful structural-selection results delimit what these findings imply. Together, the evidence links input-conditioned structural effects to finite-horizon fidelity regions in two deterministic kernels, without establishing universal topology rankings, model compression or asymptotic robustness.
Translating visual brain activity into natural language offers a powerful window into human cognition and neural semantic representation. Most prior brain-captioning approaches project fMRI signals into language space using paired supervision. However, the widely used Natural Scenes Dataset (NSD) was built based only on image-fMRI pairs, while existing methods rely on MS-COCO captions as indirect textual supervision. Critically, during fMRI acquisition, participants observe only cropped image regions, whereas the associated MS-COCO captions describe full scenes. This mismatch creates a fundamental gap between neural representations and textual supervision, introducing an inherent semantic loss in NSD-based brain captioning. To mitigate this limitation, we reformulate brain captioning as Neural-Grounded Visual Captioning, where language is generated directly from visually grounded neural evidence rather than text supervision. We propose MindVLM, a framework that maps fMRI signals into subject-aware visual tokens and leverages a frozen vision-language model (VLM) to produce interpretable and personalized descriptions. Instead of point-wise regression, MindVLM focuses on extracting semantically relevant visual cues from neural activity, naturally accommodating partial observability and inter-subject variability. Extensive experiments on NSD show that MindVLM maintains, and often improves, caption quality across multiple VLM backbones, including LLaVA-v1.5, Qwen2.5-VL, and Gemma3, beyond intrinsic model priors. Despite requiring neither text supervision nor an LLM during training and operating under an image-grounded inference paradigm distinct from conventional captioning methods, MindVLM remains competitive with supervised approaches, suggesting that subject-specific neural grounding provides an efficient, scalable, and interpretable path toward faithful brain-to-language generation.
Large-scale electrical circuits span a wide range of research topics from highly integrated circuits in microelectronics up to power grids for cities and countries. As the complexity increases significantly by each additional component, we find a need to describe large-scale circuits in a manner easy to understand. In this article, we study cascades of simple circuits consisting of resistors, capacitors and inductors, which we call ladder circuits. Such electrical ladders are common in electronics to design filters and they are also used in other disciplines, for example to describe diffusion or wave phenomena. In particular, we derive linear time-invariant state space models for three simple ladder types and we discuss the specific matrix structures of the large-scale second-order differential equations. Furthermore, we exemplify our findings with simulations to unveil the intrinsic dynamical behavior of each ladder type.
Juan Ignacio Camarotti, Ricky Aristio, Roland Wüchner
原文摘要
Isogeometric beam formulations provide an efficient reduced-dimensional representation of slender structures, combining accurate geometry and high-order continuity with few structural degrees of freedom. Their application to fluid--structure interaction (FSI) requires transferring motion and loads between the one-dimensional beam centerline and the surrounding fluid interface. While mapping strategies exist for conventional finite element beams, geometrically nonlinear isogeometric formulations require operators consistent with their spline-based kinematics and distinct descriptions of cross-sectional rotation. This work develops consistent beam-to-surface mappings for geometrically nonlinear isogeometric Bernoulli and Timoshenko beams in partitioned FSI. Fluid-interface points are attached to the beam in the reference configuration and reconstructed using the nonlinear kinematics of each formulation. Consistent linearization yields a configuration-dependent mapping operator whose transpose ensures work-conjugate load transfer. The formulations are verified through analytical deformation tests, convergence studies, and virtual-work checks, and evaluated in beam-based adaptations of the Mok and Turek--Hron benchmarks and the Goland wing flutter benchmark. The results confirm accurate interface reconstruction and work-conjugate load transfer under large deformations, while demonstrating the applicability of both beam formulations to coupled FSI problems.
Kirill Katsuba, Oleg Rudenko, Egor Bugaev, Alexander Tarakanov
原文摘要
Neural surrogates for engineering models are often trained on large collections of simulated solutions. We investigate whether physics-informed neural networks (PINNs) can achieve accurate predictions from scarce labelled observations by incorporating governing equations and prescribed initial and boundary conditions. We introduce hierarchical loss weighting (H-PINN) and its gradient-direction-aware extension (HO-PINN), which adjust the emphasis on physical constraints according to higher-priority losses. Hierarchical PINNs are compared with Vanilla PINN, tuned gradient boosting, support-vector regression, and Gaussian-process regression on a heat equation and three heterogeneous two-phase-flow benchmarks. Experiments use 20--1000 labelled states and ten paired seeds. Each label is one coordinate--state observation, not a complete simulation. At least one PINN variant achieves the highest mean primary-target \(R^2\) in each interpolation and equation-assisted forecasting comparison at 20 and 50 labels. The advantage for water saturation persists across all tested budgets. Hierarchical weighting reduces variability across runs in selected settings. These results demonstrate that known physics can support accurate neural surrogate predictions from very few solution observations, at substantially higher fitting cost than the tested classical regressors.
The rapid increase in the deployment of Low Earth Orbit (LEO) satellites, catering to diverse applications such as communication, Earth observation, environmental monitoring, and scientific research, has significantly amplified the complexity of trajectory management. The current work focuses on calculating and analyzing perturbation effects on a satellite's anticipated trajectory in LEO, considering Solar Radiation Pressure (SRP) as the main perturbing force. The acceleration due to SRP and it's effects on the satellite was calculated using a custom-built Python module mainly based on the hypothesis of the cannonball model. The study demonstrates the effectiveness of the proposed model through comprehensive simulations and comparisons with existing analytical and numerical methods. Here, the primary Keplerian orbital characteristics were employed to analyze a simulated low-earth orbit LEO satellite, initially visualizing the satellite's trajectory and ground tracks at a designated altitude. The study also focuses on a comparative analysis of ground stations, primarily considering the main regions of the subcontinent, with revisit time as the key parameter for comparison. In the end, we combine analytical techniques with Machine Learning (ML) algorithms to predict changes in the position vectors of the satellite. Using ML techniques, the model can adaptively learn and refine predictions based on historical data and real-time input, thus improving accuracy over time. In addition, the incorporation of analytical methods allows for a deeper understanding of the underlying physics governing satellite motion, enabling more precise adjustments and corrections.
A central objective in stochastic mechanics is to separate deterministic physical behavior from the probability laws governing uncertain inputs. While classical spectral approaches achieve this separation in linear settings, nonlinear responses introduce interactions beyond conventional second-order variability response functions (VRF). Inspired by the spirit of VRFs, this work establishes that, for a fixed physical system, uncertainty propagation is described by a law-invariant operator mapping input realizations to responses, governed by the underlying physics and the deterministic parameters of the system. Different probability laws affect the input sampling and resulting response statistics, but not the mapping operator. We establish this law invariance under complete, invertible coordinate transformations and develop complementary, Fourier, fixed-reference polynomial-chaos (PCE) and finite element method (FEM) transfer formulations. Fourier captures nonlinear cross-frequency interactions and recovers the classical VRF in the appropriate linear limit, PCE describes coupling among stochastic modes, while FEM expresses the deterministic inverse-stiffness action. Neural approximations of these deterministic operators are investigated through analytical and finite-element benchmarks, examining cross-law generalization, the influence of training distributions and stochastic excitation, and the prediction of response fields and statistics. The results demonstrate the potential for reusing learned physical operators across different stochastic laws without retraining, while highlighting the importance of adequate training coverage and the challenges of accurately estimating low-probability events.
Ultrasonic guided wave (UGW) inspection has become an effective method in structural health monitoring (SHM). While machine learning has enhanced damage detection capabilities, purely data-driven models remain constrained by extensive labeled datasets and limited physical interpretability. Standard multi-layer perceptrons (MLPs) further suffer from spectral bias (F-Principle) in high-frequency regimes, prioritizing low-frequency components while failing to resolve the high-frequency oscillations critical for UGW reconstruction. Physics-Informed Sinusoidal Representation Networks (PI-SIRENs) address these limitations by embedding governing partial differential equations directly into the training process. Building upon SIRENs, which utilize periodic activation functions to inherently capture high-frequency spectral content, the proposed framework is designed to operate effectively in sparse ultrasonic measurement regimes. This work introduces a frequency-domain PI-SIREN framework tailored for the Mindlin-Reissner plate theory to reconstruct ultrasonic wavefields without temporal discretization. The model parameters are optimized using a hybrid strategy comprising three phases: first-order Adam, residual-adaptive refinement (RAR) and quasi-Newton L-BFGS. Numerical and experimental evaluations confirm that the model serves as a physics-consistent baseline derived from sparse data, functioning as a computationally efficient surrogate for damage identification in SHM and non-destructive testing (NDT). Integrating the surrogate into a damage identification pipeline detects and localizes a milled notch from sparse experimental measurements with a localization error of 1 % of the plate diagonal. In contrast, data-driven benchmarks and MLPs with hyperbolic tangent activation functions, with and without Fourier feature embedding, are unable to identify damage due to higher reconstruction errors.
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.
Seo In Jang, Seung Ho Choi, Ji-Eun Shin, Hyunwoo Lee
原文摘要
Directed housing-submarket networks combine common market movement with heterogeneous bilateral relations, and different node-level measures need not yield distinct empirical rankings. We construct a positive pairwise net-connectedness network from the generalized forecast error variance decomposition (GFEVD) of a vector autoregression (VAR) and use it to compare complementary node positions. Net directional connectedness (NET), PageRank, and Viral Centrality summarize net directional balance, recursively weighted incoming position, and normalized multistep reach. When bilateral net differences are nonzero, the network is a weighted tournament. A least-squares edge-flow decomposition separates the pairwise-net matrix into a NET-equivalent gradient component and a NET-orthogonal residual, while a monotone-allocation condition establishes exact PageRank-indegree correspondence in a transitive tournament. In Seoul's 25-district network, the gradient component accounts for 70.9% of the squared Frobenius norm, leaving 29.1% in the residual component. PageRank is strongly aligned with indegree (Spearman $ρ=0.987$), and Viral Centrality with outdegree ($ρ=0.935$); the PageRank alignment exceeds the range of independently weighted simulations with comparable tournament consistency and edge-weight variation. Three common-component treatments reduce total connectedness from 81.98% to 50.60-52.00%, a 36.6-38.3% reduction relative to the raw system, and reverse 97-98 of 300 pairwise net directions. Thus, both the magnitude and the apparent direction of connectedness depend materially on the treatment of citywide common movement. Songpa's positive NET position remains prominent across common-component treatments and dynamic specifications and ranks first in both chronological subsamples.