Inspired by genetic algorithm(GA),an improved genetic algorithm(IGA)is proposed.It inherits the main idea of evolutionary computing,avoids the process of coding and decoding inorder to probe the solution in the state ...Inspired by genetic algorithm(GA),an improved genetic algorithm(IGA)is proposed.It inherits the main idea of evolutionary computing,avoids the process of coding and decoding inorder to probe the solution in the state space directly and has distributed computing version.Soit is faster and gives higher precision.Aided by IGA,a new optimization strategy for theflexibility analysis and retrofitting of existing heat exchanger networks is presented.A case studyshows that IGA has the ability of finding the global optimum with higher speed and better preci-sion.展开更多
L p approximation capability of radial basis function (RBF) neural networks is investigated. If g: R +1 → R 1 and $g(\parallel x\parallel _{R^n } )$g(\parallel x\parallel _{R^n } ) ∈ L loc p (R n ) with 1 ≤ p < ...L p approximation capability of radial basis function (RBF) neural networks is investigated. If g: R +1 → R 1 and $g(\parallel x\parallel _{R^n } )$g(\parallel x\parallel _{R^n } ) ∈ L loc p (R n ) with 1 ≤ p < ∞, then the RBF neural networks with g as the activation function can approximate any given function in L p (K) with any accuracy for any compact set K in R n , if and only if g(x) is not an even polynomial.展开更多
L^p approximation problems in system identification with RBF neural networks are investigated. It is proved that by superpositions of some functions of one variable in L^ploc（R）, one can approximate continuous funct...L^p approximation problems in system identification with RBF neural networks are investigated. It is proved that by superpositions of some functions of one variable in L^ploc（R）, one can approximate continuous functionals defined on a compact subset of L^P（K） and continuous operators from a compact subset of L^p1 （K1） to a compact subset of L^p2 （K2）. These results show that if its activation function is in L^ploc（R） and is not an even polynomial, then this RBF neural networks can approximate the above systems with any accuracy.展开更多
文摘Inspired by genetic algorithm(GA),an improved genetic algorithm(IGA)is proposed.It inherits the main idea of evolutionary computing,avoids the process of coding and decoding inorder to probe the solution in the state space directly and has distributed computing version.Soit is faster and gives higher precision.Aided by IGA,a new optimization strategy for theflexibility analysis and retrofitting of existing heat exchanger networks is presented.A case studyshows that IGA has the ability of finding the global optimum with higher speed and better preci-sion.
基金the National Natural Science Foundation of China (10471017)
文摘L p approximation capability of radial basis function (RBF) neural networks is investigated. If g: R +1 → R 1 and $g(\parallel x\parallel _{R^n } )$g(\parallel x\parallel _{R^n } ) ∈ L loc p (R n ) with 1 ≤ p < ∞, then the RBF neural networks with g as the activation function can approximate any given function in L p (K) with any accuracy for any compact set K in R n , if and only if g(x) is not an even polynomial.
基金Foundation item： tile National Natural Science Foundation of China （No. 10471017）.
文摘L^p approximation problems in system identification with RBF neural networks are investigated. It is proved that by superpositions of some functions of one variable in L^ploc（R）, one can approximate continuous functionals defined on a compact subset of L^P（K） and continuous operators from a compact subset of L^p1 （K1） to a compact subset of L^p2 （K2）. These results show that if its activation function is in L^ploc（R） and is not an even polynomial, then this RBF neural networks can approximate the above systems with any accuracy.
