Zobrazeno 1 - 10
of 7 667
pro vyhledávání: '"Li,Haiyan"'
Autor:
Ding, Zhaisheng, Li, Haiyan, Hou, Ruichao, Liu, Yanyu, Xie, Shidong, Zhou, Dongming, Cao, Jinde
Learning robust multi-modal feature representations is critical for boosting tracking performance. To this end, we propose a novel X Modality Assisting Network (X-Net) to shed light on the impact of the fusion paradigm by decoupling the visual object
Externí odkaz:
http://arxiv.org/abs/2312.17273
Publikováno v:
Open Mathematics, Vol 22, Iss 1, Pp 264-274 (2024)
A sequence α\alpha of nonnegative integers is said to be graphic if it is the degree sequence of a simple graph GG, and such a graph GG is called a realization of α\alpha . In this article, we generalize Gale and Ryser’s theorem and give the suff
Externí odkaz:
https://doaj.org/article/8d3998a071164e109cb9d98ce12a71ab
Let $m$ be a positive integer, $X$ a graph with vertex set $\Omega$, and ${\rm WL}_m(X)$ the coloring of the Cartesian $m$-power $\Omega^m$, obtained by the $m$-dimensional Weisfeiler-Leman algorithm. The ${\rm WL}$-dimension of the graph $X$ is defi
Externí odkaz:
http://arxiv.org/abs/2305.17302
Publikováno v:
Dianxin kexue, Vol 40, Pp 108-120 (2024)
As an integral part to the air, space and ground integrated network, unmanned aerial vehicle (UAV) swarms have shown broad application prospects in complex tasks such as emergency search and rescue, offensive and defensive confrontation, intelligence
Externí odkaz:
https://doaj.org/article/d7fe17e7a29c47119c359e7a31de1210
Autor:
Wang, Tao, Wu, Shaoliang, Jia, Hengqiong, Peng, Shanqing, Li, Haiyan, Shao, Piyan, Wei, Zhao, Shi, Yi
Publikováno v:
Railway Sciences, 2024, Vol. 3, Issue 2, pp. 227-238.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/RS-01-2024-0001
An $r$-uniform hypergraphic sequence (i.e., $r$-graphic sequence) $d=(d_1, d_2,\cdots,d_n)$ is said to be forcibly $k$-edge-connected if every realization of $d$ is $k$-edge-connected. In this paper, we obtain a strongest sufficient degree condition
Externí odkaz:
http://arxiv.org/abs/2212.09014
The degree sequence of a graph is the sequence of the degrees of its vertices. If $\pi$ is a degree sequence of a graph $G$, then $G$ is a realization of $\pi$ and $G$ realizes $\pi$. Determining when a sequence of positive integers is realizable as
Externí odkaz:
http://arxiv.org/abs/2210.13892
Publikováno v:
In Journal of Manufacturing Processes 26 December 2024 132:615-628
Publikováno v:
In Ceramics International 15 December 2024 50(24) Part A:52551-52557
Autor:
Wang, Jin, Shen, Leilei, Cai, Lingli, Li, Haiyan, Yang, Xiaoqin, Zhang, Yuhan, Zhang, Ziyi, Zhang, Hua, Yu, Fan, Wang, Yanqing, Li, Zhaoxia
Publikováno v:
In Journal of Molecular Structure 15 December 2024 1318 Part 2