This paper describes an extremely fast polynomial time algorithm, the NOVCA （Near Optimal Vertex Cover Algorithm） that produces an optimal or near optimal vertex cover for any known undirected graph G （V, E）. NOVC...This paper describes an extremely fast polynomial time algorithm, the NOVCA （Near Optimal Vertex Cover Algorithm） that produces an optimal or near optimal vertex cover for any known undirected graph G （V, E）. NOVCA is based on the idea of（l） including the vertex having maximum degree in the vertex cover and （2） rendering the degree of a vertex to zero by including all its adjacent vertices. The three versions of algorithm, NOVCA-I, NOVCA-II, and NOVCA-random, have been developed. The results identifying bounds on the size of the minimum vertex cover as well as polynomial complexity of algorithm are given with experimental verification. Future research efforts will be directed at tuning the algorithm and providing proof for better approximation ratio with NOVCA compared to any available vertex cover algorithms.展开更多
In order to exploit the enhancement of the multi- objective evolutionary algorithm based on decomposition （MOEA/D）, we propose an improved algorithm with uniform de- sign （UD）, i.e. MOEA/D-UD. Three mechanisms in ...In order to exploit the enhancement of the multi- objective evolutionary algorithm based on decomposition （MOEA/D）, we propose an improved algorithm with uniform de- sign （UD）, i.e. MOEA/D-UD. Three mechanisms in MOEA/D-UD are modified by introducing an experimental design method called UD. To fully employ the information contained in the domain of the multi-objective problem, we apply UD to initialize a uniformly scattered population. Then, motivated by the analysis of the re- lationship between weight vectors and optimal solutions of scalar subproblems in the study of MOEND with adaptive weight ad- justment （MOEA/D-AWA）, a new weight vector design method based on UD is introduced. To distinguish real sparse regions from pseudo sparse regions, i.e. discontinuous regions, of the complex Pareto front, the weight vector adjustment strategy in MOEMD-UD adequately utilizes the information from neighbors of individuals. In the experimental study, we compare MOEA/D-UD with three outstanding algorithms, namely MOEA/D with the dif- ferential evolution operator （MOEA/D-DE）, MOEA/D-AWA and the nondominated sorting genetic algorithm II （NSGA-II） on nineteen test instances. The experimental results show that MOEA/D-UD is capable of obtaining a well-converged and well diversified set of solutions within an acceptable execution time.展开更多
To improve the handling performance of a steer-by-wire (SBW) vehicle, a series of control logics are proposed. Firstly, an algorithm for enhancing the maneuvering in steady-state cornering is presented. On this basis,...To improve the handling performance of a steer-by-wire (SBW) vehicle, a series of control logics are proposed. Firstly, an algorithm for enhancing the maneuvering in steady-state cornering is presented. On this basis, two categories of control strategies are used to dynamically correct and compensate the transient state steering responses and vehicle behaviors. Simulator tests including subjective evaluations and virtual field tests are both conducted to make comprehensive investigations on the series of control logics. The subjective evaluations demonstrate that the SBW vehicle with a specifically selected value of steering sensitivity tends to be more desirable for driving than a conventional one in which a fixed steering ratio exists. The virtual field tests indicate that the control strategies for dynamical correction and compensation could effectively improve the handling per-formances of an SBW vehicle by reducing the work load of drivers, enhancing the track-holding performance, and improving steering response properties.展开更多
文摘This paper describes an extremely fast polynomial time algorithm, the NOVCA （Near Optimal Vertex Cover Algorithm） that produces an optimal or near optimal vertex cover for any known undirected graph G （V, E）. NOVCA is based on the idea of（l） including the vertex having maximum degree in the vertex cover and （2） rendering the degree of a vertex to zero by including all its adjacent vertices. The three versions of algorithm, NOVCA-I, NOVCA-II, and NOVCA-random, have been developed. The results identifying bounds on the size of the minimum vertex cover as well as polynomial complexity of algorithm are given with experimental verification. Future research efforts will be directed at tuning the algorithm and providing proof for better approximation ratio with NOVCA compared to any available vertex cover algorithms.
文摘In order to exploit the enhancement of the multi- objective evolutionary algorithm based on decomposition （MOEA/D）, we propose an improved algorithm with uniform de- sign （UD）, i.e. MOEA/D-UD. Three mechanisms in MOEA/D-UD are modified by introducing an experimental design method called UD. To fully employ the information contained in the domain of the multi-objective problem, we apply UD to initialize a uniformly scattered population. Then, motivated by the analysis of the re- lationship between weight vectors and optimal solutions of scalar subproblems in the study of MOEND with adaptive weight ad- justment （MOEA/D-AWA）, a new weight vector design method based on UD is introduced. To distinguish real sparse regions from pseudo sparse regions, i.e. discontinuous regions, of the complex Pareto front, the weight vector adjustment strategy in MOEMD-UD adequately utilizes the information from neighbors of individuals. In the experimental study, we compare MOEA/D-UD with three outstanding algorithms, namely MOEA/D with the dif- ferential evolution operator （MOEA/D-DE）, MOEA/D-AWA and the nondominated sorting genetic algorithm II （NSGA-II） on nineteen test instances. The experimental results show that MOEA/D-UD is capable of obtaining a well-converged and well diversified set of solutions within an acceptable execution time.
基金Project (Nos. 50475009 and 50775096) supported by the National Natural Science Foundation of China
文摘To improve the handling performance of a steer-by-wire (SBW) vehicle, a series of control logics are proposed. Firstly, an algorithm for enhancing the maneuvering in steady-state cornering is presented. On this basis, two categories of control strategies are used to dynamically correct and compensate the transient state steering responses and vehicle behaviors. Simulator tests including subjective evaluations and virtual field tests are both conducted to make comprehensive investigations on the series of control logics. The subjective evaluations demonstrate that the SBW vehicle with a specifically selected value of steering sensitivity tends to be more desirable for driving than a conventional one in which a fixed steering ratio exists. The virtual field tests indicate that the control strategies for dynamical correction and compensation could effectively improve the handling per-formances of an SBW vehicle by reducing the work load of drivers, enhancing the track-holding performance, and improving steering response properties.
