Papers

Morphing flexible multibody aircraft require structural strain, aerodynamic geometry, surface velocity, and generalized loading to remain compatible as joints and flexible components change configuration. A compositional formulation is developed around an assumed material attachment between each lifting surface and a geometrically exact beam. Separating the component root pose from the section field shows that the body strain and elastic potential of a component depend on its own elastic coordinates, while upstream motion enters kinetic terms and external-load pullbacks. At element level, an exact relative logarithm $d$ supplies strain and potential energy, whereas a reference-anchored section coordinate $\sigma$ supplies deformed section geometry. Finite-order expansions retain the finite reference geometry exactly and truncate only endpoint perturbations. The attachment map then generates surface points, tangents, normals, velocities, and force Jacobians from common section kinematics. Euler–Poincare beam balance, moving-surface potential-flow relations, graph cotangent assembly, and the associated semidiscrete power identity are stated in a common twist–wrench convention. Collocation, pressure, equivalent-load, and structural-station sites are distinguished to expose their approximation errors. Verification gives the expected $N_d+1$ convergence order for degree-$N_d$ relative-log expansions. In a geometrically nonlinear cantilever comparison, a cubic static-manifold correction reduces mean full-record displacement error from $0.479$ to $0.255$ over four completed load cases. These results provide structural and interface-level evidence rather than validation of a complete aircraft aeroelastic prediction.

Deciphering the drivers of brain ageing and neurodegeneration, and explaining heterogeneity in individual trajectories, remains a central challenge for precision medicine. We propose PIM-BrainTwin, a physics-informed multiscale digital twin for Alzheimer's disease that draws on materials-science principles–fatigue-like depletion, safety margins and critical transitions–to quantify residual compensatory capacity and system stability. Designed as an open, modular and federated platform, it enables alternative mechanistic hypotheses to be formalised, compared and refined.

Scientific machine learning for partial differential equations commonly targets solution fields, as in physics-informed neural networks, or solution maps, as in neural operators. We study a third target: the propagator itself, a phase and amplitude in phase space. The motivation is a gap in regularity. A transported discontinuity is nonsmooth in space and time, yet the rule that moves it can be a polynomial phase carrying unit amplitude, so the object that generates an evolution can be far smoother than the field it generates. The microlocal neural operator (MiNO) learns that object, using the eikonal equation for the phase and the transport equation for the amplitude, and recovers the solution by an oscillatory integral. Sharp fronts and caustics then belong to propagation geometry rather than to a field fitted pointwise. Small residuals certify more than the reconstructed field. They place the learned canonical relation, the geometry that carries singularities, close to the exact one, and they separate trainable error from the frequency-truncation tail. On a matched-budget discontinuous-advection benchmark, MiNO stops improving within 10,000 steps at the accuracy limit of its finite reconstruction window, a limit predicted in closed form, whereas a physics-informed neural network with neural-tangent-kernel loss balancing stays near its initial error. On smooth advection, the mean error is $3.84\times10^{-3}$ for MiNO and $3.12\times10^{-2}$ for a supervised Fourier neural operator. Single-branch MiNO is the smallest model compared, and one trained generator serves five unseen initial conditions without retraining.

Boundary-conforming four-dimensional meshes are essential for being able to run spacetime numerical simulations about complex, moving three-dimensional geometries. Specifically, a mesh of pentatopes is needed in which the tetrahedral faces of this mesh conform to the boundary of the domain. In the three-dimensional setting, a common approach consists of generating a constrained Delaunay tetrahedralization. Implementations of this approach are mature, but it is unclear how it extends to the four-dimensional setting, particularly in how the local mesh operations are scheduled to recover the constraints. This paper develops a new algorithm for recovering boundary constraints which is simple to implement in any dimension. The algorithm is primarily an advancing-front approach and uses a constrained cavity operator to incrementally insert constraints into the mesh. Compared to existing advancing-front approaches, which advance from a front of $(d-1)$-simplices (faces), the proposed approach advances from a front of $(d-2)$-simplices, called ridges. Steiner vertices can be added to the boundary when the front stalls and several examples in $3d$ demonstrate the ability of this algorithm to recover a complete representation of the input surface. For the four-dimensional geometries studied here, the algorithm generally recovers at least 99% of the input tetrahedralization with this advancing ridge procedure. For some simpler domains, complete conformity with the input tetrahedralization is achieved by adding Steiner vertices, thereby demonstrating the ability to produce boundary-conforming four-dimensional meshes. The design and efficiency of the underlying cavity operator implementation is also evaluated, showing that 30 million pentatopes can be created in about 1.5 minutes, and 300 million pentatopes in about 15 minutes on a workstation laptop.

