Wiener filtering is used to estimate receiver function in a time_domain. With the vertical component of 3_component teleseismic P waveform as the input of a Wiener filter, receiver function as the filter response, and...Wiener filtering is used to estimate receiver function in a time_domain. With the vertical component of 3_component teleseismic P waveform as the input of a Wiener filter, receiver function as the filter response, and radial and tangential components as the expected output, receiver function is estimated by minimizing the error between expected and actual outputs. Receiver function can be obtained by solving the Toeplitz equation using the Levinson algorithm. The non_singularity of the Toeplitz equation ensures the stability of Wiener Deconvolution. Both synthetic and observational seismogram checks show that Wiener Deconvolution is an effective time_domain method to estimate receiver function from teleseismic P waveform.展开更多
A improving Steady State Genetic Algorithm for global optimization over linear constraint non-convex programming problem is presented. By convex analyzing, the primal optimal problem can be converted to an equivalent ...A improving Steady State Genetic Algorithm for global optimization over linear constraint non-convex programming problem is presented. By convex analyzing, the primal optimal problem can be converted to an equivalent problem, in which only the information of convex extremes of feasible space is included, and is more easy for GAs to solve. For avoiding invalid genetic operators, a redesigned convex crossover operator is also performed in evolving. As a integrality, the quality of two problem is proven, and a method is also given to get all extremes in linear constraint space. Simulation result show that new algorithm not only converges faster, but also can maintain an diversity population, and can get the global optimum of test problem.展开更多
Shape optimization of mechanical components is one of the issues that have been considered in recent years. Different methods were presented such as adaptive biological for reducing costs and increasing accuracy. The ...Shape optimization of mechanical components is one of the issues that have been considered in recent years. Different methods were presented such as adaptive biological for reducing costs and increasing accuracy. The effects of step factor, the number of control points and the definition way of control points coordinates in convergence rate were studied. A code was written using ANSYS Parametric Design Language (APDL) which receives the studied parameters as input and obtains the optimum shape for the components. The results show that for achieving successful optimization, step factor should be in a specific range. It is found that the use of any coordinate system in defining control points coordinates and selection of any direction for stimulus vector of algorithm will also result in optimum shape. Furthermore, by increasing the number of control points, some non-uniformities are created in the studied boundary. Achieving acceptable accuracy seems impossible due to the creation of saw form at the studied boundary which is called "saw position".展开更多
An immune algorithm solution is proposed in this paper to deal with the problem of optimal coordination of local physically based controllers in order to preserve or retain mid and long term voltage stability. This pr...An immune algorithm solution is proposed in this paper to deal with the problem of optimal coordination of local physically based controllers in order to preserve or retain mid and long term voltage stability. This problem is in fact a global coordination control problem which involves not only sequencing and timing different control devices but also tuning the parameters of controllers. A multi-stage coordinated control scheme is presented, aiming at retaining good voltage levels with minimal control efforts and costs after severe disturbances in power systems. A self-pattem-recognized vaccination procedure is developed to transfer effective heuristic information into the new generation of solution candidates to speed up the convergence of the search procedure to global optima. An example of four bus power system case study is investigated to show the effectiveness and efficiency of the proposed algorithm, compared with several existing approaches such as differential dynamic programming and tree-search.展开更多
A multiple-objective evolutionary algorithm (MOEA) with a new Decision Making (DM) scheme for MOD of conceptual missile shapes was presented, which is contrived to determine suitable tradeoffs from Pareto optimal set ...A multiple-objective evolutionary algorithm (MOEA) with a new Decision Making (DM) scheme for MOD of conceptual missile shapes was presented, which is contrived to determine suitable tradeoffs from Pareto optimal set using interactive preference articulation. There are two objective functions, to maximize ratio of lift to drag and to minimize radar cross-section (RCS) value. 3D computational electromagnetic solver was used to evaluate RCS, electromagnetic performance. 3D Navier-Stokes flow solver was adopted to evaluate aerodynamic performance. A flight mechanics solver was used to analyze the stability of the missile. Based on the MOEA, a synergetic optimization of missile shapes for aerodynamic and radar cross-section performance is completed. The results show that the proposed approach can be used in more complex optimization case of flight vehicles.展开更多
The basic principle of interval arithmetic and the basic algorithm of the interval Newton methods are introduced.The prototype algorithm can not find any zero in an interval that has zero sometimes,that is,it is insta...The basic principle of interval arithmetic and the basic algorithm of the interval Newton methods are introduced.The prototype algorithm can not find any zero in an interval that has zero sometimes,that is,it is instable.So the prototype relaxation procedure is improved in this paper.Additionally,an immediate test of the existence of a solution following branch_and_bound is proposed,which avoids unwanted computations in those intervals that have no solution.The numerical results demonstrat that the improved interval Newton method is superior to prototype algorithm in terms of solution quality,stability and convergent speed.展开更多
The greedy algorithm is a strong local searching algorithm. The genetic algorithm is generally applied to the global optimization problems. In this paper, we combine the greedy idea and the genetic algorithm to propos...The greedy algorithm is a strong local searching algorithm. The genetic algorithm is generally applied to the global optimization problems. In this paper, we combine the greedy idea and the genetic algorithm to propose the greedy genetic algorithm which incorporates the global exploring ability of the genetic algorithm and the local convergent ability of the greedy algorithm. Experimental results show that greedy genetic algorithm gives much better results than the classical genetic algorithm.展开更多
文摘Wiener filtering is used to estimate receiver function in a time_domain. With the vertical component of 3_component teleseismic P waveform as the input of a Wiener filter, receiver function as the filter response, and radial and tangential components as the expected output, receiver function is estimated by minimizing the error between expected and actual outputs. Receiver function can be obtained by solving the Toeplitz equation using the Levinson algorithm. The non_singularity of the Toeplitz equation ensures the stability of Wiener Deconvolution. Both synthetic and observational seismogram checks show that Wiener Deconvolution is an effective time_domain method to estimate receiver function from teleseismic P waveform.
文摘A improving Steady State Genetic Algorithm for global optimization over linear constraint non-convex programming problem is presented. By convex analyzing, the primal optimal problem can be converted to an equivalent problem, in which only the information of convex extremes of feasible space is included, and is more easy for GAs to solve. For avoiding invalid genetic operators, a redesigned convex crossover operator is also performed in evolving. As a integrality, the quality of two problem is proven, and a method is also given to get all extremes in linear constraint space. Simulation result show that new algorithm not only converges faster, but also can maintain an diversity population, and can get the global optimum of test problem.
文摘Shape optimization of mechanical components is one of the issues that have been considered in recent years. Different methods were presented such as adaptive biological for reducing costs and increasing accuracy. The effects of step factor, the number of control points and the definition way of control points coordinates in convergence rate were studied. A code was written using ANSYS Parametric Design Language (APDL) which receives the studied parameters as input and obtains the optimum shape for the components. The results show that for achieving successful optimization, step factor should be in a specific range. It is found that the use of any coordinate system in defining control points coordinates and selection of any direction for stimulus vector of algorithm will also result in optimum shape. Furthermore, by increasing the number of control points, some non-uniformities are created in the studied boundary. Achieving acceptable accuracy seems impossible due to the creation of saw form at the studied boundary which is called "saw position".
基金Project supported by the National Basic Research Program (973) of China (No. 2002CB312200) and City University of Hong Kong (No.9380026), China
文摘An immune algorithm solution is proposed in this paper to deal with the problem of optimal coordination of local physically based controllers in order to preserve or retain mid and long term voltage stability. This problem is in fact a global coordination control problem which involves not only sequencing and timing different control devices but also tuning the parameters of controllers. A multi-stage coordinated control scheme is presented, aiming at retaining good voltage levels with minimal control efforts and costs after severe disturbances in power systems. A self-pattem-recognized vaccination procedure is developed to transfer effective heuristic information into the new generation of solution candidates to speed up the convergence of the search procedure to global optima. An example of four bus power system case study is investigated to show the effectiveness and efficiency of the proposed algorithm, compared with several existing approaches such as differential dynamic programming and tree-search.
基金National Natural Science Foundation ofChina( No.90 2 0 5 0 0 6) and Shanghai Rising Star Program( No.0 2 QG14 0 3 1)
文摘A multiple-objective evolutionary algorithm (MOEA) with a new Decision Making (DM) scheme for MOD of conceptual missile shapes was presented, which is contrived to determine suitable tradeoffs from Pareto optimal set using interactive preference articulation. There are two objective functions, to maximize ratio of lift to drag and to minimize radar cross-section (RCS) value. 3D computational electromagnetic solver was used to evaluate RCS, electromagnetic performance. 3D Navier-Stokes flow solver was adopted to evaluate aerodynamic performance. A flight mechanics solver was used to analyze the stability of the missile. Based on the MOEA, a synergetic optimization of missile shapes for aerodynamic and radar cross-section performance is completed. The results show that the proposed approach can be used in more complex optimization case of flight vehicles.
文摘The basic principle of interval arithmetic and the basic algorithm of the interval Newton methods are introduced.The prototype algorithm can not find any zero in an interval that has zero sometimes,that is,it is instable.So the prototype relaxation procedure is improved in this paper.Additionally,an immediate test of the existence of a solution following branch_and_bound is proposed,which avoids unwanted computations in those intervals that have no solution.The numerical results demonstrat that the improved interval Newton method is superior to prototype algorithm in terms of solution quality,stability and convergent speed.
文摘The greedy algorithm is a strong local searching algorithm. The genetic algorithm is generally applied to the global optimization problems. In this paper, we combine the greedy idea and the genetic algorithm to propose the greedy genetic algorithm which incorporates the global exploring ability of the genetic algorithm and the local convergent ability of the greedy algorithm. Experimental results show that greedy genetic algorithm gives much better results than the classical genetic algorithm.
