Research
Research
Research
Research
72,324+ open-access research outputs.
In this paper, we study a system of bosons trapped in a confining potential, interacting with a quantized field of coherent photons in the mean field description of non-relativistic Quantum Electrodyn…
Prior representative ReAct-style approaches in autonomous Software Engineering (SWE) typically lack the explicit System-2 reasoning required for deep analysis and handling complex edge cases. While re…
Exact hierarchical agglomerative clustering (HAC) of large spatial datasets is limited in practice by the $\mathcal{O}(n^2)$ time and memory required for the full pairwise distance matrix. We present …
In this paper, we introduce a functional and a geometric setting for an obstacle problem for nonlocal minimal graphs. In particular we study existence of solutions, a priori estimates, and we prove th…
Postmortem avatars (PMAs) -- AI systems that simulate a deceased person by being fine-tuned on data they generated or that was generated about them -- have attracted growing scholarly attention, yet t…
Fine-grained human action recognition (FHAR) is challenging because visually similar actions differ by subtle spatio-temporal cues. Many recent systems enhance discriminability with extra modalities (…
We say a hypergraph $\mathcal{H}$ contains a hypergraph $\mathcal{G}$ as trace if there exists a vertex subset $S \subseteq V(\mathcal{H})$ such that $|S| = |V(\mathcal{G})|$ and $\{e \cap S: e \in E(…
We give an independent eta-product derivation of the level-8 Apery limit lim B_n^{(8)}/s_n = (7/32) zeta(3), where s_n = sum_{k=0}^n C(n,k)^2 C(2k,n)^2 and B_n^{(8)} is the rational companion sequence…
The Stokes problem with non-homogeneous Dirichlet boundary condition is solved numerically using conforming discretizations and an approximation of the boundary datum in the corresponding trace space.…
Efficient and explainable breast cancer (BC) risk prediction is critical for large-scale population-based screening. Breast MRI provides functional information for personalized risk assessment. Yet ef…
In recent years, rapid advances in Multimodal Large Language Models (MLLMs) have increasingly stimulated research on ancient Chinese scripts. As the evolution of written characters constitutes a funda…
In this paper, we present a comprehensive overview of the NTIRE 2026 3rd Restore Any Image Model (RAIM) challenge, with a specific focus on Track 3: AI Flash Portrait. Despite significant advancements…
Contrastive Language-Image Pre-training (CLIP) has demonstrated outstanding performance in global image understanding and zero-shot transfer through large-scale text-image alignment. However, the core…
Multi-hop Knowledge Graph Question Answering (KGQA) requires coherent reasoning across relational paths, yet existing methods often treat each reasoning step independently and fail to effectively leve…
We investigate hard-core bosons at half filling on a three-leg ladder under the uniform artificial gauge field. By analyzing current patterns and correlation functions, we uncover a rich quantum phase…
Deep learning has greatly advanced medical image segmentation, but its success relies heavily on fully supervised learning, which requires dense annotations that are costly and time-consuming for 3D v…
ATANT v1.0 (arXiv:2604.06710) defined continuity as a system property with 7 required properties and introduced a 10-checkpoint, LLM-free evaluation methodology validated on a 250-story corpus. Since …
We propose that the enhanced Higgs quartic coupling required by radiatively broken electroweak symmetry (RBEWS) emerges naturally from SO(10) grand unification. Our previous analysis demonstrated that…
A central theme in extremal combinatorics is the study of the maximum number of edges in an $r$-uniform hypergraph ($r$-graph) with matching number at most $s$ (the Erd\H{o}s Matching Conjecture) or w…
In this paper, we study Sibson's $\alpha$-mutual information in the context of the additive Gaussian noise channel. While the classical case $\alpha = 1$ is well understood and admits deep connections…
Free open-access publishing with Google Scholar indexing.
Submission Guide →