The Quiver trees spread in arid Namibia and South *** order to investigate the spatial distribution pattern associated with climate changes, from 2002 to 2008,Quiver trees observational data were *** to the financial ...
详细信息
The Quiver trees spread in arid Namibia and South *** order to investigate the spatial distribution pattern associated with climate changes, from 2002 to 2008,Quiver trees observational data were *** to the financial constraint,data set is not large enough and even uncompleted:only forty-three out of the originally designated fifty-three observational sites,which causes extreme difficulties in the spatial pattern *** our preliminary analysis,we found that the growth of the Quiver trees is robust to climate variables,say,rainfall and temperature and further that even for close sites geographically,the growths can be very diversified, which implies conventional kriging prediction or the inverse distance approach not working in the *** this paper,we define signal to noise ratio as a habitat measure for the Quiver Trees and engage the uncertain interpolation and extrapolation approaches including the uncertain canonical process regression and uncertain kriging prediction,for the habitat measure of the ten"missing"sites.
Genetic algorithm(GA)is most famous and useful algorithm belongs to the class of Evolutionary algorithm(EA).However,often an objective function possesses numerous local optima,which could trap GA from moving toward th...
详细信息
Genetic algorithm(GA)is most famous and useful algorithm belongs to the class of Evolutionary algorithm(EA).However,often an objective function possesses numerous local optima,which could trap GA from moving toward the desired global *** provides extremely long length of binary string,unsure position of two chromosomes crossover,turbid mutation methods,which fearfully limit the efficiency of *** this paper,we propose a new metaheuristic optimization algorithm named asλ*** new algorithm utilizes strings of digits from member set {0,1,2,3,and 4} to represent the fitness values of candidate solutions(represented as vectors in n-dimensional Euclidean space).Theλalgorithm draws useful information from both repeated and unrepeated digits of strings(candidate solutions),to simulate global advanced schema towards final *** new algorithm only asks 3 or 4 digits to represent an unknown variable, but still could access very precision ***λcomparison and expansion operations instead of inefficient mutation operation,which allowed the strings select more efficient schema from the *** using crossover,stochastic coding strategy,population selection,PSO methods...all of the existing optimization methods,the new algorithm still could achieve the highest searching efficiency, better optimized than most of existing algorithm.
暂无评论