Molten steel temperature prediction is important in Ladle Furnace (LF). Most of the existing temperature models have been built on small-scale data. The accuracy and the generalization of these models cannot satisfy i...
详细信息
Molten steel temperature prediction is important in Ladle Furnace (LF). Most of the existing temperature models have been built on small-scale data. The accuracy and the generalization of these models cannot satisfy industrial production. Now, the large-scale data with more useful information are accumulated from the production process. However, the data are with noise. Large-scale and noise data impose strong restrictions on building a temperature model. To solve these two issues, the Bootstrap Feature Subsets Ensemble Regression Trees (BFSE-RTs) method is proposed in this paper. Firstly, low-dimensional feature subsets are constructed based on the multivariate fuzzy Taylor theorem, which saves more memory space in computers and indicates ``smaller-scale'' data sets are used. Secondly, to eliminate the noise, the bootstrap sampling approach of the independent identically distributed data is applied to the feature subsets. Bootstrap replications consist of smaller-scale and lower-dimensional samples. Thirdly, considering its simplicity, a Regression Tree (RT) is built on each bootstrap replication. Lastly, the BFSE-RTs method is used to establish a temperature model by analyzing the metallurgic process of LF. Experiments demonstrate that the BFSE-RTs outperforms other estimators, improves the accuracy and the generalization, and meets the requirements of the RMSE and the maximum error on the temperature prediction.
Aiming at DNA encoding sequences design, a micro-genetic algorithm (MGA) is proposed by introducing a sharing function based on similarity and H-measure of DNA sequences. In the algorithm, six design criteria are adop...
详细信息
ISBN:
(纸本)9781467398732
Aiming at DNA encoding sequences design, a micro-genetic algorithm (MGA) is proposed by introducing a sharing function based on similarity and H-measure of DNA sequences. In the algorithm, six design criteria are adopted and four genetic operators are applied. Compared with the previous results, the algorithm can get better DNA sequences and improve the computational efficiency.
In this paper, we propose a novel megawatt-class wind turbine gear train optimal design method based on genetic algorithm. Firstly, we construct an objective function to obtain the optimal quality of gear train with t...
详细信息
By using facial motion data from passive optical motion capture system, this paper proposed an animation reconstruction approach, which is aimed to solve the common problem: model discontinuity and reconstructing a re...
详细信息
The protein structure folding is one of the most challenging problems in the field of bioinformatics. The main problem of protein structure prediction in the 3D toy model is to find the lowest energy conformation. Alt...
详细信息
The protein structure folding is one of the most challenging problems in the field of bioinformatics. The main problem of protein structure prediction in the 3D toy model is to find the lowest energy conformation. Although many heuristic algorithms have been proposed to solve the protein structure prediction (PSP) problem, the existing algorithms are far from perfect since PSP is an NP-problem. In this paper, we proposed an artificial bee colony (ABC) algorithm based on the toy model to solve PSP problem. In order to improve the global convergence ability and convergence speed of the ABC algorithm, we adopt a new search strategy by combining the global solution into the search equation. Experimental results illustrate that the suggested algorithm can get the lowest energy when the algorithm is applied to the Fibonacci sequences and to four real protein sequences which come from the Protein Data Bank (PDB). Compared with the results obtained by PSO, LPSO, PSO-TS, PGATS, our algorithm is more efficient.
Based on a virtual spherical light source method, this paper presents an improved virtual spherical lights approach for glossy illumination by modifying a reflection render equation. First, in order to keep primitive ...
详细信息
Based on a virtual spherical light source method, this paper presents an improved virtual spherical lights approach for glossy illumination by modifying a reflection render equation. First, in order to keep primitive spherical lights, it uses non-zero solid angle integration instead of a geometric item of traditional Instant Radiosity arithmetic. Second, the formula mode for the light energy allocation of VSLs is improved by the energy distribution, in which the radius of sphere is replaced by the radius of inscribed circle generated by the tangent to the non-zero solid angle of cone. Third, the similar function of judging two point visibility takes place of a cosine term in the approximate equations of the VSLs. Experiments show that blurring or disappearing phenomenon that appear in part of right-angle surface scene is avoided.
In this article, we investigate the use of joint a-entropy for 3D ear matching by incorporating the local shape feature of 3D ears into the joint a-entropy. First, we extract a sut^cient number of key points from the ...
详细信息
In this article, we investigate the use of joint a-entropy for 3D ear matching by incorporating the local shape feature of 3D ears into the joint a-entropy. First, we extract a sut^cient number of key points from the 3D ear point cloud, and fit the neighborhood of each key point to a single-value quadric surface on product parameter regions. Second, we define the local shape feature vector of each key point as the sampling depth set on the parametric node of the quadric surface. Third, for every pair of gallery ear and probe ear, we construct the minimum spanning tree (MST) on their matched key points. Finally, we minimize the total edge weight of MST to estimate its joint a-entropy the smaller the entropy is, the more similar the ear pair is. We present several examples to demonstrate the advantages of our algorithm, including low time complexity, high recognition rate, and high robustness. To the best of our knowledge, it is the first time that, in computer graphics, the classical information theory of joint a-entropy is used to deal with 3D ear shape recognition.
In the free-floating mode, there is intense dynamic coupling existing between the space manipulator and the base, and the base attitude may change while performing a motion with its manipulator. Therefore, it is neces...
详细信息
In the free-floating mode, there is intense dynamic coupling existing between the space manipulator and the base, and the base attitude may change while performing a motion with its manipulator. Therefore, it is necessary to reduce the interference that resulted from the manipulator movement. For planning trajectories of the space manipulator with 7 degrees of freedom (7-DOF), simulated annealing particle swarm optimization (SAPSO) algorithm is presented in the paper. Firstly, kinematics equations are setup. Secondly, the joint functions are parameterized by sinusoidal functions, and the objective function is defined according to the motion constraints of manipulator and accuracy requirements of the base attitude. Finally, SAPSO algorithm is used to search the optimal trajectory. The simulation results verify the proposed method.
Networks have developed very quickly, allowing the speedy transfer of image information through Internet. However, the openness of these networks poses a serious threat to the security of image information. The field ...
Networks have developed very quickly, allowing the speedy transfer of image information through Internet. However, the openness of these networks poses a serious threat to the security of image information. The field of image encryption has drawn attention for this reason. In this paper, the concepts of 1-dimensional DNA cellular automata and T-DNA cellular automata are defined, and the concept of reversible T-DNA cellular automata is introduced. An efficient approach to encryption involving reversible T-DNA cellular automata as an encryption tool and natural DNA sequences as the main keys is here proposed. The results of a simulation experiment, performance analysis, and comparison to other encryption algorithms showed this algorithm to be capable of resisting brute force attacks, statistical attacks, and differential attacks. It also enlarged the key space enormously. It meets the criteria for one-time pad and resolves the problem that one-time pad is difficult to save.
The path planning of free-floating space robot in space on-orbit service has been paid more and more attention. The problem is more complicated because of the interaction between the space robot and base. Therefore, i...
详细信息
The path planning of free-floating space robot in space on-orbit service has been paid more and more attention. The problem is more complicated because of the interaction between the space robot and base. Therefore, it is necessary to minimize the base position and attitude disturbance to improve the path planning of free-floating space robot, reducing the fuel consumption for the position and attitude maintenance. In this paper, a reasonable path planning method to solve the problem is presented, which is feasible and relatively simple. First, the kinematic model of 6 degrees of freedom free-floating space robot is established. And then the joint angles are parameterized using the 7th order polynomial sine functions. The fitness function is defined according to the position and attitude of minimizing base disturbance and constraints of space robot. Furthermore, an improved chaotic particle swarm optimization (ICPSO) is presented. The proposed algorithm is compared with the standard PSO and CPSO algorithm in the literature by the experimental simulation. The simulation results demonstrate that the proposed algorithm is more effective than the two other approaches, such as easy to find the optimal solution, and this method could provide a satisfactory path for the free-floating space robot.
暂无评论