arXiv subjects

Huajun Zhang

Publications and source records attributed to Huajun Zhang.

At least 19 recordsLinked to original sources

arXiv2026

The Erdős-Ko-Rado Theorem in $\ell_2$-Norm

The codegree squared sum ${\rm co}_2(\cal F)$ of a family (hypergraph) $\cal F \subseteq \binom{[n]} k$ is defined to be the sum of codegrees squared $d(E)^2$ over all $E\in \binom{[n]}{k-1}$, where $d(E)=|\{F\in \cal F: E\subseteq F\}|$. Given a family of $k$-uniform families $\mathscr H$, Balogh, Clemen and Lidický recently introduced the problem to determine the maximum codegree squared sum ${\rm co}_2(\cal F)$ over all $\mathscr H$-free $\cal F$. In the present paper, we consider the families which has as forbidden configurations all pairs of sets with intersection sizes less than $t$, that is, the well-known $t$-intersecting families. We prove the following Erdős-Ko-Rado Theorem in $\ell_2$-norm, which confirms a conjecture of Brooks and Linz. Let $t,k,n$ be positive integers such that $t\leq k\leq n$. If a family $\mathcal F\subseteq \binom{[n]}{k}$ is $t$-intersecting, then for $n\ge (t+1)(k-t+1)$, we have \[{\rm co}_2(\cal F)\le {\binom{n-t}{k-t}}(t+(n-k+1)(k-t)),\] equality holds if and only if $\mathcal{F}=\{F\in {\binom{[n]}{k}}: T\subset F\}$ for some $t$-subset $T$ of $[n]$. In addition, we prove a Frankl-Hilton-Milner Theorem in $\ell_2$-norm for $t\ge 2$, and a generalized Turán result, i.e., we determine the maximum number of copies of tight path of length 2 in $t$-intersecting families.

math.CO↗

arXiv2026

Structured Prompt Optimization for Few-Shot Text Classification via Semantic Alignment in Latent Space

This study addresses the issues of semantic entanglement, unclear label structure, and insufficient feature representation in few-shot text classification, and proposes an optimization framework based on structured prompts to enhance semantic understanding and task adaptation under low-resource conditions. The framework first uses a pretrained language model to encode the input text and obtain basic semantic representations. It then introduces structured prompts composed of multi-dimensional semantic factors and integrates them with text features through a learnable combination mechanism, which forms task-related representations with clear boundaries in the latent space. To further strengthen the consistency between text representations and label semantics, the method constructs a structured label embedding matrix and employs a cross-space alignment mechanism to ensure stable matching between textual features and label attributes. In addition, the model applies prompt orthogonality constraints and a joint optimization objective to maintain independence across different semantic factors in the prompts, allowing the structured prompts to provide transparent and controllable guidance for classification decisions. Three types of sensitivity experiments, including learning rate sensitivity, prompt length sensitivity, and data scale sensitivity, are designed to evaluate the stability and robustness of the framework under different conditions. Experimental results show that the proposed structured prompt optimization framework effectively alleviates semantic conflicts and label ambiguity in few-shot text classification. It significantly improves performance on accuracy, precision, recall, and AUC, and demonstrates strong cross-task applicability.

cs.CL↗

arXiv2025

Contrastive Knowledge Transfer and Robust Optimization for Secure Alignment of Large Language Models

This paper addresses the limitations of large-scale language models in safety alignment and robustness by proposing a fine-tuning method that combines contrastive distillation with noise-robust training. The method freezes the backbone model and transfers the knowledge boundaries of the teacher model to the student model through distillation, thereby improving semantic consistency and alignment accuracy. At the same time, noise perturbations and robust optimization constraints are introduced during training to ensure that the model maintains stable predictive outputs under noisy and uncertain inputs. The overall framework consists of distillation loss, robustness loss, and a regularization term, forming a unified optimization objective that balances alignment ability with resistance to interference. To systematically validate its effectiveness, the study designs experiments from multiple perspectives, including distillation weight sensitivity, stability analysis under computation budgets and mixed-precision environments, and the impact of data noise and distribution shifts on model performance. Results show that the method significantly outperforms existing baselines in knowledge transfer, robustness, and overall safety, achieving the best performance across several key metrics. This work not only enriches the theoretical system of parameter-efficient fine-tuning but also provides a new solution for building safer and more trustworthy alignment mechanisms.

cs.CL↗

arXiv2025

Integrating Structure-Aware Attention and Knowledge Graphs in Explainable Recommendation Systems

