Research
Research
Research
Research
1,754+ open-access research outputs.
Despite the operational importance of hot fixes, large-scale evidence on how they reshape routine maintenance workflows, particularly in the era of autonomous coding agents, remains limited. We analys…
We showed a positive energy theorem for asymptotically flat initial data sets with the concept of spectral PSC by He-Shi-Yu, Bi-Hao-He-Shi-Zhu and Brendle-Wang. Then, we proved a quantitative shieldin…
Standard text-to-speech (TTS) evaluation measures intelligibility (WER, CER) and overall naturalness (MOS, UTMOS) but does not quantify accent. A synthesiser may score well on all four yet sound non-n…
Commercial TTS systems produce near-native Indic audio, but the best open-source bases (Chatterbox, Indic Parler-TTS, IndicF5) trail them on measured phonological dimensions, and the most widely adopt…
A longest path in a graph is called a detour. Denote by $a(k,n)$ the minimum number of detours in a connected graph with minimum degree $k$ and order $n,$ and denote by $b(k,n)$ the minimum odd number…
The main aim of this paper is to study chains of model structures arising from cotorsion pairs in extriangulated categories. Starting with a hereditary Hovey triple, we construct further hereditary Ho…
Understanding scientific papers requires more than answering isolated questions or summarizing content. It involves an integrated reasoning process that grounds textual and visual information, interpr…
The advent of Large Language Models (LLMs) has fundamentally reshaped the way we interact with graphs, giving rise to a new paradigm called GraphLLM. As revealed in recent studies, graph learning can …
In long-context decoding for LLMs and LMMs, attention becomes increasingly memory-bound because each decoding step must load a large amount of KV-cache data from GPU memory. Existing acceleration stra…
Large Reasoning Models (LRMs) achieve strong performance on complex tasks through extended chains of thought but suffer from high inference latency due to autoregressive reasoning. Recent work explore…
Let $F_n$, $W_n$, and $\widehat{K}_n$ be the graphs obtained by joining a vertex to $n$ independent edges, a cycle and a path of order $n-1$, respectively. In this paper, we give new bounds for the Ra…
FPGAs are well-suited for dataflow architectures that process data in a streaming or pipelined manner, thus satisfying the high computational and communication demands of emerging applications. Howeve…
We study the first nonzero Steklov eigenvalue $\lambda_2(T,\delta\Omega)$ of the Dirichlet-to-Neumann operator on a finite tree $T$ with leaf boundary $\delta\Omega$, under a constraint on the diamete…
This paper develops a new framework for alpha testing in high-dimensional factor pricing models with time-varying coefficients. To detect sparse alternatives, we propose a spatial-sign-based max-type …
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 describe how the Schoen-Yau proof of the positive mass theorem can be extended to arbitrary dimensions. To overcome the problem of singularities, we propose a new inductive scheme. To carry out the…
We prove an explicit finite-sample version of the Borel--Cantelli lemma under $m$-dependence. Given any $m$-dependent sequence of events $(A_k)_{1\leq k\leq N}$, we show that \[ \mathbb{P}\Bigl(\big…
Large Language Models (LLMs) have shown a high capability in answering questions on a diverse range of topics. However, these models sometimes produce biased, ideologized or incorrect responses, limit…
PRISM-MCTS: Learning from Reasoning Trajectories with Metacognitive Reflection Siyuan Cheng, Bozhong Tian, Yanchao Hao, Zheng Wei Published: 06 Apr 2026, Last Modified: 06 Apr 2026 ACL 2026 Findings C…
Agentic AI systems capable of autonomous goal setting and proactive intervention introduce new challenges for regulating moral-emotional processes in learning environments. Existing frameworks typical…
Free open-access publishing with Google Scholar indexing.
Submission Guide →