Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Yu-Yu Zhou"'
Autor:
Xiao-Yu Lu, Jin-Shu Huang, Cong-Bin Liu, Xiu-Mei Xu, Jin-Bing Cheng, Wan Chang, Yu-Yu Zhou, Ya-Jie Wang
Publikováno v:
Universe, Vol 9, Iss 4, p 189 (2023)
The clock comparison experiments to test special relativity mainly include the Michelson–Morley experiment, Kennedy–Thorndike experiment, Ives–Stilwell experiment and the comparison experiment of atomic clocks in two locations. These experiment
Externí odkaz:
https://doaj.org/article/d1d2250fa9ce41b697ae637321c2e509
Publikováno v:
Pest Management Science. 79:45-54
Publikováno v:
Pest management scienceREFERENCES. 79(1)
A significant variation in RNA interference (RNAi) efficiency hinders further functional gene studies and pest control application in many insects. The available double-stranded RNA (dsRNA) molecules introduced into the target cells are regarded as t
Publikováno v:
Physical Review Applied. 17
Publikováno v:
Microwave and Optical Technology Letters. 62:3820-3828
Publikováno v:
Advanced Materials Research. :1029-1033
Packing problem, which occurs frequently in sheet metal, clothing and furniture industry, cut product patterns from raw materials most efficiently and maximize material utilization. In this paper, an adaptive memetic algorithm is proposed to solve th
Publikováno v:
Advanced Materials Research. :2574-2578
We address a two dimensional bin packing problem in this paper. Firstly, we adopt and improve bottom left placement method, which is presented as bottom left corner-occupying (BLCO). Secondly, borrowing from the respective advantages of the two algor
Publikováno v:
Advanced Materials Research. :3131-3136
In this paper we address a rectangular packing problem (RPP), which is one of the most difficult NP-complete problems. First, greedy biggest space sequencing (GBSS) is presented as a new placement strategy, which is very essential to RPP. Then, borro
Publikováno v:
Advanced Materials Research. :379-383
In this paper we address a rectangular packing problem (RPP), which is one of the most difficult NP-complete problems. Borrowing from the respective advantages of the two algorithms, a hybrid of genetic algorithm (GA) and simulated annealing (SA) is