arXiv:2605.22040v1 Announce Type: new
Abstract: Fluid antenna systems (FASs) are emerging as a reconfigurable-aperture technology that expands physical-layer design beyond fixed, rigid antenna geometries. While the \emph{fading diversity} of FASs -- which exploits spatial channel fluctuations for signal enhancement and interference avoidance -- has been widely studied, the \emph{geometry diversity} created by reconfigurable port placement remains far less understood, particularly for planar architectures under finite-aperture constraints. This paper develops a systematic analytical framework for finite-aperture planar fluid antenna arrays (FAAs). First, we derive a closed-form characterization of the minimum inter-port distance under uniform random placement over a rectangular aperture and show that it follows a Rayleigh law. Its mean scales as $\mathcal{O}(M^{-1})$, in sharp contrast to the $\mathcal{O}(M^{-2})$ behavior in the linear case in which $M$ represents the number of candidate ports, revealing a fundamentally more favorable packing geometry in two dimensions. Secondly, we establish a universal Cram\'{e}r-Rao bound (CRB) for joint elevation-azimuth estimation, governed by a $2\times 2$ \emph{geometric inertia matrix} whose determinant and eigenstructure fully capture the role of port placement in estimation precision. We further prove that both the trace and determinant of this matrix are invariant to the azimuth look direction. Third, we uncover an intrinsic \emph{precision--ambiguity trade-off}: maximizing the geometric determinant to minimize the CRB drives ports toward the aperture boundary, but simultaneously increases sidelobe-induced spatial ambiguity.
Science Journals
arXiv:2605.22042v1 Announce Type: new
Abstract: Flexure of Antarctic ice shelves under excitation from long ocean waves induces mechanical ice shelf stresses that amplify fractures and, hence, contribute to calving events. Here, a solution method is developed for a hydroelastic mathematical model of wave-induced ice shelf flexure, based on the conventional theory of a Kirchoff-Love plate floating on shallow water under linearised conditions, but allowing wave forcing of ice shelves with variations in both horizontal dimensions, and where the ice shelves are of arbitrary shape, including non-uniform thickness. The method uses finite elements specifically designed for the high-order hydroelastic system, and a Dirichlet-to-Neumann map to bound the computational domain in the open ocean. Following verification, the method is used to conduct novel studies on how the ice-shelf deflection is affected by the ice shelf shape, the incident wave direction and the proportion of the shelf that is grounded. The efficiency of the method allows the studies to be conducted over a broad frequency range, such that resonant responses are identified.
arXiv:2605.22043v1 Announce Type: new
Abstract: Multivariate time series (MTS) classification is foundational to pervasive computing and financial analysis, yet existing multi-scale paradigms are often constrained by suboptimal representation fidelity. We identify two critical bottlenecks: temporal non-causality in standard encoders that induces temporal confounding in non-stationary dynamics, and the absence of explicit channel saliency mechanisms that allows noise to contaminate the latent space. To address these challenges, we propose the Causal Attention and Spatio-temporal Encoder Network (CASE-NET), an architecture designed for structural manifold pre-conditioning. CASE-NET synergizes a Causal Temporal Encoder, which enforces physical arrow-of-time constraints via masked self-attention and causal convolutions, with an Adaptive Channel Recalibration module functioning as an information bottleneck to suppress detrimental noise. Comprehensive evaluations across six heterogeneous domains demonstrate that CASE-NET establishes new state-of-the-art benchmarks on four tasks, achieving a peak accuracy of 98.6% on the AWR dataset and superior robustness in non-stationary regimes.
arXiv:2605.22044v1 Announce Type: new
Abstract: Accurate localization of myocardial infarction is essential for risk stratification. While LGE-MRI remains the gold standard, it is resource-intensive. Integrating cine MRI with ECG enables a more detailed representation of infarct properties. Existing inverse MI inference methods overlook realistic scar morphology and cardiac repolarization, reducing sensitivity to subtle ECG variations and interpretability of infarct-induced electrophysiological changes. In this paper, we propose a novel framework for noninvasive MI localization using cardiac digital twins. To bridge the domain gap between simulation and reality, we introduce an anatomy-aware stochastic infarct synthesis strategy to synthesize realistic, irregular scars with border zones, mimicking ischemic transmural progression. We then construct a virtual cohort to simulate QRS-T waveforms, capturing both depolarization and repolarization dynamics. Furthermore, we design a Physiology and Anatomy Aware Network (PAA-Net) that jointly encodes 3D myocardial geometry and multi-lead ECGs to infer infarct areas with varying localizations, sizes, spatial extents, and transmuralities. Experimental results demonstrate that our framework significantly outperforms existing methods in inverse inference, achieving Dice scores of 0.7391 and 0.5503 for scar and border zone segmentation, respectively, while further enhancing the interpretability of the ECG-infarct relationship. Our code will be released upon acceptance.
arXiv:2605.22055v1 Announce Type: new
Abstract: Time Series Classification (TSC) is a long-standing research problem that has gained increasing attention in recent years with the rapid growth of large-scale temporal data. Despite substantial progress enabled by deep learning, designing TSC models that are both accurate and interpretable remains a challenging task. Many existing approaches adopt a direct feature-to-label classification paradigm, by collapsing high-dimensional temporal embeddings into class logits via a single linear projection (often after global pooling), the paradigm conflates feature extraction and decision logic into an inseparable mapping.
To address these limitations, we propose PDFTime, a prototype-guided framework that reformulates time series classification as a multi-stage decision process. Instead of direct feature-to-label mapping, PDFTime leverages learned prototypes to approximate class-conditional feature distributions in the latent space, enabling progressive discrimination through classification sub-tasks of varying granularity. To our knowledge, PDFTime is the first framework to reformulate time series classification as a decoupled, multi-stage similarity-based reasoning process, breaking the long-standing paradigm of direct, black-box feature-to-label mapping. Extensive evaluations demonstrate that PDFTime achieves state-of-the-art (SOTA) performance across UEA and UCR benchmarks. Notably, it secures the top-$1$ accuracy on 80 out of 128 datasets in the UCR archive, significantly outperforming recent strong baselines in both consistency and generalization.
arXiv:2605.22804v1 Announce Type: new
Abstract: In the Min-Sum-Radii (MSR) clustering problem, we are given a finite set X of n points in a metric space. The objective is to find at most k clusters centered at a subset of these points such that every point of X is assigned to one of the clusters, minimizing the sum of the radii of the clusters. The problem is known to be NP-hard even on metrics induced by weighted planar graphs and metrics with constant doubling dimension, as shown by Gibson et al. (SWAT 2008). In this work, we investigate the parameterized complexity of MSR on metrics induced by undirected graphs. We distinguish between weighted graph metrics (with positive edge weights) and unweighted graph metrics (where all edges have unit weight).
Weighted Graph Metrics: We show that MSR is W[1]-hard on metrics induced by weighted bipartite graphs, when parameterized by the combined parameter k (the number of clusters) and Delta (the cost of the clustering). We then investigate the structural parameterized complexity of the problem. Drexler et al. (arXiv:2310.02130) showed that the MSR problem admits an XP algorithm on metrics induced by weighted graphs when parameterized by treewidth, and asked whether this can be improved to fixed-parameter tractability. We first answer their question in the negative, and more strongly show that MSR stays W[1]-hard on metrics induced by undirected weighted bipartite graphs when parameterized by the vertex cover number plus k. We then turn our attention to parameters for dense graphs and show that MSR remains W[1]-hard when parameterized by k+Delta even on cliques and complete bipartite graphs. On the positive side, we employ the known XP algorithm parameterized by treewidth, to show that the MSR problem is FPT when parameterized by the parameter treewidth plus Delta.
arXiv:2605.21646v1 Announce Type: new
Abstract: Prototype-based explanations offer an intuitive, example-based approach to support the interpretability of machine learning black box classifiers but often lack feature-level granularity. We introduce a framework that integrates feature importance at two levels to address this gap. First, for local explanations, we propose \textit{alike parts}: a method that uses feature importance scores to highlight the most relevant, shared feature subsets between a classified instance and its nearest prototype, guiding user attention. Second, we augment the global prototype selection objective function with a feature importance term to actively promote diversity in the feature attributions of the selected prototypes. Experiments on six benchmark datasets show that this augmented selection process maintains or, in some cases, increases the prediction fidelity of the surrogate model, suggesting that feature diversity does not compromise model fidelity.
arXiv:2605.22176v1 Announce Type: new
Abstract: Citation counts remain the dominant metric for assessing research impact, yet they suffer from well-documented limitations: temporal lag, disciplinary bias, and Matthew effects. Here we propose LLM-Metrics, a research-impact assessment metric derived from the parametric memory of large language models (LLMs). The central hypothesis is that high-impact papers receive greater exposure in the academic community, that this exposure enters LLM training data in textual form, and that models consequently form stronger parametric memory of these papers. We designed four types of multiple-choice probes, covering title recognition, author recognition, method recognition, and venue recognition, and evaluated 549 computer science papers published in 2023-2024 across 17 LLMs spanning 0.5B to 72B parameters from six vendors. Of the 17 models, 15 produced positive predictions, 9 of which were significant at p less than 0.05, with an overall Spearman correlation of rho = 0.1495 and p = 0.0004 against citation counts. Three additional findings support the proposed mechanism. First, the predictive signal was stronger for 2024 papers, rho = 0.1880, whose citation counts were near zero at model-training time, reducing the plausibility of a simple reverse-causality explanation. Second, author-recognition probes showed the strongest discriminative power, consistent with an exposure-driven memory mechanism. Third, model scale and predictive power were non-monotonic: a 3B-parameter model, Llama-3.2-3B-Instruct, with rho = 0.1829, outperformed most larger models, supporting a selective-memory hypothesis in which the limited capacity of smaller models can serve as an effective information filter. LLM-Metrics offers a real-time, cross-disciplinary, citation-independent paradigm for research assessment.
arXiv:2605.22567v1 Announce Type: new
Abstract: Reinforcement learning has proven effective for enhancing multi-step reasoning in large language models (LLMs), yet its benefits have not fully translated to multilingual contexts. Existing methods struggle with a fundamental trade-off: prioritizing input-language consistency severely hampers reasoning quality, while prioritizing reasoning often leads to unintended language drift toward English. We address this challenge with LANG, a novel framework that leverages language-conditioned hints to guide exploration in non-English reasoning tasks. Our method incorporates two key mechanisms to prevent dependency on these hints: a progressive decay schedule that gradually withdraws scaffolding, and a language-adaptive switch that tailors learning horizons to specific language difficulties. Empirical results on challenging multilingual mathematical benchmarks reveal that LANG substantially enhances reasoning performance without compromising language consistency. Moreover, we show that our framework generalizes beyond mathematics, fostering more consistent language alignment across model layers
arXiv:2605.22668v1 Announce Type: new
Abstract: Diffusion transformers (DiTs) have emerged as a dominant architecture for text-to-image generation, yet their performance drops when generating at resolutions beyond their training range. Existing training-free approaches mitigate this by modifying inference-time attention behavior, often through Rotary Position Embeddings (RoPE) extrapolation combined with attention scaling. However, these strategies apply a uniform and content-agnostic scaling across RoPE components with distinct frequency characteristics, inducing a trade-off between preserving global structure and recovering fine detail. We introduce SEGA, a training-free method that dynamically scales attention across RoPE components according to the latent's spatial-frequency structure at each denoising step. This adaptive scaling improves both structural coherence and fine-detail fidelity. Experiments show that SEGA consistently improves high-resolution synthesis across multiple target resolutions, outperforming state-of-the-art training-free baselines.
arXiv:2605.05118v2 Announce Type: replace
Abstract: Recently, Deng et al. (2026) proposed Generative Modeling via Drifting (GMD), a novel framework for generative tasks. This note presents an analysis of GMD through the lens of Wasserstein Gradient Flows (WGF), i.e., the path of steepest descent for a functional in the space of probability measures, equipped with the geometry of optimal transport. Unlike previous WGF-based contributions, GMD can be thought of as directly targeting a fixed point of a specific WGF flow. We demonstrate three main results: first, that one algorithm proposed by Deng et al. (2026) corresponds to finding the limiting point of a WGF on the KL divergence, with Parzen smoothing on the densities. Second, that the algorithm actually implemented by Deng et al. (2026) corresponds to a different procedure, which bears some resemblance to the fixed point of a WGF on the Sinkhorn divergence, but lacks certain desirable properties of the latter. Third, the same same idea can be extended to the limiting point of other WGFs, including the Maximum Mean Discrepancy (MMD), the sliced Wasserstein distance, and GAN critic functions.
arXiv:2605.21812v1 Announce Type: new
Abstract: Deploying natural language search systems presents a critical cold-start challenge: no real user queries to learn linguistic patterns, and no relevance labels to train ranking models. We present a framework for generating synthetic queries and labels using large language models (LLMs), powering model training and evaluation for Airbnb's natural language search.
For query generation, we combine contrastive listing pairs from booking sessions with seed queries from user research to balance realism and diversity, enabling a cold-to-warm start transition as real user data becomes available. For label generation, we introduce contrastive generation that produces topicality labels by construction, and Virtual Judge (VJ) labeling for broader coverage.
We compare our approach against a no-seed contrastive baseline and an InPars-style baseline. For query length, the InPars baseline produces verbose queries with KL divergence of 12.03 vs. real users; our seed-guided approach achieves 0.66, a 7.5x improvement. For attribute type distributions, our approach achieves the lowest KL divergence (0.04), outperforming even seed queries (0.09). Experiments show our approach produces harder evaluation examples than the no-seed baseline (79% vs. 97% pairwise accuracy), providing discriminative signal for model improvement. We deploy production pipelines generating synthetic examples daily for embedding-based retrieval and ranking evaluation.
arXiv:2605.22034v1 Announce Type: new
Abstract: Visual grounding, the task of localizing objects described by natural-language expressions, is a foundational capability for agricultural AI systems, enabling applications such as selective weeding, disease monitoring, and targeted harvesting. Reliable evaluation of agricultural visual grounding remains challenging because agricultural targets are often small, repetitive, occluded, or irregularly shaped, and instructions may refer to one, many, or no objects in an image. Evaluating this capability therefore requires jointly testing localization accuracy, target-set completeness, and existence-aware abstention. To address these challenges, we introduce \textbf{AgroVG}, a multi-source benchmark that formulates agricultural grounding as generalized set prediction: given an image and a referring expression, a model must return all matching target instances or abstain when no target is present. AgroVG contains 10{,}071 annotation-grounded image-query pairs from ten source datasets across six target families: crop/weed, fruit, wheat head, pest, plant disease, and tree canopy. It supports bounding-box grounding (T1) across all six families and instance-mask grounding (T2) on sources with reliable instance-level pixel annotations, with queries covering single-target, multi-target, and target-absent regimes. AgroVG further provides task-specific protocols for box-set matching and query-level mask coverage. Zero-shot evaluation of 26 model configurations spanning closed-source MLLMs, open-source VLMs, and specialized grounding systems reveals persistent gaps: the best multi-target Set-$F_1$ reaches only 0.35, and the best positive-query mask success rate at IoU@0.75 remains below 0.17. Data and code are available at https://anonymous.4open.science/r/AgroVG-5172/ .
arXiv:2605.21814v1 Announce Type: new
Abstract: A common feature of most numerically optimized stellarator geometries is the presence of sharp ridges on outer flux surfaces, irrespective of the rotational transform. Despite their importance, an analytical theory for their existence has been lacking. In this work, we demonstrate that ridges are not artifacts but mathematical necessities. We develop such a theory for devices with quasisymmetry (QS). We demonstrate that QS exhibits close connections with the theory of geometrical optics, following Parker's ``optical analogy" (E.N. Parker, Geophys. Astrophys. Fluid Dyn, 1989). By mapping vacuum QS to the eikonal equation of geometrical optics, we derive the conditions for ridge formation, identified as field line caustics where magnetic field lines focus. Furthermore, we prove a geometric theorem for stellarator coil design: both ridges and filamentary coils must lie on the zero-determinant manifold of the magnetic gradient tensor. This topological constraint unifies the description of plasma ridges and external coils, providing a precise criterion for identifying valid coil locations and explaining the efficacy of the magnetic gradient lengthscale (J. Kappel et al., Plasma Phys. Control. Fusion, 2024) as a coil optimization parameter. We demonstrate that as the device becomes more compact, sharp ridges naturally form on the inboard side in quasiaxisymmetry. We support our analytical theory with extensive numerical evidence.
arXiv:2605.21829v1 Announce Type: new
Abstract: We consider the classic cake cutting problem in the Robertson-Webb model, with the objective of proportional fairness. We show that any randomized algorithm must use $\Omega(n \log n)$ queries.
arXiv:2605.21932v1 Announce Type: new
Abstract: Multi-Robot Task Allocation (MRTA) is a central challenge in decentralized multi-agent systems, where teams of robots must cooperatively assign and execute tasks under limited communication while optimizing global performance objectives. Auction-consensus algorithms, such as the Consensus-Based Bundle Algorithm (CBBA), provide scalable decentralized coordination with provable convergence, but rely on hand-crafted greedy scoring functions that often lead to suboptimal task allocations. This paper proposes a learning-enhanced auction-consensus framework in which CBBA's deterministic bidding mechanism is replaced by a neural bidding policy trained using reinforcement learning. Under a centralized training and decentralized execution paradigm, agents learn to compute task bids from partial local observations while retaining the standard auction and consensus phases for decentralized coordination. The learned bidding policy is trained using Proximal Policy Optimization with rewards shaped by proximity to globally optimal solutions obtained via mixed-integer linear programming. Multiple neural architectures are evaluated, including a Neural Additive Model, the Long Short-Term Memory (LSTM) model, and the Set Transformer Model. Experimental results across varying swarm sizes demonstrate that learned bidding policies can improve solution quality over classical CBBA while preserving decentralized execution. The proposed approach highlights the effectiveness of integrating reinforcement learning with classical distributed coordination algorithms, offering a scalable pathway toward higher-quality decentralized multi-robot task allocation.
arXiv:2605.16362v2 Announce Type: replace
Abstract: Activation steering offers a lightweight way to control LLMs without retraining, but its effectiveness varies sharply across concepts. Prior work often reads this variability as evidence that many concepts are not captured by a single steering direction. We argue instead that much of it reflects search difficulty: a useful rank-1 intervention often exists, but finding it can be expensive.
We formalize rank-1 steering as a budget-constrained optimization over intervention layer and coefficient. Across concepts and model families, prompt-boundary directional alignment predicts where effective interventions occur, enabling geometry-guided search that reaches high utility with substantially fewer evaluations, reducing the trials needed to recover 95% of best-found utility by 39.8% on average across three model families. To explain why some concepts remain expensive even under better search, we introduce concept granularity, a measure of directional heterogeneity across contrastive contexts. Granularity distinguishes concepts whose difference vectors share a stable global direction from those where prompts agree locally within each input but the utility-maximizing direction rotates systematically across inputs. Higher granularity is associated with slower convergence and lower best-found performance (Pearson $r{=}0.44$ with trials-to-95%, $r{=}{-}0.46$ with best-found utility, both $p<0.001$).
We present GRACE, a Granularity- and Representation-Aware Concept Engineering framework that uses activation geometry to diagnose the dominant source of steering difficulty, select the appropriate remedy, and allocate optimization effort efficiently. Our results shift the frame from "when does rank-1 fail?" to "when is rank-1 cheap and stable?", turning activation geometry from a descriptive tool into an actionable prior for LLM control.
arXiv:2601.12188v2 Announce Type: replace
Abstract: The accuracy of one-shot $G_0W_0$ and Bethe-Salpeter equation (BSE) calculations depends strongly on the underlying starting-point eigensystem, which is commonly obtained from a mean-field density-functional approximation. Range-separated hybrid (RSH) functionals provide a particularly effective starting point, however, conventional optimally tuned RSH procedures often require costly, system-specific, multi-step optimizations of the range-separation parameter $\omega$. In this work, we show that a recently proposed effective tuning protocol [Singh \textit{et. al.}, Journal of Physical Chemistry Letters, 16, 32, 8198-8208, (2025)] for RSH functionals can serve as an efficient alternative for determining $\omega$ used in $G_0W_0$ and BSE calculations. This simplified tuning scheme yields range-separation parameters that are effectively equivalent to those obtained from more elaborate tuning strategies, while avoiding their substantial computational overhead. The resulting tuned RSH eigensystems provide reliable starting points for many-body perturbation theory. In particular, one-shot $G_0W_0$ calculations based on effectively tuned RSH orbitals reproduce reference ionization potentials with high accuracy, while subsequent BSE calculations yield quantitatively reliable neutral excitation energies, optical absorption spectra, and excitonic properties for a diverse set of molecular systems and clusters. These results demonstrate that effective RSH tuning offers a practical and broadly applicable route to accurate quasiparticle and excited-state calculations, combining the accuracy of optimally tuned starting points with the low computational cost required for routine applications of $G_0W_0$ and BSE.
arXiv:2605.21539v1 Announce Type: new
Abstract: We propose DualOptim+, a novel optimization framework for improving machine unlearning in large language models. It introduces a base state to capture common representations shared by forgetting and retaining objectives and delta states to preserve objective-specific residuals. This architecture allows the optimizer to adaptively bridge shared and decoupled states based on the directional conflict between forgetting and retaining gradients. We further introduce DualOptim+ 8bit, a quantized variant that reduces memory overhead without compromising performance. Extensive experiments across fictitious and real-world unlearning, safety alignment, and multi-task learning tasks demonstrate that DualOptim+ consistently achieves a superior trade-off between different objectives. Codes are available at https://github.com/CityU-MLO/DualOptimPlus.
arXiv:2605.21687v1 Announce Type: new
Abstract: A method for measuring the altitude and particle size of noctilucent clouds, based on positioning and photometry from wide-angle three-color cameras, has been developed to determine the three velocity components, particle radius, and its derivative with respect to time for different cloud fragments. The updated method is applied to observational data of bright clouds during the summers of 2023-2025. Meridional motion of the cloud is found to be the principal factor driving the change in particle size. The effect of particle size evolution in the presence of a strong latitudinal temperature gradient is also studied.
arXiv:2605.22223v1 Announce Type: new
Abstract: We study how we can leverage only a handful of characteristics of a transformer's architecture to closely predict the number of different sequences it can output, both qualitatively and quantitatively. We provide an upper bound depending on the length of the prompt, which we show empirically to be tight up to a factor less than 10, across architectures and model sizes. Our analysis also provides a theoretical explanation for previously observed empirical failures of transformers on simple sequence tasks, such as copying and cramming. Formally, we prove that (i) the maximal length of accessible sequences (those that the transformer can output for some prompt) grows linearly with the prompt length, (ii) beyond a critical threshold, the proportion of accessible sequences decays exponentially with sequence length, and (iii) the linear coefficient relating prompt length to accessible sequence length admits a theoretical upper bound. Notably, these results hold even with unbounded context and computation time.
arXiv:2605.22228v1 Announce Type: new
Abstract: Aspect-based sentiment analysis (ABSA) requires models to bind sentiment evidence to the correct aspect, making it a natural testbed for fine-grained structural reasoning. We introduce GHI, a Graphormer-over-Conditioned-Hypergraph-Incidence framework that is designed as an incidence-based structural reasoning layer built on a bipartite topology. GHI represents diverse linguistic and semantic evidence as token--hyperedge incidence relations, allowing different structural signals to be incorporated through a unified interface. Extensive experiments on six standard ABSA benchmarks show that GHI outperforms all baselines on the SemEval domains, and multi-seed evaluations show stable improvements over strong DeBERTa. Further experiments show that with only 247M parameters, GHI approaches the performance of 11B Flan-T5 based methods on the ISE benchmark. Moreover, it demonstrates strong robustness on the challenging ARTS datasets, maintaining highly competitive performance where traditional models degrade. These results demonstrate that compact structural reasoning remains a valuable alternative to scale-driven approaches for fine-grained tasks.
arXiv:2605.21499v1 Announce Type: new
Abstract: Grid-based neural networks such as convolutional autoencoders are widely used in dimension reduction-based surrogate models for computational fluid dynamics. In recent years, the use of coordinate-based approaches like conditional neural fields has emerged. Their independence of the spatial discretization is a beneficial feature for various applications in computational fluid dynamics. This paper discusses the spatio-temporal prediction of aircraft ditching loads using a conditional neural field approach. The model is evaluated using two datasets for the dynamic loads of the fuselage of a DLR-D150 aircraft, one of which relates to a single fixed spatial discretization and the other that includes data from different discretizations. When paired with a long short-term memory (LSTM) network in the latent space, the neural field-based model achieves a spatio-temporal prediction accuracy for the first data set that is close to that of grid-dependent convolutional autoencoder-based models, and with significantly less parameters. Results for the second data set demonstrate the ability of the neural field-based approach to reconstruct ditching loads accurately for heterogeneous spatial discretizations. This allows for flexible use of training datasets generated for different geometries and/or discretizations, as well as the use of the surrogate model to predict loads for different configurations.
arXiv:2605.21503v1 Announce Type: new
Abstract: Along with the development of the scripting technology in cartography, such as the GMT and libraries of R programming language, geologic and geophysical mapping is being vigorously promoted, where the integration of the thematic data, such as GEBCO, EGM-2008 and geological raster and vector layers is one of the primary datasets that provides the high-resolution raw sources for cartographic visualization in the geologically complex regions like Pakistan. This study aims to integrate scripting methods of automated cartography, methods of applied geoinformatics for geomorphometric analysis and technical data processing (formatting, projecting, plotting), to provide a synthesis of the geological, geophysical and geomorphological maps of Pakistan they as new information supporting analysis of the geospatial variations of geology, geomorphology, tectonics and gravity fields with a special focus on the geologically remarkable region of Pakistan: Sulaiman Fold Belt and Muslim Bagh ophiolite complex. This study presents new 12 thematic maps, which are technically made using scripting approaches and open tools. All maps cover the region of Pakistan and they are made using open source tools: GMT, R and QGIS. A GMT and R based scripting mapping is applied for mapping Pakistan, and its algorithm steps are presented stepwise as code snippets. A system complex approach of the data integration and formats reshaping, data conversion and reformatting for a single project of the geology of Pakistan is designed and developed based on the combination of the programming and scripting techniques and with additional mapping, which integrates the geospatial datasets. Correlation between spatial phenomena of Earth's gravity, geologic evolution and tectonic movements were commented.
arXiv:2605.21512v1 Announce Type: new
Abstract: In this paper we discuss extensions of the canonical quantization procedure in quantum field theories. We focus specifically on S-matrix representation as a T-exponent. This extension involves flat bundles on certain infinite dimensional functional manifolds of local time. The motivating problem is first principles treatment of bound states in quantum chromodynamics as well as precision physics of hydrogen atom and the muonium. Our main results include systematic treatment of flat bundles in an infinite dimensional setting, generalization of Hamiltonian evolution and functional renormalization group evolution equations in quantum field theories. We discuss several results from finite dimensional theory that have analogies in the functional setting. This includes construction of moduli space of flat connections and isomonodromic deformations. One of the outcomes of our analysis is a construction of a rich family of functional flat bundles with rational connections. This class of connections exhibits a rich set of mathematical properties. In particular, we construct examples of spaces fundamental groups of which have a definable continuum of generators. Physical states correspond to points in the moduli space of bundles on these spaces. On the physics side of things, we conclude that spacetime notions, such as spaces of particle configurations, emerge effectively as spectral sets of functional differential operators.