Zobrazeno 1 - 10
of 394
pro vyhledávání: '"Zhang, Bicheng"'
Autor:
Zhang, Shenglin, Jin, Pengxiang, Lin, Zihan, Sun, Yongqian, Zhang, Bicheng, Xia, Sibo, Li, Zhengdan, Zhong, Zhenyu, Ma, Minghua, Jin, Wa, Zhang, Dai, Zhu, Zhenyu, Pei, Dan
Automatic failure diagnosis is crucial for large microservice systems. Currently, most failure diagnosis methods rely solely on single-modal data (i.e., using either metrics, logs, or traces). In this study, we conduct an empirical study using real-w
Externí odkaz:
http://arxiv.org/abs/2302.10512
Autor:
Zhang, Bicheng1,2 (AUTHOR) bicheng_zhang@zju.edu.cn, Huang, Fengbo3 (AUTHOR), Guo, Siyu1,2 (AUTHOR), Wu, Dang1,2 (AUTHOR), Xiao, Xiaofang4 (AUTHOR) xxfang2017@zju.edu.cn, Zhang, Ting1,2 (AUTHOR) zezht@zju.edu.cn
Publikováno v:
Diagnostics (2075-4418). Nov2024, Vol. 14 Issue 21, p2347. 10p.
Autor:
Li, Dong Liu. Pingshan, Zhang, Bicheng
The edge-fault-tolerance of networks is of great significance to the design and maintenance of networks. For any pair of vertices $u$ and $v$ of the connected graph $G$, if they are connected by $\min \{ \deg_G(u),\deg_G(v)\}$ edge-disjoint paths, th
Externí odkaz:
http://arxiv.org/abs/2209.12126
Autor:
Song, Yuegang1 (AUTHOR), Zhang, Bicheng1 (AUTHOR) zbc18737419101@163.com
Publikováno v:
Emerging Markets Finance & Trade. 2024, Vol. 60 Issue 12, p2665-2690. 26p.
Autor:
Hu, Yang, Zhang, Haolin, Sun, Xinya, Zhang, Bicheng, Wang, Yubin, Rafiq, Anum, Jia, Hongtao, Liang, Chao, An, Shaoshan
Publikováno v:
In Science of the Total Environment 15 June 2024 929
Autor:
Guo, Wei, Huang, Yimei, Huang, Yudan, Li, Yilun, Song, Xiaoxiang, Shen, Jikai, Qi, Xiping, Zhang, Bicheng, Zhu, Zhaolong, Peng, Shouzhang, An, Shaoshan
Publikováno v:
In Computers and Electronics in Agriculture June 2024 221
Autor:
Moro, Pedro L., Carlock, Grace, Fifadara, Nimita, Habenicht, Tei, Zhang, Bicheng, Strid, Penelope, Marquez, Paige
Publikováno v:
In Vaccine 2 April 2024 42(9):2380-2384
As a generalization of the traditional connectivity, the g-component edge connectivity c{\lambda}g(G) of a non-complete graph G is the minimum number of edges to be deleted from the graph G such that the resulting graph has at least g components. Hyp
Externí odkaz:
http://arxiv.org/abs/2105.04803
Autor:
Chen, Yihan, Zhang, Bicheng
Hypercube is one of the most important networks to interconnect processors in multiprocessor computer systems. Different kinds of connectivities are important parameters to measure the fault tolerability of networks. Lin et al.\cite{LinStructure} int
Externí odkaz:
http://arxiv.org/abs/2002.10134
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.