3,244+ open-access research outputs.
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 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…
Stephen Wolfram proclaimed in his 2003 seminal work "A New Kind Of Science" that simple recursive programs in the form of Cellular Automata (CA) are a promising approach to replace currently used math…
The Beagle framework, through GPU-based Genetic Programming, enables population dynamics previously unattainable (within practical time frames) by CPU-constrained Genetic Programming systems. This wor…
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…
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…
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 present a robust and accurate numerical method for the anisotropic diffusion equation in curvilinear coordinates. This study extends the recent work [Muir et al., Computer Physics Communications, 2…
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…
Photonic stepped-frequency (SF) radar offers high range resolution and only requires low-speed driving electronics, but existing architectures face challenges in achieving low phase noise and uniform …
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…
This study examines who adopts generative AI and whether early adoption has begun to reshape the task content of jobs across 35 European countries. Adoption ranges from under 3% to 25%. Occupational e…
We give a new simple geometric proof that any seven points in the plane have four Tverberg partitions into three sets. This is the only confirmed non-trivial case of Sierksma's conjecture. Earlier pro…
Stepped-wedge cluster randomized trials (SW-CRTs) evaluate interventions rolled out across clusters over time. Standard analyses typically use immediate-treatment (IT) models, which assume effects beg…
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…
Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We prove this for every nonrecursive \ce\ many-one degree containing a $D$-maximal set.…
Rydberg atoms, which possess exceptionally large electric dipole moments, offer a promising route for electric field sensing as well as metrology traceable to the International System of Units (SI); 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 →