Zobrazeno 1 - 10
of 102
pro vyhledávání: '"Diao, Zhuo"'
We present the development of an automated scanning probe microscopy (SPM) measurement system using an advanced large-scale language model (LLM). This SPM system can receive instructions via social networking services (SNS), and the integration of SN
Externí odkaz:
http://arxiv.org/abs/2405.15490
We present an advanced scanning probe microscopy system enhanced with artificial intelligence (AI-SPM) designed for self-driving atomic-scale measurements. This system expertly identifies and manipulates atomic positions with high precision, autonomo
Externí odkaz:
http://arxiv.org/abs/2404.11162
Autor:
Jian, Xingxing, Hou, Guixue, Li, Liqiao, Diao, Zhuo, Wu, Yingfang, Wang, Jiayi, Xie, Lu, Peng, Cong, Lin, Liang, Li, Jie
Publikováno v:
In The Journal of Allergy and Clinical Immunology August 2024 154(2):412-423
Autor:
Diao, Zhuo, Katsube, Daiki, Yamashita, Hayato, Sugimoto, Yoshiaki, Custance, Oscar, Abe, Masayuki
A machine-learning method for extracting the short-range part of the probe-surface interaction from force spectroscopy curves is presented. Our machine-learning algorithm consists of two stages: the first stage determines a boundary that separates th
Externí odkaz:
http://arxiv.org/abs/2004.04882
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.
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.
Autor:
Diao, Zhuo
In this paper, we prove a combinatorial property of flows on a cycle. $C(V,E)$ is an undirected cycle with two commodities: $\{s_{1},t_{1}\}, \{s_{2},t_{2}\}$;$r_1>0,r_2>0, \mathbf r=(r_i)_{i=1,2}$ and $f,f'$ are both feasible flows for $(C,(s_i,t_i)
Externí odkaz:
http://arxiv.org/abs/1808.10119
Autor:
Diao, Zhuo, Tang, Zhongzheng
Let $H=(V,E)$ be a hypergraph with vertex set $V$ and edge set $E$. $S\subseteq V$ is a feedback vertex set (FVS) of $H$ if $H\setminus S$ has no cycle and $\tau_c(H)$ denote the minimum cardinality of a FVS of $H$. In this paper, we prove $(i)$ if $
Externí odkaz:
http://arxiv.org/abs/1807.10456
Autor:
Tang, Zhongzheng, Diao, Zhuo
Given a weighted graph $G(V,E)$ with weight $\mathbf w: E\rightarrow Z^{|E|}_{+}$. A $k-$cycle covering is an edge subset $A$ of $E$ such that $G-A$ has no $k-$cycle. The minimum weight of $k-$cycle covering is the weighted covering number on $k-$cyc
Externí odkaz:
http://arxiv.org/abs/1807.06867
Autor:
Diao, Zhuo
Given a hypergraph H(V;E), a set of vertices S in V is a vertex cover if every edge has at least a vertex in S. The vertex cover number is the minimum cardinality of a vertex cover, denoted by t(H). In this paper, we prove that for every 3 uniform co
Externí odkaz:
http://arxiv.org/abs/1807.00473