Effect of Fe2+ and Fe0 Applied Photo‐Fenton Processes on Sludge Disintegration

The disintegration of waste active sludge was investigated by photo‐Fenton processes. A batch study was conducted to evaluate parameters, such as Fe²⁺ and Fe⁰ ions and H₂O₂, governing the activated sludge integration by the photo‐Fenton process. Under optimum conditions, the concentration of soluble chemical oxygen demand (SCOD) with the classical Fenton process (CFP) increased very rapidly in the first five minutes due to the sufficient presence of reaction components in the medium, and then the rate of increase declined. In the modified Fenton process (FTP), the SCOD concentration increased more slowly as metallic iron powder must first be dissolved. The photo‐Fenton process proved to be a feasible and efficient process for the disintegration of waste sludge.     

Application of artificial neural network method to predict the breakage properties of PGE bearing chromite ore

In the present investigation, systematic grinding experiments were conducted in a laboratory ball mill to determine the breakage properties of low-grade PGE bearing chromite ore. The population balance modeling technique was used to study the breakage parameters such as primary breakage distribution (B_{i, j}) and the specific rates of breakage (S_i). The breakage and selection function values were determined for six feed sizes. The results stated that the breakage follows the first-order grinding kinetics for all the feed sizes. It was observed that the coarser feed sizes exhibit higher selection function values than the finer feed size. Further, an artificial neural network was used to predict breakage characteristics of low-grade PGE bearing chromite ore. The predicted results obtained from the neural network modeling were close to the experimental results with a correlation of determination R² = 0.99 for both product size and selection function.     

基于多通道的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%。     

改进的CAGAN在虚拟试衣中的应用

针对CAGAN（Conditional Analogy GAN）换衣后效果模糊，在目标衣服与原始衣服长短不一致时效果一般，相对目标衣服保留过少的细节等问题做了相关研究并对CAGAN进行了改进，提出了新的虚拟试衣方式。经过改进的CAGAN生成一个粗糙的结果，由该结果得到目标衣服穿在模特身上改变形状后的mask，接下来利用mask对目标衣服进行变形，综合变形的衣服和第一步的结果便得到最终的试衣图像。实验结果表明，该方法解决了前面存在的问题，而且取得了非常好的效果。     

改性聚乳酸发泡技术研究进展

综述了近几年国内外改性聚乳酸（PLA）发泡技术的研究进展，针对PLA在发泡方面熔体强度和结晶性能的不足，介绍了通过加入扩链剂、交联剂、成核剂、纤维和其他聚合物等物质来改善PLA发泡性能的方法、效果和机理；最后，对改性聚乳酸发泡技术的未来发展进行了展望。     

变分自编码器模型综述

变分自编码器（VAE）作为深度隐空间生成模型的一种，近年来其表现性能取得了极大的成功，尤其是在图像生成方面。变分自编码器模型作为无监督式特征学习的重要工具之一，可以通过学习隐编码空间与数据生成空间的特征映射，进而在输出端重构生成输入数据。梳理了传统变分自编码器模型及其衍生变体模型的发展与研究现状，并就此做了总结和对比，最后分析了变分自编码器模型存在的问题与挑战，并就可能的发展趋势做了展望。     

平面并联机构工作空间的三维螺旋扫描CAD求解

针对平面并联机构无奇异位置工作空间求解困难、过程繁琐、计算量大等问题，提出了基于CAD求解平面并联机构工作空间的三维螺旋扫描方法。将[n]自由度平面并联机构分解成[n]条支链进行独立分析，得到每条支链下末端执行器的可达区域，再将所有支链可达区域取交集即为平面并联机构工作空间。应用SolidWorks软件建立平面并联机构模型，进行几何特征处理，通过自动求解器求解，将求解过程图形化，快速得到同轴布局5R机构和平面3-RPR并联机构的无奇异位置工作空间。通过同轴布局5R机构的运动学实验，验证了该求解方法的可行性。     

0Cr17Ni4Cu4Nb传感器断裂原因分析

某力学传感器在出厂检验流程中发生断裂失效,为了确定失效原因,防止此类失效事件再次发生,实验对该传感器的力学性能、金相组织和断口形貌进行了分析,确定了断裂原因。结果表明,传感器的失效模式为氢致延迟开裂,材料中氢含量偏高和开裂位置机加工质量较差是导致传感器发生氢致开裂的主要原因。结合失效原因,提出了改进措施。     

A novel differential evolution mapping technique for generic combinatorial optimization problems

Differential evolution is primarily designed and used to solve continuous optimization problems. Therefore, it has not been widely considered as applicable for real-world problems that are characterized by permutation-based combinatorial domains. Many algorithms for solving discrete problems using differential evolution have been proposed, some of which have achieved promising results. However, to enhance their performance, they require improvements in many aspects, such as their convergence speeds, computational times and capabilities to solve large discrete problems. In this paper, we present a new mapping method that may be used with differential evolution to solve combinatorial optimization problems. This paper focuses specifically on the mapping component and its effect on the performance of differential evolution. Our method maps continuous variables to discrete ones, while at the same time, it directs the discrete solutions produced towards optimality, by using the best solution in each generation as a guide. To judge its performance, its solutions for instances of well-known discrete problems, namely: 0/1 knapsack, traveling salesman and traveling thief problems, are compared with those obtained by 8 other state-of-the-art mapping techniques. To do this, all mapping techniques are used with the same differential evolution settings. The results demonstrated that our technique significantly outperforms the other mapping methods in terms of the average error from the best-known solution for the traveling salesman problems, and achieves promising results for both the 0/1 knapsack and the traveling thief problems.