This paper presents an all-parametric model of radar target in optic region, in which the localized scattering center's frequency and aspect angle dependent scattering level, distance and azimuth locations are mod...This paper presents an all-parametric model of radar target in optic region, in which the localized scattering center's frequency and aspect angle dependent scattering level, distance and azimuth locations are modeled as the feature vectors. And the traditional TLS-Prony algorithm is modified to extract these feature vectors. The analysis of Cramer-Rao bound shows that the modified algorithm not only improves the restriction of high signal-to-noise ratio(SNR)threshold of traditional TLS-Prony algorithm, but also is suitable to the extraction of big damped coefficients and high-resolution estimation of near separation poles. Finally, an illustrative example is presented to verify its practicability in the applications. The experimental results show that the method developed can not only recognize two airplane-like targets with similar shape at low SNR, but also compress the original radar data with high fidelity.展开更多
To improve the measurement accuracy of structured laser for inner surface dimensions of a deep hole, a new method to extract the laser stripe center line is proposed. An improved adaptive genetic algorithm that can co...To improve the measurement accuracy of structured laser for inner surface dimensions of a deep hole, a new method to extract the laser stripe center line is proposed. An improved adaptive genetic algorithm that can converge rapidly and search the global optimum is used to determine the threshold for the laser stripe segmentation. And then NURBS interpolation which has a good local control capability is adopted to extract the laser stripe center line. Experiments show that the extracted laser stripe center line is stable and the diameter of the deep hole can be measured accurately.展开更多
It takes more time and is easier to fall into the local minimum value when using the traditional full-supervised learning algorithm to train RBFNN. Therefore, the paper proposes one algorithm to determine the RBFNN’s...It takes more time and is easier to fall into the local minimum value when using the traditional full-supervised learning algorithm to train RBFNN. Therefore, the paper proposes one algorithm to determine the RBFNN’s data center based on the improvement density method. First it uses the improved density method to select RBFNN’s data center, and calculates the expansion constant of each center, then only trains the network weight with the gradient descent method. To compare this method with full-supervised gradient descent method, the time not only has obvious reduction (including to choose data center’s time by density method), but also obtains better classification results when using the data set in UCI to carry on the test to the network.展开更多
The primary focus of this paper is to design a progressive restoration plan for an enterprise data center environment following a partial or full disruption. Repairing and restoring disrupted components in an enterpri...The primary focus of this paper is to design a progressive restoration plan for an enterprise data center environment following a partial or full disruption. Repairing and restoring disrupted components in an enterprise data center requires a significant amount of time and human effort. Following a major disruption, the recovery process involves multiple stages, and during each stage, the partially recovered infrastructures can provide limited services to users at some degraded service level. However, how fast and efficiently an enterprise infrastructure can be recovered de- pends on how the recovery mechanism restores the disrupted components, considering the inter-dependencies between services, along with the limitations of expert human operators. The entire problem turns out to be NP- hard and rather complex, and we devise an efficient meta-heuristic to solve the problem. By considering some real-world examples, we show that the proposed meta-heuristic provides very accurate results, and still runs 600-2800 times faster than the optimal solution obtained from a general purpose mathematical solver [1].展开更多
Cloud computing is becoming a key factor in the market day by day. Therefore, many companies are investing or going to invest in this sector for development of large data centers. These data centers not only consume m...Cloud computing is becoming a key factor in the market day by day. Therefore, many companies are investing or going to invest in this sector for development of large data centers. These data centers not only consume more energy but also produce greenhouse gases. Because of large amount of power consumption, data center providers go for different types of power generator to increase the profit margin which indirectly affects the environment. Several studies are carried out to reduce the power consumption of a data center. One of the techniques to reduce power consumption is virtualization. After several studies, it is stated that hardware plays a very important role. As the load increases, the power consumption of the CPU is also increased. Therefore, by extending the study of virtualization to reduce the power consumption, a hardware-based algorithm for virtual machine provisioning in a private cloud can significantly improve the performance by considering hardware as one of the important factors.展开更多
On the conditions of low-resolution radar, a parametric model for two-dimensional radar target is described here according to the theory of electromagnetic scattering and the geometrical theory of diffraction. A high ...On the conditions of low-resolution radar, a parametric model for two-dimensional radar target is described here according to the theory of electromagnetic scattering and the geometrical theory of diffraction. A high resolution estimation algorithm to extract the model parameters is also developed by building the relation of the scattering model and Prony model. The analysis of Cramer-Rao bound and simulation show that the method here has better statistical performance. The simulated analysis also indicates that the accurate extraction of the diffraction coefficient of scattering center is restricted by signal to noise ratio, radar center frequency and radar bandwidth.展开更多
Objective To find out more extrema simultaneously including global optimum and multiple local optima existed in multi-modal functions. Methods Germinal center is the generator and selector of high-affinity B cells, a ...Objective To find out more extrema simultaneously including global optimum and multiple local optima existed in multi-modal functions. Methods Germinal center is the generator and selector of high-affinity B cells, a multicellular group's artificial immune algorithm was proposed based on the germinal center reaction mechanism of natural immune systems. Main steps of the algorithm were given, including hyper-mutation, selection, memory, similarity suppression and recruitment of B cells and the convergence of it was proved. Results The algorithm has been tested to optimize various multi-modal functions, and the simulation results show that the artificial immune algorithm proposed here can find multiple extremum of these functions with lower computational cost. Conclusion The algorithm is valid and can converge on the satisfactory solution set D with probability 1 and approach to global solution and many local optimal solutions existed.展开更多
为了充分利用实际高速公路路段交通拥堵信息,更合理地聚类交通拥堵的内在规律和特征变化,提出自适应确定聚类中心C和类别K值(adaptive center and K-means value,ACK-Means)的聚类算法,进行高速公路拥堵路段聚类。ACK-Means算法借助簇...为了充分利用实际高速公路路段交通拥堵信息,更合理地聚类交通拥堵的内在规律和特征变化,提出自适应确定聚类中心C和类别K值(adaptive center and K-means value,ACK-Means)的聚类算法,进行高速公路拥堵路段聚类。ACK-Means算法借助簇类密度、簇类间距以及簇类强度,同时又考虑到数据样本的偶然性,对离群点进行合理分配,ACK-Means算法可实现自适应确定聚类中心C和类别K值。基于实际交通拥堵信息构建数据集,Python编程实现高速公路拥堵路段ACK-Means聚类,巧妙解决了高速公路拥堵路段聚类数目K和聚类中心C设定问题。聚类结果表明,ACK-Means算法实现高速公路拥堵路段无监督聚类,聚类结果完全基于实际的高速公路交通拥堵信息,具有更高的实用性。展开更多
文摘This paper presents an all-parametric model of radar target in optic region, in which the localized scattering center's frequency and aspect angle dependent scattering level, distance and azimuth locations are modeled as the feature vectors. And the traditional TLS-Prony algorithm is modified to extract these feature vectors. The analysis of Cramer-Rao bound shows that the modified algorithm not only improves the restriction of high signal-to-noise ratio(SNR)threshold of traditional TLS-Prony algorithm, but also is suitable to the extraction of big damped coefficients and high-resolution estimation of near separation poles. Finally, an illustrative example is presented to verify its practicability in the applications. The experimental results show that the method developed can not only recognize two airplane-like targets with similar shape at low SNR, but also compress the original radar data with high fidelity.
基金the Excellent Young Teacher Foundation from Ministry of Education (203078)
文摘To improve the measurement accuracy of structured laser for inner surface dimensions of a deep hole, a new method to extract the laser stripe center line is proposed. An improved adaptive genetic algorithm that can converge rapidly and search the global optimum is used to determine the threshold for the laser stripe segmentation. And then NURBS interpolation which has a good local control capability is adopted to extract the laser stripe center line. Experiments show that the extracted laser stripe center line is stable and the diameter of the deep hole can be measured accurately.
文摘It takes more time and is easier to fall into the local minimum value when using the traditional full-supervised learning algorithm to train RBFNN. Therefore, the paper proposes one algorithm to determine the RBFNN’s data center based on the improvement density method. First it uses the improved density method to select RBFNN’s data center, and calculates the expansion constant of each center, then only trains the network weight with the gradient descent method. To compare this method with full-supervised gradient descent method, the time not only has obvious reduction (including to choose data center’s time by density method), but also obtains better classification results when using the data set in UCI to carry on the test to the network.
文摘The primary focus of this paper is to design a progressive restoration plan for an enterprise data center environment following a partial or full disruption. Repairing and restoring disrupted components in an enterprise data center requires a significant amount of time and human effort. Following a major disruption, the recovery process involves multiple stages, and during each stage, the partially recovered infrastructures can provide limited services to users at some degraded service level. However, how fast and efficiently an enterprise infrastructure can be recovered de- pends on how the recovery mechanism restores the disrupted components, considering the inter-dependencies between services, along with the limitations of expert human operators. The entire problem turns out to be NP- hard and rather complex, and we devise an efficient meta-heuristic to solve the problem. By considering some real-world examples, we show that the proposed meta-heuristic provides very accurate results, and still runs 600-2800 times faster than the optimal solution obtained from a general purpose mathematical solver [1].
基金supported by the National Research Foundation (NRF) of Korea through contract N-14-NMIR06
文摘Cloud computing is becoming a key factor in the market day by day. Therefore, many companies are investing or going to invest in this sector for development of large data centers. These data centers not only consume more energy but also produce greenhouse gases. Because of large amount of power consumption, data center providers go for different types of power generator to increase the profit margin which indirectly affects the environment. Several studies are carried out to reduce the power consumption of a data center. One of the techniques to reduce power consumption is virtualization. After several studies, it is stated that hardware plays a very important role. As the load increases, the power consumption of the CPU is also increased. Therefore, by extending the study of virtualization to reduce the power consumption, a hardware-based algorithm for virtual machine provisioning in a private cloud can significantly improve the performance by considering hardware as one of the important factors.
文摘On the conditions of low-resolution radar, a parametric model for two-dimensional radar target is described here according to the theory of electromagnetic scattering and the geometrical theory of diffraction. A high resolution estimation algorithm to extract the model parameters is also developed by building the relation of the scattering model and Prony model. The analysis of Cramer-Rao bound and simulation show that the method here has better statistical performance. The simulated analysis also indicates that the accurate extraction of the diffraction coefficient of scattering center is restricted by signal to noise ratio, radar center frequency and radar bandwidth.
文摘Objective To find out more extrema simultaneously including global optimum and multiple local optima existed in multi-modal functions. Methods Germinal center is the generator and selector of high-affinity B cells, a multicellular group's artificial immune algorithm was proposed based on the germinal center reaction mechanism of natural immune systems. Main steps of the algorithm were given, including hyper-mutation, selection, memory, similarity suppression and recruitment of B cells and the convergence of it was proved. Results The algorithm has been tested to optimize various multi-modal functions, and the simulation results show that the artificial immune algorithm proposed here can find multiple extremum of these functions with lower computational cost. Conclusion The algorithm is valid and can converge on the satisfactory solution set D with probability 1 and approach to global solution and many local optimal solutions existed.
文摘为了充分利用实际高速公路路段交通拥堵信息,更合理地聚类交通拥堵的内在规律和特征变化,提出自适应确定聚类中心C和类别K值(adaptive center and K-means value,ACK-Means)的聚类算法,进行高速公路拥堵路段聚类。ACK-Means算法借助簇类密度、簇类间距以及簇类强度,同时又考虑到数据样本的偶然性,对离群点进行合理分配,ACK-Means算法可实现自适应确定聚类中心C和类别K值。基于实际交通拥堵信息构建数据集,Python编程实现高速公路拥堵路段ACK-Means聚类,巧妙解决了高速公路拥堵路段聚类数目K和聚类中心C设定问题。聚类结果表明,ACK-Means算法实现高速公路拥堵路段无监督聚类,聚类结果完全基于实际的高速公路交通拥堵信息,具有更高的实用性。