Bayesian optimization (BO) is a sample-efficient, surrogate-based approach to black-box optimization (BBO), but its evaluation remains dominated by synthetic functions and hyperparameter optimization (HPO) tasks that are typically low-dimensional and single-objective. Engineering design poses a substantially different regime: problems are physics-based, often high-dimensional, constrained by requirements such as cost and manufacturability, and may involve multiple objectives or mixed variables. To close this benchmarking gap, we introduce BOCoDe, an open-source, PyTorch-native benchmark comprising 307 BBO problems, including 159 engineering design tasks and widely used synthetic and HPO benchmarks. Each problem includes cited provenance and machine-readable metadata that supports programmatic discovery, including by LLM-based agents, and all tasks are exposed through a unified API compatible with open-source BO libraries. We evaluate 31 BO and evolutionary algorithms across five problem classes spanning single- and multi-objective optimization, constrained and unconstrained settings, and mixed-variable search spaces. Analyses of problem structure show that engineering tasks uniquely span constrained and multi-objective settings that synthetic and HPO suites rarely cover, while embeddings from a tabular foundation model separate them most clearly from HPO tasks. Algorithm rankings also vary substantially across domains; in several problem classes, rankings obtained on standard benchmarks do not transfer to engineering tasks. BOCoDe establishes a reproducible and extensible foundation for developing and evaluating BO methods that better reflect the demands of engineering design. Code & data can be found at https://github.com/rosenyu304/BOCoDe

Digital twins are increasingly used for smart-building monitoring and control, yet many evaluations focus on state estimation or fault detection rather than whether sensing errors materially affect closed-loop outcomes. This paper introduces a ground-truth-aware simulation framework that separates the latent physical state from a corrupted sensing layer and compares practical sensor-driven policies with an oracle controller. The synthetic twin includes 20 zones simulated at 15-minute intervals over 30 days and models occupancy-driven CO2, ventilation-energy trade-offs, sensor drift, measurement noise, and missing observations. Policy comparisons use a one-step information delay and common random numbers for paired Monte Carlo evaluation. Under nominal sensing, the raw-sensor controller disagreed with the oracle on 2.59% of decision steps, while aggregate CO2, energy, and comfort outcomes remained nearly unchanged. At 8x nominal drift, decision mismatch increased to 7.00%, but outcome gaps remained small. Across a 4x4 drift-missingness grid, none of 48 sensor-driven policy-condition combinations crossed the predeclared material-divergence thresholds. A three-sample rolling median increased nominal mismatch from 2.59% to 6.31% without meaningful outcome improvement, and Ground-Truth Regret rankings varied with utility weights. The results show that sensor error, decision disagreement, and outcome degradation are related but distinct. Because the study is fully synthetic and uncalibrated, its contribution is methodological rather than a claim of real-building performance.

Existing resources leave confusion over the benefits of high versus low Solar Heat Gain Coefficient (SHGC) windows for energy performance in residential buildings retrofits in cold climates. Additionally, few studies have considered the impact of expected future climate conditions and time-variable grid emission rates on energy-related metrics. Utilizing the ResStock, residential building stock models from the National Renewable Energy Laboratory (NREL), this study investigates retrofits increasing the SHGC of windows in Chicago, a cold US city. The results indicate that increasing window SHGC increases summer cooling needs; however, in most cases, this effect is more than offset by reduced winter heating needs. This balance is particularly beneficial considering the state's expected long-run marginal carbon emission rates. The study also examines the combined effects of high SHGC with improved window insulation values, demonstrating that such strategic window retrofits not only enhance overall building energy performance but also contribute to greater emission reductions. On average, the current Chicago residences (n = 4,826) save 4.6 % on heating and cooling carbon emissions by increasing the SHGC of the windows. If we assume that those homes are upgraded with heat pumps (electrification), a popular retrofit that reduces heating-related carbon emissions in particular, the increased window SHGC saves 2.5 % of long-run marginal carbon emissions. These results provide new insight into the carbon benefits of higher SHGC replacement windows in a cold climate. The benefits are significant, even considering future trends of a warming climate, higher demand grid emissions, and building electrification.

