In order to improve the efficiency of operating rooms,reduce the costs for hospitals and improve the level of service qualities, a scheduling method was developed based on an estimation of distribution algorithm（ EDA...In order to improve the efficiency of operating rooms,reduce the costs for hospitals and improve the level of service qualities, a scheduling method was developed based on an estimation of distribution algorithm（ EDA）. First, a scheduling problem domain is described. Based on assignment constraints and resource capacity constraints, the mathematical programming models are set up with an objective function to minimize the system makespan. On the basis of the descriptions mentioned above, a solution policy of generating feasible scheduling solutions is established. Combined with the specific constraints of operating theatres, the EDA-based algorithm is put forward to solve scheduling problems. Finally, simulation experiments are designed to evaluate the scheduling method. The orthogonal table is chosen to determine the parameters in the proposed method. Then the genetic algorithm and the particle swarm optimization algorithm are chosen for comparison with the EDA-based algorithm, and the results indicate that the proposed method can decrease the makespan of the surgical system regardless of the size of operations. Moreover, the computation time of the EDA-based algorithm is only approximately 5 s when solving the large scale problems, which means that the proposed algorithm is suitable for carrying out an on-line scheduling optimization of the patients.展开更多
An improved Gaussian mixture model （GMM）- based clustering method is proposed for the difficult case where the true distribution of data is against the assumed GMM. First, an improved model selection criterion, the ...An improved Gaussian mixture model （GMM）- based clustering method is proposed for the difficult case where the true distribution of data is against the assumed GMM. First, an improved model selection criterion, the completed likelihood minimum message length criterion, is derived. It can measure both the goodness-of-fit of the candidate GMM to the data and the goodness-of-partition of the data. Secondly, by utilizing the proposed criterion as the clustering objective function, an improved expectation- maximization （EM） algorithm is developed, which can avoid poor local optimal solutions compared to the standard EM algorithm for estimating the model parameters. The experimental results demonstrate that the proposed method can rectify the over-fitting tendency of representative GMM-based clustering approaches and can robustly provide more accurate clustering results.展开更多
MATLAB software and optimal complete subgraph algorithm were used to extract and reveal the microsatellite distribution features in the complete genomes of the tobacco vein clearing virus （NC-003 378.1） from the NCB...MATLAB software and optimal complete subgraph algorithm were used to extract and reveal the microsatellite distribution features in the complete genomes of the tobacco vein clearing virus （NC-003 378.1） from the NCBI database.The results showed that the repetitions number and their location of the N-base group has been extracted and displayed.The largest repetitions of N-base group in the complete genomes of the tobacco vein clearing virus was decreased as the exponential function with the increasing of N.The method used in this study could be applied to the extraction and revealing of the microsatellite distribution features in the complete genomes of other viruses,thereby provided a basis for the research of the structure and the law of function,inheritance and variation by the using of the microsatellite distribution features.展开更多
A new integrity metric for navigation systems is proposed based on the measurement domain. Proba-hilistic optimization design offers tools for fault detection by considering the required navigation performance （RNP）...A new integrity metric for navigation systems is proposed based on the measurement domain. Proba-hilistic optimization design offers tools for fault detection by considering the required navigation performance （RNP） parameter and the uncertainty noise. The choice of the proper performance parameter provided the single-valued mapping with the missed detection probability estimates the probability of failure. The desirable characteristics of the residual sensitivity matrix are exploited to increase the efficiency for identifying erroneous observations. The algorithm can be used to support the performance specification and the efficient calculation of the integrity monitoring process. The simulation for non-precision approach （NPA） validates both the viability and the effectiveness of the proposed algorithm.展开更多
The environment modeling algorithm named rectangular decomposition, which is composed of cellular nodes and interleaving networks, is proposed. The principle of environment modeling is to divide the environment into i...The environment modeling algorithm named rectangular decomposition, which is composed of cellular nodes and interleaving networks, is proposed. The principle of environment modeling is to divide the environment into individual square sub-areas. Each sub-area is orientated by the central point of the sub-areas called a node. The rectangular map based on the square map can enlarge the square area side size to increase the coverage efficiency in the case of there being an adjacent obstacle. Based on this algorithm, a new coverage algorithm, which includes global path planning and local path planning, is introduced. In the global path planning, uncovered subspaces are found by using a special rule. A one-dimensional array P, which is used to obtain the searching priority of node in every direction, is defined as the search rule. The array P includes the condition of coverage towards the adjacent cells, the condition of connectivity and the priorities defined by the user in all eight directions. In the local path planning, every sub-area is covered by using template models according to the shape of the environment. The simulation experiments show that the coverage algorithm is simple, efficient and adapted for complex two- dimensional environments.展开更多
The NP-hard no-wait flow shop scheduling problems with makespan and total flowtime minimization are considered. Objective increment properties of the problems are analyzed. A non-dominated classification method is int...The NP-hard no-wait flow shop scheduling problems with makespan and total flowtime minimization are considered. Objective increment properties of the problems are analyzed. A non-dominated classification method is introduced to class population individuals into Pareto fronts to improve searching efficiency. Besides investigating the crowding distance and the elitist solution strategy, two effective bi-criteria local search procedures based on objective increments are presented to improve searching effectiveness. Based on the properties and methods, a hybrid evolutionary algorithm is proposed for the considered problems and compared with the best existing algorithms. Experimental results show that the proposed algorithm is effective with high efficiency.展开更多
Matching pursuits algorithm (MP), as an adaptive signal representation upon overcomplete fundamental waveforms, is a powerful tool in many applications. However, MP suffers from distinguishing a doublet structure. In ...Matching pursuits algorithm (MP), as an adaptive signal representation upon overcomplete fundamental waveforms, is a powerful tool in many applications. However, MP suffers from distinguishing a doublet structure. In this paper, the authors proposed an algorithm called compete matching pursuits (CMP), which can overcome this shortcoming and performance very well.展开更多
As an efficient method of solving subgame-perfect Nash equilibrium,the backward induction is analyzed from an evolutionary point of view in this paper,replacing a player with a population and turning a game into a pop...As an efficient method of solving subgame-perfect Nash equilibrium,the backward induction is analyzed from an evolutionary point of view in this paper,replacing a player with a population and turning a game into a population game,which shows that equilibrium of a perfect information game is the unique evolutionarily stable outcome for dynamic models in the limit.展开更多
基金The National Natural Science Foundation of China(No.61273035,71471135)
文摘In order to improve the efficiency of operating rooms,reduce the costs for hospitals and improve the level of service qualities, a scheduling method was developed based on an estimation of distribution algorithm（ EDA）. First, a scheduling problem domain is described. Based on assignment constraints and resource capacity constraints, the mathematical programming models are set up with an objective function to minimize the system makespan. On the basis of the descriptions mentioned above, a solution policy of generating feasible scheduling solutions is established. Combined with the specific constraints of operating theatres, the EDA-based algorithm is put forward to solve scheduling problems. Finally, simulation experiments are designed to evaluate the scheduling method. The orthogonal table is chosen to determine the parameters in the proposed method. Then the genetic algorithm and the particle swarm optimization algorithm are chosen for comparison with the EDA-based algorithm, and the results indicate that the proposed method can decrease the makespan of the surgical system regardless of the size of operations. Moreover, the computation time of the EDA-based algorithm is only approximately 5 s when solving the large scale problems, which means that the proposed algorithm is suitable for carrying out an on-line scheduling optimization of the patients.
基金The National Natural Science Foundation of China(No.61105048,60972165)the Doctoral Fund of Ministry of Education of China(No.20110092120034)+2 种基金the Natural Science Foundation of Jiangsu Province(No.BK2010240)the Technology Foundation for Selected Overseas Chinese Scholar,Ministry of Human Resources and Social Security of China(No.6722000008)the Open Fund of Jiangsu Province Key Laboratory for Remote Measuring and Control(No.YCCK201005)
文摘An improved Gaussian mixture model （GMM）- based clustering method is proposed for the difficult case where the true distribution of data is against the assumed GMM. First, an improved model selection criterion, the completed likelihood minimum message length criterion, is derived. It can measure both the goodness-of-fit of the candidate GMM to the data and the goodness-of-partition of the data. Secondly, by utilizing the proposed criterion as the clustering objective function, an improved expectation- maximization （EM） algorithm is developed, which can avoid poor local optimal solutions compared to the standard EM algorithm for estimating the model parameters. The experimental results demonstrate that the proposed method can rectify the over-fitting tendency of representative GMM-based clustering approaches and can robustly provide more accurate clustering results.
基金Supported by the Eleventh Five-year Development Planning Project for Instructional Science in Hubei Province (2006B131)~~
文摘MATLAB software and optimal complete subgraph algorithm were used to extract and reveal the microsatellite distribution features in the complete genomes of the tobacco vein clearing virus （NC-003 378.1） from the NCBI database.The results showed that the repetitions number and their location of the N-base group has been extracted and displayed.The largest repetitions of N-base group in the complete genomes of the tobacco vein clearing virus was decreased as the exponential function with the increasing of N.The method used in this study could be applied to the extraction and revealing of the microsatellite distribution features in the complete genomes of other viruses,thereby provided a basis for the research of the structure and the law of function,inheritance and variation by the using of the microsatellite distribution features.
基金Supported by the National High Technology Research and Development Program of China (‘863’Program) (2006AA12Z313)~~
文摘A new integrity metric for navigation systems is proposed based on the measurement domain. Proba-hilistic optimization design offers tools for fault detection by considering the required navigation performance （RNP） parameter and the uncertainty noise. The choice of the proper performance parameter provided the single-valued mapping with the missed detection probability estimates the probability of failure. The desirable characteristics of the residual sensitivity matrix are exploited to increase the efficiency for identifying erroneous observations. The algorithm can be used to support the performance specification and the efficient calculation of the integrity monitoring process. The simulation for non-precision approach （NPA） validates both the viability and the effectiveness of the proposed algorithm.
基金The National Natural Science Foundation of China(No.50475076)the National High Technology Research and Development Pro-gram of China(863Program)(No.2006AA04Z234)
文摘The environment modeling algorithm named rectangular decomposition, which is composed of cellular nodes and interleaving networks, is proposed. The principle of environment modeling is to divide the environment into individual square sub-areas. Each sub-area is orientated by the central point of the sub-areas called a node. The rectangular map based on the square map can enlarge the square area side size to increase the coverage efficiency in the case of there being an adjacent obstacle. Based on this algorithm, a new coverage algorithm, which includes global path planning and local path planning, is introduced. In the global path planning, uncovered subspaces are found by using a special rule. A one-dimensional array P, which is used to obtain the searching priority of node in every direction, is defined as the search rule. The array P includes the condition of coverage towards the adjacent cells, the condition of connectivity and the priorities defined by the user in all eight directions. In the local path planning, every sub-area is covered by using template models according to the shape of the environment. The simulation experiments show that the coverage algorithm is simple, efficient and adapted for complex two- dimensional environments.
基金The National Natural Science Foundation of China(No.60504029,60672092)the National High Technology Research and Development Program of China(863Program)(No.2008AA04Z103)
文摘The NP-hard no-wait flow shop scheduling problems with makespan and total flowtime minimization are considered. Objective increment properties of the problems are analyzed. A non-dominated classification method is introduced to class population individuals into Pareto fronts to improve searching efficiency. Besides investigating the crowding distance and the elitist solution strategy, two effective bi-criteria local search procedures based on objective increments are presented to improve searching effectiveness. Based on the properties and methods, a hybrid evolutionary algorithm is proposed for the considered problems and compared with the best existing algorithms. Experimental results show that the proposed algorithm is effective with high efficiency.
文摘Matching pursuits algorithm (MP), as an adaptive signal representation upon overcomplete fundamental waveforms, is a powerful tool in many applications. However, MP suffers from distinguishing a doublet structure. In this paper, the authors proposed an algorithm called compete matching pursuits (CMP), which can overcome this shortcoming and performance very well.
文摘As an efficient method of solving subgame-perfect Nash equilibrium,the backward induction is analyzed from an evolutionary point of view in this paper,replacing a player with a population and turning a game into a population game,which shows that equilibrium of a perfect information game is the unique evolutionarily stable outcome for dynamic models in the limit.
