[Objective] The research aimed to simplify the traditional method and gain the method which could directly construct the comprehensive rainstorm intensity formula.[Method] The particle swarm optimization was used to o...[Objective] The research aimed to simplify the traditional method and gain the method which could directly construct the comprehensive rainstorm intensity formula.[Method] The particle swarm optimization was used to optimize the parameters of uniform comprehensive rainstorm intensity formula in every return period and directly construct the comprehensive rainstorm intensity formula.Moreover,took the comprehensive rainstorm intensity formula which was established by the hourly precipitation data in wuhu City as an example,the calculation result compared with the computed result of traditional method.[Result] The calculation result precision of particle swarm algorithm was higher than the traditional method,and the calculation process was simpler.[Conclusion] The particle swarm algorithm could directly construct the comprehensive rainstorm intensity formula.展开更多
A new method for the construction of bivariate matrix valued rational interpolants (BGIRI) on a rectangular grid is presented in [6]. The rational interpolants are of Thiele-type continued fraction form with scalar de...A new method for the construction of bivariate matrix valued rational interpolants (BGIRI) on a rectangular grid is presented in [6]. The rational interpolants are of Thiele-type continued fraction form with scalar denominator. The generalized inverse introduced by [3]is gen-eralized to rectangular matrix case in this paper. An exact error formula for interpolation is ob-tained, which is an extension in matrix form of bivariate scalar and vector valued rational interpola-tion discussed by Siemaszko[l2] and by Gu Chuangqing [7] respectively. By defining row and col-umn-transformation in the sense of the partial inverted differences for matrices, two type matrix algorithms are established to construct corresponding two different BGIRI, which hold for the vec-tor case and the scalar case.展开更多
Constrained nonlinear optimization problems are well known as very difficult problems. In this paper, we present a new algorithm for solving such problems. Our proposed algorithm combines the Branch-and-Bound algorith...Constrained nonlinear optimization problems are well known as very difficult problems. In this paper, we present a new algorithm for solving such problems. Our proposed algorithm combines the Branch-and-Bound algorithm and Lipschitz constant to limit the search area effectively;this is essential for solving constrained nonlinear optimization problems. We obtain a more appropriate Lipschitz constant by applying the formula manipulation system of each divided area. Therefore, we obtain a better approximate solution without using a lot of searching points. The efficiency of our proposed algorithm has been shown by the results of some numerical experiments.展开更多
In this paper, an approximate analytical algorithm in the form of direct Fourier reconstruction is obtained for the recon- struction of data functions arisen from ^-scheme short-scan sin- gle-photon emission computed ...In this paper, an approximate analytical algorithm in the form of direct Fourier reconstruction is obtained for the recon- struction of data functions arisen from ^-scheme short-scan sin- gle-photon emission computed tomography（SPECT） with uniform attenuation, and the modified central slice theorem is developed. Numerical simulations are conducted to demonstrate the effec- tiveness of the developed method.展开更多
This paper provides a new sorting algorithm called 'Only-Once-Sorting' algorithm a mathemati cal formula,this algorithm can put elements in the positions they should be stored only once,then compacts them.The ...This paper provides a new sorting algorithm called 'Only-Once-Sorting' algorithm a mathemati cal formula,this algorithm can put elements in the positions they should be stored only once,then compacts them.The algorithm completes sorting a sequence of n elements in a calculation time of O(n ).展开更多
A class of parallel implicit Runge-Kutta formulas is constructed for multiprocessor system. A family of parallel implicit two-stage fourth order Runge-Kutta formulas is given. For these formulas, the convergence is pr...A class of parallel implicit Runge-Kutta formulas is constructed for multiprocessor system. A family of parallel implicit two-stage fourth order Runge-Kutta formulas is given. For these formulas, the convergence is proved and the stability analysis is given. The numerical examples demonstrate that these formulas can solve an extensive class of initial value problems for the ordinary differential equations.展开更多
针对Leach(low energy adaptive clustering hierarchy)协议在大规模网络中存在着数据传输效率不高和网络生命周期短的问题,提出了一种LEACH-CM-NGO优化算法。该方法通过在簇头选取阶段优化簇头数在所有节点中占比,引进能量密度因子和...针对Leach(low energy adaptive clustering hierarchy)协议在大规模网络中存在着数据传输效率不高和网络生命周期短的问题,提出了一种LEACH-CM-NGO优化算法。该方法通过在簇头选取阶段优化簇头数在所有节点中占比,引进能量密度因子和能耗因子改进阈值公式优化簇头分布,并在数据传输阶段,由原本的单跳传输改为多跳方式传输数据,引入基于立方映射方法,自适应权重策略和柯西变异的北方苍鹰优化算法改进簇头间数据传输路径,以提高网络的能效和数据传输效率。仿真结果表明,所提出的方法在减少能耗的同时,显著延长了网络的生命周期并提高了数据传输的成功率。展开更多
基金Supported by The College Management Science Research Project of Chengdu University of Information Technology (CRF200804)The Project of Sichuan Education Department (07ZB014)
文摘[Objective] The research aimed to simplify the traditional method and gain the method which could directly construct the comprehensive rainstorm intensity formula.[Method] The particle swarm optimization was used to optimize the parameters of uniform comprehensive rainstorm intensity formula in every return period and directly construct the comprehensive rainstorm intensity formula.Moreover,took the comprehensive rainstorm intensity formula which was established by the hourly precipitation data in wuhu City as an example,the calculation result compared with the computed result of traditional method.[Result] The calculation result precision of particle swarm algorithm was higher than the traditional method,and the calculation process was simpler.[Conclusion] The particle swarm algorithm could directly construct the comprehensive rainstorm intensity formula.
文摘A new method for the construction of bivariate matrix valued rational interpolants (BGIRI) on a rectangular grid is presented in [6]. The rational interpolants are of Thiele-type continued fraction form with scalar denominator. The generalized inverse introduced by [3]is gen-eralized to rectangular matrix case in this paper. An exact error formula for interpolation is ob-tained, which is an extension in matrix form of bivariate scalar and vector valued rational interpola-tion discussed by Siemaszko[l2] and by Gu Chuangqing [7] respectively. By defining row and col-umn-transformation in the sense of the partial inverted differences for matrices, two type matrix algorithms are established to construct corresponding two different BGIRI, which hold for the vec-tor case and the scalar case.
文摘Constrained nonlinear optimization problems are well known as very difficult problems. In this paper, we present a new algorithm for solving such problems. Our proposed algorithm combines the Branch-and-Bound algorithm and Lipschitz constant to limit the search area effectively;this is essential for solving constrained nonlinear optimization problems. We obtain a more appropriate Lipschitz constant by applying the formula manipulation system of each divided area. Therefore, we obtain a better approximate solution without using a lot of searching points. The efficiency of our proposed algorithm has been shown by the results of some numerical experiments.
基金Supported by the National Natural Science Foundation of China(61271398)the Natural Science Foundation of Ningbo(2012A610031)
文摘In this paper, an approximate analytical algorithm in the form of direct Fourier reconstruction is obtained for the recon- struction of data functions arisen from ^-scheme short-scan sin- gle-photon emission computed tomography（SPECT） with uniform attenuation, and the modified central slice theorem is developed. Numerical simulations are conducted to demonstrate the effec- tiveness of the developed method.
文摘This paper provides a new sorting algorithm called 'Only-Once-Sorting' algorithm a mathemati cal formula,this algorithm can put elements in the positions they should be stored only once,then compacts them.The algorithm completes sorting a sequence of n elements in a calculation time of O(n ).
基金Project supported by the National Natural Science Foundation of China
文摘A class of parallel implicit Runge-Kutta formulas is constructed for multiprocessor system. A family of parallel implicit two-stage fourth order Runge-Kutta formulas is given. For these formulas, the convergence is proved and the stability analysis is given. The numerical examples demonstrate that these formulas can solve an extensive class of initial value problems for the ordinary differential equations.
文摘针对Leach(low energy adaptive clustering hierarchy)协议在大规模网络中存在着数据传输效率不高和网络生命周期短的问题,提出了一种LEACH-CM-NGO优化算法。该方法通过在簇头选取阶段优化簇头数在所有节点中占比,引进能量密度因子和能耗因子改进阈值公式优化簇头分布,并在数据传输阶段,由原本的单跳传输改为多跳方式传输数据,引入基于立方映射方法,自适应权重策略和柯西变异的北方苍鹰优化算法改进簇头间数据传输路径,以提高网络的能效和数据传输效率。仿真结果表明,所提出的方法在减少能耗的同时,显著延长了网络的生命周期并提高了数据传输的成功率。