Structure-preserving discontinuous Galerkin (DG) methods typically improve the robustness of high order simulations of real fluids. In addition to conservation, key structures include the preservation of pressure equilibrium and satisfaction of at least one entropy inequality. In this work, we investigate conservative discretizations using exactly pressure equilibrium conserving (EPEC) and approximately pressure equilibrium conserving (APEC) flux differencing DG formulations, as well as entropy stable formulations through the use of minimally dissipative corrections for non-ideal equations of state (EOS). We introduce an analysis of EPEC schemes and a new procedure for designing such fluxes based on a generalization of Tadmor's shuffle condition. We also analyze APEC DG schemes and show that the incorporation of dissipative interface penalization terms does not significantly increase pressure equilibrium errors, especially at higher orders of approximation. Finally, we observe that when combined with APEC flux differencing formulations, entropy correction improves robustness for under-resolved solutions and long-time simulations.

A spectral foundation model should remain useful when laboratories preprocess spectra differently. The standard test trains a classifier under one pipeline and evaluates under another, taking preserved accuracy as evidence of learned invariance. However, these models normalize each input before any learned parameter is applied. When normalization maps differently preprocessed spectra to the same vector, the encoder receives identical inputs and the measured invariance cannot be attributed to learning. We propose a normalization-only attribution control: compare the encoder against its normalization before interpreting transfer as learned invariance. On six Raman datasets the encoder does not measurably improve transfer over its normalization. A controlled experiment confirms invariance develops only when variation reaches the encoder past normalization. Across three systems, no encoder improves relative retention over its normalization. An audit of eighteen configurations across five modalities confirms the issue is widespread: the normalization-only control should be reported before crediting transfer to the encoder.

TOGEARI constructs a compressed contact correction for condensed finite-element equations with incremental potential contact (IPC). A core-conditioned interaction matrix ranks contact combinations by their mechanical responses; a raw-factor proxy acquires only the retained responses. For a symmetric positive-definite core, the reference analysis gives the exact spectrum, scaled inverse error and optimal worst omitted interaction. The selected responses are maintained through signed contact changes using supported operator images and a small coarse matrix. A complementary Schur spectrum and perturbation bounds connect this construction to the full current linear equation, damped local Newton steps and compatible episode reuse. On a 325,260-coordinate finger/cup problem, eight selected directions reduce Krylov work from eleven columns to five, matching full contact. Two reversed-order load studies give matching anchored displacements and accepted normal reactions, with 28.8-29.3 percent less warm time and 5.1-5.3 percent less complete time than per-step direct refactorization. A completed twelve-episode run saves 18.8 percent of total time against direct and 2.8 percent against a held factor. Full response caching has comparable time with 7.5 times the response storage. A compressed repeat terminates at an energy line search; separate diagnostics identify constitutive cancellation and terminal-backtracking sensitivity. Larger-contact, held-out-load and frictional comparisons show where compression or preparation loses its advantage. The complete Newton equation remains the residual operator throughout; the convergence guarantees retain their stated reference and local hypotheses.

Scientific simulations often produce scalar volumes faster than they can be stored, transferred, and loaded, while in situ reduction must use only a limited share of simulation resources. This work encodes scalar fields as anisotropic Gaussian primitives under a fixed budget. The complete primitive set is allocated analytically from local field structure, including position, orientation, and shape, then refined directly against the scalar field without densification, pruning, or count changes. The selected budget determines encoded storage before refinement and, together with the iteration schedule, provides a controllable refinement-time budget. In a controlled benchmark, truncation-aware field evaluation reduces encoding time by up to 51x; 1.4 million Gaussians encode a billion-voxel volume in at most four minutes on one desktop GPU, with reduced-iteration refinement completing in under one minute. Across five datasets spanning 2.1 million to 1.1 billion evaluated voxels, compression-useful configurations achieve 15.0-38.7 dB PSNR at compression ratios from 2.2x to over 40,000x. Pre-encoding structure statistics characterize fields for which one-shot allocation yields limited gains from additional capacity. Because primitives retain scalar attributes rather than baked appearance, a single compact model serves every subsequent visualization state - supporting post-hoc transfer-function, colormap, lighting, and viewpoint changes without re-encoding.

