Source author record

Cao Yuan

Explore this author’s publications, collaborators and research topics. This catalog record has not been claimed by its author.

ResearcherUnclaimed source record

Catalog footprint

Research overview

4works
4topics
4close collaborators

Published work

4 publications

preprint2026arXiv

ECTO: Exogenous-Conditioned Temporal Operator for Ultra-Short-Term Wind Power Forecasting

Accurate ultra-short-term wind power forecasting is critical for grid dispatch and reserve management, yet remains challenging due to the non-stationary, condition-dependent nature of wind generation. Meteorological exogenous variables carry substantial predictive information, but the most informative variable combination varies across sites, operating conditions, and prediction horizons. Existing deep learning approaches either treat exogenous inputs as generic auxiliary channels through uniform mixing or soft gating, or rely on fixed preprocessing steps such as PCA, without exploiting the physical structure of meteorological variables. We propose ECTO (Exogenous-Conditioned Temporal Operator), a unified framework that decomposes exogenous variable modeling into two complementary modules. Physically-Grounded Variable Selection (PGVS) performs hierarchical, group-aware sparse selection over exogenous variables using a domain-informed physical prior and sparsemax activations, producing a compact, condition-adaptive exogenous context. Exogenous-Conditioned Regime Refinement (ECRR) routes the forecast through learned regime experts that apply gain--bias calibration and horizon-specific corrections via a mixture-of-experts paradigm. Experiments on three wind farms spanning different climates, capacities (66--200 MW), and exogenous dimensions (11--13 variables) demonstrate that ECTO achieves the lowest MSE across all sites, with relative improvements over the strongest baseline ranging from 2.2% to 5.2%, widening to 8.6% at the longer prediction horizon (H=32H=32). Ablation analysis confirms that each exogenous-related component contributes positively (PGVS +1.84%, ECRR +2.86%), and interpretability analysis reveals that PGVS learns physically meaningful, site-specific variable selection patterns, while ECRR converges to well-separated calibration strategies consistent across sites.

preprint2020arXiv

Conditional Image Generation with One-Vs-All Classifier

This paper explores conditional image generation with a One-Vs-All classifier based on the Generative Adversarial Networks (GANs). Instead of the real/fake discriminator used in vanilla GANs, we propose to extend the discriminator to a One-Vs-All classifier (GAN-OVA) that can distinguish each input data to its category label. Specifically, we feed certain additional information as conditions to the generator and take the discriminator as a One-Vs-All classifier to identify each conditional category. Our model can be applied to different divergence or distances used to define the objective function, such as Jensen-Shannon divergence and Earth-Mover (or called Wasserstein-1) distance. We evaluate GAN-OVAs on MNIST and CelebA-HQ datasets, and the experimental results show that GAN-OVAs make progress toward stable training over regular conditional GANs. Furthermore, GAN-OVAs effectively accelerate the generation process of different classes and improves generation quality.

preprint2016arXiv

Cyclic codes over Z4[u]/⟨uk⟩\mathbb{Z}_4[u]/\langle u^k\rangle of odd length

Let R=Z4[u]/⟨uk⟩=Z4+uZ4+…+uk−1Z4R=\mathbb{Z}_{4}[u]/\langle u^k\rangle=\mathbb{Z}_{4}+u\mathbb{Z}_{4}+\ldots+u^{k-1}\mathbb{Z}_{4} (uk=0u^k=0) where k∈Z+k\in \mathbb{Z}^{+} satisfies k≥2k\geq 2. For any odd positive integer nn, it is known that cyclic codes over RR of length nn are identified with ideals of the ring R[x]/⟨xn−1⟩R[x]/\langle x^{n}-1\rangle. In this paper, an explicit representation for each cyclic code over RR of length nn is provided and a formula to count the number of codewords in each code is given. Then a formula to calculate the number of cyclic codes over RR of length nn is obtained. Precisely, the dual code of each cyclic code and self-dual cyclic codes over RR of length nn are investigated. When k=4k=4, some optimal quasi-cyclic codes over Z4\mathbb{Z}_{4} of length 2828 and index 44 are obtained from cyclic codes over R=Z4[u]/⟨u4⟩R=\mathbb{Z}_{4} [u]/\langle u^4\rangle.

preprint2016arXiv

On a class of left metacyclic codes

Let G(m,3,r)=⟨x,y∣xm=1,y3=1,yx=xry⟩G_{(m,3,r)}=\langle x,y\mid x^m=1, y^3=1,yx=x^ry\rangle be a metacyclic group of order 3m3m, where gcd(m,r)=1{\rm gcd}(m,r)=1, 1<r<m1<r<m and r3≡1r^3\equiv 1 (mod mm). Then left ideals of the group algebra Fq[G(m,3,r)]\mathbb{F}_q[G_{(m,3,r)}] are called left metacyclic codes over Fq\mathbb{F}_q of length 3m3m, and abbreviated as left G(m,3,r)G_{(m,3,r)}-codes. A system theory for left G(m,3,r)G_{(m,3,r)}-codes is developed for the case of gcd(m,q)=1{\rm gcd}(m,q)=1 and r≡qεr\equiv q^ε for some positive integer εε, only using finite field theory and basic theory of cyclic codes and skew cyclic codes. The fact that any left G(m,3,r)G_{(m,3,r)}-code is a direct sum of concatenated codes with inner codes Ai{\cal A}_i and outer codes CiC_i is proved, where Ai{\cal A}_i is a minimal cyclic code over Fq\mathbb{F}_q of length mm and CiC_i is a skew cyclic code of length 33 over an extension field of Fq\mathbb{F}_q. Then an explicit expression for each outer code in any concatenated code is provided. Moreover, the dual code of each left G(m,3,r)G_{(m,3,r)}-code is given and self-orthogonal left G(m,3,r)G_{(m,3,r)}-codes are determined.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.