基于GA_XGBoost模型的大学生科研能力预测问题研究

科学评价大学生科研创新能力对我国科研水平的提高具有重要意义.采用机器学习模型来预测大学生科研能力可以起到良好的效果,提出一种GAXGBoost模型来实现对大学生的科研能力预测.此模型是以Xgboost算法为基础,然后充分利用遗传算法的全局搜索能力自动搜索Xgboost最优超参数,避免了人为经验调参不准确的缺陷,最后采用精英选择策略以此确保每一轮都是最佳的进化结果.通过分析表明,所采用的GAXGBoost模型在大学生科研能力预测的结果中具有很高的精度,将此模型与Logistic Regression、Random Forest、SVM等模型进行对比,GAXGBoost模型的预测精度最高.     

Distribution dependent stochastic differential equations

Due to their intrinsic link with nonlinear Fokker-Planck equations and many other applications, distribution dependent stochastic differential equations (DDSDEs) have been intensively investigated. In this paper, we summarize some recent progresses in the study of DDSDEs, which include the correspondence of weak solutions and nonlinear Fokker-Planck equations, the well-posedness, regularity estimates, exponential ergodicity, long time large deviations, and comparison theorems.     

移动加热器法生长碲锌镉晶体的组分输运与界面形貌研究

移动加热器法(THM)生长碲锌镉晶体时,界面稳定性对晶体生长的质量有很大影响。本文基于多物理场有限元仿真软件Comsol建立了THM生长碲锌镉晶体的数值模拟模型,讨论了Te边界层与组分过冷区之间的关系,对不同生长阶段的物理场、Te边界层与组分过冷区进行仿真研究,最后讨论了微重力对物理场分布的影响,并对比了微重力与正常重力下的生长界面形貌。模拟结果表明,Te边界层与组分过冷区的分布趋势是一致的,在不同生长阶段,流场中次生涡旋的位置会发生移动,从而导致生长界面的形貌随着生长的进行发生变化,同时微重力条件下形成的生长界面形貌最有利于单晶生长。因此,在晶体生长的中前期,对次生涡旋位置的控制和对组分过冷的削弱,是THM生长高质量晶体的有效方案。     

Nonlinear elastic constitutive relations of residually stressed composites with stiff curved fibres

Applied Mathematics and Mechanics - Mechanical models of residually stressed fibre-reinforced solids, which do not resist bending, have been developed in the literature. However, in some residually...     

Quantum algorithm for neighborhood preserving embedding

Neighborhood preserving embedding (NPE) is an important linear dimensionality reduction technique that aims at preserving the local manifold structure. NPE contains three steps, i.e., finding the nearest neighbors of each data point, constructing the weight matrix, and obtaining the transformation matrix. Liang et al. proposed a variational quantum algorithm (VQA) for NPE [Phys. Rev. A 101 032323 (2020)]. The algorithm consists of three quantum sub-algorithms, corresponding to the three steps of NPE, and was expected to have an exponential speedup on the dimensionality n. However, the algorithm has two disadvantages: (i) It is not known how to efficiently obtain the input of the third sub-algorithm from the output of the second one. (ii) Its complexity cannot be rigorously analyzed because the third sub-algorithm in it is a VQA. In this paper, we propose a complete quantum algorithm for NPE, in which we redesign the three sub-algorithms and give a rigorous complexity analysis. It is shown that our algorithm can achieve a polynomial speedup on the number of data points m and an exponential speedup on the dimensionality n under certain conditions over the classical NPE algorithm, and achieve a significant speedup compared to Liang et al.'s algorithm even without considering the complexity of the VQA.