When forecasting hourly returns for 1,000 US equities, we observe an unexpected phenomenon: predictions become nearly flat and show poor stock ranking, as measured by cross-sectional correlation. We call this forecast collapse. Surprisingly, the phenomenon largely disappears when forecasting trading volume under the same setting. We investigate forecast collapse across time-series foundation models (TSFMs), twelve deep-learning forecasting models, and 97 public benchmark configurations, and find that it is closely tied to target predictability. We identify two distinct reasons behind it: low predictability limits the amplitude of calibrated point forecasts, while per-series objectives leave cross-series structure unidentified. These findings reveal a calibration-ranking tradeoff: optimizing squared error leads to flat predictions, whereas directly optimizing cross-sectional correlation improves ranking but can inflate forecast amplitude by more than an order of magnitude. To address this tradeoff, we introduce CalibRank, a simple objective that balances calibration and ranking. On Finance1K, CalibRank nearly triples cross-sectional correlation while keeping amplitude close to the target, and improves correlation on all tested models. Our results reveal a blind spot in conventional time-series evaluation: per-series metrics can hide failures in cross-series structure needed by downstream decisions.

Machine learning is rapidly reshaping constitutive modeling, offers new ways to learn material behavior directly from experimental data, and challenges long-established modeling paradigms. But with a growing number of machine-learning-based approaches available, how do they compare in practice? In this paper, we use the classic experimental data of Treloar to benchmark popular frameworks for hyperelasticity: (Generalized-Invariant) Constitutive Artificial Neural Networks, Physics-Augmented Neural Networks, (Adaptive) Material Fingerprinting, and Efficient Unsupervised Constitutive Law Identification & Discovery. We compare their fitting performance, computational cost, hyperparameter sensitivity, and ease of implementation. Furthermore, we discuss the trade-offs between predictive accuracy and model complexity. The latter is assessed by quantifying both the number of material parameters in the discovered models and the computational time required to evaluate the constitutive model and its derivatives. The results show that all methods can reproduce the benchmark data remarkably well. Rather than identifying a single winner, we highlight the strengths and limitations of each approach and provide practical guidance for their use. The source code for all six methods, including the training and comparison scripts, as well as all results and data used in this study, is publicly available via https://doi.org/10.5281/zenodo.21915635.

Recently, multimodal large language models (MLLMs) have demonstrated strong potential in visual understanding and complex reasoning tasks. However, existing methods often struggle to efficiently transform visual cues from multimodal inputs and the semantics of the question into effective reasoning conditions, thereby limiting the reasoning performance of multimodal large language models. To address this challenge, we propose MMDynOpt-Agent, which models the dynamic optimization of multimodal reasoning as a Markov decision process via end-to-end reinforcement learning. Specifically, a lightweight multimodal agent serves as the decision policy and interacts with the target MLLM as the environment, adaptively steering its reasoning through multi-turn dynamic optimization prompts. Furthermore, to reduce the cost of multimodal reasoning, a reward mechanism that combines format compliance, answer correctness, and budget awareness is designed to jointly ensure reasoning accuracy and efficiency. MMDynOpt-Agent is transferable and generalizable, enabling training with one target MLLM and inference-time transfer to others. Experimental results on fifteen public datasets show MMDynOpt-Agent achieves strong performance and outperforms baselines. Our project is available at https://github.com/QwenQKing/MMDynOpt-Agent.

With the rapid rise of large language models, LLM-driven quantitative factor mining has become an increasingly active research area. However, existing methods still suffer from subjective direction design, limited integration of up-to-date multi-source information, semantic drift, factor redundancy, and the absence of an end-to-end feedback loop from factor discovery to portfolio backtesting. To address these limitations, we propose AlphaSeek, an end-to-end factor mining framework for quantitative investment that integrates automated direction discovery, trajectory-level factor evolution mining and self-iterative portfolio optimization. AlphaSeek first collects and summarizes multi-source financial information to identify promising mining directions. It then performs trajectory-level factor mining by extending the optimization unit from a single factor expression to a complete research trajectory covering hypothesis generation, factor construction, validation, backtesting, and feedback. Based on this design, we introduce evolution operators - parallel direction expansion, mutation and crossover - to improve search diversity, refinement quality and factor robustness. Finally, AlphaSeek constructs a self-iterative factor portfolio, allowing newly discovered factors to interact with an existing state-of-the-art(SOTA) factor library under redundancy-aware constraints. Experiments on CSI300 show that AlphaSeek achieves the strongest overall strategy-level performance on CSI300 with ARR of 8.28%, IR of 1.29 and MDD of 6.28%, while remaining competitive on factor predictive metrics with IC of 0.0454, while factors mined on CSI300 also achieve strong time-series return performance on CSI500 than other models, suggesting promising cross-market transferability under a zero-shot setting.

