Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Guang-zhou Zhao"'
Publikováno v:
Crystals, Vol 12, Iss 11, p 1530 (2022)
The biaxial fatigue crack growth behavior of commercial pure titanium TA2 of cruciform specimens with different crack inclination angles (β = 90°, 60°, 45°) under various biaxial load ratios (λ = 0, 0.5, 1) and different stress ratios (R = 0, 0.
Externí odkaz:
https://doaj.org/article/6b08b48a6b324cba8db5a290a79abe0a
Publikováno v:
DEStech Transactions on Materials Science and Engineering.
In order to reduce the computational complexity of the OTSU algorithm, in this paper, improved OTSU algorithm using quartered search method has been proposed. When compute the optimal segmentation threshold, divide the whole gray level into four regi
Autor:
Guang-Zhou Zhao, Yi-Hua Liu
Publikováno v:
Information Technology Journal. 13:1204-1209
Publikováno v:
INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences. 4:453-459
Publikováno v:
International Journal of Advancements in Computing Technology. 4:540-549
Publikováno v:
Advanced Materials Research. 267:614-619
In this paper, a 4 degree-of-freedom robot arm used for wafer handling is proposed. The dynamic modeling of the vertical axis which includes a simplified friction model is derived. This friction model is fitted through the measured friction data. An
Autor:
Chi Zhang, Guang Zhou Zhao
Publikováno v:
Key Engineering Materials. :1099-1104
A high efficiency axial-flux brushless DC motor assisted by self axial magnetic bearing and used in flywheel energy storage system is proposed in this paper. In this design, the rotor with composite rim acts as the flywheel of the system and is sandw
Publikováno v:
Journal of Zhejiang University-SCIENCE A. 6:87-93
Publikováno v:
Journal of Zhejiang University SCIENCE. 5:867-872
Swarm intelligence inspired by the social behavior of ants boasts a number of attractive features, including adaptation, robustness and distributed, decentralized nature, which are well suited for routing in modern communication networks. This paper
Publikováno v:
CIT
The complexity of resource allocation problems is usually NP-complete, which makes exact method inadequate to handle Resource allocation problems, and encourages heuristic techniques to this class of problems for obtaining approximate solutions in po