Zobrazeno 1 - 10
of 6 473
pro vyhledávání: '"WEI, Bing"'
Autor:
Lam, Leo S. I., Deng, Hai-Yao, Zhang, Wei-Bing, Nwankwo, Udoka, Xiao, Chu, Yip, Cho-Tung, Lee, Chun-Shing, Ruan, Haihui, Lam, Chi-Hang
The physics of glass has been a significant topic of interest for decades. Dynamical facilitation is widely believed to be an important characteristic of glassy dynamics, but the precise mechanism is still under debate. We propose a lattice model of
Externí odkaz:
http://arxiv.org/abs/2412.08986
The independent domination number of a finite graph $G$ is defined as the minimum cardinality of an independent dominating set of vertices. The independent bondage number of $G$ is the minimum cardinality of a set of edges whose deletion results in a
Externí odkaz:
http://arxiv.org/abs/2411.01687
With the continuous advancement of artificial intelligence, natural language processing technology has become widely utilized in various fields. At the same time, there are many challenges in creating Chinese news summaries. First of all, the semanti
Externí odkaz:
http://arxiv.org/abs/2406.18364
Autor:
Zhang, Zhan, Zhang, Qin, Jiao, Yang, Lu, Lin, Ma, Lin, Liu, Aihua, Liu, Xiao, Zhao, Juan, Xue, Yajun, Wei, Bing, Zhang, Mingxia, Gao, Ru, Zhao, Hong, Lu, Jie, Li, Fan, Zhang, Yang, Wang, Yiming, Zhang, Lei, Tian, Fengwei, Hu, Jie, Gou, Xin
Publikováno v:
Artificaial Intelligence Review, (2024) 57:151
AI-aided clinical diagnosis is desired in medical care. Existing deep learning models lack explainability and mainly focus on image analysis. The recently developed Dynamic Uncertain Causality Graph (DUCG) approach is causality-driven, explainable, a
Externí odkaz:
http://arxiv.org/abs/2406.05746
A Statistic Vectorial Complex Ray Model (SVCRM) is proposed for the scattering of a plane wave by a non-spherical dielectric particle in three dimensions. This method counts the complex amplitudes of all rays arriving in a tiny box in the observation
Externí odkaz:
http://arxiv.org/abs/2403.13119
The independent domination number of a finite graph G is the minimum cardinality of an independent dominating set of vertices. The independent bondage number of G is the minimum cardinality of a set of edges whose deletion results in a graph with a l
Externí odkaz:
http://arxiv.org/abs/2402.02083
Autor:
Gamlath, E. G. K. M., Wei, Bing
In this paper, we explore the concept of total bondage in finite graphs without isolated vertices. A vertex set $D$ is considered a total dominating set if every vertex $v$ in the graph $G$ has a neighbor in $D$. The minimum cardinality of all total
Externí odkaz:
http://arxiv.org/abs/2401.16615