This paper designs and implements an explainable recommendation model that integrates knowledge graphs with structure-aware attention mechanisms. The model is built on graph neural networks and incorporates a multi-hop neighbor aggregation strategy. By integrating the structural information of knowledge graphs and dynamically assigning importance to different neighbors through an attention mechanism, the model enhances its ability to capture implicit preference relationships. In the proposed method, users and items are embedded into a unified graph structure. Multi-level semantic paths are constructed based on entities and relations in the knowledge graph to extract richer contextual information. During the rating prediction phase, recommendations are generated through the interaction between user and target item representations. The model is optimized using a binary cross-entropy loss function. Experiments conducted on the Amazon Books dataset validate the superior performance of the proposed model across various evaluation metrics. The model also shows good convergence and stability. These results further demonstrate the effectiveness and practicality of structure-aware attention mechanisms in knowledge graph-enhanced recommendation.

cs.IR↗

arXiv2025

On cross-2-intersecting families

Two families $\mathcal A\subseteq\binom{[n]}{k}$ and $\mathcal B\subseteq\binom{[n]}{\ell}$ are called cross-$t$-intersecting if $|A\cap B|\geq t$ for all $A\in\mathcal A$, $B\in\mathcal B$. Let $n$, $k$ and $\ell$ be positive integers such that $n\geq 3.38\ell$ and $\ell\geq k\geq 2$. In this paper, we will determine the upper bound of $|\mathcal A||\mathcal B|$ for cross-$2$-intersecting families $\mathcal A\subseteq\binom{[n]}{k}$ and $\mathcal B\subseteq\binom{[n]}{\ell}$. The structures of the extremal families attaining the upper bound are also characterized. The similar result obtained by Tokushige can be considered as a special case of ours when $k=\ell$, but under a more strong condition $n>3.42k$. Moreover, combined with the results obtained in this paper, the complicated extremal structures attaining the upper bound for nontrivial cases can be relatively easy to reach with similar techniques.

math.CO↗

arXiv2024

Non-uniform Cross-intersecting Families

Let $m\geq 2$, $n$ be positive integers, and $R_i=\{k_{i,1} >k_{i,2} >\cdots> k_{i,t_i}\}$ be subsets of $[n]$ for $i=1,2,\ldots,m$. The families $\mathcal{F}_1\subseteq \binom{[n]}{R_1},\mathcal{F}_2\subseteq \binom{[n]}{R_2},\ldots,\mathcal{F}_m\subseteq \binom{[n]}{R_m}$ are said to be non-empty cross-intersecting if for each $i\in [m]$, $\mathcal{F}_i\neq\emptyset$ and for any $A\in \mathcal{F}_i,B\in\mathcal{F}_j$, $1\leq i<j\leq m$, $|A\bigcap B|\geq1$. In this paper, we determine the maximum value of $\sum_{j=1}^{m}|\mathcal{F}_j|$ for non-empty cross-intersecting family $\mathcal{F}_1, \mathcal{F}_2,\ldots,\mathcal{F}_m$ when $n\geq k_1+k_2$, where $k_1$ (respectively, $k_2$) is the largest (respectively, second largest) value in $\{k_{1,1},k_{2,1},\ldots,k_{m,1}\}$. This result is a generalization of the results by Shi, Frankl and Qian \cite{shi2022non} on non-empty cross-intersecting families. Moreover, the extremal families are completely characterized.

math.CO↗

arXiv2024

