Hyperparameter on-line learning of stochastic resonance based threshold networks

Aiming at training the feed-forward threshold neural network consisting of nondifferentiable activation functions, the approach of noise injection forms a stochastic resonance based threshold network that can be optimized by various gradient-based optimizers. The introduction of injected noise extends the noise level into the parameter space of the designed threshold network, but leads to a highly non-convex optimization landscape of the loss function. Thus, the hyperparameter on-line learning procedure with respective to network weights and noise levels becomes of challenge. It is shown that the Adam optimizer, as an adaptive variant of stochastic gradient descent, manifests its superior learning ability in training the stochastic resonance based threshold network effectively. Experimental results demonstrate the significant improvement of performance of the designed threshold network trained by the Adam optimizer for function approximation and image classification.     

基于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.     

紫色球杆菌视紫红质光谱特性的机器学习研究

近年来，机器学习等人工智能技术被应用于蛋白质工程，其在蛋白质结构、功能预测、催化活性等研究中具有独特优势。在未知蛋白质结构的情况下，将蛋白质序列和功能特性与机器学习相结合，基于序列-活性关系（innovative sequence-activity relationship，ISAR）算法，将蛋白质氨基酸序列数字化，用快速傅里叶变换（fast four transform，FFT）进行预处理，再进行偏最小二乘回归建模，可在数据集较少情况下拟合得到最佳模型。通过机器学习对紫色球杆菌视紫红质（gloeobacter violaceus rhodopsin，GR）的突变体蛋白质氨基酸序列与光谱最大吸收波长进行建模，获得了最佳模型。用最佳索引LEVM760106建模得到的确定系数R² 为0.944，均方误差E为11.64。用小波变换进行的预处理，其R² 虽也约为0.944，但E大于11.64，不及FFT进行的预处理。方法较好地解决了蛋白质序列与功能特性之间的数学建模问题，在蛋白质工程中可为预测更优的突变体提供支持。     

基于深度学习的ELM实时识别研究

基于深度学习的方法，在HL-2A装置上开发出了一套边缘局域模(ELM)实时识别算法。算法使用5200次放电数据(约24.19万数据切片)进行学习，得到一个深度为22层的卷积神经网络。为衡量算法的识别能力，识别了HL-2A装置自2009年实现稳定ELMy H模放电以来所有历史数据(约26000次放电数据)，共识别出1665次H模放电，其中误识别35次，误报率为2.10%。在实际的1634次H模放电中，漏识别4次，漏识别率为0.24%。该误报率和漏报率可以满足ELM实时识别的精度要求。识别算法在实时控制环境下，对单个时间点的平均计算时间为0.46ms，可以满足实时控制的计算速度要求。     

ESTIMATING EXTREME-VALUE INDEX FROM RECORDS

1.IntroductionLet{X.,n21}beasequenceoflidry'swithanondegeneratedistributionfunctionF(x).Supposethereexistsomeconstantsan>0,b.6RandsomeacERsuchthatwhereG.standsforoneoftheextremevaluedistributions:Heretheindex7ERisarealparameter(interpret(1 box)--'/ryase--"for7~0).Theestimationoftheextreme-valueindex7isveryimportantbothintheextremevaluetheoryandinpractice.Manystatistics,suchasHillestimator(forcaseac>0),PickandsestimatorandDekkers-EinmahLdeHaan'smomentestimatorwhicharebasedonafinitesample,…     

可重构制造系统重组过程中设备选择模型的研究

根据生产任务选择加工设备进行制造资源重组是实现可重构制造系统的关键问题之一，由于设备的选择涉及到多种因素，既有定量指标，又有定性指标，传统的依靠人工经验的方法显得力不从心。本文首先结合实际情况，提出了一套设备选择评价体系，通过对模糊判断矩阵采用最小对数二乘法确定各评价因素的权重系数，针对定性指标和定量指标采用不同的方法确定其性能指标值，通过模糊积分对评判指标进行综合评判，最后进行了实例研究。所提出的方法有效地简化了决策过程，为可重构制造系统设备选择提供了一套行之有效的方法。     

A new family of proximity graphs: Class cover catch digraphs

Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs—class cover catch digraphs (CCCDs). CCCDs are a special case of catch digraphs. Solving the underlying CCP is equivalent to finding a smallest cardinality dominating set for the associated CCCD, which in turn provides regularization for statistical pattern classification. Some relevant properties of CCCDs are studied and a characterization of a family of CCCDs is given.