Kirigami, the art of cutting sheets, offers unique characteristics such as shape morphing, stretchability, and adaptability, with applications in deployable and reconfigurable structures. While Finite Element (FE) approaches are widely used to analyze kirigami structures, they are computationally intensive and prone to convergence issues. On the other hand, existing simplified and theoretical models for evaluating kirigami are typically restricted to specific designs and analytical scenarios. This paper proposes a generalized, computationally efficient reduced-order model based on the bar and hinge approach for analyzing any kirigami system. The model represents the entire kirigami structure using truss bars, bending hinges, and torsional springs, capturing both the deformation and internal forces of the system. We derive stiffness expressions for kirigami structures that experience stretching and out-of-plane bending deformations, as well as for structures that experience only in-plane stretching and rotations. The accuracy and robustness of the model are validated through comparisons with FE analysis and experimental data on both single-cut kirigami designs and more complex designs with multiple cuts. Our results demonstrate less than 5% difference in deformation predictions and achieve at least a tenfold computational speedup compared to FE simulations. Additionally, we demonstrate the model's capabilities through simulating complex scenarios, including kirigami-skinned crawlers, high-throughput property-space exploration, and in-plane kirigami-inspired metamaterials. These examples demonstrate computational capabilities that enable large-deformation structural simulations and high-throughput design exploration beyond the practical limits of conventional FE methods.

Local chemical perception and property reasoning are both essential for understanding how molecular structure determines properties. Current LLM-based chemical reasoning methods either receive SMILES/molecular images together with descriptions of local motifs, or reason directly from molecular images. Neither approach enables the model to focus on chemically meaningful regions before reasoning. To address this gap, we propose Visual Latent Structural Reasoning (VLSR), an end-to-end framework that jointly learns localization and reasoning from molecular images. Central to our approach is a localize-then-reason strategy. VLSR first learns to locate chemically meaningful regions in a molecular image. It then reasons about their property effects in a compact latent workspace before producing the final answer. Under the same inference setup, this design achieves 9.6X higher throughput than a comparable textual-reasoning baseline.

Limit order book (LOB) simulators are most useful to practitioners when they combine realistic market dynamics, computationally efficient sampling, controllable scenario generation, and the ability to generalize beyond the instruments seen during training—properties that existing agent-based and deep generative simulators provide only partially. We present FlowLOB, a conditional flow-matching generator of LOB trajectories, trained on multiple Hong Kong Exchange (HKEX) symbols at three sampling frequencies ($0.1$s, $1$s, $10$s) in tick-relative representation that transfers to unseen instruments. Because flow and diffusion models admit a common formulation, we train both with identical data, architecture, and budget, and sample both through the same fixed-step ODE solvers, yielding a controlled comparison of sampling efficiency and fidelity. Flow matching attains its best quality with only $10$ ODE-solver steps, whereas diffusion needs many more function evaluations to approach the same fidelity. At this efficient operating point, FlowLOB improves realism over baselines, two learned and two agent-based models, in most distributional metrics at the two finer sampling frequencies. We evaluate counterfactual controllability with a distributional test that asks whether changing a scenario condition moves the generated statistic toward the corresponding real tail regime; FlowLOB satisfies this criterion in most tested settings. Both realism and control effects transfer zero-shot on a held-out symbol. We additionally conduct ablation studies on the network architecture and the learning rate.

Generative models of limit orderbook (LOB) data have advanced rapidly, but their evaluation often focuses on stylised facts and selected market statistics. These measures provide useful diagnostics but may not capture the joint temporal and cross-level structure of order-book trajectories. We introduce LOB-ID, an embedding-based framework that adapts the Fréchet Inception Distance (FID) and Monge Inception Distance (MIND) to LOB data. To obtain domain-specific embeddings, we train the DeepLOB architecture on four months of Level-2 order-book data for five equities. We show that LOB-ID is stable across time, instruments, and embedding checkpoints, and rises monotonically under controlled distortions. We then construct a moment-matching attack against FID and a deep-book perturbation that evades statistic-based evaluation. MIND remains substantially more sensitive to both distortions. Finally, we score five generative LOB models, spanning stochastic baselines and deep learning approaches, and find that LOB-ID ranks them in line with the joint temporal and cross-level structure each captures by construction.

