3,460+ open-access research outputs.
Finite Larmor radius magnetohydrodynamics (FLR-MHD) provides a hybrid model of plasma that explains how turbulent energy cascade extends to sufficiently small parallel length scales, potentially leadiโฆ
Massive stars (> 8 $M_\odot$) are known to have high degrees of multiplicity, e.g., with about 60% in triples or higher-order multiples. Such high levels of multiplicity may arise during formation (prโฆ
In this paper, we improve on Fouvry and Radziwi{\l}{\l}'s results on unbalanced convolutions. In particular, we find that if $(\alpha_m)$ and $(\beta_n)$ are sequences supported on $m\sim M$ and $n\siโฆ
Quantum Computing (QC) is often challenging for beginners due to its abstract concepts and mathematical foundations. This paper explores the use of gamification to support the learning of introductoryโฆ
The rapid growth in the size of large language models has necessitated the partitioning of computational workloads across accelerators such as GPUs, TPUs, and NPUs. However, these parallelization straโฆ
This paper aims to provide a proof of concept of the accuracy of simulations for advanced networking study. The particular target technology is the Differentiated Services (DiffServ) architecture. Theโฆ
We present an approach for enhancing non-playable characters (NPCs) in games by combining large language models (LLMs) with computer vision to provide contextual awareness of their surroundings. Conveโฆ
Apple Neural Engine (ANE) is a dedicated neural processing unit (NPU) present in every Apple Silicon chip. Mixture-of-Experts (MoE) LLMs improve inference efficiency via sparse activation but are chalโฆ
Modeling the Milky Way stellar halo requires well-determined density and velocity anisotropy profiles. However, it has been challenging to gather a large sample of stars with six-dimensional data thatโฆ
The matrix-free gather-batched-GEMM-scatter pattern eliminates global stiffness assembly for three-dimensional SIMP topology optimization, but the conventional three-stage implementation forces avoidaโฆ
Visual search in 3D environments requires embodied agents to actively explore their surroundings and acquire task-relevant evidence. However, existing visual search and embodied AI benchmarks, includiโฆ
Despite the rapid progress, LLMs for sequential decision-making (i.e., LLM agents) still struggle to produce diverse outputs. This leads to insufficient exploration, convergence to sub-optimal solutioโฆ
With the ever-increasing usage of serverless computing in both industry and academia, it is essential to understand the mechanisms that power the underlying platforms. As serverless is more than ten yโฆ
Reinforcement learning is a promising approach to autonomous and adaptive security management in networked systems. However, current reinforcement learning solutions for security management are mostlyโฆ
Sequential Quantum State Discrimination (SQSD) can be naturally framed as a sequential decision-making problem: at each time step, an agent must decide whether to perform an additional measurement to โฆ
Urban venues serve as arenas for social mixing, where individuals from different socioeconomic backgrounds share space during daily activities. While residential and activity-space segregation have beโฆ
For many materials, macroscopic mechanical behavior is determined by an intricate microstructure. Understanding the relation between these two scales helps scientists and engineers design better materโฆ
Large language models (LLMs) have shown remarkable capabilities in dialogue generation and reasoning, yet their effectiveness in eliciting user-known but concealed information in open-ended conversatiโฆ
Let \(H(n)\) denote the Hilbert number, i.e.\ the maximal number of limit cycles of planar polynomial vector fields of degree \(\le n\). A classical lower-bound mechanism for \(H(n)\) is \emph{replicaโฆ
The central goal of active learning is to gather data that maximises downstream predictive performance, but popular approaches have limited flexibility in customising this data acquisition to differenโฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