Exact extremal non-trivial cross-intersecting families

Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are called cross-intersecting if each pair of sets $A\in \mathcal{A}$ and $B\in \mathcal{B}$ has nonempty intersection. Let $\cal{A}$ and ${\cal B}$ be two cross-intersecting families of $k$-subsets and $\ell$-subsets of $[n]$. Matsumoto and Tokushige [J. Combin. Theory Ser. A 52 (1989) 90--97] studied the extremal problem of the size $|\cal{A}||\cal{B}|$ and obtained the uniqueness of extremal families whenever $n\ge 2 \ell\ge 2k$, building on the work of Pyber. This paper will explore the second extremal size of $|\cal{A}||\cal{B}|$ and obtain that if $\mathcal{A}$ and $\mathcal{B}$ are not the subfamilies of Matsumoto--Tokushige's extremal families, then, for $n\ge 2\ell >2k$ or $n> 2\ell=2k$, \begin{itemize} \item[1)]either $|\cal{A}||\cal{B}|\le \left({\binom{n-1}{k-1}}+{\binom{n-2 }{k-1}}\right){\binom{n-2}{\ell-2}}$ with the unique extremal families (up to isomorphism) \[\mbox{$\mathcal{A}=\{A\in {\binom{[n]}{k}}: 1\in A \: \rm{ or} \: 2\in A\}$ \quad and \quad $\mathcal{B}=\{B\in {\binom{[n]}{\ell}}: [2] \subseteq B\}$};\] \item[2)] or $|\cal{A}||\cal{B}|\le \left({\binom{n-1}{k-1}}+1\right)\left({\binom{n-1}{\ell-1}}-{\binom{n-k-1}{\ell-1}}\right)$ with the unique extremal families (up to isomorphism) \[\mbox{$\mathcal{A}=\{A\in {\binom{[n]}{k}}: 1\in A\}\cup \{[2,k+1] \}$\quad and \quad $\mathcal{B}=\{B\in {\binom{[n]}{\ell}}: 1\in B, B\cap [2,k+1]\neq \emptyset \}$.}\] \end{itemize} The bound ``$n\ge 2\ell >2k$ or $n> 2\ell=2k$" is sharp for $n$. To achieve the above results, we establish some size-sensitive inequalities for cross-intersecting families. As by-products, we will recover the main results of Frankl and Kupavskii [European J. Combin. 62 (2017) 263--271].

math.CO↗

arXiv2024

On a conjecture of Tokushige for cross-$t$-intersecting families

Two families of sets $\mathcal{A}$ and $\mathcal{B}$ are called cross-$t$-intersecting if $|A\cap B|\ge t$ for all $A\in \mathcal{A}$, $B\in \mathcal{B}$. An active problem in extremal set theory is to determine the maximum product of sizes of cross-$t$-intersecting families. This incorporates the classical Erdős--Ko--Rado (EKR) problem. In the present paper, we prove that if $\mathcal{A}$ and $\mathcal{B}$ are cross-$t$-intersecting families of $\binom {[n]}k$ with $k\ge t\ge 3$ and $n\ge (t+1)(k-t+1)$, then $|\mathcal{A}||\mathcal{B}|\le {\binom{n-t}{k-t}}^2$; moreover, if $n>(t+1)(k-t+1)$, then equality holds if and only if $\mathcal{A}=\mathcal{B}$ is a maximum $t$-intersecting subfamily of $\binom{[n]}{k}$. This confirms a conjecture of Tokushige for $t\ge 3$.

math.CO↗

arXiv2021

Measuring optical vortices by means of dual shearing-type Sagnac interferometers

Measuring the positions of optical vortices is an essential part in the researches of speckles and adaptive optics. The measurement accuracy is restricted by the performance of optical devices and the properties of optical vortices, such as density and size. In order to achieve high accuracy and wide range of application, the dual shearing-type Sagnac interferometers is proposed using two shearing plates to adjust the precision of optical vortices measurement. The shearing displacements are able to balance the measuring precision and the value of the intensity ratio point to provide optimum measurement performance. This method is useful for the observation of optical vortices with different sizes and densities, especially for the high density condition.

physics.optics↗

arXiv2021

Phase discontinuities induced scintillation enhancement: coherent vortex beams propagating through weak oceanic turbulence

Under the impact of an infinitely extended edge phase dislocation, optical vortices (screw phase dislocations) induce scintillation enhancement. The scintillation index of a beam consisting of two Gaussian vortex beams with ${\pm{1}}$ topological charges through weak oceanic turbulence is researched via derivation and phase screen simulation. Different combinations of two types of phase discontinuities can be obtained by changing the overlapping degree and the phase difference of two coherent Gaussian vortex beams. The scintillation indexes for them verify that the formation condition of the phenomenon is the coexistence of two types of phase discontinuities. And the enhanced scintillation index can be several orders of magnitude larger than that of a plane wave under weak perturbation (Rytov variance). This phenomenon could be useful for both optical vortex detection and perturbation measurement.

physics.optics↗

arXiv2021

Oceanic non-Kolmogorov optical turbulence and spherical wave propagation

