In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-base...In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-based web services and the constraints of system resources.Then,a light-induced plant growth simulation algorithm was established.The performance of the algorithm was compared through several plant types,and the best plant model was selected as the setting for the system.Experimental results show that when the number of test cloud-based web services reaches 2048,the model being 2.14 times faster than PSO,2.8 times faster than the ant colony algorithm,2.9 times faster than the bee colony algorithm,and a remarkable 8.38 times faster than the genetic algorithm.展开更多
Dynamic model of aerial towed decoy system is established and simulations are performed to research the dynamic characteristics of the system. Firstly, Kinetic equations based on spinor are built, where the cable is d...Dynamic model of aerial towed decoy system is established and simulations are performed to research the dynamic characteristics of the system. Firstly, Kinetic equations based on spinor are built, where the cable is discretized into a number of rigid segments while the decoy is modeled as a rigid body hinged on the cable. Then tension recurrence algorithm is developed to improve computational efficiency, which makes it possible to predict the dynamic response of aerial towed decoy system rapidly and accurately. Subsequently, the efficiency and validity of this algorithm are verified by comparison with Kane’s function and further validated by wind tunnel tests.Simulation results indicate that the distance between the towing point and the decoy’s center of gravity is suggested to be 5%–20% of the length of decoy body to ensure the stability of system.In up-risen maneuver process, the value of angular velocity is recommended to be less than0.10 rad/s to protect the cable from the aircraft exhaust jet. During the turning movement of aircraft, the cable’s extent of stretching outwards is proportional to the aircraft’s angular velocity.Meanwhile, the decoy, aircraft and missile form a triangle, which promotes the decoy’s performance.展开更多
A class of hybrid algorithms of real-time simulation based on evaluation of non-integerstep right-hand side function are presented in this paper. And some results of the convergence and stability of the algorithms are...A class of hybrid algorithms of real-time simulation based on evaluation of non-integerstep right-hand side function are presented in this paper. And some results of the convergence and stability of the algorithms are given. Using the class of algorithms, evaluation for the right-hand side function is needed once in every integration-step. Moreover, comparing with the other methods with the same amount of work, their numerical stability regions are larger and the method errors are smaller, and the numerical experiments show that the algorithms are very effective.展开更多
Traditional parafoil homing usually uses a point as object. As the mobility of parafoil is limited by its glide ratio and wind, in some cases when the parafoil scatter area is large, or the glide ratio of parafoil is ...Traditional parafoil homing usually uses a point as object. As the mobility of parafoil is limited by its glide ratio and wind, in some cases when the parafoil scatter area is large, or the glide ratio of parafoil is small, the deviation of its landing point to object point will be arduous to control. Accordingly, during these situations, when parafoil is used in recovery of spacecraft or satellite, the landing area of parafoil can be set as a rectangle, and the object of parafoil can be set as a line segment. The thesis of this work is designing an algorithm for parafoil homing using line segment as object. The algorithm of wind velocity and direction calculation in different flying segments was also investigated. The algorithm designed navigates the parafoil to land into the predestined area and largely reduce the probability of recovery loads falling to unwanted area to damage houses and people.展开更多
An approach for the integrated optimization of the construction/expansion capacity of high-voltage/ medium-voltage (HV/MV) substations and the configuration of MV radial distribution network was presented using plant ...An approach for the integrated optimization of the construction/expansion capacity of high-voltage/ medium-voltage (HV/MV) substations and the configuration of MV radial distribution network was presented using plant growth simulation algorithm (PGSA). In the optimization process, fixed costs correspondent to the investment in lines and substations and the variable costs associated to the operation of the system were considered under the constraints of branch capacity, substation capacity and bus voltage. The optimization variables considerably reduce the dimension of variables and speed up the process of optimizing. The effectiveness of the proposed approach was tested by a distribution system planning.展开更多
In this paper a class of real-time parallel modified Rosenbrock methods of numerical simulation is constructed for stiff dynamic systems on a multiprocessor system, and convergence and numerical stability of these met...In this paper a class of real-time parallel modified Rosenbrock methods of numerical simulation is constructed for stiff dynamic systems on a multiprocessor system, and convergence and numerical stability of these methods are discussed. A-stable real-time parallel formula of two-stage third-order and A(α)-stable real-time parallel formula with o ≈ 89.96° of three-stage fourth-order are particularly given. The numerical simulation experiments in parallel environment show that the class of algorithms is efficient and applicable, with greater speedup.展开更多
In this paper, a new approach using artificial neural network and genetic algorithm for the optimization of the thermally coupled distillation is presented. Mathematical model can be constructed with artificial neura...In this paper, a new approach using artificial neural network and genetic algorithm for the optimization of the thermally coupled distillation is presented. Mathematical model can be constructed with artificial neural network based on the simulation results with ASPEN PLUS. Modified genetic algorithm was used to optimize the model. With the proposed model and optimization arithmetic, mathematical model can be calculated, decision variables and target value can be reached automatically and quickly. A practical example is used to demonstrate the algorithm.展开更多
Many scientific and engineering problems need to use numerical methods and algorithms to obtain computational simulation results because analytical solutions are seldom available for them.The chemical dissolution-fron...Many scientific and engineering problems need to use numerical methods and algorithms to obtain computational simulation results because analytical solutions are seldom available for them.The chemical dissolution-front instability problem in fluid-saturated porous rocks is no exception.Since this kind of instability problem has both the conventional(i.e.trivial)and the unconventional(i.e.nontrivial)solutions,it is necessary to examine the effects of different numerical algorithms,which are used to solve chemical dissolution-front instability problems in fluid-saturated porous rocks.Toward this goal,two different numerical algorithms associated with the commonly-used finite element method are considered in this paper.In the first numerical algorithm,the porosity,pore-fluid pressure and acid/solute concentration are selected as basic variables,while in the second numerical algorithm,the porosity,velocity of pore-fluid flow and acid/solute concentration are selected as basic variables.The particular attention is paid to the effects of these two numerical algorithms on the computational simulation results of unstable chemical dissolution-front propagation in fluid-saturated porous rocks.The related computational simulation results have demonstrated that:1)the first numerical algorithm associated with the porosity-pressure-concentration approach can realistically simulate the evolution processes of unstable chemical dissolution-front propagation in chemical dissolution systems.2)The second numerical algorithm associated with the porosity-velocity-concentration approach fails to simulate the evolution processes of unstable chemical dissolution-front propagation.3)The extra differential operation is the main source to result in the failure of the second numerical algorithm.展开更多
The concepts of information fusion and the basic principles of neural networks are introduced. Neural net-works were introduced as a way of building an information fusion model in a coal mine monitoring system. This a...The concepts of information fusion and the basic principles of neural networks are introduced. Neural net-works were introduced as a way of building an information fusion model in a coal mine monitoring system. This assures the accurate transmission of the multi-sensor information that comes from the coal mine monitoring systems. The in-formation fusion mode was analyzed. An algorithm was designed based on this analysis and some simulation results were given. Finally,conclusions that could provide auxiliary decision making information to the coal mine dispatching officers were presented.展开更多
In this paper, a mathematical model of real-time simulation is given, and the problem of convergence on real-time Runge-Kutta algorithms is analysed. At last a theorem on the relation between the order of compensation...In this paper, a mathematical model of real-time simulation is given, and the problem of convergence on real-time Runge-Kutta algorithms is analysed. At last a theorem on the relation between the order of compensation and the convergent order of real-time algorithm is proved.展开更多
Identification simulation for dynamical system which is based on genetic algorithm (GA) and recurrent multilayer neural network (RMNN) is presented. In order to reduce the inputs of the model, RMNN which can remember ...Identification simulation for dynamical system which is based on genetic algorithm (GA) and recurrent multilayer neural network (RMNN) is presented. In order to reduce the inputs of the model, RMNN which can remember and store some previous parameters is used for identifier. And for its high efficiency and optimization, genetic algorithm is introduced into training RMNN. Simulation results show the effectiveness of the proposed scheme. Under the same training algorithm, the identification performance of RMNN is superior to that of nonrecurrent multilayer neural network (NRMNN).展开更多
Region partition(RP) is the key technique to the finite element parallel computing(FEPC),and its performance has a decisive influence on the entire process of analysis and computation.The performance evaluation index ...Region partition(RP) is the key technique to the finite element parallel computing(FEPC),and its performance has a decisive influence on the entire process of analysis and computation.The performance evaluation index of RP method for the three-dimensional finite element model(FEM) has been given.By taking the electric field of aluminum reduction cell(ARC) as the research object,the performance of two classical RP methods,which are Al-NASRA and NGUYEN partition(ANP) algorithm and the multi-level partition(MLP) method,has been analyzed and compared.The comparison results indicate a sound performance of ANP algorithm,but to large-scale models,the computing time of ANP algorithm increases notably.This is because the ANP algorithm determines only one node based on the minimum weight and just adds the elements connected to the node into the sub-region during each iteration.To obtain the satisfied speed and the precision,an improved dynamic self-adaptive ANP(DSA-ANP) algorithm has been proposed.With consideration of model scale,complexity and sub-RP stage,the improved algorithm adaptively determines the number of nodes and selects those nodes with small enough weight,and then dynamically adds these connected elements.The proposed algorithm has been applied to the finite element analysis(FEA) of the electric field simulation of ARC.Compared with the traditional ANP algorithm,the computational efficiency of the proposed algorithm has been shortened approximately from 260 s to 13 s.This proves the superiority of the improved algorithm on computing time performance.展开更多
In order to solve three kinds of fuzzy programm model, fuzzy chance-constrained programming mode ng models, i.e. fuzzy expected value and fuzzy dependent-chance programming model, a simultaneous perturbation stochast...In order to solve three kinds of fuzzy programm model, fuzzy chance-constrained programming mode ng models, i.e. fuzzy expected value and fuzzy dependent-chance programming model, a simultaneous perturbation stochastic approximation algorithm is proposed by integrating neural network with fuzzy simulation. At first, fuzzy simulation is used to generate a set of input-output data. Then a neural network is trained according to the set. Finally, the trained neural network is embedded in simultaneous perturbation stochastic approximation algorithm. Simultaneous perturbation stochastic approximation algorithm is used to search the optimal solution. Two numerical examples are presented to illustrate the effectiveness of the proposed algorithm.展开更多
The stochastic simulation algorithm （SSA） accurately depicts spatially homogeneous wellstirred chemically reacting systems with small populations of chemical species and properly represents noise, but it is often ab...The stochastic simulation algorithm （SSA） accurately depicts spatially homogeneous wellstirred chemically reacting systems with small populations of chemical species and properly represents noise, but it is often abandoned when modeling larger systems because of its computational complexity. In this work, a twin support vector regression based stochastic simulations algorithm （TS^3A） is proposed by combining the twin support vector regression and SSA, the former is a well-known robust regression method in machine learning. Numerical results indicate that this proposed algorithm can be applied to a wide range of chemically reacting systems and obtain significant improvements on efficiency and accuracy with fewer simulating runs over the existing methods.展开更多
An efficient importance sampling algorithm is presented to analyze reliability of complex structural system with multiple failure modes and fuzzy-random uncertainties in basic variables and failure modes. In order to ...An efficient importance sampling algorithm is presented to analyze reliability of complex structural system with multiple failure modes and fuzzy-random uncertainties in basic variables and failure modes. In order to improve the sampling efficiency, the simulated annealing algorithm is adopted to optimize the density center of the importance sampling for each failure mode, and results that the more significant contribution the points make to fuzzy failure probability, the higher occurrence possibility the points are sampled. For the system with multiple fuzzy failure modes, a weighted and mixed importance sampling function is constructed. The contribution of each fuzzy failure mode to the system failure probability is represented by the appropriate factors, and the efficiency of sampling is improved furthermore. The variances and the coefficients of variation are derived for the failure probability estimations. Two examples are introduced to illustrate the rationality of the present method. Comparing with the direct Monte-Carlo method, the improved efficiency and the precision of the method are verified by the examples.展开更多
The present study proposes a stochastic simulation scheme to model reactive boundaries through a position jump process which can be readily implemented into the Inhomogeneous Stochastic Simulation Algorithm by modifyi...The present study proposes a stochastic simulation scheme to model reactive boundaries through a position jump process which can be readily implemented into the Inhomogeneous Stochastic Simulation Algorithm by modifying the propensity of the diffusive jump over the reactive boundary. As compared to the literature, the present approach does not require any correction factors for the propensity. Also, the current expression relaxes the constraint on the compartment size allowing the problem to be solved with a coarser grid and therefore saves considerable computational cost. The modified algorithm is then applied to simulate three reaction-diffusion systems with reactive boundaries.展开更多
To improve the precision of the filling pressure curve of differential pressure casting controlled with PID controller,the model of differential pressure casting process is established and two pressure-difference cont...To improve the precision of the filling pressure curve of differential pressure casting controlled with PID controller,the model of differential pressure casting process is established and two pressure-difference control systems using PID algorithm and Dahlin algorithm are separately designed in MATLAB. The scheduled pressure curves controlled with PID algorithm and Dahlin algorithm,respectively,are comparatively simulated in MATLAB. The simulated pressure curves obtained show that the control precision with Dahlin algorithm is higher than that with PID algorithm in the differential pressure casting process,and it was further verified by production practice.展开更多
The improved weighted-least-square model was used for state simulation of water distribution networks. And DFP algorithm was applied to get the model solution. In order to fit DFP algorithm,the initial model was trans...The improved weighted-least-square model was used for state simulation of water distribution networks. And DFP algorithm was applied to get the model solution. In order to fit DFP algorithm,the initial model was transformed into a non-constrained optimization problem using mass conservation. Then,through one dimensional optimization and scale matrix establishment,the feasible direction of iteration was obtained,and the values of state variables could be calculated. After several iterations,the optimal estimates of state variables were worked out and state simulation of water distribution networks was achieved as a result. A program of DFP algorithm is developed with Delphi 7 for verification. By running on a designed network,which is composed of 55 nodes,94 pipes and 40 loops,it is proved that DFP algorithm can quickly get the convergence. After 36 iterations,the root mean square of all nodal head errors is reduced by 90.84% from 5.57 to 0.51 m,and the maximum error is only 1.30 m. Compared to Marquardt algorithm,the procedure of DFP algorithm is more stable,and the initial values have less influences on calculation accuracy. Therefore,DFP algorithm can be used for real-time simulation of water distribution networks.展开更多
In order to solve the complex optimization problem dealing with uncertain phenomenon effectively, this paper presents a probability simulation optimization approach using orthogonal genetic algorithm. This approach sy...In order to solve the complex optimization problem dealing with uncertain phenomenon effectively, this paper presents a probability simulation optimization approach using orthogonal genetic algorithm. This approach synthesizes the computer simulation technology, orthogonal genetic algorithm and statistical test method faultlessly, which can solve complex optimization problem effectively. In this paper, the author gives the correlative conception of probability simulation optimization and describes the probability simulation optimization approach using orthogonal genetic algorithm in detail. Theoretically speaking, it has a strong rationality and maneuverability that can apply probability method in solving the complex optimization problems with uncertain phenomenon. In demonstration, the optimization performance of this method is better than other traditional methods. Simulation resuh suggests that the approach referred to this paper is feasible, correct and valid.展开更多
Optimization Algorithm was developed for the simula ti on of ceramic grain growth at atomistic scale. Based on the coordination informa tion of different atoms, a structure of trident tree was applied to save large q ...Optimization Algorithm was developed for the simula ti on of ceramic grain growth at atomistic scale. Based on the coordination informa tion of different atoms, a structure of trident tree was applied to save large q uantities data, so as to solve the problems of large data information and long r unning time. For every atom a binary tree was firstly formed according to the X coordination of atom. If the values of X coordination were the same, the middle sub-tree of first layer formed then a binary tree according to the Y coordinati on of atom. If the values of Y coordination were also the same, the middle sub- tree of second layer formed then a binary tree according to the Z coordination o f atom. In this way the speed of whole program is enhanced obviously. In order t o reduce memory, in this structure only need to store the exterior atoms’ infor mation, an integer is used to store the interior atoms’ information. If other a toms take up an atom’s all adjacent positions, this atom will be deleted in the data structure, for all the adjacent positions’ atoms, the integer’s relative bit will be set 1 to denote that there is an atom in this position but not be s tored in the trident tree. When an outside atom is deleted, for all the bits tha t are set 1,an atom will be added to the trident tree as an outside atom for the relative positions. And for this new added atom, the integer’s relative bi t of all the adjacent position’s atoms should be set 0 to denote that there is no interior atom in this position. In this way, if there are n 3 atoms, onl y need to store 6n 2 quantity’s atoms’ information. Large quantity of mem ory space can then be saved.展开更多
基金Shanxi Province Higher Education Science and Technology Innovation Fund Project(2022-676)Shanxi Soft Science Program Research Fund Project(2016041008-6)。
文摘In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-based web services and the constraints of system resources.Then,a light-induced plant growth simulation algorithm was established.The performance of the algorithm was compared through several plant types,and the best plant model was selected as the setting for the system.Experimental results show that when the number of test cloud-based web services reaches 2048,the model being 2.14 times faster than PSO,2.8 times faster than the ant colony algorithm,2.9 times faster than the bee colony algorithm,and a remarkable 8.38 times faster than the genetic algorithm.
文摘Dynamic model of aerial towed decoy system is established and simulations are performed to research the dynamic characteristics of the system. Firstly, Kinetic equations based on spinor are built, where the cable is discretized into a number of rigid segments while the decoy is modeled as a rigid body hinged on the cable. Then tension recurrence algorithm is developed to improve computational efficiency, which makes it possible to predict the dynamic response of aerial towed decoy system rapidly and accurately. Subsequently, the efficiency and validity of this algorithm are verified by comparison with Kane’s function and further validated by wind tunnel tests.Simulation results indicate that the distance between the towing point and the decoy’s center of gravity is suggested to be 5%–20% of the length of decoy body to ensure the stability of system.In up-risen maneuver process, the value of angular velocity is recommended to be less than0.10 rad/s to protect the cable from the aircraft exhaust jet. During the turning movement of aircraft, the cable’s extent of stretching outwards is proportional to the aircraft’s angular velocity.Meanwhile, the decoy, aircraft and missile form a triangle, which promotes the decoy’s performance.
文摘A class of hybrid algorithms of real-time simulation based on evaluation of non-integerstep right-hand side function are presented in this paper. And some results of the convergence and stability of the algorithms are given. Using the class of algorithms, evaluation for the right-hand side function is needed once in every integration-step. Moreover, comparing with the other methods with the same amount of work, their numerical stability regions are larger and the method errors are smaller, and the numerical experiments show that the algorithms are very effective.
基金Project(61503077)supported by the National Natural Science Foundation of ChinaProject(BK20130628)supported by the Jiangsu Natural Science Foundation,China
文摘Traditional parafoil homing usually uses a point as object. As the mobility of parafoil is limited by its glide ratio and wind, in some cases when the parafoil scatter area is large, or the glide ratio of parafoil is small, the deviation of its landing point to object point will be arduous to control. Accordingly, during these situations, when parafoil is used in recovery of spacecraft or satellite, the landing area of parafoil can be set as a rectangle, and the object of parafoil can be set as a line segment. The thesis of this work is designing an algorithm for parafoil homing using line segment as object. The algorithm of wind velocity and direction calculation in different flying segments was also investigated. The algorithm designed navigates the parafoil to land into the predestined area and largely reduce the probability of recovery loads falling to unwanted area to damage houses and people.
基金the National Natural Science Foundation of China (No. 50747025)the Postdoctoral Science Foundation of China (No. 20060400648)+1 种基金the Scientific Research Foundation for the Returned Overseas Chinese Scholars (No. 2005383)the Shanghai Key Scienceand Technology Research Program (No. 041612012)
文摘An approach for the integrated optimization of the construction/expansion capacity of high-voltage/ medium-voltage (HV/MV) substations and the configuration of MV radial distribution network was presented using plant growth simulation algorithm (PGSA). In the optimization process, fixed costs correspondent to the investment in lines and substations and the variable costs associated to the operation of the system were considered under the constraints of branch capacity, substation capacity and bus voltage. The optimization variables considerably reduce the dimension of variables and speed up the process of optimizing. The effectiveness of the proposed approach was tested by a distribution system planning.
基金This project was supported by the National Natural Science Foundation of China (No. 19871080).
文摘In this paper a class of real-time parallel modified Rosenbrock methods of numerical simulation is constructed for stiff dynamic systems on a multiprocessor system, and convergence and numerical stability of these methods are discussed. A-stable real-time parallel formula of two-stage third-order and A(α)-stable real-time parallel formula with o ≈ 89.96° of three-stage fourth-order are particularly given. The numerical simulation experiments in parallel environment show that the class of algorithms is efficient and applicable, with greater speedup.
文摘In this paper, a new approach using artificial neural network and genetic algorithm for the optimization of the thermally coupled distillation is presented. Mathematical model can be constructed with artificial neural network based on the simulation results with ASPEN PLUS. Modified genetic algorithm was used to optimize the model. With the proposed model and optimization arithmetic, mathematical model can be calculated, decision variables and target value can be reached automatically and quickly. A practical example is used to demonstrate the algorithm.
基金Project(11272359)supported by the National Natural Science Foundation of China
文摘Many scientific and engineering problems need to use numerical methods and algorithms to obtain computational simulation results because analytical solutions are seldom available for them.The chemical dissolution-front instability problem in fluid-saturated porous rocks is no exception.Since this kind of instability problem has both the conventional(i.e.trivial)and the unconventional(i.e.nontrivial)solutions,it is necessary to examine the effects of different numerical algorithms,which are used to solve chemical dissolution-front instability problems in fluid-saturated porous rocks.Toward this goal,two different numerical algorithms associated with the commonly-used finite element method are considered in this paper.In the first numerical algorithm,the porosity,pore-fluid pressure and acid/solute concentration are selected as basic variables,while in the second numerical algorithm,the porosity,velocity of pore-fluid flow and acid/solute concentration are selected as basic variables.The particular attention is paid to the effects of these two numerical algorithms on the computational simulation results of unstable chemical dissolution-front propagation in fluid-saturated porous rocks.The related computational simulation results have demonstrated that:1)the first numerical algorithm associated with the porosity-pressure-concentration approach can realistically simulate the evolution processes of unstable chemical dissolution-front propagation in chemical dissolution systems.2)The second numerical algorithm associated with the porosity-velocity-concentration approach fails to simulate the evolution processes of unstable chemical dissolution-front propagation.3)The extra differential operation is the main source to result in the failure of the second numerical algorithm.
基金project BK2001073 supported by Jiangsu Province Natural Science Foundation
文摘The concepts of information fusion and the basic principles of neural networks are introduced. Neural net-works were introduced as a way of building an information fusion model in a coal mine monitoring system. This assures the accurate transmission of the multi-sensor information that comes from the coal mine monitoring systems. The in-formation fusion mode was analyzed. An algorithm was designed based on this analysis and some simulation results were given. Finally,conclusions that could provide auxiliary decision making information to the coal mine dispatching officers were presented.
文摘In this paper, a mathematical model of real-time simulation is given, and the problem of convergence on real-time Runge-Kutta algorithms is analysed. At last a theorem on the relation between the order of compensation and the convergent order of real-time algorithm is proved.
文摘Identification simulation for dynamical system which is based on genetic algorithm (GA) and recurrent multilayer neural network (RMNN) is presented. In order to reduce the inputs of the model, RMNN which can remember and store some previous parameters is used for identifier. And for its high efficiency and optimization, genetic algorithm is introduced into training RMNN. Simulation results show the effectiveness of the proposed scheme. Under the same training algorithm, the identification performance of RMNN is superior to that of nonrecurrent multilayer neural network (NRMNN).
基金Project(61273187)supported by the National Natural Science Foundation of ChinaProject(61321003)supported by the Foundation for Innovative Research Groups of the National Natural Science Foundation of China
文摘Region partition(RP) is the key technique to the finite element parallel computing(FEPC),and its performance has a decisive influence on the entire process of analysis and computation.The performance evaluation index of RP method for the three-dimensional finite element model(FEM) has been given.By taking the electric field of aluminum reduction cell(ARC) as the research object,the performance of two classical RP methods,which are Al-NASRA and NGUYEN partition(ANP) algorithm and the multi-level partition(MLP) method,has been analyzed and compared.The comparison results indicate a sound performance of ANP algorithm,but to large-scale models,the computing time of ANP algorithm increases notably.This is because the ANP algorithm determines only one node based on the minimum weight and just adds the elements connected to the node into the sub-region during each iteration.To obtain the satisfied speed and the precision,an improved dynamic self-adaptive ANP(DSA-ANP) algorithm has been proposed.With consideration of model scale,complexity and sub-RP stage,the improved algorithm adaptively determines the number of nodes and selects those nodes with small enough weight,and then dynamically adds these connected elements.The proposed algorithm has been applied to the finite element analysis(FEA) of the electric field simulation of ARC.Compared with the traditional ANP algorithm,the computational efficiency of the proposed algorithm has been shortened approximately from 260 s to 13 s.This proves the superiority of the improved algorithm on computing time performance.
基金National Natural Science Foundation of China (No.70471049)China Postdoctoral Science Foundation (No. 20060400704)
文摘In order to solve three kinds of fuzzy programm model, fuzzy chance-constrained programming mode ng models, i.e. fuzzy expected value and fuzzy dependent-chance programming model, a simultaneous perturbation stochastic approximation algorithm is proposed by integrating neural network with fuzzy simulation. At first, fuzzy simulation is used to generate a set of input-output data. Then a neural network is trained according to the set. Finally, the trained neural network is embedded in simultaneous perturbation stochastic approximation algorithm. Simultaneous perturbation stochastic approximation algorithm is used to search the optimal solution. Two numerical examples are presented to illustrate the effectiveness of the proposed algorithm.
基金This work was supported by the National Natural Science Foundation of China （No.30871341）, the National High-Tech Research and Development Program of China （No.2006AA02-Z190）, the Shanghai Leading Academic Discipline Project （No.S30405）, and the Natural Science Foundation of Shanghai Normal University （No.SK200937）.
文摘The stochastic simulation algorithm （SSA） accurately depicts spatially homogeneous wellstirred chemically reacting systems with small populations of chemical species and properly represents noise, but it is often abandoned when modeling larger systems because of its computational complexity. In this work, a twin support vector regression based stochastic simulations algorithm （TS^3A） is proposed by combining the twin support vector regression and SSA, the former is a well-known robust regression method in machine learning. Numerical results indicate that this proposed algorithm can be applied to a wide range of chemically reacting systems and obtain significant improvements on efficiency and accuracy with fewer simulating runs over the existing methods.
基金This project is supported by National Natural Science Foundation of China (No.10572117)Aerospace Science Foundation of China(No.N3CH0502,No.N5CH0001)Provincial Natural Science Foundation of Shanxi, China(No.N3CS0501).
文摘An efficient importance sampling algorithm is presented to analyze reliability of complex structural system with multiple failure modes and fuzzy-random uncertainties in basic variables and failure modes. In order to improve the sampling efficiency, the simulated annealing algorithm is adopted to optimize the density center of the importance sampling for each failure mode, and results that the more significant contribution the points make to fuzzy failure probability, the higher occurrence possibility the points are sampled. For the system with multiple fuzzy failure modes, a weighted and mixed importance sampling function is constructed. The contribution of each fuzzy failure mode to the system failure probability is represented by the appropriate factors, and the efficiency of sampling is improved furthermore. The variances and the coefficients of variation are derived for the failure probability estimations. Two examples are introduced to illustrate the rationality of the present method. Comparing with the direct Monte-Carlo method, the improved efficiency and the precision of the method are verified by the examples.
文摘The present study proposes a stochastic simulation scheme to model reactive boundaries through a position jump process which can be readily implemented into the Inhomogeneous Stochastic Simulation Algorithm by modifying the propensity of the diffusive jump over the reactive boundary. As compared to the literature, the present approach does not require any correction factors for the propensity. Also, the current expression relaxes the constraint on the compartment size allowing the problem to be solved with a coarser grid and therefore saves considerable computational cost. The modified algorithm is then applied to simulate three reaction-diffusion systems with reactive boundaries.
文摘To improve the precision of the filling pressure curve of differential pressure casting controlled with PID controller,the model of differential pressure casting process is established and two pressure-difference control systems using PID algorithm and Dahlin algorithm are separately designed in MATLAB. The scheduled pressure curves controlled with PID algorithm and Dahlin algorithm,respectively,are comparatively simulated in MATLAB. The simulated pressure curves obtained show that the control precision with Dahlin algorithm is higher than that with PID algorithm in the differential pressure casting process,and it was further verified by production practice.
基金Project(IRT0853) supported by Changjiang Scholars and Innovative Research Team in UniversityProject(DB03086) supported by Talents Fund of Xi’an University of Architecture and TechnologyProject(50978213) supported by National Natural Science Foundation
文摘The improved weighted-least-square model was used for state simulation of water distribution networks. And DFP algorithm was applied to get the model solution. In order to fit DFP algorithm,the initial model was transformed into a non-constrained optimization problem using mass conservation. Then,through one dimensional optimization and scale matrix establishment,the feasible direction of iteration was obtained,and the values of state variables could be calculated. After several iterations,the optimal estimates of state variables were worked out and state simulation of water distribution networks was achieved as a result. A program of DFP algorithm is developed with Delphi 7 for verification. By running on a designed network,which is composed of 55 nodes,94 pipes and 40 loops,it is proved that DFP algorithm can quickly get the convergence. After 36 iterations,the root mean square of all nodal head errors is reduced by 90.84% from 5.57 to 0.51 m,and the maximum error is only 1.30 m. Compared to Marquardt algorithm,the procedure of DFP algorithm is more stable,and the initial values have less influences on calculation accuracy. Therefore,DFP algorithm can be used for real-time simulation of water distribution networks.
基金Supported by the National Natural Science Foundation of China(70272002) .
文摘In order to solve the complex optimization problem dealing with uncertain phenomenon effectively, this paper presents a probability simulation optimization approach using orthogonal genetic algorithm. This approach synthesizes the computer simulation technology, orthogonal genetic algorithm and statistical test method faultlessly, which can solve complex optimization problem effectively. In this paper, the author gives the correlative conception of probability simulation optimization and describes the probability simulation optimization approach using orthogonal genetic algorithm in detail. Theoretically speaking, it has a strong rationality and maneuverability that can apply probability method in solving the complex optimization problems with uncertain phenomenon. In demonstration, the optimization performance of this method is better than other traditional methods. Simulation resuh suggests that the approach referred to this paper is feasible, correct and valid.
文摘Optimization Algorithm was developed for the simula ti on of ceramic grain growth at atomistic scale. Based on the coordination informa tion of different atoms, a structure of trident tree was applied to save large q uantities data, so as to solve the problems of large data information and long r unning time. For every atom a binary tree was firstly formed according to the X coordination of atom. If the values of X coordination were the same, the middle sub-tree of first layer formed then a binary tree according to the Y coordinati on of atom. If the values of Y coordination were also the same, the middle sub- tree of second layer formed then a binary tree according to the Z coordination o f atom. In this way the speed of whole program is enhanced obviously. In order t o reduce memory, in this structure only need to store the exterior atoms’ infor mation, an integer is used to store the interior atoms’ information. If other a toms take up an atom’s all adjacent positions, this atom will be deleted in the data structure, for all the adjacent positions’ atoms, the integer’s relative bit will be set 1 to denote that there is an atom in this position but not be s tored in the trident tree. When an outside atom is deleted, for all the bits tha t are set 1,an atom will be added to the trident tree as an outside atom for the relative positions. And for this new added atom, the integer’s relative bi t of all the adjacent position’s atoms should be set 0 to denote that there is no interior atom in this position. In this way, if there are n 3 atoms, onl y need to store 6n 2 quantity’s atoms’ information. Large quantity of mem ory space can then be saved.
