Zobrazeno 1 - 10
of 4 824
pro vyhledávání: '"Gu Yan"'
Autor:
Gu Yan
Publikováno v:
Australasian Orthodontic Journal, Vol 26, Iss 2, Pp 171-177 (2023)
To identify the craniofacial characteristics that contribute to long-term stability of protraction facemask treatment of Class III malocclusion.
Externí odkaz:
https://doaj.org/article/43e623393df941c19234e5973e3b8875
Publikováno v:
Asian Journal of Surgery, Vol 47, Iss 5, Pp 2457-2458 (2024)
Externí odkaz:
https://doaj.org/article/1cc7edccd55d48a189a7c811ab2dbf2c
Publikováno v:
Acta Biochimica et Biophysica Sinica, Vol 55, Pp 1847-1850 (2023)
Externí odkaz:
https://doaj.org/article/51624f842ef84aa1b552eb060495f4a5
Publikováno v:
High Temperature Materials and Processes, Vol 41, Iss 1, Pp 589-598 (2022)
In order to study the long-time safe storage performance of GaTo modified double base propellant, the accelerated aging tests at 65, 70, 75, and 85°C were conducted. The chemical stabilities, mechanical properties, and microstructure of the propella
Externí odkaz:
https://doaj.org/article/155b133df7bb4083a0bd8a9d72daad71
Locomotion on dynamic rigid surface (i.e., rigid surface accelerating in an inertial frame) presents complex challenges for controller design, which are essential for deploying humanoid robots in dynamic real-world environments such as moving trains,
Externí odkaz:
http://arxiv.org/abs/2409.08371
Robot skill learning and execution in uncertain and dynamic environments is a challenging task. This paper proposes an adaptive framework that combines Learning from Demonstration (LfD), environment state prediction, and high-level decision making. P
Externí odkaz:
http://arxiv.org/abs/2405.15711
Computing a Single-Linkage Dendrogram (SLD) is a key step in the classic single-linkage hierarchical clustering algorithm. Given an input edge-weighted tree $T$, the SLD of $T$ is a binary dendrogram that summarizes the $n-1$ clusterings obtained by
Externí odkaz:
http://arxiv.org/abs/2404.19019
In this paper, we introduce PASGAL (Parallel And Scalable Graph Algorithm Library), a parallel graph library that scales to a variety of graph types, many processors, and large graph sizes. One special focus of PASGAL is the efficiency on \textit{lar
Externí odkaz:
http://arxiv.org/abs/2404.17101
The idea of dynamic programming (DP), proposed by Bellman in the 1950s, is one of the most important algorithmic techniques. However, in parallel, many fundamental and sequentially simple problems become more challenging, and open to a (nearly) work-
Externí odkaz:
http://arxiv.org/abs/2404.16314
This paper presents a hierarchical control framework that enables robust quadrupedal locomotion on a dynamic rigid surface (DRS) with general and unknown vertical motions. The key novelty of the framework lies in its higher layer, which is a discrete
Externí odkaz:
http://arxiv.org/abs/2403.16262