arXiv:2605.18248v2 Announce Type: replace
Abstract: Interpretations are a fundamental tool in mathematical logic, allowing structures to be encoded within other structures via logical definitions. We study $\MSO$ \emph{multidimensional point interpretations}, where elements of an interpreted structure are represented by tuples of elements of the host structure, and address the problem of simplifying such interpretations by reducing their representation dimension.
To formalize simplification, we use the notion of \emph{reparameterization}. Our main result shows that, over the class of countable labelled linear orders, it is decidable whether a given $\MSO$ formula admits a $d$-dimensional reparameterization. As a consequence, every interpretation whose domain admits such a reparameterization is equivalent to a $d$-dimensional point interpretation.
Science Journals
arXiv:2605.17942v2 Announce Type: replace
Abstract: Feed-forward 3D reconstruction has advanced rapidly, but current models remain unreliable in UAV photogrammetric acquisition. We argue that this failure is caused not only by appearance-domain shift, but also by UAV-specific camera-geometry variations, especially oblique views and HFOV-height ambiguity. Existing UAV datasets mainly emphasize scene diversity and provide limited coverage of camera configurations, which restricts robustness evaluation and UAV-domain adaptation. To address this gap, we introduce UAVFF3D, a geometry-aware real-synthetic benchmark for feed-forward UAV 3D reconstruction. UAVFF3D contains more than 170k real UAV images and more than 370k synthetic images rendered from high-quality textured 3D models, covering diverse HFOVs, flight altitudes, viewing directions, and acquisition patterns. It also includes a controlled HFOV-height test subset for diagnosing projection-geometry ambiguity. We further propose an evaluation protocol that jointly assesses camera-geometry estimation and dense scene reconstruction under a shared global alignment, avoiding the bias caused by separate camera and geometry alignments. Experiments on representative feed-forward reconstruction models show that UAVFF3D-based domain adaptation consistently improves camera and geometry estimation, reducing Ray Error by up to 84.2%, Pose ATE by up to 76.0%, and Chamfer Distance by up to 41.1%. In oblique scenes, adaptation reduces the oblique-nadir rotation gap by up to 90.7%. Under HFOV-height ambiguity, it improves robustness across HFOV-height configurations and yields more stable performance across HFOV settings. Incorporating camera priors further improves reconstruction under UAV-specific acquisition geometries. The dataset and evaluation code are available at https://github.com/yanxian-ll/UAVFF3D .
arXiv:2605.19865v1 Announce Type: new
Abstract: Accurate camera viewpoint estimation under sparse-view conditions remains challenging, particularly in two-view scenarios. Recent approaches leverage diffusion models such as Zero123 to synthesize novel views conditioned on relative viewpoint, showing promising results when repurposed for viewpoint estimation via optimization with MSE loss. However, existing methods often suffer from nonconvex loss landscape with numerous local minima, making them sensitive to initialization and reliant on naive multistart strategies. We analyze these optimization challenges and visualize failure cases, showing that geometric ambiguities, such as symmetry and self-similarity, can mislead gradient-based updates toward incorrect viewpoints. To address these limitations, we propose a score-based method that reshapes the optimization landscape to guide updates toward the ground-truth viewpoint, followed by a refinement stage using a viewpoint-conditioned diffusion model. Experiments show that our method improves convergence, reduces reliance on brute-force sampling, and achieves competitive accuracy with higher sample-efficiency.
arXiv:2605.18889v1 Announce Type: new
Abstract: Modern machine learning forces practitioners to choose between powerful but expensive deep networks and fast but limited classical algorithms. Here we introduce Soft Learning, a framework that maintains a library of heterogeneous specialists -- spanning linear models, tree ensembles, kernel machines, and neural networks -- and discovers provably optimal combination weights through cross-validated non-negative least squares. Soft Learning is guaranteed to match or exceed the best weighted combination of its specialists, trains over two orders of magnitude faster than deep networks on CPU alone (72-435x faster across tested configurations), provides inherent interpretability through learned weights that reveal which algorithmic paradigm best fits the data, and is future-proof: adding specialists is mathematically guaranteed to maintain or improve performance. Across 37 datasets (25 classification, 12 regression) against nine methods including CatBoost and tuned deep networks, Soft Learning ranks first on 70% of tasks, achieves the best mean rank (Friedman test, p = 1.12 x 10^-12), and is the only method to simultaneously excel at both classification and regression -- all without GPU hardware or hyperparameter tuning. These results suggest a paradigm shift from "which algorithm is best?" to "what is the provably optimal combination?" -- a question Soft Learning answers with formal guarantees for any data modality.
arXiv:2605.19480v1 Announce Type: new
Abstract: Driver fatigue is a critical safety concern in advanced driver assistance systems. Driver monitoring models trained off-site on static datasets adapt poorly to real-world conditions, while standard federated learning imposes high communication overhead, assumes homogeneous architectures, and struggles with personalized driver data. We present FedADAS, a federated distillation framework enabling collaborative on-device learning across heterogeneous vehicular networks. FedADAS enables full model heterogeneity by exchanging only soft logits on a shared public dataset, allowing each vehicle to run a customized model tailored to its computational constraints. Additionally, we introduce a yawn recognition pipeline supporting training and inference on edge devices that provides two robust architectures: Performance-Efficient (99.7 MB) achieving 98.3% F1-score with 1.99ms inference time on a Jetson NANO, and a Memory-Efficient (0.6 MB) that trains an epoch in 6.12 minutes on a Jetson AGX Orin. In experiments with up to 115 edge clients, FedADAS significantly outperforms traditional federated learning approaches at higher client participation, achieving up to 9974x reduction in communication cost while maintaining a superior tradeoff between personalization and generalization under extreme data heterogeneity, demonstrating its suitability for real-world deployment. Code is available at https://opensource.silicon-austria.com/mujtabaa/fedadas
arXiv:2605.18389v2 Announce Type: replace
Abstract: Optimal transport provides a powerful framework for comparing measures while respecting the geometry of their support, but comes with an expensive computational cost, hindering its potential application to real world use cases. On manifolds, convolutional algorithms based on the heat kernel have been proposed to alleviate this cost, but their theoretical properties remain largely unexplored. We establish that the heat kernel cost converges to the optimal transport cost as time vanishes in the balanced and unbalanced cases. In the specific case of the 2-sphere $\mathbb{S}^2$, we ensure that the associated Sinkhorn divergences retains the desirable geometric and analytic properties of classical optimal transport discrepancies. Moreover, we leverage the harmonic structure of the sphere to derive a fast Sinkhorn algorithm, requiring only $\mathcal{O}(n)$ memory and $\mathcal{O}(n^{3/2})$ time per iteration, with fully dense GPU-friendly operations. We validate its computational efficiency on synthetic data, and discuss its potential use in the evaluation of global climate models, providing both spatial and seasonal insights into models performances.
arXiv:2605.19866v1 Announce Type: new
Abstract: Vision-Language Models (VLMs) parse documents end-to-end but frequently break down on layouts unlike those seen in training. We attribute this to a two-hop bottleneck: before the decoder can extract content (Hop 2), it must first classify and localize the enclosing layout entity (Hop 1), and when the first hop fails the second collapses into omissions, malformed structure, or autoregressive repetition. We pre-resolve Hop 1 outside the decoder by running a lightweight RT-DETR detector, serializing its outputs in the parser's native DocTags vocabulary, and injecting them into the prompt alongside the full page image. Unlike analyze-then-parse approaches that crop the page, or prior prompt-level priors written in plain text, our prior shares the decoder's generation space and leaves the global image in view as a fallback when detections are noisy. On a 10k-page structural out-of-distribution benchmark, markdown F1 rises from $0.37$ to $0.92$; on the Chinese subset of OmniDocBench, table TEDS rises from $0.01$ to $0.36$; and on the 26k-page ViDoRe V3 benchmark, infinite-loop decoding failures drop across every industrial domain tested. These gains cost $15\%$ wall-clock latency and a median of $74$ prompt tokens, with no architectural change to the base VLM. An attention-level analysis further reveals a bimodal phase shift in which the decoder attends to injected layout tokens when emitting structure and to image patches when emitting content, consistent with the two-hop bottleneck being alleviated. Model weights will be released to support reproducibility.
arXiv:2605.18850v1 Announce Type: new
Abstract: We introduce KadiAssistant, a privacy-by-design AI assistant integrated into the Kadi research data ecosystem, enabling researchers to efficiently access, aggregate, and synthesize information from heterogeneous, privacy-sensitive research data. Interdisciplinary fields such as materials science bring together disciplines with their own terminology and standards. While this convergence fuels innovation, it also makes it increasingly difficult to connect and access knowledge, as data are distributed across disciplines, organizations, and individuals. For example, battery research combines electrochemical measurements, materials characterization data, physics-based simulations, and manufacturing parameters, each using different formats, vocabularies, and standards. Efficiently storing and sharing such heterogeneous data via research data platforms, such as Kadi4Mat, demands domain knowledge, technical expertise, and familiarity with metadata schemas and interfaces. Research data also vary in sensitivity: newly generated 'warm' data are often private, whereas published 'cold' data are usually openly accessible. The Kadi ecosystem offers fine-grained access control needed for sensitive data. A solution for efficient information retrieval in Kadi must therefore respect the fine-grained access permissions. To address these intertwined challenges of information retrieval, strong data privacy, and complex access control, KadiAssistant combines a self-hosted large language model (LLM) with a privacy-preserving semantic search, inspired by retrieval-augmented generation, that can access files and record metadata on Kadi. This allows the assistant to screen, aggregate, and structure information into a highly informative answer. KadiAssistant therefore bridges terminology and standards, lowers access barriers for researchers, and strengthens the Findable pillar of FAIR data principles.
arXiv:2605.18892v1 Announce Type: new
Abstract: Federated learning (FL) enables collaborative learning of computer vision models, where privacy and regulatory constraints prevent centralizing data across devices or organizations. However, practical FL deployments often exhibit severe class imbalance and label skew, causing standard aggregation protocols to overfit dominant clients and degrade minority-class performance. We propose a data-free, class-wise contribution estimation and aggregation framework based on logit maximization (CELM) that does not require sharing raw data, client metadata, or auxiliary public datasets. The FL server probes client updates to obtain class-wise evidence scores and assembles a cross-client evidence matrix, which quantifies both per-class competence and class coverage. Using this matrix, we compute contribution weights that upweight clients providing strong, discriminative evidence for underrepresented classes. The resulting aggregation is stable due to simplex constraints and momentum smoothing, and it remains compatible with standard FL training pipelines. We evaluate the approach on representative vision benchmarks under controlled non-IID and pathological label splits, demonstrating that CELM-based aggregation improves robustness to imbalance and statistical heterogeneity, while yielding better performance without requiring any additional data exchange.
arXiv:2605.19345v1 Announce Type: new
Abstract: We demonstrate a high-stability laser offset-frequency locking technique based on a balanced filter discriminator. The beat note between two 852 nm external-cavity diode lasers is down-converted in two parallel arms using local-oscillator frequencies placed symmetrically around the desired offset frequency. After low-pass filtering and RMS detection, differential subtraction of the two detector outputs produces a dispersive frequency-error signal with a zero crossing primarily defined by the reference local-oscillator frequencies. This balanced configuration reduces sensitivity to common beat-power fluctuations and can improve the effective error-signal signal-to-noise ratio. The system was implemented for an 8.653 GHz offset corresponding to the cesium repumping frequency difference used in our laser-cooling setup. Measurements with different low-pass filters reveal a trade-off between discrimination sensitivity and feedback bandwidth. With an SLP-1.9+ filter, the locked beat frequency reached a fractional instability of $4\times10^{-15}$ at 10 s when referred to the 852 nm optical carrier. The residual dependence on photodetector optical power was also characterized, showing that amplitude-to-frequency conversion remains small in the optimized differential configuration. This approach provides a practical frequency-only offset-locking method for atomic-physics experiments requiring stable and tunable microwave-scale laser frequency offsets.
arXiv:2605.18904v1 Announce Type: new
Abstract: Model merging enables the reuse of fine-tuned models without joint training or access to original data. Dynamic merging further improves flexibility by selectively activating task-relevant parameters and efficiently composing experts across multiple tasks. However, existing dynamic methods either maintain a full shared model with tiny experts or allocate excessive capacity to experts, leading to suboptimal accuracy--efficiency trade-offs. To address this, we propose DiDi-Merging, a slim dynamic merging framework that leverages differentiable rank allocation to balance shared and expert parameters. By formulating parameter budgeting as differentiable rank optimization in low-rank modules and introducing a data-free refinement step to recover task fidelity, DiDi-Merging matches prior dynamic baselines at only 1.24x the parameters of a single fine-tuned model and surpasses them at 1.4x, substantially more compact than methods requiring > 2x storage. DiDi-Merging applies across vision, language, and multimodal tasks.
arXiv:2605.16137v2 Announce Type: replace
Abstract: Generating simulation-ready tabletop scenes from task instructions is an intriguing and promising research direction in the field of Embodied AI. However, existing task-to-scene generation methods rely exclusively on large language models (LLMs) to predict scene layouts, inevitably yielding object collisions or floating due to LLMs' inherent limitations in 3D spatial reasoning. In this paper, we present STABLE, a semantics-physics dual-system tailored for simulation-ready tabletop scene generation. STABLE consists of two complementary modules: (i) a Semantic Reasoner, a fine-tuned LLM trained on a structured tabletop scene dataset to generate coarse layouts from input task instructions, and (ii) a Physics Corrector, a physics-aware flow-based denoising model that outputs pose updates to refine layouts, which ensures the physical plausibility of scenes while preserves semantic alignment with task instructions. STABLE adopts a progressive generation paradigm: by alternating between the Semantic Reasoner and Physics Corrector, it incrementally expands the scene from task-critical objects to background objects. Experiments demonstrate that STABLE successfully generates simulation-ready tabletop scenes that strictly conform to task instructions and significantly enhances the physical validity of scenes over prior art.
arXiv:2605.15599v2 Announce Type: replace
Abstract: Extreme low-data fine-grained classification is common in expert domains where labeling is expensive, yet practitioners still need principled guidance for selecting pretrained encoders. We study emerald inclusion grading with a custom dataset of labeled images across three classes and ask: under matched backbone capacity, how does pretraining objective affect downstream representation quality? We compare four frozen ViT-B/16 encoders trained with supervised classification, contrastive learning (SigLIP2), masked reconstruction (MAE), and self-distillation (DINOv3), and evaluate them with leave-one-out cross-validation using linear and nonlinear probes. To control statistical noise in the low-N regime, we use permutation testing (N=1000) on macro one-vs-rest AUC. Supervised and contrastive encoders provide the strongest linear separability (logistic AUC: 0.768 and 0.735; SVM AUC: 0.739 and 0.697), while MAE improves under nonlinear probes (XGBoost AUC: 0.713). We find that DINOv3 underperforms across probe families in this domain. These results support a practical recommendation for extreme low-data FGVC: prioritize margin-enforcing pretraining objectives when data scarcity restricts probing to linear decision rules, and consider reconstruction-style encoders when nonlinear classifiers are feasible given dataset constraints.
arXiv:2605.15336v2 Announce Type: replace
Abstract: In this report, we present HoloMotion-1, a humanoid motion foundation model for zero-shot whole-body motion tracking. A key innovation of HoloMotion-1 is to scale control-policy training with a large-scale hybrid motion corpus, where video-reconstructed motions from in-the-wild videos provide the dominant source of motion diversity, while curated motion-capture and in-house motion data provide higher-fidelity supervision and deployment-oriented coverage. This data regime enables HoloMotion-1 to move beyond conventional MoCap-only training and exposes the policy to substantially broader behaviors, capture conditions, and motion styles.
Learning from such heterogeneous data introduces new challenges, including reconstruction noise, source-domain mismatch, uneven motion quality, and the need for temporal modeling under large behavioral variation. To address these challenges, HoloMotion-1 integrates large-capacity temporal modeling, a sparsely activated Mixture-of-Experts Transformer with KV-cache inference for real-time control, and a sequence-level training strategy that improves learning efficiency on extended motion sequences. Extensive experiments on multiple unseen motion benchmarks show that HoloMotion-1 generalizes robustly across diverse motion types and capture conditions, significantly improves tracking accuracy over prior methods, and transfers directly to a real humanoid robot without task-specific fine-tuning.
arXiv:2605.19283v1 Announce Type: new
Abstract: Sequential prediction is challenging in regimes of delayed disambiguation, where early observations are ambiguous and multiple latent explanations remain plausible until sufficient evidence accumulates. Standard approaches based on marginal inference struggle in this setting, either collapsing uncertainty prematurely or failing to recover once informative evidence arrives.
We introduce EviTrack, a test-time inference framework that operates over latent trajectories rather than marginal states. EviTrack maintains a set of competing trajectory hypotheses and applies evidence- and likelihood-ratio-based selection to delay commitment until supported by data, drawing inspiration from hypothesis management in multiple hypothesis tracking and track-before-detect.
To evaluate this setting, we construct a controlled synthetic benchmark with known latent ground truth that explicitly exhibits delayed disambiguation. At matched inference budget, EviTrack substantially outperforms sampling-based baselines, achieving faster post-disambiguation recovery.
These results show that, in delayed disambiguation regimes, moderate trajectory-level selection is more effective than increasing sampling coverage, highlighting selection over sampling as a key principle for reliable sequential inference.
arXiv:2605.18930v1 Announce Type: new
Abstract: Memory-augmented large language model (LLM) agents use iterative reflection and self-evolution to solve complex tasks, but these mechanisms introduce security risks. Existing agentic memory attacks require privileged access or explicit malicious content, making them detectable by advanced safety filters. This leaves a subtler attack surface underexplored: whether adversaries can induce agent to generate experiences that appear locally correct and semantically plausible yet induce harmful generalization during reflection. We find that reflective agents are vulnerable to such clean experiences, especially when paired with severe but plausible hypothetical consequences. Based on this observation, we introduce Obsessive Experience Poisoning (OEP), a low-privilege black-box attack requiring no direct control over the system prompt or memory database. OEP constructs adversarial clean edge-cases that combine locally correct solutions, non-transferable methods, and severe consequences, biasing reflection toward risk-averse rule formation. During memory consolidation, agents may over-trust self-generated reflections and distill localized experiences into high-priority but over-generalized rules, causing downstream failures. Evaluations across three domains show that OEP achieves ASR above 50\% with GPT-4o agents, and outperforms existing attacks under LLM auditing defense.
arXiv:2605.19814v1 Announce Type: new
Abstract: The preservation of witness beam polarization in wakefield accelerators will be crucial for future collider applications. While extensive theoretical studies on the injection and initial acceleration of polarized electrons exist, a study concerning higher-energy regimes has been neglected thus far. Besides the spin precession usually considered in wakefield-related research, radiative effects could become increasingly relevant at higher energies as the witness electrons perform betatron oscillations during which they will emit photons. In the present study, we use particle-in-cell simulations extended with Monte-Carlo routines to study the influence of radiative spin-flips on beam polarization. We find that at high energies, the importance of radiative effects on beam polarization mainly comes down to the alignment of the witness beam with respect to the wakefield.
arXiv:2605.14102v2 Announce Type: replace
Abstract: Autonomous language-model agents increasingly combine planning, tool use, document processing, browsing, code execution, and verification loops. These capabilities make agent systems more useful, but they also introduce operational failure modes that are not visible from final accuracy alone. This report presents ChromaFlow, a tool-augmented autonomous reasoning framework built around planner-directed execution, specialized tool use, and telemetry-driven evaluation. We analyze ChromaFlow on GAIA 2023 Level-1 validation tasks under clean evaluation constraints. A frozen full Level-1 baseline achieved 29/53 correct answers, or 54.72%. A later recovery configuration with expanded orchestration achieved 27/53 correct answers, or 50.94%, while increasing tracebacks, timeout events, tool-failure mentions, token-log calls, and campaign-log cost estimates. Two randomized 20-task smoke evaluations produced 12/20 and 11/20 correct answers, showing that small diagnostic gains can be unstable across samples. The central result is therefore a negative ablation: more aggressive orchestration did not improve full-set performance and increased operational noise. A later strict-provider full-Level-1 diagnostic reached 30/53, or 56.60%, under explicit integrity controls, but at substantially higher token-log cost. The report argues that bounded planner escalation, deterministic extraction, evidence reconciliation, provider-health gates, and explicit run gates should be treated as first-order requirements for reliable autonomous agent evaluation.
arXiv:2605.13793v2 Announce Type: replace
Abstract: Arguments are a fundamental aspect of human reasoning, in which claims are supported, challenged, and weighed against one another. We present an end-to-end large language model (LLM)-based system for reconstructing arguments from natural language text into abstract argument graphs. The system follows a multi-stage pipeline that progressively identifies argumentative components, selects relevant elements, and uncovers their logical relations. These elements are represented as directed acyclic graphs consisting of two component types (premises and conclusions) and three relation types (support, attack, and undercut). We conduct two complementary experiments to evaluate the system. First, we perform a manual evaluation on arguments drawn from an argumentation theory textbook to assess the system's ability to recover argumentative structure. Second, we conduct a quantitative evaluation on benchmark datasets, allowing comparison with prior work by mapping our outputs to established annotation schemes. Results show that the system can adequately recover argumentative structures and, when adapted to different annotation schemes, achieve reasonable performance across benchmark datasets. These findings highlight the potential of LLM-based pipelines for scalable argument mining.
Protocol-Driven Development: Governing Generated Software Through Invariants and Continuous Evidence
arXiv:2605.12981v3 Announce Type: replace
Abstract: Automated program synthesis lowers the cost of producing implementations but introduces a harder governance problem: determining which generated artifacts are admissible. Natural-language specifications are ambiguous, and example-based tests sample only part of the behavioral space. Used alone, neither provides a sufficient control boundary. We introduce Protocol-Driven Development (PDD), where the primary software artifact is a machine-enforceable protocol rather than code. We define a protocol as the triplet P = (S, B, O), specifying structural, behavioral, and operational invariants. Their conjunction defines the admissible implementation space of a software component. Under PDD, implementations are replaceable realizations discovered through constrained search. An implementation is admitted only if it satisfies the protocol and produces a verifiable Evidence Chain of compliance. Admission is grounded in protocol satisfaction and recorded evidence rather than trust in the generator. For deployed systems, we extend the Evidence Chain into a Dynamic Evidence Ledger. Runtime verifiers append signed observations, invariant checks, and violations to the ledger, allowing monitorable obligations to be continuously attested. This connects live failures back to the generation loop without granting the generator runtime authority. Combining formal methods, property testing, runtime verification, policy-as-code, and software provenance, PDD defines a governance model for automated software engineering. Its organizing principle is that code is transient, while the protocol carries durable authority.
arXiv:2605.18969v1 Announce Type: new
Abstract: We report the first experiment investigating ion acceleration and neutron generation irradiating thin plastic targets (CH2) and deuterated plastic targets (CD2) of thickness ranging from 30nm to 160nm using the 4PW (0.1 Hz) laser at CoReLS in South Korea. Thin wedge-shaped filters exploiting differing stopping ranges were designed to distinguish carbon 6+ ions from deuterons in shots with CD2 targets. The maximum energies of all ion species from both CH2 and CD2 targets were found to increase linearly with the laser intensity. The highest observed energy of each ion species scales as q (charge)^2/mass, which is more similar to the scaling expected for ponderomotive acceleration than to the scaling expected for TNSA. The maximum ion energies were also found to increase with target thickness. Utilizing the secondary interactions of the deuteron beam, we created a fast neutron source via deuteron breakup reactions on a copper converter. The neutron spectrum follows an exponential distribution with energy up to 15MeV. A neutron yield of 2x10^7n/J was observed from thicker targets, comparable to TNSA-regime laser-driven neutron sources and within one order of magnitude of the highest yields reported using Break-out-afterburner (BOA) acceleration with beryllium converters.
arXiv:2605.20161v1 Announce Type: new
Abstract: Understanding the mechanical behavior of quasi-parallel fiber networks is essential for improving the manufacturing processes of fiber-reinforced composites. Mesoscale models of dry yarns and reinforcements require constitutive laws that accurately reflect the heterogeneous microstructure of fiber bundles. This study aims to develop a numerical generator of random fiber bundles for microscopic parametric studies of compaction behavior. A real fiber bundle was first reconstructed from X-ray microtomography data, and the numerical strategy was validated by tracking fiber cross-sections along the bundle length, with a fiber-position error of 5.2%. Based on this validated framework, an experiment-independent generator was established to create parameterized fiber bundles. The generated bundles reproduced the experimental compaction response with good agreement. Parametric results showed that increasing fiber waviness enhances inter-fiber interactions, increases transverse stiffness, and requires a higher load to reach the same fiber volume fraction. This framework provides a useful microscopic basis for studying fiber-bundle deformation mechanisms and for developing future mesoscopic constitutive laws.
arXiv:2605.20138v1 Announce Type: new
Abstract: This article presents a Hamilton--Jacobi (HJ) reachability framework for a two--satellite collision avoidance problem operating in the same circular orbit, where relative motion is modeled in the radial--tangential--normal (RTN) frame using planar Hill--Clohessy--Wiltshire (HCW) dynamics. We define the target state space as unsafe relative configurations in the orbit plane corresponding to minimum separation requirements consistent with Federal Communications Commission (FCC) orbital standards. The interaction between spacecraft is formulated as a zero--sum differential game, where Player 1 is the controlled satellite and Player 2 is modeled as a bounded adversarial disturbance with unknown intent. We present the HJ formulation and compute backward reachable sets that characterize relative states from which collision cannot be avoided under worst-case disturbances, while states outside this set admit provably collision-free trajectories. These reachable sets are integrated with supervisory hybrid control logic to determine when evasive maneuvers must be initiated, enabling mathematically grounded safety guarantees for scalability.
arXiv:2605.20118v1 Announce Type: new
Abstract: High-energy (mJ) and high-peak-power (MW) multicycle terahertz (THz) pulses are essential for nonlinear THz spectroscopy and compact accelerator technologies, yet their generation by nonlinear optical frequency conversion remains inefficient and imposes severe demands on femtosecond driving lasers. Amplifying existing THz pulses offers an appealing alternative, but no power-scalable amplifier has been realized in the sub-THz regime. Here, we demonstrate an all-optical THz amplifier operating at 0.35 THz based on the modulation of nanosecond laser pulses by a weak THz field in periodically poled lithium niobate (PPLN). The THz-induced phase modulation is converted into an amplitude modulation using controlled group delay dispersion, forming a tailored pulse train that can efficiently drive high-energy THz generation in a second crystal, thereby amplifying the THz seed. By analogy to electronic klystrons, we term this device the Phlystron, in which the electron beam carrying the power is replaced by a photon beam. In this proof-of-concept experiment, a 3.3-fold increase in THz energy is achieved with commercial crystals. Scaling analysis indicates the potential for higher gain when using large-aperture PPLN devices and multi-stage amplification. The Phlystron thus provides a scalable route to powerful multicycle THz sources driven by readily available narrowband lasers.
arXiv:2605.19244v1 Announce Type: new
Abstract: A multiresolution technique on tessellation graphs for particle dynamics is proposed. This allows to split spatial field data given on millions of discrete particle positions into scale-dependent contributions. The Delaunay tessellation is used to define the graph, and Voronoi cell volumes are used to satisfy volume conservation. Our approach enables computation of the scale-dependent statistics of particle dynamics by leveraging a wavelet transformation of Lagrangian point particle data and is useful for characterizing particle clustering in turbulent flows. The technique is systematically verified by using synthetic data of randomly distributed particles in a two-dimensional plane. Then the applicability of the technique is demonstrated by extracting the scale-dependent particle velocity divergence of inertial particles in homogeneous isotropic turbulence from direct numerical simulation data. The result is verified by comparing the energy spectrum of the divergence with that obtained by a Fourier-based approach. Finally, the wavelet-based filtering to the particle velocity divergence is demonstrated to extract the effect of caustics in inertial particle clustering.