Organizational decisions are co-created while evidence, constraints, and human priorities continue to evolve. In conventional transcript-based multi-agent systems, humans typically provide an initial problem, agents deliberate internally, and the system returns a final response. BoardroomAI instead treats the human as a persistent participant who can intervene by challenging assumptions, modifying constraints, changing priorities, introducing evidence, or redirecting the decision process. We operationalize this human–agent coexistence through four components: (i) a typed decision graph representing evidence, assumptions, constraints, claims, objections, alternatives, risks, decisions, semantic dependencies, and specialist responsibility; (ii) an intervention compiler that converts confirmed human actions into explicit graph updates; (iii) dependency-aware propagation that identifies affected subgraphs, preserves unaffected artifacts, and selectively reactivates relevant specialists; and (iv) an evaluation framework measuring intervention impact, repair coverage, preservation, recomputation, and decision validity. Across 600 generated decision-DAG interventions, propagation matched exhaustive impact computation while inspecting only 14.59% of nodes. In a 12-case exploratory pilot, selective repair recomputed 62.11% of canonical nodes, preserved all gold-unaffected nodes, and produced valid updated decisions in six cases while abstaining in the remaining six. These abstentions show that correct intervention routing may still provide insufficient context for synthesis, motivating a decision-sufficient context closure for human-steered multi-agent deliberation. All results are synthetic and prototype-level.

Event-driven catalyst-outcome forecasting increasingly uses retrieval- and memory-augmented large language model agents for prediction. However, training-data contamination and temporal leakage can create an Evidence Chasm between reported accuracy and true predictive ability. We propose TIEM, a timestamp-gated framework with three coordinated components: an Event-Evidence Hypergraph (EEH) for timestamp-filtered multi-tier retrieval; a Case-based Skill Memory (CSM) for source-tagged temporal skills; and Heterogeneous Evidence-Experience Fusion Reasoning (HEFR) for evidence-experience fusion and prediction. We also introduce FinPURE, a recent-period A-share holdout benchmark, and use a Name-Date Probe to assess per-model name-date sensitivity rather than assuming training cutoffs. Results on five financial forecasting benchmarks show TIEM outperforms current baselines. Our project is available at https://github.com/QwenQKing/Fin_TIEM.

Introduction: Coupling between lateral deviation and axial rotation is a known feature of spinal mechanics, yet its behavior at the individual vertebral level during gait, as well as the association with sagittal posture remains poorly understood. Methods: This study analyzed spinal kinematics in a diverse cohort (n=642) using a non-invasive rasterstereography system with an instrumented treadmill, quantifying time-dependent coupling of rotation and lateral deviation for each vertebra from T3 to L4 during walking as well as the influence of sagittal posture on this coupling. Coupling behavior was analyzed with absolute phase lag, normalized signed area and tilt angle derived from the Fourier series. Results: Results revealed cranio-caudal patterns for all three metrics with differences between almost all adjacent vertebrae and different turning points, i.e., where the coupling behavior changed (from increase to decrease and vice versa). Generalized, as well as pooled static sagittal posture significantly modulated these patterns, while individual deviations from static sagittal posture influenced the metrics. Conclusion: These findings provide the first dynamic, vertebra-level characterization of spinal coupling during gait. Furthermore, they offer a foundation for an understanding of spinal biomechanics and the influence of static sagittal posture, potentially relevant to the diagnosis and treatment of spinal disorders.

Modern CFD increasingly places simulation inside workflows for design, inference, optimization, and data-driven modeling, creating pressure to connect physical models, numerical kernels, heterogeneous hardware, differentiation, and learning. Julia offers a distinctive approach: high-level scientific abstractions can be specialized for performance and composed within a common language and compiler ecosystem. This critical survey examines where that model benefits CFD software and where its limits remain. We review representative open-source projects and synthesize application-level evidence on performance, scalability, accelerator portability, automatic differentiation, and software composition. Published results demonstrate credible Julia-native CFD on large distributed CPU systems and multi-GPU platforms, as well as emerging differentiable workflows. Comparisons with C++ performance-portability frameworks, finite-element domain-specific languages, and JAX-based differentiable CFD show that these capabilities are not unique to Julia. Julia's distinction is their integration through shared types, dispatch, and specialization. The evidence is mixed: Julia has progressed beyond proof of concept in several CFD regimes, but still lacks the ecosystem breadth, industrial tooling, and deployment experience of established C/C++/Fortran environments. Its strongest current role is as a platform for developing and testing CFD architectures that connect simulation with downstream analysis.

