In order to solve the problems of the insufficient mining of relationship among inter-disease joint effects and readmission and the weak generalization ability of related models， a readmission prediction model based on graph contrastive learning was proposed， called HealthGraph. Firstly， the disease co-occurrence information in the dataset was used to construct a disease code map， so that the correlation information among diseases was fully explored. Then， a patient data augmentation method was proposed with the guidance of the idea of graph contrastive learning， and the topology related to the task was captured by the graph sampler adaptively， and a new view was constructed to improve the data richness， thereby improving generalization performance of the model. Finally， readmission prediction was carried out by combining the initial disease code map embedding and the new view embedding. The respiratory and circulatory system diseases datasets were constructed on real dataset MIMIC-Ⅲ and extensive experiments were conducted. The results show that compared with REverse Time AttentIoN model （RETAIN） and the Stage-aware neural Network model （StageNet）， the proposed model has the accuracy and F1 indicators improved by about 1 percentage point. In addition， results of two groups of ablation experiments verify the effectiveness of the proposed model in improving the accuracy and generalization of readmission prediction.

To decrease the time of classifier design and training, a new method combining the Clonal Selection Algorithm and K Nearest Neighbor (CSA+KNN) was proposed. Having the image preprocessed and getting the comprehensive features information from geometry and texture feature, the CSA+KNN was used to train and classify the plant leaf samples. The plant leaf database with 100 leaf species was applied to test the proposed algorithm, and the recognition accuracy was 91.37%. Compared with other methods, the experimental results demonstrate the efficiency, accuracy and high training speed of the proposed method, and verify the significance of texture features in leaf recognition. CSA+KNN method broadens the field of plant leaf recognition method, and it can be applied to create digitalized plant specimens museum.

For solving combinational optimization problems, a Binary Harmony Search Algorithm (BHSA) based on three discrete operators of Harmony Search Algorithm （HSA）was proposed. Then, BHSA was used to solve the famous k-SAT problem and 0-1 knapsack problem. The numeral results of BHSA, Binary Particle Swarm Optimization （BPSO） and Genetic Algorithm (GA) show that the BHSA is feasible and highly efficient.