Machine learning algorithm selection for windage alteration fault diagnosis of mine ventilation system

Machine learning algorithms have been widely used in mine fault diagnosis. The correct selection of the suitable algorithms is the key factor that affects the fault diagnosis. However, the impact of machine learning algorithms on the prediction performance of mine fault diagnosis models has not been fully evaluated. In this study, the windage alteration faults (WAFs) diagnosis models, which are based on K-nearest neighbor algorithm (KNN), multi-layer perceptron (MLP), support vector machine (SVM), and decision tree (DT), are constructed. Furthermore, the applicability of these four algorithms in the WAFs diagnosis is explored by a T-type ventilation network simulation experiment and the field empirical application research of Jinchuan No. 2 mine. The accuracy of the fault location diagnosis for the four models in both networks was 100%. In the simulation experiment, the mean absolute percentage error (MAPE) between the predicted values and the real values of the fault volume of the four models was 0.59%, 97.26%, 123.61%, and 8.78%, respectively. The MAPE for the field empirical application was 3.94%, 52.40%, 25.25%, and 7.15%, respectively. The results of the comprehensive evaluation of the fault location and fault volume diagnosis tests showed that the KNN model is the most suitable algorithm for the WAFs diagnosis, whereas the prediction performance of the DT model was the second-best. This study realizes the intelligent diagnosis of WAFs, and provides technical support for the realization of intelligent ventilation.     

基于多通道的ICU脑血管疾病死亡风险预测模型

死亡风险预测指根据病人临床体征监测数据来预测未来一段时间的死亡风险。对于ICU病患，通过死亡风险预测可以有针对性地对病人做出临床诊断，以及合理安排有限的医疗资源。基于临床使用的MEWS和Glasgow昏迷评分量表，针对ICU病人临床监测的17项生理参数，提出一种基于多通道的ICU脑血管疾病死亡风险预测模型。引入多通道概念应用于BiLSTM模型，用于突出每个生理参数对死亡风险预测的作用。采用Attention机制用于提高模型预测精度。实验数据来自MIMIC [Ⅲ]数据库，从中提取3?080位脑血管疾病患者的16?260条记录用于此次研究，除了六组超参数实验之外，将所提模型与LSTM、Multichannel-BiLSTM、逻辑回归（logistic regression）和支持向量机（support vector machine, SVM）四种模型进行了对比分析，准确率Accuracy、灵敏度Sensitive、特异性Specificity、AUC-ROC和AUC-PRC作为评价指标，实验结果表明，所提模型性能优于其他模型，AUC值达到94.3%。     

Designing optical glasses by machine learning coupled with a genetic algorithm

Engineering new glass compositions have experienced a sturdy tendency to move forward from (educated) trial-and-error to data- and simulation-driven strategies. In this work, we developed a computer program that combines data-driven predictive models (in this case, neural networks) with a genetic algorithm to design glass compositions with desired combinations of properties. First, we induced predictive models for the glass transition temperature (T_g) using a dataset of 45,302 compositions with 39 different chemical elements, and for the refractive index (n_d) using a dataset of 41,225 compositions with 38 different chemical elements. Then, we searched for relevant glass compositions using a genetic algorithm informed by a design trend of glasses having high n_d (1.7 or more) and low T_g (500 °C or less). Two candidate compositions suggested by the combined algorithms were selected and produced in the laboratory. These compositions are significantly different from those in the datasets used to induce the predictive models, showing that the used method is indeed capable of exploration. Both glasses met the constraints of the work, which supports the proposed framework. Therefore, this new tool can be immediately used for accelerating the design of new glasses. These results are a stepping stone in the pathway of machine learning-guided design of novel glasses.     

基于改进D?Lite遗传算法路径规划研究

针对遗传算法在移动机器人路径规划中易产生早熟现象和收敛速度慢的问题,提出了改进的D~* Lite遗传算法。该算法将D~* Lite算法和遗传算法相结合,通过引入碰撞系数和可视检测技术以提高路径安全性,寻找最短路径。在遗传算法设计中加入动态调整交叉与变异概率,以解决算法在路径规划中因陷入局部最优值而不能到达目标点的问题。最后,通过实验仿真可知:与蚁群算法和免疫遗传算法相比,改进的D~* Lite遗传算法执行效率高,可以快速规划出全局最优路径。     

Automatic generation of variants depending on changes of product properties in a flexible manufacturing environment

Competition forces manufacturing systems to be flexible and to increase product variety and process complexity. These tasks depend on the flexible design of a bill of materials (BOM), one of the most important inputs in manufacturing planning and control systems. Product variety forces systems to generate BOMs with regard to product properties through a BOM pattern. A variant bill of materials provides a structure to manage product variability. In this study, an algorithm is designed to build a BOM pattern using computer-aided design and computer-aided manufacturing (CAD/CAM) data, and another algorithm is designed to generate variants with regard to product specifications. Genetic algorithm is used to generate new products to provide high product variability for testing algorithms. After the test, both algorithms are applied to a real industry problem. The BOM pattern is built automatically using CAD/CAM data, and variants are generated with regard to the pattern, and the results are discussed.     

