What is the optimal cutoff surface for ore bodies with more than one mineral?

In mine planning problems, cutoff grade optimization defines a threshold at every time period such that material above this value is processed, and the rest is considered waste. In orebodies with multiple minerals, which occur in practice, the natural extension is to consider a cutoff surface. We show that in two dimensions the optimal solution is a line, and in n dimensions it is a hyperplane.     

基于深度学习的中医古文献临床经验抽取

中医古文献蕴藏着丰富的临床经验，是古代中医在行医过程中对临床诊疗的经验性总结，体现了中医学形成和发展的理论框架和思想基础.然而这些宝贵的临床经验不仅量大，而且分散在不同的文献中，使得中医从业者手工很难快速全面地获取它们，文献检索工具也只能提供文档级别的信息筛选，无法为这种细粒度的信息获取提供支持.此外，古汉语相对于现代汉语的不同特点也限制了主流文本分析工具的使用效果.为此本文提出面向临床经验获取的中医古文献信息抽取任务，用于识别古文献中描述临床经验的文本片段，手工标注了样本数据用于这种抽取模型的训练和测试，并设计了基于深度学习的序列标注器用于完成该任务.考虑到标注数据量小可能带来的过度拟合问题，本文引入对抗训练和虚拟对抗训练来增强模型的泛化能力.一系列充分的实验验证了模型的有效性，表明利用信息抽取技术从古文献获取中医临床经验具有可行性，为这一新的信息抽取任务提供了有希望的研究基线和可复用的标注数据集.     

The Picone identity: A device to get optimal uniqueness results and global dynamics in Population Dynamics

This paper infers from a generalized Picone identity the uniqueness of the stable positive solution for a class of semilinear equations of superlinear indefinite type, as well as the uniqueness and global attractivity of the coexistence state in two generalized diffusive prototypes of the symbiotic and competing species models of Lotka–Volterra. The optimality of these uniqueness theorems reveals the tremendous strength of the Picone identity.     

An efficient edge based data structure for the compressible Reynolds-averaged Navier–Stokes equations on hybrid unstructured meshes

An efficient edge based data structure has been developed in order to implement an unstructured vertex based finite volume algorithm for the Reynolds-averaged Navier–Stokes equations on hybrid meshes. In the present approach, the data structure is tailored to meet the requirements of the vertex based algorithm by considering data access patterns and cache efficiency. The required data are packed and allocated in a way that they are close to each other in the physical memory. Therefore, the proposed data structure increases cache performance and improves computation time. As a result, the explicit flow solver indicates a significant speed up compared to other open-source solvers in terms of CPU time. A fully implicit version has also been implemented based on the PETSc library in order to improve the robustness of the algorithm. The resulting algebraic equations due to the compressible Navier–Stokes and the one equation Spalart–Allmaras turbulence equations are solved in a monolithic manner using the restricted additive Schwarz preconditioner combined with the FGMRES Krylov subspace algorithm. In order to further improve the computational accuracy, the multiscale metric based anisotropic mesh refinement library PyAMG is used for mesh adaptation. The numerical algorithm is validated for the classical benchmark problems such as the transonic turbulent flow around a supercritical RAE2822 airfoil and DLR-F6 wing-body-nacelle-pylon configuration. The efficiency of the data structure is demonstrated by achieving up to an order of magnitude speed up in CPU times.     

Regularity of optimal sets for some functional involving eigenvalues of an operator in divergence form

In this paper we consider minimizers of the functional$\min \{{\lambda }_1(\mathrm{\Omega })+\cdots +{\lambda }_k(\mathrm{\Omega })+\mathrm{\Lambda }|\mathrm{\Omega }|,:\mathrm{\Omega }\subset D\text{ open}\}$ where $D\subset {\mathbb{R}}^d$ is a bounded open set and where $0<{\lambda }_1(\mathrm{\Omega })\le \cdots \le {\lambda }_k(\mathrm{\Omega })$ are the first k eigenvalues on Ω of an operator in divergence form with Dirichlet boundary condition and with Hölder continuous coefficients. We prove that the optimal sets ${\mathrm{\Omega }}^{⁎}$ have finite perimeter and that their free boundary $\partial {\mathrm{\Omega }}^{⁎}\cap D$ is composed of a regular part, which is locally the graph of a $C^{1,\alpha }$-regular function, and a singular part, which is empty if $d<d^{⁎}$, discrete if $d=d^{⁎}$ and of Hausdorff dimension at most $d-d^{⁎}$ if $d>d^{⁎}$, for some $d^{⁎}\in \{5,6,7\}$.     

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

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

Prediction of the drag reduction effect of pulsating pipe flow based on machine learning

Prediction of drag reduction effect caused by pulsating pipe flows is examined using machine learning. First, a large set of flow field data is obtained experimentally by measuring turbulent pipe flows with various pulsation patterns. Consequently, more than 7000 waveforms are applied, obtaining a maximum drag reduction rate and maximum energy saving rate of 38.6% and 31.4%, respectively. The results indicate that the pulsating flow effect can be characterized by the pulsation period and pressure gradient during acceleration and deceleration. Subsequently, two machine learning models are tested to predict the drag reduction rate. The results confirm that the machine learning model developed for predicting the time variation of the flow velocity and differential pressure with respect to the pump voltage can accurately predict the nonlinearity of pressure gradients. Therefore, using this model, the drag reduction effect can be estimated with high accuracy.