Searcharxiv⌕ Search

arXiv subjects

Ao Xiao

Publications and source records attributed to Ao Xiao.

5 recordsLinked to original sources

Exact multiplicity for a Minkowski-curvature Neumann problem with a step weight

The DEG1 challenge asks whether positive solutions of a super-exponential Minkowski-curvature equation are unique for step weights with a single sign change and negative mean. In this paper, we give a Neumann counterexample by studying $\left(\frac{u'}{\sqrt{1-(u')^2}}\right)' + λa_{μ,h}(t)(e^{u^2}-1)=0$ with $u'(0)=u'(2h)=0$, where $a_{μ,h}=1$ on $(0,h)$ and $a_{μ,h}=-μ$ on $(h,2h)$, with $μ>1$. Using the shooting method, we prove that the positive solution curve has exactly two nondegenerate folds for $(λ,h)$ in a nonempty open region. As $μ$ increases through the corresponding critical values, the number of positive solutions is successively $1$, $2$, $3$, $2$, and $1$.

math.CA↗

Time-Efficient Active Bearing-Only Localization with Reception and Coverage Guarantees

We consider the localization and removal of a stationary omnidirectional radio source using a mobile sensor with bounded bearing errors and an unknown reception radius within known bounds. The objective is to minimize expected remaining action time under a fixed continuation policy while guaranteeing reception and source removal under the sensing model. A three-disk filter ensures reception, and a minimum enclosing circle certifies coverage of all bearing-consistent source positions. Monte Carlo sample-average search ranks a finite candidate set by complete mission time, including travel, readings, terminal service, and a finite fallback scan that ensures completion under the stated assumptions. In the reference case, 5000 independent validation missions average 60.40 s (approximate 95\% confidence interval: [59.96, 60.84] s), saving 19.39\% relative to a prescribed lateral point and 0.79\% relative to a short-travel point. All 25,000 selected-point validation missions across five initial geometries succeed, with lower mean completion times than both prescribed designs. A same-grid objective ablation shows that minimizing travel or reading count alone can increase mean completion time.

math.OC↗

Positive solutions to semipositone problems with mean curvature operator in Minkowski space

We establish the existence of a positive solution for a one-dimensional Minkowski-curvature equation with mixed boundary conditions and a sign-changing nonlinearity. A nonnegative linear shift and the Green kernel of the associated linear problem produce an invariant cone. Principal-eigenvalue comparisons and the fixed point index give cone expansion near zero and compression at infinity. A globally defined auxiliary equation and a first-contact argument show that the resulting solution has slope below one and hence solves the original equation. We also derive a directly verifiable asymptotic criterion.

math.AP↗

An Infinitesimal Circular Morera Theorem

We prove an infinitesimal circular version of Morera's theorem. Let $D\subset\mathbb{C}$ be a domain and let $f\in C(D)$. If, at every $a\in D$, $\int_{\vert{}ζ-a\vert{}=r}f(ζ)\,dζ=o(r^2)$ as $r\to0^+$, then $f$ is holomorphic in $D$. In particular, exact vanishing of all sufficiently small centered circular integrals implies holomorphicity. The proof uses a local distributional $\partial$-primitive, a circular identity for weak $\partial$-derivatives, and a pointwise asymptotic mean-value criterion for harmonicity.

math.CV↗

Huawei Cloud Model-as-a-Service on the CloudMatrix384 SuperPod

Scaled-out MoE LLMs and scaled-up SuperPods create new systems challenges for production Model-as-a-Service (MaaS), requiring disaggregation, low-latency communication, and decentralized serving. This report presents xDeepServe, the production serving system behind Huawei Cloud's MaaS offering on CloudMatrix384, a 48-server SuperPod with 384 Ascend 910C chips connected by a high-bandwidth UB fabric and global shared memory. It serves models including DeepSeek, Kimi, GLM, Qwen, and MiniMax, among others. xDeepServe is built around Transformerless, a disaggregated execution architecture that decomposes transformer inference into modular units -- attention, feedforward, and MoE -- and supports disaggregated Prefill-Decode and MoE-Attention deployments. To enable disaggregation, we develop XCCL, a memory-semantic communication layer providing microsecond-level point-to-point and scalable all-to-all primitives, and we extend FlowServe with decentralized DP groups and techniques to mitigate stragglers and synchronization variance. In a peak decoding configuration, xDeepServe reaches 2400 tokens/s per Ascend 910C chip at ~50ms time-per-output-token (TPOT).

cs.DC↗