Zobrazeno 1 - 10
of 51
pro vyhledávání: '"Daqing Zhu"'
Autor:
Lisong Shan, Xue Shao, Liangyou Gu, Minhong Wu, Pengxiu Lin, Zhiling Yu, Qingsheng Chen, Daqing Zhu
Publikováno v:
Frontiers in Surgery, Vol 9 (2022)
BackgroundThere are still differences in the prognostic factors of renal cell carcinoma with sarcomatoid dedifferentiation (sRCC). The aim of this study was to evaluate important predictors of survival in patients with sRCC.Patients and methodsA comp
Externí odkaz:
https://doaj.org/article/d41ac75422564e749b87d4bb0a3427de
Publikováno v:
Frontiers in Oncology, Vol 10 (2021)
BackgroundTo compare perioperative, functional and oncological outcomes between transperitoneal robotic partial nephrectomy (TRPN) and retroperitoneal robotic partial nephrectomy (RRPN).MethodsA literature searching of Pubmed, Embase, Cochrane Librar
Externí odkaz:
https://doaj.org/article/289cd357362d4fb3a3741bcd89fd49ac
Autor:
Qingfu Yang, Xiqing Ye, Dong-Han Yan, Jing-Qiao Feng, Linrong Chen, Liying Sun, Zhi-Tao Xu, Daqing Zhu
Publikováno v:
Geological Journal. 57:440-461
Publikováno v:
Journal of Electronic Imaging. 31
Publikováno v:
2022 5th International Conference on Intelligent Autonomous Systems (ICoIAS).
Publikováno v:
2022 5th International Conference on Intelligent Autonomous Systems (ICoIAS).
Publikováno v:
2022 5th International Conference on Intelligent Autonomous Systems (ICoIAS).
Autor:
Daqing Zhu
Publikováno v:
Mathematical Problems in Engineering.
Aiming at the problems of poor real-time recognition efficiency and low recognition accuracy of video basketball technical movements, a real-time recognition method of video basketball technical movements based on the target detection algorithm is pr
Publikováno v:
CACRE
In order to better solve path planning problems of underwater vehicles on complicated seabed terrains under ocean currents, a global path planning method based on whale optimization algorithm (WOA) is proposed. We focus on the fixed-depth navigation,
Publikováno v:
CACRE
In order to better solve traveling salesman problems, we proposed an improved imperialist competitive algorithm (IICA). Firstly, the original continuous algorithm is discretized to be suitable for solving combinatorial optimization problems. Then, fo