Multimodal Large Language Models (MLLMs) have shown strong semantic understanding capabilities, but their direct use in low-altitude Unmanned Aerial Vehicle (UAV) mission generation remains limited by weak spatial optimization and inefficient route planning. To address this issue, we propose ARIES-Mission2, a zero-shot Vision-Language-Action (VLA) framework that decouples visual-semantic perception from physical route optimization. Given natural-language instructions and satellite imagery, ARIES-Mission2 first uses DeepSeek-V3 for task parsing and Molmo-7B for zero-shot target grounding, and then converts detected pixel locations into GPS waypoints through geospatial interpolation. To reduce the redundant backtracking caused by raw VLM-generated visiting orders, the back end formulates multi-target UAV traversal as a Traveling Salesperson Problem (TSP) and compares four candidate routes, including the raw VLM order and the routes optimized by PSO, GPSO, and IPSO. The minimum-cost closed-loop route is then selected for mission generation. Experiments on the UAV-VLPA-nano-30 benchmark show that ARIES-Mission2 achieves a total flight distance of 62.43 km, reducing the route length by 21.6% compared with the unoptimized VLA baseline (79.66 km) and by 9.5% compared with manual human planning (69.00 km). The complete 30-task workflow takes 575.40 s, averaging 19.18 s per task, which is approximately 3.6 times faster than human expert planning. Component-level timing shows that VLM inference dominates the runtime with 19.02 s per task, while the TSP solver requires only 0.16 s per task. Scalability analysis further indicates that the TSP module maintains lower growth in computation time as the number of targets increases.

Knowledge graphs used by agentic systems are often treated as flat stores of extracted triples, with little record of who owns a fact, why it was admitted, or how it should be used downstream. We argue that reliable agentic knowledge systems require governance as an essential component of graph construction to bridge this gap. We propose MAGG, a principled multi-agent framework for constructing Governed Knowledge Graphs that introduces explicit governance decisions for reliable and trustworthy knowledge sharing. A domain classifier first induces entity and relation types directly from document content, enabling operation in open-world settings without fixed schemas. Candidate triples are assigned to domain owners, reviewed against supporting evidence, admitted through governance decisions, and stored with audit metadata. The same ownership structure is reused during question answering, where queries are routed to domain-specific graph experts rather than answered through undifferentiated retrieval. Our evaluation demonstrates MAGG's effectiveness: On SciERC, MAGG improves strict triple F1 by 47% and mapped triple F1 by 51% over flat insertion. A blinded review of 120 triples finds governed-only triples more often source-supported than flat-only ones, and revised triples supported in 100% of cases. Finally, on MuSiQue, MAGG outperforms Microsoft GraphRAG by 9.0 exact-match points and 11.2 token-F1 points.

Compact mixed-radiation instruments must preserve a low-mass charged-particle entrance while providing enough high-Z depth for photon sensitivity. We first compare two detector heads within a 40 x 20 x 10 mm^3 design budget. S1 places bare CdZnTe (CZT) and passivated implanted planar silicon (PIPS) branches side by side and estimates three rates. S2 adds 0.50 mm of CZT behind PIPS to estimate X/gamma, low-beta, high-beta, and alpha rates. A hard-constraint search combines photon attenuation and deposition, Hecht charge collection, charged-particle energy loss, solid angle, resolution budgeting, timing, and response-matrix conditioning. Feasible screening points exist inside the initial envelope, but a fresh transport/electronics assessment gives only 25.04-25.07 cps/(uSv/h) under the robust H*(10) convention, and every conservative electronics draw exceeds 2.5% FWHM. We therefore retain the more informative S2 observation structure, relax only the 10 mm package-depth constraint, divide the bare CZT into independently biased layers, and add a low-noise sum channel for spectroscopy plus layer-resolved gradient-boosted classification for mixed-field analysis. The extension campaign contains 2.40 million Geant4 11.4.1 histories over three depths, five transport seeds, and 14 particle/energy cases. The final 40 x 20 x 12.570 mm^3 head uses 7.870 mm of bare CZT in five layers at 180 V per layer. Under the application-scenario U95 electronics profile, its live-time-corrected 662 keV sensitivity is 32.804 cps/(uSv/h), its independent-sum resolution is 2.303% FWHM at the 95th percentile, and the propagated beta/alpha absolute-efficiency lower bounds are 35.679%/39.832%. Additional endpoint transport covers 20 keV-3 MeV photons, 3-7 MeV alpha particles, and 155 keV-3.5 MeV beta spectra. The extended design therefore passes the original detector-performance criteria in the U95 model.

