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

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

为了更加准确地检测出图像中的显著性目标，提出了多先验融合的显著性目标检测算法。针对传统中心先验对偏离图像中心的显著性目标会出现检测失效的情况，提出在多颜色空间下求显著性目标的最小凸包交集来确定目标的大致位置，以凸包区域中心计算中心先验。同时通过融合策略将凸包区域中心先验、颜色对比先验和背景先验融合并集成到特征矩阵中。最后通过低秩矩阵恢复模型生成结果显著图。在公开数据集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-噻吗洛尔的转晶拆分以水作溶剂，比传统不对称合成工艺安全稳定，操作简单，适合工业化生产。     

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.     

改进HSR-FCN的服装图像识别分类算法研究

目前网络上的服装图像数量增长迅猛，对于大量服装图像实现智能分类的需求日益增加。将基于区域的全卷积网络（Region-Based Fully Convolutional Networks，R-FCN）引入到服装图像识别中，针对服装图像分类中网络训练时间长、形变服装图像识别率低的问题，提出一种新颖的改进框架HSR-FCN。新框架将R-FCN中的区域建议网络和HyperNet网络相融合，改变图片特征学习方式，使得HSR-FCN可以在更短的训练时间内达到更高的准确率。在模型中引入了空间转换网络，对输入服装图像和特征图进行了空间变换及对齐，加强了对多角度服装和形变服装的特征学习。实验结果表明，改进后的HSR-FCN模型有效地加强了对形变服装图像的学习，且在训练时间更短的情况下，比原来的网络模型R-FCN平均准确率提高了大约3个百分点，达到96.69%。     

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

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

一种抗运动干扰的实时心率提取方法

针对基于容积脉搏波（PPG）提取运动心率时，传统心率提取算法由于运动噪声干扰使测量结果误差大、实时性不好的问题，提出一种抗运动干扰的实时心率提取方法。该方法通过实时小波去噪，同时结合三轴加速度信号（ACC）对运动进行分类训练，计算各运动状态心率增益，对实时心率值进行补偿。实验结果表明，通过与同时采集的ECG信号计算出的实时心率进行对比，绝对误差率仅为1.2%左右。相比传统心率提取算法，该算法具有抗干扰性强，实时准确的特点。     

PSO优化多核RVM的模拟电路故障预测

针对模拟电路健康管理的特点，提出了一种基于PSO优化多核RVM的模拟电路故障预测方法。利用参数分析得到电路的输出频域响应作为特征，计算其与电路无故障标准响应的欧氏距离来表征电路元件健康值，将多个核函数线性组合，并用PSO优化多核RVM参数后的模型实现对各个时间点元件的健康值变化轨迹进行预测。仿真结果表明，该方法在小样本情况下，预测效果优于单一核函数的RVM模型，适用于健康管理中实时预测，具有较好的实用性。     

Automated network management and configuration using Probabilistic Trans-Algorithmic Search

Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search.