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

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

Could chroman-4-one derivative be a better inhibitor of PTR1? – Reason for the identified disparity in its inhibitory potency in Trypanosoma brucei and Leishmania major

Most notable Kinetoplastids are of the genus Trypanosoma and Leishmania, affecting several millions of humans in Africa and Latin America. Current therapeutic options are limited by several drawbacks, hence the need to develop more efficacious inhibitors. An investigation to decipher the mechanism behind greater inhibitory potency of a chroman-4-one derivative (compound 1) in Trypanosoma brucei pteridine reductase 1 (TbPTR1) and Leishmania major pteridine reductase 1 (LmPTR1) was performed. Estimation of ΔG_bind revealed that compound 1 had a greater binding affinity in TbPTR1 with a ΔG_bind value of −49.0507 Kcal/mol than −29.2292 Kcal/mol in LmPTR1. The ΔGbind in TbPTR1 were predominantly contributed by “strong” electrostatic energy compared to the “weak” van der Waals in LmPTR1. In addition to this, the NADPH cofactor contributed significantly to the total energy of TbPTR1. A characteristic weak aromatic π interaction common in PTR1 was more prominent in TbPTR1 than LmPTR1. The consistent occurrence of high-affinity conventional hydrogen bond interactions as well as a steady interaction of crucial active site residues like Arg14/Arg17, Ser95/Ser111, Phe97/Phe113 in TbPTR1/LmPTR1 with chroman-4-one moiety equally revealed the important role the moiety played in the activity of compound 1. Overall, the structural and conformational analysis of the active site residues in TbPTR1 revealed them to be more rigid than LmPTR1. This could be the mechanism of interaction TbPTR1 employs in exerting a greater potency than LmPTR1. These findings will further give insight that will be assistive in modifying compound 1 for better potency and the design of novel inhibitors of PTR1.     

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.     

Binary functions,degeneracy, and alternating dimaps

This paper continues the study of combinatorial properties of binary functions — that is, functions $f:2^E\to ?$ such that $f(0?)=1$, where $E$ is a finite set. Binary functions have previously been shown to admit families of transforms that generalise duality, including a trinity transform, and families of associated minor operations that generalise deletion and contraction, with both these families parameterised by the complex numbers. Binary function representations exist for graphs (via the indicator functions of their cutset spaces) and indeed arbitrary matroids (as shown by the author previously). In this paper, we characterise degenerate elements – analogues of loops and coloops – in binary functions, with respect to any set of minor operations from our complex-parameterised family. We then apply this to study the relationship between binary functions and Tutte’s alternating dimaps, which also support a trinity transform and three associated minor operations. It is shown that only the simplest alternating dimaps have binary representations of the form we consider, which seems to be the most direct type of representation. The question of whether there exist other, more sophisticated types of binary function representations for alternating dimaps is left open.     

An M/G/1 Retrial Queueing System with Two-Phase Service and Preemptive Resume

An M/G/1 retrial queueing system with additional phase of service and possible preemptive resume service discipline is considered. For an arbitrarily distributed retrial time distribution, the necessary and sufficient condition for the system stability is obtained, assuming that only the customer at the head of the orbit has priority access to the server. The steady-state distributions of the server state and the number of customers in the orbit are obtained along with other performance measures. The effects of various parameters on the system performance are analysed numerically. A general decomposition law for this retrial queueing system is established.     

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…