This paper reformulates the correction factor in the force-state of the bond-associated peridynamic (BAPD) model. The reformulation is established from the strain energy density equivalence between the BAPD model and the classical continuum mechanics (CCM) model at a material point. With the FEM solution taken as the reference, the proposed correction factor improves the accuracy of the BAPD solution in this study. Furthermore, a BAPD-CCM coupled model is developed based on the above energy density equivalence, and a “Morphing" function is introduced to achieve a smooth transition between the two models. For time integration, explicit schemes are adopted for both quasi-static and dynamic problems. In the spatial discretization, the CCM model is discretized by elements, whereas the BAPD model is discretized by particles. The solution accuracy of the coupled model is validated by comparison with the FEM solution and by evaluating the $L^{2}$ norm, the $H^{1}_{\mathrm{semi}}$, and the energy norm of the displacement error. Two- and three-dimensional numerical examples show that the proposed model has higher computational efficiency. For example, in the Mode I crack propagation problem, its computational cost is reduced by more than 72% compared with that of the pure BAPD model, and the predicted crack patterns agree with experimental results.

Optimizing digital content headlines for click-through rate (CTR) is an important problem in online media and recommendation systems. While large language models (LLMs) have demonstrated strong generative capabilities, their effectiveness for discriminative ranking tasks, such as selecting the highest-performing headline from a set of candidates, remains less well understood. In this work, we compare a LoRA-fine-tuned causal language model, LOLAQwen (0.6B), with a dense embedding regression model for headline selection. We formulate headline selection as a winner-take-all classification problem and evaluate both approaches using a dataset of 3,263 A/B-tested headline groups. Performance is measured using Top-1 accuracy, defined as the proportion of groups for which the model correctly identifies the highest-performing headline. The embedding regression model achieves a Top-1 accuracy of 42.79%, compared with 35.70% for the LoRA-fine-tuned language model. These results indicate that, for this headline selection task, a lightweight discriminative approach can outperform a small generative language model fine-tuned using parameter-efficient adaptation. The findings highlight the potential of embedding-based regression models as efficient alternatives to generative models for high-throughput content ranking applications.

The customization, optimization and stabilization of the process flow of a silicon bipolar phototransistor commits months of cleanroom time before a finished device can be measured, so a model that predicts device gain from process parameters before a run has value out of proportion to its accuracy. We study this problem on a real fabrication history, thirteen to fourteen process runs of a single device: a small-sample, hierarchically structured setting unlike the large-corpus regime of conventional virtual metrology. Decomposing the variance of device gain, we find that roughly half of it lies between process runs rather than within them, so recipe-only prediction is bounded by construction. Building on these findings we provide a forward gain predictor with a relative, uncertainty-aware signal, an inverse search that returns recipes for a target gain, and, as the foundation for all of it, a multi-level data-quality assessment tailored to the nested physical entities of fabrication (batch, wafer, die) with an explicit cross-level linkage score. The normalized dataset and analysis code are released for full reproducibility.

Financial time series exhibit non-stationary behavior, where the strength and extent of temporal dependencies vary across market regimes. Trending, low-volatility phases typically require long-range contextual information, whereas mean-reverting, high-volatility periods rely more heavily on short-term dynamics. Standard Transformer architectures, with fixed attention windows and static positional encodings, are therefore unable to adapt to such variations. In this work, we propose a regime-aware dynamic windowing framework that incorporates market regime information directly into the Transformer. We construct four generic regime signals from price series: volatility ratio, trend strength, local predictability ratio (LPR), and rolling autocorrelation. We incorporate these signals into the model through two mechanisms: (i) regime-augmented inputs to a standard Transformer architecture, and (ii) a modified attention layer that modulates attention weights using regime embeddings. Experiments on five S&P 500 stocks show consistent improvements across five evaluation metrics, demonstrating that regime-aware dynamic windowing enhances both interpretability and predictive performance in financial forecasting tasks.