In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of t...In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of the three-dimensional attack area model,restrict their practical applications.To address these issues,an improved backtracking algorithm is proposed to improve calculation efficiency.A significant reduction in solution time and maintenance of accuracy in the three-dimensional attack area are achieved by using the proposed algorithm.Furthermore,the age-layered population structure genetic programming(ALPS-GP)algorithm is introduced to determine an analytical polynomial model of the three-dimensional attack area,considering real-time requirements.The accuracy of the polynomial model is enhanced through the coefficient correction using an improved gradient descent algorithm.The study reveals a remarkable combination of high accuracy and efficient real-time computation,with a mean error of 91.89 m using the analytical polynomial model of the three-dimensional attack area solved in just 10^(-4)s,thus meeting the requirements of real-time combat scenarios.展开更多
In the hydraulic transporting process of cutter-suction mining natural gas hydrate, when the temperature-pressure equilibrium of gas hydrate is broken, gas hydrates dissociate into gas. As a result, solid-liquid two-p...In the hydraulic transporting process of cutter-suction mining natural gas hydrate, when the temperature-pressure equilibrium of gas hydrate is broken, gas hydrates dissociate into gas. As a result, solid-liquid two-phase flow(hydrate and water) transforms into gas-solid-liquid three-phase flow(methane, hydrate and water) inside the pipeline. The Euler model and CFD-PBM model were used to simulate gas-solid-liquid three-phase flow. Numerical simulation results show that the gas and solid phase gradually accumulate to the center of the pipe. Flow velocity decreases from center to boundary of the pipe along the radial direction. Comparison of numerical simulation results of two models reveals that the flow state simulated by CFD-PBM model is more uniform than that simulated by Euler model, and the main behavior of the bubble is small bubbles coalescence to large one. Comparison of numerical simulation and experimental investigation shows that the values of flow velocity and gas fraction in CFD-PBM model agree with experimental data better than those in Euler model. The proposed PBM model provides a more accurate and effective way to estimate three-phase flow state of transporting gas hydrate within the submarine pipeline.展开更多
The self-potential method is widely used in environmental and engineering geophysics. Four intelligent optimization algorithms are adopted to design the inversion to interpret self-potential data more accurately and e...The self-potential method is widely used in environmental and engineering geophysics. Four intelligent optimization algorithms are adopted to design the inversion to interpret self-potential data more accurately and efficiently: simulated annealing, genetic, particle swarm optimization, and ant colony optimization. Using both noise-free and noise-added synthetic data, it is demonstrated that all four intelligent algorithms can perform self-potential data inversion effectively. During the numerical experiments, the model distribution in search space, the relative errors of model parameters, and the elapsed time are recorded to evaluate the performance of the inversion. The results indicate that all the intelligent algorithms have good precision and tolerance to noise. Particle swarm optimization has the fastest convergence during iteration because of its good balanced searching capability between global and local minimisation.展开更多
This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satell...This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.展开更多
To make up the poor quality defects of traditional control methods and meet the growing requirements of accuracy for strip crown,an optimized model based on support vector machine(SVM)is put forward firstly to enhance...To make up the poor quality defects of traditional control methods and meet the growing requirements of accuracy for strip crown,an optimized model based on support vector machine(SVM)is put forward firstly to enhance the quality of product in hot strip rolling.Meanwhile,for enriching data information and ensuring data quality,experimental data were collected from a hot-rolled plant to set up prediction models,as well as the prediction performance of models was evaluated by calculating multiple indicators.Furthermore,the traditional SVM model and the combined prediction models with particle swarm optimization(PSO)algorithm and the principal component analysis combined with cuckoo search(PCA-CS)optimization strategies are presented to make a comparison.Besides,the prediction performance comparisons of the three models are discussed.Finally,the experimental results revealed that the PCA-CS-SVM model has the highest prediction accuracy and the fastest convergence speed.Furthermore,the root mean squared error(RMSE)of PCA-CS-SVM model is 2.04μm,and 98.15%of prediction data have an absolute error of less than 4.5μm.Especially,the results also proved that PCA-CS-SVM model not only satisfies precision requirement but also has certain guiding significance for the actual production of hot strip rolling.展开更多
Intuitionistic fuzzy sets(IFSs) are useful means to describe and deal with vague and uncertain data.An intuitionistic fuzzy C-means algorithm to cluster IFSs is developed.In each stage of the intuitionistic fuzzy C-me...Intuitionistic fuzzy sets(IFSs) are useful means to describe and deal with vague and uncertain data.An intuitionistic fuzzy C-means algorithm to cluster IFSs is developed.In each stage of the intuitionistic fuzzy C-means method the seeds are modified,and for each IFS a membership degree to each of the clusters is estimated.In the end of the algorithm,all the given IFSs are clustered according to the estimated membership degrees.Furthermore,the algorithm is extended for clustering interval-valued intuitionistic fuzzy sets(IVIFSs).Finally,the developed algorithms are illustrated through conducting experiments on both the real-world and simulated data sets.展开更多
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.展开更多
Constraint-based multicast routing, which aims at identifying a path that satisfies a set of quality of service (QoS) constraints, has became a very important research issue in the areas of networks and distributed sy...Constraint-based multicast routing, which aims at identifying a path that satisfies a set of quality of service (QoS) constraints, has became a very important research issue in the areas of networks and distributed systems. In general, multi-constrained path selection with or without optimization is a NP-complete problem that can not be exactly solved in polynomial time. Hence, accurate constraints-based routing algorithms with a fast running time are scarce, perhaps even non-existent. The expected impact of such a constrained-based routing algorithm has resulted in the proposal of numerous heuristics and a few exact QoS algorithms. This paper aims to give a thorough, concise and fair evaluation of the most important multiple constraint-based QoS multicast routing algorithms known today, and it provides a descriptive overview and simulation results of these multi-constrained routing algorithms.展开更多
The control design, based on self-adaptive PID with genetic algorithms(GA) tuning on-line was investigated, for the temperature control of industrial microwave drying rotary device with the multi-layer(IMDRDWM) and wi...The control design, based on self-adaptive PID with genetic algorithms(GA) tuning on-line was investigated, for the temperature control of industrial microwave drying rotary device with the multi-layer(IMDRDWM) and with multivariable nonlinear interaction of microwave and materials. The conventional PID control strategy incorporated with optimization GA was put forward to maintain the optimum drying temperature in order to keep the moisture content below 1%, whose adaptation ability included the cost function of optimization GA according to the output change. Simulations on five different industrial process models and practical temperature process control system for selenium-enriched slag drying intensively by using IMDRDWM were carried out systematically, indicating the reliability and effectiveness of control design. The parameters of proposed control design are all on-line implemented without iterative predictive calculations, and the closed-loop system stability is guaranteed, which makes the developed scheme simpler in its synthesis and application, providing the practical guidelines for the control implementation and the parameter design.展开更多
The present work is concerned with the solution of a problem on thermoelastic interactions in a functional graded material due to thermal shock in the context of the fractional order three-phase lag model. The governi...The present work is concerned with the solution of a problem on thermoelastic interactions in a functional graded material due to thermal shock in the context of the fractional order three-phase lag model. The governing equations of fractional order generalized thermoelasticity with three-phase lag model for functionally graded materials(FGM)(i.e., material with spatially varying material properties) are established. The analytical solution in the transform domain is obtained by using the eigenvalue approach.The inversion of Laplace transform is done numerically. The graphical results indicate that the fractional parameter has significant effects on all the physical quantities. Thus, we can consider the theory of fractional order generalized thermoelasticity an improvement on studying elastic materials.展开更多
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.展开更多
With its wide use in different fields, the problem of the convergence of simple genetic algorithms (GAs) has been concerned. In the past, the research on the convergence of GAs was based on Holland's model theorem...With its wide use in different fields, the problem of the convergence of simple genetic algorithms (GAs) has been concerned. In the past, the research on the convergence of GAs was based on Holland's model theorem. The diversity of the evolutionary population and the convergence of GAs are studied by using the concept of negentropy based on the discussion of the characteristic of GA. Some test functions are used to test the convergence of GAs, and good results have been obtained. It is shown that the global optimization may be obtained by selecting appropriate parameters of simple GAs if the evolution time is enough.展开更多
The Volterra feedforward neural network with nonlinear interconnections and related homotopy learning algorithm are proposed in the paper. It is shown that Volterra neural network and the homolopy learning algorithms ...The Volterra feedforward neural network with nonlinear interconnections and related homotopy learning algorithm are proposed in the paper. It is shown that Volterra neural network and the homolopy learning algorithms are significant potentials in nonlinear approximation ability,convergent speeds and global optimization than the classical neural networks and the standard BP algorithm, and related computer simulations and theoretical analysis are given too.展开更多
develop a mentation This paper considers the priority facility primal-dual 3-approximation algorithm for procedure, the authors further improve the location problem with penalties： The authors this problem. Combining...develop a mentation This paper considers the priority facility primal-dual 3-approximation algorithm for procedure, the authors further improve the location problem with penalties： The authors this problem. Combining with the greedy aug- previous ratio 3 to 1.8526.展开更多
A multiple model tracking algorithm based on neural network and multiple-process noise soft-switching for maneuvering targets is presented.In this algorithm, the＂current＂statistical model and neural network are runn...A multiple model tracking algorithm based on neural network and multiple-process noise soft-switching for maneuvering targets is presented.In this algorithm, the＂current＂statistical model and neural network are running in parallel.The neural network algorithm is used to modify the adaptive noise filtering algorithm based on the mean value and variance of the＂current＂statistical model for maneuvering targets, and then the multiple model tracking algorithm of the multiple processing switch is used to improve the precision of tracking maneuvering targets.The modified algorithm is proved to be effective by simulation.展开更多
To generate a test set for a given circuit (including both combinational and sequential circuits), choice of an algorithm within a number of existing test generation algorithms to apply is bound to vary from circuit t...To generate a test set for a given circuit (including both combinational and sequential circuits), choice of an algorithm within a number of existing test generation algorithms to apply is bound to vary from circuit to circuit. In this paper, the genetic algorithms are used to construct the models of existing test generation algorithms in making such choice more easily. Therefore, we may forecast the testability parameters of a circuit before using the real test generation algorithm. The results also can be used to evaluate the efficiency of the existing test generation algorithms. Experimental results are given to convince the readers of the truth and the usefulness of this approach.展开更多
A new error analysis method is presented via genetic algorithms for high precise heading determination model based on two total positioning stations （TPSs）. The method has the ability to search all possible solution...A new error analysis method is presented via genetic algorithms for high precise heading determination model based on two total positioning stations （TPSs）. The method has the ability to search all possible solution space by the genetic operators of elitist model and restriction. The result of analyzing the error of this model shows that the accuracy of this model is precise enough to meet the need of calibration for navigation systems on ship, and the search space is only 0. 03% of the total search space, and the precision of heading determination is 4＂ in a general dock.展开更多
To study the diagnostic problem of Wire-OR （W-O） interconnect fault of PCB （Printed Circuit Board）, five modified boundary scan adaptive algorithms for interconnect test are put forward. These algorithms apply Glo...To study the diagnostic problem of Wire-OR （W-O） interconnect fault of PCB （Printed Circuit Board）, five modified boundary scan adaptive algorithms for interconnect test are put forward. These algorithms apply Global-diagnosis sequence algorithm to replace the equal weight algorithm of primary test, and the test time is shortened without changing the fault diagnostic capability. The descriptions of five modified adaptive test algorithms are presented, and the capability comparison between the modified algorithm and the original algorithm is made to prove the validity of these algorithms.展开更多
A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time. Models and relaxations are collected. Most of these problems are NP-hard...A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time. Models and relaxations are collected. Most of these problems are NP-hard, in the strong sense, or open problems, therefore approximation algorithms are studied. The review reveals that there exist some potential areas worthy of further research.展开更多
The classical job shop scheduling problem(JSP) is the most popular machine scheduling model in practice and is known as NP-hard.The formulation of the JSP is based on the assumption that for each part type or job ther...The classical job shop scheduling problem(JSP) is the most popular machine scheduling model in practice and is known as NP-hard.The formulation of the JSP is based on the assumption that for each part type or job there is only one process plan that prescribes the sequence of operations and the machine on which each operation has to be performed.However,JSP with alternative machines for various operations is an extension of the classical JSP,which allows an operation to be processed by any machine from a given set of machines.Since this problem requires an additional decision of machine allocation during scheduling,it is much more complex than JSP.We present a domain independent genetic algorithm(GA) approach for the job shop scheduling problem with alternative machines.The GA is implemented in a spreadsheet environment.The performance of the proposed GA is analyzed by comparing with various problem instances taken from the literatures.The result shows that the proposed GA is competitive with the existing approaches.A simplified approach that would be beneficial to both practitioners and researchers is presented for solving scheduling problems with alternative machines.展开更多
基金National Natural Science Foundation of China(62373187)Forward-looking Layout Special Projects(ILA220591A22)。
文摘In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of the three-dimensional attack area model,restrict their practical applications.To address these issues,an improved backtracking algorithm is proposed to improve calculation efficiency.A significant reduction in solution time and maintenance of accuracy in the three-dimensional attack area are achieved by using the proposed algorithm.Furthermore,the age-layered population structure genetic programming(ALPS-GP)algorithm is introduced to determine an analytical polynomial model of the three-dimensional attack area,considering real-time requirements.The accuracy of the polynomial model is enhanced through the coefficient correction using an improved gradient descent algorithm.The study reveals a remarkable combination of high accuracy and efficient real-time computation,with a mean error of 91.89 m using the analytical polynomial model of the three-dimensional attack area solved in just 10^(-4)s,thus meeting the requirements of real-time combat scenarios.
基金Project(51375498) supported by the National Natural Science Foundation of China
文摘In the hydraulic transporting process of cutter-suction mining natural gas hydrate, when the temperature-pressure equilibrium of gas hydrate is broken, gas hydrates dissociate into gas. As a result, solid-liquid two-phase flow(hydrate and water) transforms into gas-solid-liquid three-phase flow(methane, hydrate and water) inside the pipeline. The Euler model and CFD-PBM model were used to simulate gas-solid-liquid three-phase flow. Numerical simulation results show that the gas and solid phase gradually accumulate to the center of the pipe. Flow velocity decreases from center to boundary of the pipe along the radial direction. Comparison of numerical simulation results of two models reveals that the flow state simulated by CFD-PBM model is more uniform than that simulated by Euler model, and the main behavior of the bubble is small bubbles coalescence to large one. Comparison of numerical simulation and experimental investigation shows that the values of flow velocity and gas fraction in CFD-PBM model agree with experimental data better than those in Euler model. The proposed PBM model provides a more accurate and effective way to estimate three-phase flow state of transporting gas hydrate within the submarine pipeline.
基金Project(41574123)supported by the National Natural Science Foundation of ChinaProject(2015zzts250)supported by the Fundamental Research Funds for the Central Universities,ChinaProject(2013FY110800)supported by the National Basic Research Scientific Program of China
文摘The self-potential method is widely used in environmental and engineering geophysics. Four intelligent optimization algorithms are adopted to design the inversion to interpret self-potential data more accurately and efficiently: simulated annealing, genetic, particle swarm optimization, and ant colony optimization. Using both noise-free and noise-added synthetic data, it is demonstrated that all four intelligent algorithms can perform self-potential data inversion effectively. During the numerical experiments, the model distribution in search space, the relative errors of model parameters, and the elapsed time are recorded to evaluate the performance of the inversion. The results indicate that all the intelligent algorithms have good precision and tolerance to noise. Particle swarm optimization has the fastest convergence during iteration because of its good balanced searching capability between global and local minimisation.
基金supported by the National Natural Science Foundation of China(7127106671171065+1 种基金71202168)the Natural Science Foundation of Heilongjiang Province(GC13D506)
文摘This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.
基金Project(52005358)supported by the National Natural Science Foundation of ChinaProject(2018YFB1307902)supported by the National Key R&D Program of China+1 种基金Project(201901D111243)supported by the Natural Science Foundation of Shanxi Province,ChinaProject(2019-KF-25-05)supported by the Natural Science Foundation of Liaoning Province,China。
文摘To make up the poor quality defects of traditional control methods and meet the growing requirements of accuracy for strip crown,an optimized model based on support vector machine(SVM)is put forward firstly to enhance the quality of product in hot strip rolling.Meanwhile,for enriching data information and ensuring data quality,experimental data were collected from a hot-rolled plant to set up prediction models,as well as the prediction performance of models was evaluated by calculating multiple indicators.Furthermore,the traditional SVM model and the combined prediction models with particle swarm optimization(PSO)algorithm and the principal component analysis combined with cuckoo search(PCA-CS)optimization strategies are presented to make a comparison.Besides,the prediction performance comparisons of the three models are discussed.Finally,the experimental results revealed that the PCA-CS-SVM model has the highest prediction accuracy and the fastest convergence speed.Furthermore,the root mean squared error(RMSE)of PCA-CS-SVM model is 2.04μm,and 98.15%of prediction data have an absolute error of less than 4.5μm.Especially,the results also proved that PCA-CS-SVM model not only satisfies precision requirement but also has certain guiding significance for the actual production of hot strip rolling.
基金supported by the National Natural Science Foundation of China for Distinguished Young Scholars(70625005)
文摘Intuitionistic fuzzy sets(IFSs) are useful means to describe and deal with vague and uncertain data.An intuitionistic fuzzy C-means algorithm to cluster IFSs is developed.In each stage of the intuitionistic fuzzy C-means method the seeds are modified,and for each IFS a membership degree to each of the clusters is estimated.In the end of the algorithm,all the given IFSs are clustered according to the estimated membership degrees.Furthermore,the algorithm is extended for clustering interval-valued intuitionistic fuzzy sets(IVIFSs).Finally,the developed algorithms are illustrated through conducting experiments on both the real-world and simulated data sets.
文摘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.
文摘Constraint-based multicast routing, which aims at identifying a path that satisfies a set of quality of service (QoS) constraints, has became a very important research issue in the areas of networks and distributed systems. In general, multi-constrained path selection with or without optimization is a NP-complete problem that can not be exactly solved in polynomial time. Hence, accurate constraints-based routing algorithms with a fast running time are scarce, perhaps even non-existent. The expected impact of such a constrained-based routing algorithm has resulted in the proposal of numerous heuristics and a few exact QoS algorithms. This paper aims to give a thorough, concise and fair evaluation of the most important multiple constraint-based QoS multicast routing algorithms known today, and it provides a descriptive overview and simulation results of these multi-constrained routing algorithms.
基金Project(51090385) supported by the Major Program of National Natural Science Foundation of ChinaProject(2011IB001) supported by Yunnan Provincial Science and Technology Program,China+1 种基金Project(2012DFA70570) supported by the International Science & Technology Cooperation Program of ChinaProject(2011IA004) supported by the Yunnan Provincial International Cooperative Program,China
文摘The control design, based on self-adaptive PID with genetic algorithms(GA) tuning on-line was investigated, for the temperature control of industrial microwave drying rotary device with the multi-layer(IMDRDWM) and with multivariable nonlinear interaction of microwave and materials. The conventional PID control strategy incorporated with optimization GA was put forward to maintain the optimum drying temperature in order to keep the moisture content below 1%, whose adaptation ability included the cost function of optimization GA according to the output change. Simulations on five different industrial process models and practical temperature process control system for selenium-enriched slag drying intensively by using IMDRDWM were carried out systematically, indicating the reliability and effectiveness of control design. The parameters of proposed control design are all on-line implemented without iterative predictive calculations, and the closed-loop system stability is guaranteed, which makes the developed scheme simpler in its synthesis and application, providing the practical guidelines for the control implementation and the parameter design.
文摘The present work is concerned with the solution of a problem on thermoelastic interactions in a functional graded material due to thermal shock in the context of the fractional order three-phase lag model. The governing equations of fractional order generalized thermoelasticity with three-phase lag model for functionally graded materials(FGM)(i.e., material with spatially varying material properties) are established. The analytical solution in the transform domain is obtained by using the eigenvalue approach.The inversion of Laplace transform is done numerically. The graphical results indicate that the fractional parameter has significant effects on all the physical quantities. Thus, we can consider the theory of fractional order generalized thermoelasticity an improvement on studying elastic materials.
基金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.
文摘With its wide use in different fields, the problem of the convergence of simple genetic algorithms (GAs) has been concerned. In the past, the research on the convergence of GAs was based on Holland's model theorem. The diversity of the evolutionary population and the convergence of GAs are studied by using the concept of negentropy based on the discussion of the characteristic of GA. Some test functions are used to test the convergence of GAs, and good results have been obtained. It is shown that the global optimization may be obtained by selecting appropriate parameters of simple GAs if the evolution time is enough.
文摘The Volterra feedforward neural network with nonlinear interconnections and related homotopy learning algorithm are proposed in the paper. It is shown that Volterra neural network and the homolopy learning algorithms are significant potentials in nonlinear approximation ability,convergent speeds and global optimization than the classical neural networks and the standard BP algorithm, and related computer simulations and theoretical analysis are given too.
基金supported by the National Natural Science Foundation of China under Grant No.11371001
文摘develop a mentation This paper considers the priority facility primal-dual 3-approximation algorithm for procedure, the authors further improve the location problem with penalties： The authors this problem. Combining with the greedy aug- previous ratio 3 to 1.8526.
文摘A multiple model tracking algorithm based on neural network and multiple-process noise soft-switching for maneuvering targets is presented.In this algorithm, the＂current＂statistical model and neural network are running in parallel.The neural network algorithm is used to modify the adaptive noise filtering algorithm based on the mean value and variance of the＂current＂statistical model for maneuvering targets, and then the multiple model tracking algorithm of the multiple processing switch is used to improve the precision of tracking maneuvering targets.The modified algorithm is proved to be effective by simulation.
基金This work was supported by National Natural Science Foundation of China (NSFC) under the grant !No. 69873030
文摘To generate a test set for a given circuit (including both combinational and sequential circuits), choice of an algorithm within a number of existing test generation algorithms to apply is bound to vary from circuit to circuit. In this paper, the genetic algorithms are used to construct the models of existing test generation algorithms in making such choice more easily. Therefore, we may forecast the testability parameters of a circuit before using the real test generation algorithm. The results also can be used to evaluate the efficiency of the existing test generation algorithms. Experimental results are given to convince the readers of the truth and the usefulness of this approach.
文摘A new error analysis method is presented via genetic algorithms for high precise heading determination model based on two total positioning stations （TPSs）. The method has the ability to search all possible solution space by the genetic operators of elitist model and restriction. The result of analyzing the error of this model shows that the accuracy of this model is precise enough to meet the need of calibration for navigation systems on ship, and the search space is only 0. 03% of the total search space, and the precision of heading determination is 4＂ in a general dock.
文摘To study the diagnostic problem of Wire-OR （W-O） interconnect fault of PCB （Printed Circuit Board）, five modified boundary scan adaptive algorithms for interconnect test are put forward. These algorithms apply Global-diagnosis sequence algorithm to replace the equal weight algorithm of primary test, and the test time is shortened without changing the fault diagnostic capability. The descriptions of five modified adaptive test algorithms are presented, and the capability comparison between the modified algorithm and the original algorithm is made to prove the validity of these algorithms.
基金the National Natural Science Foundation of China (70631003)the Hefei University of Technology Foundation (071102F).
文摘A class of nonidentical parallel machine scheduling problems are considered in which the goal is to minimize the total weighted completion time. Models and relaxations are collected. Most of these problems are NP-hard, in the strong sense, or open problems, therefore approximation algorithms are studied. The review reveals that there exist some potential areas worthy of further research.
文摘The classical job shop scheduling problem(JSP) is the most popular machine scheduling model in practice and is known as NP-hard.The formulation of the JSP is based on the assumption that for each part type or job there is only one process plan that prescribes the sequence of operations and the machine on which each operation has to be performed.However,JSP with alternative machines for various operations is an extension of the classical JSP,which allows an operation to be processed by any machine from a given set of machines.Since this problem requires an additional decision of machine allocation during scheduling,it is much more complex than JSP.We present a domain independent genetic algorithm(GA) approach for the job shop scheduling problem with alternative machines.The GA is implemented in a spreadsheet environment.The performance of the proposed GA is analyzed by comparing with various problem instances taken from the literatures.The result shows that the proposed GA is competitive with the existing approaches.A simplified approach that would be beneficial to both practitioners and researchers is presented for solving scheduling problems with alternative machines.