Earliness–tardiness minimization on scheduling a batch processing machine with non-identical job sizes

This paper considers the scheduling problem of minimizing earliness–tardiness (E/T) on a single batch processing machine with a common due date. The problem is extended to the environment of non-identical job sizes. First, a mathematical model is formulated, which is tested effectively under IBM ILOG CPLEX using the constraint programming solver. Then several optimal properties are given to schedule batches effectively, and by introducing the concept of ARB (Attribute Ratio of Batch), it is proven that the ARB of each batch should be made as small as possible in order to minimize the objective, designed as the heuristic information for assigning jobs into batches. Based on these properties, a heuristic algorithm MARB (Minimum Attribute Ratio of Batch) for batch forming is proposed, and a hybrid genetic algorithm is developed for the problem under study by combining GA (genetic algorithm) with MARB. Experimental results demonstrate that the proposed algorithm outperforms other algorithms in the literature, both for small and large problem instances.     

多先验融合的图像显著性目标检测算法

为了更加准确地检测出图像中的显著性目标，提出了多先验融合的显著性目标检测算法。针对传统中心先验对偏离图像中心的显著性目标会出现检测失效的情况，提出在多颜色空间下求显著性目标的最小凸包交集来确定目标的大致位置，以凸包区域中心计算中心先验。同时通过融合策略将凸包区域中心先验、颜色对比先验和背景先验融合并集成到特征矩阵中。最后通过低秩矩阵恢复模型生成结果显著图。在公开数据集MSRA1000和ESSCD上的仿真实验结果表明，MPLRR能够得到清晰高亮的显著性目标视觉效果图，同时F，AUC，MAE等评价指标也比现有的许多方法有明显提升。     

（S）-噻吗洛尔半水合物的合成及表征

为了开发β受体阻断剂新药（S）-噻吗洛尔半水合物，采用3-吗啉-4-氯-1，2，5-噻二唑为起始原料，经水解反应得到中间体1（3-吗啉-4-羟基-1，2，5-噻二唑）。中间体1与R-环氧氯丙烷发生醚化反应，经后处理及重结晶得到中间体2 {（R）-4-［4-（环氧乙烷-2-基甲氧基）-1，2，5-噻二唑-3-基］吗啉}。中间体2经胺化反应、马来酸成盐及重结晶得到（S）-马来酸噻吗洛尔。（S）-马来酸噻吗洛尔经游离、纯水转晶得到符合药典标准的（S）-噻吗洛尔半水合物，总收率14.05%且e.e.值为99.66%。最终成品经IR、1H-NMR、13C-NMR、MS、TGA、DSC表征，并优化各步反应条件。结果表明:以三乙胺为醚化反应缚酸剂75 ℃反应最佳；以乙醇为胺化反应溶剂46 ℃反应16 h最佳；S-噻吗洛尔的转晶拆分以水作溶剂，比传统不对称合成工艺安全稳定，操作简单，适合工业化生产。     

Evolutionary collective behavior decomposition model for time series data mining

In this research, we propose a novel framework referred to as collective game behavior decomposition where complex collective behavior is assumed to be generated by aggregation of several groups of agents following different strategies and complexity emerges from collaboration and competition of individuals. The strategy of an agent is modeled by certain simple game theory models with limited information. Genetic algorithms are used to obtain the optimal collective behavior decomposition based on history data. The trained model can be used for collective behavior prediction. For modeling individual behavior, two simple games, the minority game and mixed game are investigated in experiments on the real-world stock prices and foreign-exchange rate. Experimental results are presented to show the effectiveness of the new proposed model.     

An adaptive image steganographic scheme based on Noise Visibility Function and an optimal chaotic based encryption method

Steganography is the science of hiding secret message in an appropriate digital multimedia in such a way that the existence of the embedded message should be invisible to anyone apart from the sender or the intended recipient. This paper presents an irreversible scheme for hiding a secret image in the cover image that is able to improve both the visual quality and the security of the stego-image while still providing a large embedding capacity. This is achieved by a hybrid steganography scheme incorporates Noise Visibility Function (NVF) and an optimal chaotic based encryption scheme. In the embedding process, first to reduce the image distortion and to increase the embedding capacity, the payload of each region of the cover image is determined dynamically according to NVF. NVF analyzes the local image properties to identify the complex areas where more secret bits should be embedded. This ensures to maintain a high visual quality of the stego-image as well as a large embedding capacity. Second, the security of the secret image is brought about by an optimal chaotic based encryption scheme to transform the secret image into an encrypted image. Third, the optimal chaotic based encryption scheme is achieved by using a hybrid optimization of Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) which is allowing us to find an optimal secret key. The optimal secret key is able to encrypt the secret image so as the rate of changes after embedding process be decreased which results in increasing the quality of the stego-image. In the extracting process, the secret image can be extracted from the stego-image losslessly without referring to the original cover image. The experimental results confirm that the proposed scheme not only has the ability to achieve a good trade-off between the payload and the stego-image quality, but also can resist against the statistics and image processing attacks.