2,889+ open-access research outputs.
Token serves as the fundamental unit of computation in modern autoregressive models, and generation length directly influences both inference cost and reasoning performance. Despite its importance, exโฆ
Detailed Computational Fluid Dynamics (CFD) simulations are too computationally expensive for the real-time control and design optimization of multiphase flow reactors. To address these limitations, wโฆ
We present an efficient and accurate implementation of hybrid exchange-correlation (XC) functionals in the SIESTA code, enabling large-scale simulations based on Hartree-Fock-type exact exchange combiโฆ
Minimizing the size of finite automata is a fundamental problem in theoretical computer science. Beyond standard minimization, further reductions can be achieved by decomposing an automaton into smallโฆ
We establish a necessary condition for pseudoprimality and a sufficient condition for primality of Fermat numbers, based on a congruence involving the exponent $(F_n-1)/4$. Moreover, in connection witโฆ
We propose a per-task leverage ratio for human-agent collaboration: human work displaced by an agent, divided by the human time required to specify the task, resolve mid-run interrupts, and review theโฆ
Efficient and fair spectrum allocation is a central challenge in 6G networks, where massive connectivity and heterogeneous services continuously compete for limited radio resources. We investigate theโฆ
With spotforecast2-safe we present an integrated Compliance-by-Design approach to Python-based point forecasting of time series in safety-critical environments. A review of the relevant open-source toโฆ
Malliavin calculus is a powerful and general framework for the analysis of square-integrable random variables, but it often suffers from a lack of tractability and explicit representations. To addressโฆ
Machine learning methods that predict initial guesses from molecular geometry can reduce this cost, but matrix-prediction models fail when extrapolating to larger molecules, degrading rather than acceโฆ
We propose a solution to the tenth of Professor Clark Kimberling's unsolved problems found on https://faculty.evansville.edu/ck6/integer/unsolved.html. We are required to find the parametric equationsโฆ
We study composition operators acting on the weighted Bergman spaces on the bidisc, i.e. $C_{\Phi}:A^2_{\beta}(\mathbb{D}^2)\to A^2_{\beta}(\mathbb{D}^2)$ where $\Phi$ is induced by rational inner funโฆ
The simulation of a physical system in a virtual replica, known as a digital twin, is a useful way to interrogate the system non-invasively, providing the ability to perform predictive maintenance andโฆ
Knowledge graphs (KGs) are increasingly integrated with large language models (LLMs) to provide structured, verifiable reasoning. A core operation in this integration is multi-hop retrieval, yet existโฆ
Let $\mathcal{O}_K$ be a complete discrete valuation ring with field of fractions $K$ and algebraically closed residue field $k.$ Let $G$ be a smooth connected commutative algebraic group over $K$ whiโฆ
Bitcoin transaction fees will become more important as the block subsidy declines, but fee formation is hard to study with blockchain data alone because the relevant queueing environment is unobservedโฆ
We analyze the constant step size subgradient method on nonsmooth, nonconvex functions. We identify geometric assumptions on the objective function under which i) its domain admits a partition (stratiโฆ
Spiking neural operators are appealing for neuromorphic edge computing because event-driven substrates can, in principle, translate sparse activity into lower latency and energy. Whether that advantagโฆ
We define several topological spaces whose points are quivers with a given infinite vertex set $X$. In the special case when $X$ is countably infinite, we show that two of the spaces of interest are hโฆ
We study a variant of a polygon partition problem, introduced by Chung, Iwama, Liao, and Ahn [ISAAC'25]. Given orthogonal unit vectors $\mathbf{u},\mathbf{v}\in \mathbb{R}^2$ and a polygon $P$ with $nโฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