To address the challenges of reduced population diversity and sensitivity to hyperparameters in solving Symbolic Regression （SR） problems by using genetic evolutionary algorithms， a Deep Symbolic Regression Technique （DSRT） method based on Transformer was proposed. This method employed autoregressive capability of Transformer to generate expression symbol sequence. Subsequently， the transformation of the fitness value between the data and the expression symbol sequence was served as a reward value， and the model parameters were updated through deep reinforcement learning， so that the model was able to output expression sequence that fitted the data better， and with the model’s continuous converging， the optimal expression was identified. The effectiveness of the DSRT method was validated on the SR benchmark dataset Nguyen， and it was compared with DSR （Deep Symbolic Regression） and GP （Genetic Programming） algorithms within 200 iterations. Experimental results confirm the validity of DSRT method. Additionally， the influence of various parameters on DSRT method was discussed， and an experiment to predict the formula for surface pressure coefficient of an aircraft airfoil using NACA4421 dataset was performed. The obtained formula was compared with the Kármán-Tsien formula， yielding a mathematical formula with a lower Root Mean Square Error （RMSE）.

To solve the problem that users and products can not be accurately selected in large data sets, and the problem that user behavior preference can not be predicted accurately, a new method of CUR (Column Union Row) matrix decomposition was proposed. A small number of columns were selected from the original matrix to form the matrix C, and a small number of rows were selected to form the matrix R. Then, the matrix U was constructed by Orthogonal Rotation (QR) matrix decomposition. The matrixes C and R were feature matrixes of users and products respectively, which were composed of real data, and enabled to reflect the detailed characters of both users as well as products. In order to predict behavioral preferences of users accurately, the authors improved the CUR algorithm in this paper, endowing it with greater stability and accuracy in terms of matrix recovery. Lastly, the experiment based on real dataset (Netflix dataset) indicates that, compared with traditional singular value decomposition, principal component analysis and other matrix decomposition methods, the CUR matrix decomposition algorithm has higher accuracy as well as better interpretability in terms of feature selection, as for matrix recovery, the CUR matrix decomposition also shows superior stability and accuracy, with a preciseness of over 90%. The CUR matrix decomposition has a great application value in the recommender system and traffic flow prediction.

This paper proposed a novel sparse tracking method based on multi-feature fusion to compensate for incomplete description of single feature. Firstly, to fuse various features, multiple feature descriptors of dictionary templates and particle candidates were encoded as the form of kernel matrices. Secondly, every candidate particle was sparsely represented as a linear combination of all atoms of dictionary. Then the sparse representation model was efficiently solved using a Kernelizable Accelerated Proximal Gradient (KAPG) method. Lastly, in the framework of particle filter, the weights of particles were determined by sparse coefficient reconstruction errors to realize tracking. In the tracking step, a template update strategy which employed incremental subspace learning was introduced. The experimental results show that, compared with the related state-of-the-art methods, this algorithm improves the tracking accuracy under all kinds of factors such as occlusions, illumination changes, pose changes, background clutter and viewpoint variation.

To solve the problem of Fine Particulate Matter (PM2.5) concentration prediction, a PM2.5 concentration prediction model was proposed. First, through introducing the comprehensive meteorological index, the factors of wind, humidity, temperature were comprehensively considered; then the feature vector was conducted by combining the actual concentration of SO2, NO2, CO and PM10; finally the Least Squares Support Vector Machine (LS-SVM) prediction model was built based on feature vector and PM2.5 concentration data. The experimental results using the data from the city A and city B environmental monitoring centers in 2013 show that, the forecast accuracy is improved after the introduction of a comprehensive weather index, error is reduced by nearly 30%. The proposed model can more accurately predict the PM2.5 concentration and it has a high generalization ability. Furthermore, the author analyzed the relationship between PM2.5 concentration and the rate of hospitalization, hospital outpatient service amount, and found a high correlation between them.

In view of complicated and inefficient calculation of system matrix, a simple length weighted algorithm was proposed. Compared with the traditional length weighted algorithm, the proposed algorithm reduced situations of the intercepted photon rays with the grid and the grid index of the proposed approach was determined in the two-dimensional coordinate. The computational process of the system matrix was improved based on the proposed algorithm. The image reconstructed with the system matrix was constructed through the new process, and the quality of the reconstructed image was assessed. The experimental results show that the operation speed of the proposed algorithm is more than three times faster than Siddon improved algorithm, and the more lengths in the length weighted algorithm get considered, the better quality of the reconstructed image has.

In the Case-Based Reasoning (CBR) case retrieving and matching, different cases are usually composed by different features. But most of the traditional CBR engines adopt fixed feature weights mode, which makes matching rate of whole system very low. To solve this problem, this paper proposed a CBR engine model with variable feature weights and brought interactive mode into feature weights calculating module. It calculated subjective weight based on group decisionmaking theory and proposed an adjustment method which used differences between a single expert and his group. It used similarity rough set theory to calculate objective weight in order to make results calculating more objective and accurate. At last, it designed composite weights adjustment algorithm which calculated the distance between the subjective weight and objective weight, considered the deviation degree of those two weights, then deduced weights adjustment coefficient, and get the final weight adjustment results. The calculation example and simulation analysis of network attack cases validate the effectiveness of the proposed method and prove this method has much better performance in different performance indexes.

In this paper, an adaptive color image enhancement method was proposed: Firstly, color image was transformed from RGB to HSV color space and the H component was kept invariable, while the illumination component of brightness image could be estimated through Adaptive Bidimensional Empirical Mode Decomposition (ABEMD); Secondly, reflection component was figured out by the method of center/surround Retinex algorithm, and the illumination and reflection components were controlled through Gamma emendation and Weber's law and processed with weighted average method; Thirdly, the S component was adjusted adaptively based on characteristics of the whole image, and then image was transformed back to RGB color space. The method could be evaluated by subjective effects and objective image quality assessment, and the experiment results show that the proposed algorithm is better in mean value, square variation, entropy and resolution than MSR algorithm and Meylan's algorithm.

The problems encountered in ground traffic simulation were analyzed, a multiAgent system with vehicles and virtual trafficpolices as intelligent Agents was constructed, and then the communication and consistency problems with general trigger system model among multiple Agents were resolved. The change of information quantity caused by induction of virtual trafficpolice and general trigger system model was also analyzed quantitatively. The method and idea described in this paper are proved efficiently by an experimental model of ground traffic.