Zobrazeno 1 - 10
of 573
pro vyhledávání: '"Wang Shipeng"'
Publikováno v:
Fushe yanjiu yu fushe gongyi xuebao, Vol 40, Iss 4, Pp 56-65 (2022)
Considering the special circumstances after nuclear accidents, such as continuous change of source term release rate, limited monitoring data, and variable observed noise, a source term inversion method based on the Gaussian puff dispersion model and
Externí odkaz:
https://doaj.org/article/280a24c4d328404081cb83aab338ba9e
Publikováno v:
Fushe yanjiu yu fushe gongyi xuebao, Vol 41, Iss 2, Pp 020601-020601 (2023)
In order to solve the problems of the nuclear accident emergency drill, such as invisible radiation field, potential radiation risk, and high labor costs, therefore, an adaptive ray-casting 3D nuclear radiation field visualization method based on fea
Externí odkaz:
https://doaj.org/article/451e6e07f6de4e3c8ba7c895f4f01954
Autor:
Wang Shipeng, Xiong Liming
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 39, Iss 4, Pp 925-937 (2019)
A well-known theorem by Chvátal-Erdőos [A note on Hamilton circuits, Discrete Math. 2 (1972) 111–135] states that if the independence number of a graph G is at most its connectivity plus one, then G is traceable. In this article, we show that eve
Externí odkaz:
https://doaj.org/article/4b463bb0845e415c8244792d9a014edd
Publikováno v:
口腔疾病防治, Vol 27, Iss 1, Pp 41-45 (2019)
Objective To summarize the incidence, clinical manifestations, diagnosis and treatment of basal cell ne⁃ vus syndrome and to provide reference for clinical diagnosis and treatment. Methods Retrospective analysis of 4 cas⁃ es of basal cell nevus
Externí odkaz:
https://doaj.org/article/152503f1a96443d19dc920f339801255
Let $G$ be an $n$-vertex triangle-free graph. The celebrated Mantel's theorem showed that $e(G)\leq \lfloor\frac{n^2}{4}\rfloor$. In 1962, Erd\H{o}s (together with Gallai), and independently Andr\'{a}sfai, proved that if $G$ is non-bipartite then $e(
Externí odkaz:
http://arxiv.org/abs/2404.07486
A graph $G$ is called $C_{2k+1}$-free if it does not contain any cycle of length $2k+1$. In 1981, Haggkvist, Faudree and Schelp showed that every $n$-vertex triangle-free graph with more than $\frac{(n-1)^2}{4}+1$ edges is bipartite. In this paper, w
Externí odkaz:
http://arxiv.org/abs/2307.07962
Autor:
Zeng, Zheni, Yin, Bangchen, Wang, Shipeng, Liu, Jiarui, Yang, Cheng, Yao, Haishen, Sun, Xingzhi, Sun, Maosong, Xie, Guotong, Liu, Zhiyuan
Natural language is expected to be a key medium for various human-machine interactions in the era of large language models. When it comes to the biochemistry field, a series of tasks around molecules (e.g., property prediction, molecule mining, etc.)
Externí odkaz:
http://arxiv.org/abs/2306.11976
Autor:
Zhao, Xin1,2 (AUTHOR), Wang, Shipeng1,2 (AUTHOR), Zhang, Hongrui1,2 (AUTHOR), Dong, Shengjun1,2 (AUTHOR), Chen, Jianhua1,2 (AUTHOR), Sun, Yongqiang1,2 (AUTHOR), Zhang, Yueyuan1 (AUTHOR), Liu, Quangang1,2 (AUTHOR) liuquangang007@126.com
Publikováno v:
BMC Genomics. 10/14/2024, Vol. 25 Issue 1, p1-23. 23p.
Autor:
Wang, Shipeng, Li, Qingzhong, Cui, Lizhen, Yan, Zhongmin, Xu, Yonghui, Shi, Zhuan, Min, Xinping, Shen, Zhiqi, Yu, Han
Crowdsourcing, in which human intelligence and productivity is dynamically mobilized to tackle tasks too complex for automation alone to handle, has grown to be an important research topic and inspired new businesses (e.g., Uber, Airbnb). Over the ye
Externí odkaz:
http://arxiv.org/abs/2212.14676
Let $F$ be an $(r+1)$-color critical graph with $r\geq 2$, that is, $\chi(F)=r+1$ and there is an edge $e$ in $F$ such that $\chi(F-e)=r$. Gerbner recently conjectured that every $n$-vertex maximal $F$-free graph with at least $(1-\frac{1}{r})\frac{n
Externí odkaz:
http://arxiv.org/abs/2205.00426