Light propagation in turbulent media is conventionally studied with the help of the spatio-temporal power spectra of the refractive index fluctuations. In particular, for natural water turbulence several models for the spatial power spectra have been developed based on the classic, Kolmogorov postulates. However, as currently widely accepted, non-Kolmogorov turbulent regime is also common in the stratified flow fields, as suggested by recent developments in atmospheric optics. Until now all the models developed for the non-Kolmogorov optical turbulence were pertinent to atmospheric research and, hence, involved only one advected scalar, e.g., temperature. We generalize the oceanic spatial power spectrum, based on two advected scalars, temperature and salinity concentration, to the non-Kolmogorov turbulence regime, with the help of the so-called "Upper-Bound Limitation" and by adopting the concept of spectral correlation of two advected scalars. The proposed power spectrum can handle general non-Kolmogorov, anisotropic turbulence but reduces to Kolmogorov, isotropic case if the power law exponents of temperature and salinity are set to 11/3 and anisotropy coefficient is set to unity. To show the application of the new spectrum, we derive the expression for the second-order mutual coherence function of a spherical wave and examine its coherence radius (in both scalar and vector forms) to characterize the turbulent disturbance. Our numerical calculations show that the statistics of the spherical wave vary substantially with temperature and salinity non-Kolmogorov power law exponents and temperature-salinity spectral correlation coefficient. The introduced spectrum is envisioned to become of significance for theoretical analysis and experimental measurements of non-classic natural water double-diffusion turbulent regimes.

physics.ao-ph↗

arXiv2020

Resilient Load Restoration in Microgrids Considering Mobile Energy Storage Fleets: A Deep Reinforcement Learning Approach

Mobile energy storage systems (MESSs) provide mobility and flexibility to enhance distribution system resilience. The paper proposes a Markov decision process (MDP) formulation for an integrated service restoration strategy that coordinates the scheduling of MESSs and resource dispatching of microgrids. The uncertainties in load consumption are taken into account. The deep reinforcement learning (DRL) algorithm is utilized to solve the MDP for optimal scheduling. Specifically, the twin delayed deep deterministic policy gradient (TD3) is applied to train the deep Q-network and policy network, then the well trained policy can be deployed in on-line manner to perform multiple actions simultaneously. The proposed model is demonstrated on an integrated test system with three microgrids connected by Sioux Falls transportation network. The simulation results indicate that mobile and stationary energy resources can be well coordinated to improve system resilience.

math.OC↗

arXiv2019

Resilient Unit Commitment for Day-ahead Market Considering Probabilistic Impacts of Hurricanes

In the face of extreme events, e.g., hurricanes, the transmission systems, especially the transmission lines, are affected across time and space. To mitigate these impacts on the day-ahead market from a probabilistic perspective, a resilient unit commitment (UC) problem is formulated as a two-stage robust optimization (RO) problem. In the first stage, the status, energy, and reserves of generators are pre-scheduled to minimize the operational cost, responding to the worst line failure scenario in the operating day. The failure, operation status, and repair of transmission lines are depicted by a novel robust uncertainty set with chance constraint considering the repair of failed lines. This chance constraint is reformulated to its deterministic equivalence. Using both load shedding and generation curtailment, a recourse problem is formulated in the second stage considering the time-varying transmission lines operation status. The formulated RO problem is solved using a column-and-constraint generation scheme. Simulations are conducted on IEEE-24 and two-area IEEE reliability test system-1996 under hurricanes and results verify the effectiveness of the proposed method on the conservation of uncertainty set, worst-case line failure scenario detection and repair preparedness.

math.OC↗

arXiv2019

Rolling Optimization of Mobile Energy Storage Fleets for Resilient Service Restoration

Mobile energy storage systems (MESSs) provide promising solutions to enhance distribution system resilience in terms of mobility and flexibility. This paper proposes a rolling integrated service restoration strategy to minimize the total system cost by coordinating the scheduling of MESS fleets, resource dispatching of microgrids and network reconfiguration of distribution systems. The integrated strategy takes into account damage and repair to both the roads in transportation networks and the branches in distribution systems. The uncertainties in load consumption and the status of roads and branches are modeled as scenario trees using Monte Carlo simulation method. The operation strategy of MESSs is modeled by a stochastic multi-layer time-space network technique. A rolling optimization framework is adopted to dynamically update system damage, and the coordinated scheduling at each time interval over the prediction horizon is formulated as a two-stage stochastic mixed-integer linear program with temporal-spatial and operation constraints. The proposed model is verified on two integrated test systems, one is with Sioux Falls transportation network and four 33-bus distribution systems, and the other is the Singapore transportation network-based test system connecting six 33-bus distribution systems. The results demonstrate the effectiveness of MESS mobility to enhance distribution system resilience due to the coordination of mobile and stationary resources.

math.OC↗

arXiv2019

Evolution properties of coherent Gaussian vortex beams propagating through weak oceanic turbulence and its application for measurement

