A fast global convergence algorithm, small-world optimization (SWO), was designed to solve the global optimization problems, which was inspired from small-world theory and six degrees of separation principle in sociol...A fast global convergence algorithm, small-world optimization (SWO), was designed to solve the global optimization problems, which was inspired from small-world theory and six degrees of separation principle in sociology. Firstly, the solution space was organized into a small-world network model based on social relationship network. Secondly, a simple search strategy was adopted to navigate into this network in order to realize the optimization. In SWO, the two operators for searching the short-range contacts and long-range contacts in small-world network were corresponding to the exploitation and exploration, which have been revealed as the common features in many intelligent algorithms. The proposed algorithm was validated via popular benchmark functions and engineering problems. And also the impacts of parameters were studied. The simulation results indicate that because of the small-world theory, it is suitable for heuristic methods to search targets efficiently in this constructed small-world network model. It is not easy for each test mail to fall into a local trap by shifting into two mapping spaces in order to accelerate the convergence speed. Compared with some classical algorithms, SWO is inherited with optimal features and outstanding in convergence speed. Thus, the algorithm can be considered as a good alternative to solve global optimization problems.展开更多
The inherent selfishness of each node for the enhancement of message successful delivery ratio and the network overall performance improvement are reflected in the contradiction relationship of competition and coopera...The inherent selfishness of each node for the enhancement of message successful delivery ratio and the network overall performance improvement are reflected in the contradiction relationship of competition and cooperation in delay/disruption tolerant networks (DTN). In particular, the existence of malicious node aggravates this contradiction. To resolve this contradiction, social relationship theory and group theory of social psychology were adopted to do an in-depth analysis. The concrete balancing approach which leveraged Nash equilibrium theory of game theory was proposed to resolve this contradiction in reality. Thus, a new congestion control routing algorithm for security defense based on social psychology and game theory (CRSG) was put forward. Through the experiment, this algorithm proves that it can enhance the message successful delivery ratio by more than 15% and reduce the congestion ratio over 15% as well. This algorithm balances the contradiction relationship between the two key performance targets and made all nodes exhibit strong cooperation relationship in DTN.展开更多
Support vector regression （SVR） method is a novel type of learning machine algorithms, which is seldom applied to the development of urban atmospheric quality models under multiple socio-economic factors. This study...Support vector regression （SVR） method is a novel type of learning machine algorithms, which is seldom applied to the development of urban atmospheric quality models under multiple socio-economic factors. This study presents four SVR models by selecting linear, radial basis, spline, and polynomial functions as kernels, respectively for the prediction of urban dust fall levels. The inputs of the models are identified as industrial coal consumption, population density, traffic flow coefficient, and shopping density coefficient. The training and testing results show that the SVR model with radial basis kernel performs better than the other three both in the training and testing processes. In addition, a number of scenario analyses reveal that the most suitable parameters （insensitive loss function e, the parameter to reduce the influence of error C, and discrete level or average distribution of parameters σ） are 0.001, 0.5, and 2 000, respectively.展开更多
基金Projects(51105157, 50875101) supported by the National Natural Science Foundation of ChinaProject(2009AA043301) supported by the National High Technology Research and Development Program of China
文摘A fast global convergence algorithm, small-world optimization (SWO), was designed to solve the global optimization problems, which was inspired from small-world theory and six degrees of separation principle in sociology. Firstly, the solution space was organized into a small-world network model based on social relationship network. Secondly, a simple search strategy was adopted to navigate into this network in order to realize the optimization. In SWO, the two operators for searching the short-range contacts and long-range contacts in small-world network were corresponding to the exploitation and exploration, which have been revealed as the common features in many intelligent algorithms. The proposed algorithm was validated via popular benchmark functions and engineering problems. And also the impacts of parameters were studied. The simulation results indicate that because of the small-world theory, it is suitable for heuristic methods to search targets efficiently in this constructed small-world network model. It is not easy for each test mail to fall into a local trap by shifting into two mapping spaces in order to accelerate the convergence speed. Compared with some classical algorithms, SWO is inherited with optimal features and outstanding in convergence speed. Thus, the algorithm can be considered as a good alternative to solve global optimization problems.
基金Projects(61202488, 61070199, 61103182) supported by the National Natural Science Foundation of China
文摘The inherent selfishness of each node for the enhancement of message successful delivery ratio and the network overall performance improvement are reflected in the contradiction relationship of competition and cooperation in delay/disruption tolerant networks (DTN). In particular, the existence of malicious node aggravates this contradiction. To resolve this contradiction, social relationship theory and group theory of social psychology were adopted to do an in-depth analysis. The concrete balancing approach which leveraged Nash equilibrium theory of game theory was proposed to resolve this contradiction in reality. Thus, a new congestion control routing algorithm for security defense based on social psychology and game theory (CRSG) was put forward. Through the experiment, this algorithm proves that it can enhance the message successful delivery ratio by more than 15% and reduce the congestion ratio over 15% as well. This algorithm balances the contradiction relationship between the two key performance targets and made all nodes exhibit strong cooperation relationship in DTN.
基金Projects(2007JT3018, 2008JT1013, 2009FJ4056) supported by the Key Project in Hunan Science and Technology Program, ChinaProject(20090161120014) supported by the New Teachers Sustentation Fund in Doctoral Program, Ministry of Education, China
文摘Support vector regression （SVR） method is a novel type of learning machine algorithms, which is seldom applied to the development of urban atmospheric quality models under multiple socio-economic factors. This study presents four SVR models by selecting linear, radial basis, spline, and polynomial functions as kernels, respectively for the prediction of urban dust fall levels. The inputs of the models are identified as industrial coal consumption, population density, traffic flow coefficient, and shopping density coefficient. The training and testing results show that the SVR model with radial basis kernel performs better than the other three both in the training and testing processes. In addition, a number of scenario analyses reveal that the most suitable parameters （insensitive loss function e, the parameter to reduce the influence of error C, and discrete level or average distribution of parameters σ） are 0.001, 0.5, and 2 000, respectively.
