Dynamic Analogical Association Algorithm Based on Manifold Matching for Few-Shot Learning

At present,deep learning has been well applied in many fields.However,due to the high complexity of hypothesis space,numerous training samples are usually required to ensure the reliability of minimizing experience risk.Therefore,training a classifier with a small number of training examples is a challenging task.From a biological point of view,based on the assumption that rich prior knowledge and analogical association should enable human beings to quickly distinguish novel things from a few or even one example,we proposed a dynamic analogical association algorithm to make the model use only a few labeled samples for classification.To be specific,the algorithm search for knowledge structures similar to existing tasks in prior knowledge based on manifold matching,and combine sampling distributions to generate offsets instead of two sample points,thereby ensuring high confidence and significant contribution to the classification.The comparative results on two common benchmark datasets substantiate the superiority of the proposed method compared to existing data generation approaches for few-shot learning,and the effectiveness of the algorithm has been proved through ablation experiments.

A Novel Method of Heart Failure Prediction Based on DPCNN-XGBOOST Model

The occurrence of perioperative heart failure will affect the quality of medical services and threaten the safety of patients.Existing methods depend on the judgment of doctors,the results are affected by many factors such as doctors’knowledge and experience.The accuracy is difficult to guarantee and has a serious lag.In this paper,a mixture prediction model is proposed for perioperative adverse events of heart failure,which combined with the advantages of the Deep Pyramid Convolutional Neural Networks(DPCNN)and Extreme Gradient Boosting(XGBOOST).The DPCNN was used to automatically extract features from patient’s diagnostic texts,and the text features were integrated with the preoperative examination and intraoperative monitoring values of patients,then the XGBOOST algorithm was used to construct the prediction model of heart failure.An experimental comparison was conducted on the model based on the data of patients with heart failure in southwest hospital from 2014 to 2018.The results showed that the DPCNN-XGBOOST model improved the predictive sensitivity of the model by 3%and 31%compared with the text-based DPCNN Model and the numeric-based XGBOOST Model.

OBTAINING EXACT INTERPOLATION MULTIVARIATE POLYNOMIAL BY APPROXIMATION

In some fields such as Mathematics Mechanization, automated reasoning and Trustworthy Computing, etc., exact results are needed. Symbolic computations are used to obtain the exact results. Symbolic computations are of high complexity. In order to improve the situation, exact interpolating methods are often proposed for the exact results and approximate interpolating methods for the ap- proximate ones. In this paper, the authors study how to obtain exact interpolation polynomial with rational coefficients by approximate interpolating methods.

STRUCTURAL ANALYSIS OF HIGH-INDEX DAE FOR PROCESS SIMULATION

This paper deals with the structural analysis problem of dynamic lumped process high-index differential algebraic equations(DAE)models.The existing graph theoretical method depends on the change in the relative position of underspecified and overspecified subgraphs and has an effect to the value of the differential index for complex models.In this paper,we consider two methods for index reduction of such models by differentiation:Pryce’s method and the symbolic differential elimination algorithm rifsimp.They can remedy the above drawbacks.Discussion and comparison of these methods are given via a class of fundamental process simulation examples.In particular,the efficiency of Pryce’s method is illustrated as a function of the number of tanks in process design.Moreover,a range of nontrivial problems are demonstrated by the symbolic differential elimination algorithm and fast prolongation.