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.     

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

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

基于联合神经网络学习的中文电力计量命名实体识别

随着电力计量业务的不断扩展，迫切需要由业务信息、技术知识、行业标准及其内在联系所组成的电力计量知识图谱，为电网的决策和发展提供更为全面有效的支持。命名实体识别是构建知识图谱的基础。针对电力计量领域需要，结合中文分词技术特点，基于联合学习思想，提出了一种基于联合学习的中文电力计量命名实体识别技术。该技术联合CNN-BLSTM-CRF模型与整合词典知识的分词模型，使其共享实体类别和置信度；同时将2个模型的先后计算顺序改为并行计算，减少了识别误差累积。结果表明，在不需要人工构建特征的情况下，方法的正确率、召回率、F值等均显著优于以往方法。     

游客情感计算的文本大数据挖掘方法比较研究

旅游文本大数据以其方便、快捷和低门槛的特点为游客情感计算提供了极大便利，已经成为旅游大数据的主要来源之一。基于大数据理论和情感理论，以文本大数据为数据源，在全面梳理国内外情感计算相关成果的基础上，利用人工智能中的逻辑/算法编程方法、机器学习方法、深度学习方法对旅游文本大数据进行挖掘，探索最佳的基于文本大数据的游客情感计算方法。研究发现：（1）基于情感词典的游客情感计算模型，其核心是构建情感词典和设计情感计算规则，方法简单，容易实现，适用语料范围广。（2）机器学习，用统计学方法抽取文本中的特征项，具有非线性特征，可靠性较线性特征的情感词典方法高。（3）基于深度学习技术的游客情感计算，效果良好，准确率在85%以上。训练多领域的文本语料易于移植，实用性强，且泛化能力好，较适合大数据时代游客情感计算研究。     

Application of Machine Learning for Tool Condition Monitoring in Turning

The machining process is primarily used to remove material using cutting tools. Any variation in tool state affects the quality of a finished job and causes disturbances. So, a tool monitoring scheme (TMS) for categorization and supervision of failures has become the utmost priority. To respond, traditional TMS followed by the machine learning (ML) analysis is advocated in this paper. Classification in ML is supervised based learning method wherein the ML algorithm learn from the training data input fed to it and then employ this model to categorize the new datasets for precise prediction of a class and observation. In the current study, investigation on the single point cutting tool is carried out while turning a stainless steel (SS) workpeice on the manual lathe trainer. The vibrations developed during this activity are examined for failure-free and various failure states of a tool. The statistical modeling is then incorporated to trace vital signs from vibration signals. The multiple-binary-rule-based model for categorization is designed using the decision tree. Lastly, various tree-based algorithms are used for the categorization of tool conditions. The Random Forest offered the highest classification accuracy, i.e., 92.6%.

     

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.     

Evaluation of green and efficient deep eutectic solvents as media for extracting alkaloids from lotus leaf

Deep eutectic solvents (DESs) were applied as eco-friendly solvents in this study for the extraction of alkaloids from lotus leaf, including O-nornuciferine, N-nornuciferine, nuciferine and roemerine. A series of hydrophilic and hydrophobic DESs with different hydrogen bond donors and a acceptors were synthesized and screened for a suitable DESs for extraction of alkaloids from lotus leaf. The study results showed that the hydrophilic DES with choline chloride and propanediol had the highest extraction yield. The main factors affecting the extraction efficiency—choline chloride–propanediol ratio, water content in deep eutectic solvents, solid–liquid ratio and extraction time—were investigated via a single-factor experiment. The optimized extraction conditions were 30% of water in choline chloride–propanediol (1:4) for heated extraction for 30 min and solid–liquid ratio 1:100 g/ml. Under optimum conditions, the extraction yields of O-nornuciferine, N-nornuciferine, nuciferine and roemerine were 0.069, 0.152, 0.334 and 0.041 g/100 g respectively, which were higher than those of methanol in acidified aqueous solution. This study suggests considerable potential for DESs as promising materials for the green and efficient extraction solvents for bioactive alkaloids from natural sources.     

基于快速神经网络架构搜索的鲁棒图像水印网络算法

为解决深度学习在图像水印算法中计算量大且模型冗余的问题，提高图像水印算法在抵抗噪声、旋转和剪裁等攻击时的鲁棒性，提出基于快速神经网络架构搜索（neural architecture search，NAS）的鲁棒图像水印网络算法。通过多项式分布学习快速神经网络架构搜索算法，在预设的搜索空间中搜索最优网络结构，进行图像水印的高效嵌入与鲁棒提取。首先，将子网络中线性连接的全卷积层设置为独立的神经单元结构，并参数化表示结构单元内节点的连接，预先设定结构单元内每个神经元操作的搜索空间；其次，在完成一个批次的数据集训练后，依据神经元操作中的被采样次数和平均损失函数值动态更新概率；最后，重新训练搜索完成的网络。水印网络模型的参数量较原始网络模型缩减了92%以上，大大缩短了模型训练时间。由于搜索得到的网络结构更为紧凑，本文算法具有较高的时间性能和较好的实验效果，在隐藏图像时，对空域信息的依赖比原始网络更少。对改进前后的2个网络进行了大量鲁棒性实验，对比发现，本文算法在CIFAR-10数据集上对抵抗椒盐噪声和旋转、移除像素行（列）等攻击优势显著；在ImageNet数据集上对抵抗椒盐高斯噪声、旋转、中值滤波、高斯滤波、JPEG压缩、裁剪等攻击优势显著，特别是对随机移除行（列）和椒盐噪声有较强的鲁棒性。     

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.     

RNAGCN: RNA tertiary structure assessment with a graph convolutional network

RNAs play crucial and versatile roles in cellular biochemical reactions. Since experimental approaches of determining their three-dimensional (3D) structures are costly and less efficient, it is greatly advantageous to develop computational methods to predict RNA 3D structures. For these methods, designing a model or scoring function for structure quality assessment is an essential step but this step poses challenges. In this study, we designed and trained a deep learning model to tackle this problem. The model was based on a graph convolutional network (GCN) and named RNAGCN. The model provided a natural way of representing RNA structures, avoided complex algorithms to preserve atomic rotational equivalence, and was capable of extracting features automatically out of structural patterns. Testing results on two datasets convincingly demonstrated that RNAGCN performs similarly to or better than four leading scoring functions. Our approach provides an alternative way of RNA tertiary structure assessment and may facilitate RNA structure predictions. RNAGCN can be downloaded from https://gitee.com/dcw-RNAGCN/rnagcn.