The cross-spectral density of coherent Gaussian vortex beams propagating through weak oceanic turbulence is derived from extended Huygens-Fresnel principle and Nikishov spectrum. The evolution of a coherent superposition field composed of dual Gaussian vortex beams with $+1$ and $-1$ topological charges respectively through weak oceanic turbulence is investigated in z plane and y plane. It is shown that the non-zero separation distance of two beams in x direction enhances the oceanic turbulence effect on interference light field. The variation of intensity distribution in z plane and on the central axis of two beams in y plane are both related to the strength of oceanic turbulence, separation distance, propagation distance and waist width. The extra fluctuation of the intensity on the central axis of two beams in y plane leads to high sensitivity of oceanic turbulence. This characteristic has potential application in non-contact optical tomography of oceanic turbulence strength along the beam propagation path by lateral scattering intensity.

physics.optics↗

arXiv2011

Nontrivial independent sets of bipartite graphs and cross-intersecting families

Let $G(X,Y)$ be a connected, non-complete bipartite graph with $|X|\leq |Y|$. An independent set $A$ of $G(X,Y)$ is said to be trivial if $A\subseteq X$ or $A\subseteq Y$. Otherwise, $A$ is nontrivial. By $α(X,Y)$ we denote the size of maximal-sized nontrivial independent sets of $G(X,Y)$. We prove that if the automorphism group of $G(X,Y)$ is transitive on $X$ and $Y$, then $α(X,Y)=|Y|-d(X)+1$, where $d(X)$ is the common degree of vertices in $X$. We also give the structures of maximal-sized nontrivial independent sets of $G(X,Y)$. As applications of this result, we give the upper bound of sizes of two cross-$t$-intersecting families of finite sets, finite vector spaces and permutations.

math.CO↗

arXiv2010

Cross-intersecting families and primitivity of symmetric systems

Let $X$ be a finite set and $\mathfrak p\subseteq 2^X$, the power set of $X$, satisfying three conditions: (a) $\mathfrak p$ is an ideal in $2^X$, that is, if $A\in \mathfrak p$ and $B\subset A$, then $B\in \mathfrak p$; (b) For $A\in 2^X$ with $|A|\geq 2$, $A\in \mathfrak p$ if $\{x,y\}\in \mathfrak p$ for any $x,y\in A$ with $x\neq y$; (c) $\{x\}\in \mathfrak p$ for every $x\in X$. The pair $(X,\mathfrak p)$ is called a symmetric system if there is a group $Γ$ transitively acting on $X$ and preserving the ideal $\mathfrak p$. A family $\{A_1,A_2,\ldots,A_m\}\subseteq 2^X$ is said to be a cross-$\mathfrak{p}$-family of $X$ if $\{a, b\}\in \mathfrak{p}$ for any $a\in A_i$ and $b\in A_j$ with $i\neq j$. We prove that if $(X,\mathfrak p)$ is a symmetric system and $\{A_1,A_2,\ldots,A_m\}\subseteq 2^X$ is a cross-$\mathfrak{p}$-family of $X$, then \[\sum_{i=1}^m|{A}_i|\leq\left\{ \begin{array}{cl} |X| & \hbox{if $m\leq \frac{|X|}{α(X,\, \mathfrak p)}$,} \\ m\, α(X,\, \mathfrak p) & \hbox{if $m\geq \frac{|X|}{α{(X,\, \mathfrak p)}}$,} \end{array}\right.\] where $α(X,\, \mathfrak p)=\max\{|A|:A\in\mathfrak p\}$. This generalizes Hilton's theorem on cross-intersecting families of finite sets, and provides analogs for cross-$t$-intersecting families of finite sets, finite vector spaces and permutations, etc. Moreover, the primitivity of symmetric systems is introduced to characterize the optimal families.

math.CO↗

arXiv2010

Independent Sets in Direct Products of Vertex-transitive Graphs

The direct product $G\times H$ of graphs $G$ and $H$ is defined by: \[V(G\times H)=V(G)\times V(H)\] and \[E(G\times H)=\left\{[(u_1,v_1),(u_2,v_2)]: (u_1,u_2)\in E(G) \mbox{\ and\ } (v_1,v_2)\in E(H)\right\}.\] In this paper, we will prove that the equality $$α(G\times H)=\max\{α(G)|H|, α(H)|G|\}$$ holds for all vertex-transitive graphs $G$ and $H$, which provides an affirmative answer to a problem posed by Tardif (Discrete Math. 185 (1998) 193-200). Furthermore, the structure of all maximum independent sets of $G\times H$ are determined.

math.CO↗