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

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

基于电化学老化衰退模型的锂离子动力电池外特性

当前锂离子动力电池电化学模型存在模型复杂、建模难度大、计算效率低、老化评估效果差的问题,本文提出一种考虑电池衰退老化的机理模型(ADME).本文首先通过有限差分法对伪二维(P2D)电化学模型进行离散降阶处理,得到简化伪二维(SP2D)模型.在SP2D模型的基础上,基于阴阳两极发生的副反应导致的衰退老化现象,提出一种考虑电池衰退老化的机理模型.其次,使用多变量偏差补偿最小二乘法实现模型参数辨识.最后通过动力电池衰退老化性能循环实验,对比分析了恒流、脉冲工况下SP2D模型和ADME模型的终端电压输出.结果表明:ADME模型较为简单、计算效率和估算精度高,可以有效评估电池容量老化衰退,得到理想的锂离子动力电池外特性曲线.     

A volatolomic approach using cerumen as biofluid to diagnose bovine intoxication by Stryphnodendron rotundifolium

An innovative volatolomic approach employs the detection of biomarkers present in cerumen (earwax) to identify cattle intoxication by Stryphnodendron rotundifolium Mart., Fabaceae (popularly known as barbatimão). S. rotundifolium is a poisonous plant with the toxic compound undefined and widely distributed throughout the Brazilian territory. Cerumen samples from cattle of two local Brazilian breeds (‘Curraleiro Pé-Duro’ and ‘Pantaneiro’) were collected during an experimental intoxication protocol and analyzed using headspace (HS)/GC–MS followed by multivariate analysis (genetic algorithm for a partial least squares, cluster analysis, and classification and regression trees). A total of 106 volatile organic metabolites were identified in the cerumen samples of bovines. The intoxication by S. rotundifolium influenced the cerumen volatolomic profile of the bovines throughout the intoxication protocol. In this way, it was possible to detect biomarkers for cattle intoxication. Among the biomarkers, 2-octyldecanol and 9-tetradecen-1-ol were able to discriminate all samples between intoxicated and nonintoxicated bovines. The cattle intoxication diagnosis by S. rotundifolium was accomplished by applying the cerumen analysis using HS/GC–MS, in an easy, accurate, and noninvasive way. Thus, the proposed bioanalytical chromatography protocol is a useful tool in veterinary applications to determine this kind of intoxication.     

Studies on metabolism of total glucosides of paeony from Paeoniae Radix Alba in rats by UPLC‐Q‐TOF‐MS/MS

Total glucosides of paeony are the active constituents of Paeoniae Radix Alba. In this study, a novel strategy was proposed to find more metabolites and the differences between paeoniflorin, albiflorin and total glucosides of paeony (TGP). This strategy was characterized as follows: firstly, the animals were divided into three groups (paeoniflorin, albiflorin and TGP) to identify the source of TGP metabolites from paeoniflorin or albiflorin; secondly, a generic information‐dependent acquisition scan for the low‐level metabolites was triggered by the multiple mass defect filter and dynamic background subtraction; thirdly, the metabolites were identified with a combination of data‐processing methods including mass defect filtering, neutral loss filtering and product ion filtering; finally, a comparative study was used in the metabolism of paeoniflorin, albiflorin and TGP. Based on the strategy, 18 metabolites of TGP, 10 metabolites of paeoniflorin and 13 metabolites of albiflorin were identified respectively. The results indicated that the hydrolysis, conjugation reaction and oxidization were the major metabolic pathways, and the metabolic sites were the glycosidic linkage, the ester bond and the benzene ring. This study is first to explore the metabolism of TGP, and these findings enhance our understanding of the metabolism and the interactions of paeoniflrin and albiflorin in TGP. Copyright © 2015 John Wiley & Sons, Ltd.     

Wavelet Collocation Methods for a First Kind Boundary Integral Equation in Acoustic Scattering

In this paper we consider a wavelet algorithm for the piecewise constant collocation method applied to the boundary element solution of a first kind integral equation arising in acoustic scattering. The conventional stiffness matrix is transformed into the corresponding matrix with respect to wavelet bases, and it is approximated by a compressed matrix. Finally, the stiffness matrix is multiplied by diagonal preconditioners such that the resulting matrix of the system of linear equations is well conditioned and sparse. Using this matrix, the boundary integral equation can be solved effectively.     

ON THE CONVERGENCE OF MULTIPLICATIVE ITERATIVE ALGORITHMS WITH INEXACT LINE SEARCH

1.IntroductionIntillspaperweanalyzetheconvergenceonmultiplicativeiterativealgorithmsfortheIninimizationofadiffcrentiablefunctiondefinedonthepositiveorthantofR".ThealgorithmissllggestedbyEggermolltl'],andisrelatedtotheEM[2](Expextation--Maximization)algoritllnlforPositronemissiontonlography[']andimagereconstructi..14].Wecollsidertheproblenl"linf(x)s.t.x20.Themultiplicativeiterativealgorithmshavethel'orlniforj=l,2,',n,withAhdeterminedthroughalinesearch.Whilelusem[5]establishedanelegantconv…     

Numerical integration of ordinary differential equations on manifolds

Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions” defined by nonvanishing Lie brackets.     

Local and Parallel Finite Element Algorithms for Eigenvalue Problems

Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids.     

Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.