This paper puts forward a new variable step size LMS adaptive algorithm based on variable region. The step size p（k） in the algorithm varies with the variation of the region of deviation e （k） to ensure the optimi...This paper puts forward a new variable step size LMS adaptive algorithm based on variable region. The step size p（k） in the algorithm varies with the variation of the region of deviation e （k） to ensure the optimization of the three performance objectives including initial convergent speed, trace ability of the time-varying system and steady disregulation. The paper demonstrates the convergence of the algorithm accompanied by random noise,展开更多
According to the exact expression of the maladjustment, an equation for calculating the boundary of step-size in MLMS algorithm is derived and the relationship between the convergence rate and step-size is discussed i...According to the exact expression of the maladjustment, an equation for calculating the boundary of step-size in MLMS algorithm is derived and the relationship between the convergence rate and step-size is discussed in detail. It is shown that the threshold of the step-size is constrained by maladjustment. Three different properties are presented between the LMS and MLMS algorithms based on comparison. It is indicated that MLMS does not differ significantly from LMS when the given maladjustment is small.展开更多
Computational models are developed to create grain structures using mathematical algorithms based on the chaos theory such as cellular automaton, geometrical models, fractals, and stochastic methods. Because of the ch...Computational models are developed to create grain structures using mathematical algorithms based on the chaos theory such as cellular automaton, geometrical models, fractals, and stochastic methods. Because of the chaotic nature of grain structures, some of the most popular routines are based on the Monte Carlo method, statistical distributions, and random walk methods, which can be easily programmed and included in nested loops. Nevertheless, grain structures are not well defined as the results of computational errors and numerical incon- sistencies on mathematical methods. Due to the finite definition of numbers or the numerical restrictions during the simulation of solidifica- tion, damaged images appear on the screen. These images must be repaired to obtain a good measurement of grain geometrical properties. Some mathematical algorithms were developed to repair, measure, and characterize grain structures obtained from cellular automata in the present work. An appropriate measurement of grain size and the corrected identification of interfaces and length are very important topics in materials science because they are the representation and validation of mathematical models with real samples. As a result, the developed al- gorithms are tested and proved to be appropriate and efficient to eliminate the errors and characterize the grain structures.展开更多
A parallel arithmetic program for the molecular dynamics (MD) simulation study of a large sized system consisting of 50 000100 000 atoms of liquid metals is reformed, based on the cascade arithmetic program used for t...A parallel arithmetic program for the molecular dynamics (MD) simulation study of a large sized system consisting of 50 000100 000 atoms of liquid metals is reformed, based on the cascade arithmetic program used for the molecular dynamics simulation study of a small sized system consisting of 5001 000 atoms. The program is used to simulate the rapid solidification processes of liquid metal Al system. Some new results, such as larger clusters composed of more than 36 smaller clusters (icosahedra or defect icosahedra) obtained in the system of 50 000 atoms, however, the larger clusters can not be seen in the small sized system of 5001 000 atoms. On the other hand, the results from this simulation study would be more closed to the real situation of the system under consideration because the influence of boundary conditions is decreased remarkably. It can be expected that from the parallel algorithm combined with the higher performance super computer, the total number of atoms in simulation system can be enlarged again up to tens, even hundreds times in the near future.展开更多
AISI 304L is an austenitic Chromium-Nickel stainless steel offering the optimum combination of corrosion resistance, strength and ductility. These attributes make it a favorite for many mechanical components. The pape...AISI 304L is an austenitic Chromium-Nickel stainless steel offering the optimum combination of corrosion resistance, strength and ductility. These attributes make it a favorite for many mechanical components. The paper focuses on developing mathematical models to predict grain size and hardness of pulsed current micro plasma arc welded AISI 304L joints. Four factors, five level, central composite rotatable design matrix is used to optimize the number of experiments. The mathematical models have been developed by Response Surface Method (RSM) and its adequacy is checked by Analysis of Variance (ANOVA) technique. By using the developed mathematical models, grain size and hardness of the weld joints can be predicted with 99% confidence level. The developed mathematical models have been optimized using Hooke and Jeeves algorithm to minimize grain size and maximize the hardness.展开更多
This paper introduces an optimized planning approach for integrating photovoltaic as distributed generation (PV-DG) into the radial distribution power systems, utilizing exhaustive load flow (ELF), loss sensitivity fa...This paper introduces an optimized planning approach for integrating photovoltaic as distributed generation (PV-DG) into the radial distribution power systems, utilizing exhaustive load flow (ELF), loss sensitivity factor (LSF), genetic algorithms (GA) methods, and numerical method based on LSF. The methodology aims to determine the optimal allocation and sizing of multiple PV-DG to minimize power loss through time series power flow analysis. An approach utilizing continuous sensitivity analysis is developed and inherently leverages power flow and loss equations to compute LSF of all buses in the system towards employing a dynamic PV-DG model for more accurate results. The algorithm uses a numerical grid search method to optimize PV-DG placement in a power distribution system, focusing on minimizing system losses. It combines iterative analysis, sensitivity assessment, and comprehensive visualization to identify and present the optimal PV-DG configurations. The present-ed algorithms are verified through co-simulation framework combining MATLAB and OpenDSS to carry out analysis for 12-bus radial distribution test system. The proposed numerical method is compared with other algorithms, such as ELF, LSF methods, and Genetic Algorithms (GA). Results show that the proposed numerical method performs well in comparison with LSF and ELF solutions.展开更多
针对RRT(Rapidly-exploring Random Tree)算法在机器人路径规划过程存在采样点随机性高、算法效率低、路径规划时间长以及规划路径冗长等问题,文中提出一种结合人工势场法的双向RRT路径规划算法。将传统RRT算法中单向扩展方式改为由起...针对RRT(Rapidly-exploring Random Tree)算法在机器人路径规划过程存在采样点随机性高、算法效率低、路径规划时间长以及规划路径冗长等问题,文中提出一种结合人工势场法的双向RRT路径规划算法。将传统RRT算法中单向扩展方式改为由起点和终点同时进行扩展,在节点扩展时加入人工势场法进行引导,增加节点扩展的目的性。将固定步长改换为可变步长,使随机树可以更快地向目标点扩展。对生成路径进行剪枝处理,删除路径中的冗余节点,进一步缩短路径长度。利用MATLAB仿真平台在相同环境下对比所提改进算法与RRT-Connect算法、DRRT-Connect(Dynamic Rapidly-exploring Random Tree Connect)算法、GB(Goal-Biased)-RRT算法、A^(*)算法、PRM(Probabilistic Road Map)算法的路径规划效果。仿真结果表明,所提改进算法与其他改进算法相比最短路径缩短了7%,最短搜索时间降低了65%,提高了算法的规划效率。将所提算法应用于机器人,结果证明了其具有较强可行性。展开更多
Sample size re-estimation is essential in oncology studies. However, the use of blinded sample size reassessment for survival data has been rarely reported. Based on the density function of the exponential distributio...Sample size re-estimation is essential in oncology studies. However, the use of blinded sample size reassessment for survival data has been rarely reported. Based on the density function of the exponential distribution, an expectation-maximization（EM） algorithm of the hazard ratio was derived, and several simulation studies were used to verify its applications. The method had obvious variation in the hazard ratio estimates and overestimation for the relatively small hazard ratios. Our studies showed that the stability of the EM estimation results directly correlated with the sample size, the convergence of the EM algorithm was impacted by the initial values, and a balanced design produced the best estimates. No reliable blinded sample size re-estimation inference can be made in our studies, but the results provide useful information to steer the practitioners in this field from repeating the same endeavor.展开更多
Compared with vertical and horizontal wells, the solution and computation of transient pressure responses of slanted wells are more complex. Vertical and horizontal wells are both simplified cases of slanted wells at ...Compared with vertical and horizontal wells, the solution and computation of transient pressure responses of slanted wells are more complex. Vertical and horizontal wells are both simplified cases of slanted wells at particular inclination, so the model for slanted wells is more general and more complex than other models for vertical and horizontal wells. Many authors have studied unsteady-state flow of fluids in slanted wells and various solutions have been proposed. However, until now, few of the published results pertain to the computational efficiency. Whether in the time domain or in the Laplace domain, the computation of integration of complex functions is necessary in obtaining pressure responses of slanted wells, while the computation of the integration is complex and time-consuming. To obtain a perfect type curve the computation time is unacceptable even with an aid of high-speed computers. The purpose of this paper is to present an efficient algorithm to compute transient pressure distributions caused by slanted wells in reservoirs. Based on rigorous derivation, the transient pressure solution for slanted wells of any inclination angle is presented. Assuming an infinite-conductivity wellbore, the location of the equivalent-pressure point is determined. More importantly, according to the characteristics of the integrand in a transient pressure solution for slanted wells, the whole integral interval is partitioned into several small integral intervals, and then the method of variable substitution and the variable step-size piecewise numerical integration are employed. The amount of computation is significantly reduced and the computational efficiency is greatly improved. The algorithm proposed in this paper thoroughly solved the difficulty in the efficient and high-speed computation of transient pressure distribution of slanted wells with any inclination angle.展开更多
基金Supported by Natural Science Foundation of Beijing of China (No.2005AA501140)
文摘This paper puts forward a new variable step size LMS adaptive algorithm based on variable region. The step size p（k） in the algorithm varies with the variation of the region of deviation e （k） to ensure the optimization of the three performance objectives including initial convergent speed, trace ability of the time-varying system and steady disregulation. The paper demonstrates the convergence of the algorithm accompanied by random noise,
文摘According to the exact expression of the maladjustment, an equation for calculating the boundary of step-size in MLMS algorithm is derived and the relationship between the convergence rate and step-size is discussed in detail. It is shown that the threshold of the step-size is constrained by maladjustment. Three different properties are presented between the LMS and MLMS algorithms based on comparison. It is indicated that MLMS does not differ significantly from LMS when the given maladjustment is small.
文摘Computational models are developed to create grain structures using mathematical algorithms based on the chaos theory such as cellular automaton, geometrical models, fractals, and stochastic methods. Because of the chaotic nature of grain structures, some of the most popular routines are based on the Monte Carlo method, statistical distributions, and random walk methods, which can be easily programmed and included in nested loops. Nevertheless, grain structures are not well defined as the results of computational errors and numerical incon- sistencies on mathematical methods. Due to the finite definition of numbers or the numerical restrictions during the simulation of solidifica- tion, damaged images appear on the screen. These images must be repaired to obtain a good measurement of grain geometrical properties. Some mathematical algorithms were developed to repair, measure, and characterize grain structures obtained from cellular automata in the present work. An appropriate measurement of grain size and the corrected identification of interfaces and length are very important topics in materials science because they are the representation and validation of mathematical models with real samples. As a result, the developed al- gorithms are tested and proved to be appropriate and efficient to eliminate the errors and characterize the grain structures.
文摘A parallel arithmetic program for the molecular dynamics (MD) simulation study of a large sized system consisting of 50 000100 000 atoms of liquid metals is reformed, based on the cascade arithmetic program used for the molecular dynamics simulation study of a small sized system consisting of 5001 000 atoms. The program is used to simulate the rapid solidification processes of liquid metal Al system. Some new results, such as larger clusters composed of more than 36 smaller clusters (icosahedra or defect icosahedra) obtained in the system of 50 000 atoms, however, the larger clusters can not be seen in the small sized system of 5001 000 atoms. On the other hand, the results from this simulation study would be more closed to the real situation of the system under consideration because the influence of boundary conditions is decreased remarkably. It can be expected that from the parallel algorithm combined with the higher performance super computer, the total number of atoms in simulation system can be enlarged again up to tens, even hundreds times in the near future.
文摘AISI 304L is an austenitic Chromium-Nickel stainless steel offering the optimum combination of corrosion resistance, strength and ductility. These attributes make it a favorite for many mechanical components. The paper focuses on developing mathematical models to predict grain size and hardness of pulsed current micro plasma arc welded AISI 304L joints. Four factors, five level, central composite rotatable design matrix is used to optimize the number of experiments. The mathematical models have been developed by Response Surface Method (RSM) and its adequacy is checked by Analysis of Variance (ANOVA) technique. By using the developed mathematical models, grain size and hardness of the weld joints can be predicted with 99% confidence level. The developed mathematical models have been optimized using Hooke and Jeeves algorithm to minimize grain size and maximize the hardness.
文摘This paper introduces an optimized planning approach for integrating photovoltaic as distributed generation (PV-DG) into the radial distribution power systems, utilizing exhaustive load flow (ELF), loss sensitivity factor (LSF), genetic algorithms (GA) methods, and numerical method based on LSF. The methodology aims to determine the optimal allocation and sizing of multiple PV-DG to minimize power loss through time series power flow analysis. An approach utilizing continuous sensitivity analysis is developed and inherently leverages power flow and loss equations to compute LSF of all buses in the system towards employing a dynamic PV-DG model for more accurate results. The algorithm uses a numerical grid search method to optimize PV-DG placement in a power distribution system, focusing on minimizing system losses. It combines iterative analysis, sensitivity assessment, and comprehensive visualization to identify and present the optimal PV-DG configurations. The present-ed algorithms are verified through co-simulation framework combining MATLAB and OpenDSS to carry out analysis for 12-bus radial distribution test system. The proposed numerical method is compared with other algorithms, such as ELF, LSF methods, and Genetic Algorithms (GA). Results show that the proposed numerical method performs well in comparison with LSF and ELF solutions.
文摘针对RRT(Rapidly-exploring Random Tree)算法在机器人路径规划过程存在采样点随机性高、算法效率低、路径规划时间长以及规划路径冗长等问题,文中提出一种结合人工势场法的双向RRT路径规划算法。将传统RRT算法中单向扩展方式改为由起点和终点同时进行扩展,在节点扩展时加入人工势场法进行引导,增加节点扩展的目的性。将固定步长改换为可变步长,使随机树可以更快地向目标点扩展。对生成路径进行剪枝处理,删除路径中的冗余节点,进一步缩短路径长度。利用MATLAB仿真平台在相同环境下对比所提改进算法与RRT-Connect算法、DRRT-Connect(Dynamic Rapidly-exploring Random Tree Connect)算法、GB(Goal-Biased)-RRT算法、A^(*)算法、PRM(Probabilistic Road Map)算法的路径规划效果。仿真结果表明,所提改进算法与其他改进算法相比最短路径缩短了7%,最短搜索时间降低了65%,提高了算法的规划效率。将所提算法应用于机器人,结果证明了其具有较强可行性。
基金supported by the National Natural Science Foundation of China(81273184)the National Natural Science Foundation of China Grant for Young Scientists (81302512)
文摘Sample size re-estimation is essential in oncology studies. However, the use of blinded sample size reassessment for survival data has been rarely reported. Based on the density function of the exponential distribution, an expectation-maximization（EM） algorithm of the hazard ratio was derived, and several simulation studies were used to verify its applications. The method had obvious variation in the hazard ratio estimates and overestimation for the relatively small hazard ratios. Our studies showed that the stability of the EM estimation results directly correlated with the sample size, the convergence of the EM algorithm was impacted by the initial values, and a balanced design produced the best estimates. No reliable blinded sample size re-estimation inference can be made in our studies, but the results provide useful information to steer the practitioners in this field from repeating the same endeavor.
基金financial support from the special fund of China’s central government for the development of local colleges and universities―the project of national first-level discipline in Oil and Gas Engineering, the National Science Fund for Distinguished Young Scholars of China (Grant No. 51125019)the National Program on Key fundamental Research Project (973 Program, Grant No. 2011CB201005)
文摘Compared with vertical and horizontal wells, the solution and computation of transient pressure responses of slanted wells are more complex. Vertical and horizontal wells are both simplified cases of slanted wells at particular inclination, so the model for slanted wells is more general and more complex than other models for vertical and horizontal wells. Many authors have studied unsteady-state flow of fluids in slanted wells and various solutions have been proposed. However, until now, few of the published results pertain to the computational efficiency. Whether in the time domain or in the Laplace domain, the computation of integration of complex functions is necessary in obtaining pressure responses of slanted wells, while the computation of the integration is complex and time-consuming. To obtain a perfect type curve the computation time is unacceptable even with an aid of high-speed computers. The purpose of this paper is to present an efficient algorithm to compute transient pressure distributions caused by slanted wells in reservoirs. Based on rigorous derivation, the transient pressure solution for slanted wells of any inclination angle is presented. Assuming an infinite-conductivity wellbore, the location of the equivalent-pressure point is determined. More importantly, according to the characteristics of the integrand in a transient pressure solution for slanted wells, the whole integral interval is partitioned into several small integral intervals, and then the method of variable substitution and the variable step-size piecewise numerical integration are employed. The amount of computation is significantly reduced and the computational efficiency is greatly improved. The algorithm proposed in this paper thoroughly solved the difficulty in the efficient and high-speed computation of transient pressure distribution of slanted wells with any inclination angle.
