Hamiltonian and long paths in bipartite graphs with connectivity

Let G be a graph, $\nu (G)$ the order of G, $\kappa (G)$ the connectivity of G and k a positive integer such that $k\le (\nu (G)?2)/2$. Then G is said to be k-extendable if it has a matching of size k and every matching of size k extends to a perfect matching of G. A Hamiltonian path of a graph G is a spanning path of G. A bipartite graph G with vertex sets $V_1$ and $V_2$ is defined to be Hamiltonian-laceable if such that $|V_1|=|V_2|$ and for every pair of vertices $p\in V_1$ and $q\in V_2$, there exists a Hamiltonian path in G with endpoints p and q, or $|V_1|=|V_2|+1$ and for every pair of vertices $p,q\in V_1,p\ne q$, there exists a Hamiltonian path in G with endpoints p and q. Let G be a bipartite graph with bipartition $(X,Y)$. Define $bn(G)$ to be a maximum integer such that $0\le bn(G)<min\{|X|,|Y|\}$ and (1) for each non-empty subset S of X, if $|S|\le |X|?bn(G)$, then $|N(S)|\ge |S|+bn(G)$, and if $|X|?bn(G)<|S|\le |X|$, then $N(S)=Y$; and (2) for each non-empty subset S of Y, if $|S|\le |Y|?bn(G)$, then $|N(S)|\ge |S|+bn(G)$, and if $|Y|?bn(G)<|S|\le |Y|$, then $N(S)=X$; and (3) $bn(G)=0$ if there is no non-negative integer satisfying (1) and (2).Let G be a bipartite graph with bipartition $(X,Y)$ such that $|X|=|Y|$ and $bn(G)>0$. In this paper, we show that if $\nu (G)\le 2\kappa (G)+4bn(G)?4$, then G is Hamiltonian-laceable; or if $\nu (G)>6bn(G)?2$, then for every pair of vertices $x\in X$ and $y\in Y$, there is an $(x,y)$-path P in G with $|V(P)|\ge 6bn(G)?2$. We show some of its corollaries in k-extendable, bipartite graphs and a conjecture in k-extendable graphs.     

Diffusion Model of a Non-Integer Order PIγ Controller with TCP/UDP Streams

In this article, a way to employ the diffusion approximation to model interplay between TCP and UDP flows is presented. In order to control traffic congestion, an environment of IP routers applying AQM (Active Queue Management) algorithms has been introduced. Furthermore, the impact of the fractional controller PIγ and its parameters on the transport protocols is investigated. The controller has been elaborated in accordance with the control theory. The TCP and UDP flows are transmitted simultaneously and are mutually independent. Only the TCP is controlled by the AQM algorithm. Our diffusion model allows a single TCP or UDP flow to start or end at any time, which distinguishes it from those previously described in the literature.     

Negative thermal expansion in NbF_3 and NbOF_2:A comparative theoretical study

Thermal expansion control is always an obstructive factor and challenging in high precision engineering field. Here,the negative thermal expansion of Nb F_3 and Nb OF_2 was predicted by first-principles calculation with density functional theory and the quasi-harmonic approximation(QHA). We studied the total charge density, thermal vibration, and lattice dynamic to investigate the thermal expansion mechanism. We found that the presence of O induced the relatively strong covalent bond in Nb OF_2, thus weakening the transverse vibration of F and O in Nb OF_2, compared with the case of Nb F_3.In this study, we proposed a way to tailor negative thermal expansion of metal fluorides by introducing the oxygen atoms.The present work not only predicts two NTE compounds, but also provides an insight on thermal expansion control by designing chemical bond type.     

Sentinel-2卫星的多光谱轻量级船舶目标检测算法

近年来深度卷积神经网络在可见光船舶检测方面取得了显著的进展，然而，大多数相关研究是通过改进大型的网络结构来提高检测性能，因此加大了对更高计算机性能的需求。此外，可见光图像难以在云、雾、海杂波、黑夜等复杂场景检测到船舶。针对以上问题，提出了一种融合红（red, R）、绿（green, G）、蓝（blue, B）和近红外（NIR）4个波段光谱信息的由粗到精细的轻量型船舶检测算法。与现有的方法中根据光谱特性利用水体检测算法提取水体区域不同之处是该算法是利用改进的水体检测算法来提取船舶候选区域。为获取更准确的候选区域，对船舶、厚云、薄云、平静海面、杂波海面5种场景中4个波段的像素值进行了统计分析，选取近红外大于阈值作为辅助判断，并以其中心点获取候选区域32×32大小的切片，并对切片进行非极大值抑制，由此获得了船舶粗检测结果。随后构建了轻量级LSGFNet网络对船舶候选区域切片进行精细识别。构建的网络融合了1×1卷积提取的波谱特征与3×3的提取几何特征，为防止光谱特征与几何特征的信息在融合时“信息不流通”，在LSGFNet网络中引入了ShuffleNet中的通道打乱机制，并减小了模型结构，与典型的轻量级网络相比具有更好的效果且模型较小。最后，利用Sentinel-2卫星多光谱10 m分辨率数据构建了512×512大小的1 120组数据进行粗检测，以及32×32大小的6 014组数据进行精细网络训练，其中候选区域粗提取的查全率为98.99%，精细识别网络精确度为96.04%，不同场景下的平均精确度为92.98%。实验表明该算法在抑制云层、海浪杂波等干扰的复杂背景下具有较高的检测效率，且训练时间短、计算机性能需求低。     

Subset representations and eigenvalues of the universal intertwining matrix

We solve a combinatorial question concerning eigenvalues of the universal intertwining endomorphism of a subset representation.     

Stability of Multiplier Ideal Sheaves

Chinese Annals of Mathematics, Series B - In the present article, the authors find and establish stability of multiplier ideal sheaves, which is more general than strong openness.     

Asymptotically good quasi-cyclic codes of fractional index

Generalizing the quasi-cyclic codes of index $1\frac{1}{3}$ introduced by Fan et al., we study a more general class of quasi-cyclic codes of fractional index generated by pairs of polynomials. The parity check polynomial and encoder of these codes are obtained. The asymptotic behaviours of the rates and relative distances of this class of codes are studied by using a probabilistic method. We prove that, for any positive real number $\delta$ such that the asymptotic GV-bound at $\frac{k+l}{2}\delta$ is greater than $\frac{1}{2}$, the relative distance of the code is convergent to $\delta$, while the rate is convergent to $\frac{1}{k+l}$. As a result, quasi-cyclic codes of fractional index are asymptotically good.