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

Off‐grid DoA estimation method of wideband signals

In this paper, an off‐grid direction of arrival (DoA) estimation method is proposed for wideband signals. This method is based on the sparse representation (SR) of the array covariance matrix. Similar to the time domain DoA estimation methods, the correlation function of the sources was assumed to be the same and known. A new measurement vector is obtained using the lower‐left triangular elements of the covariance matrix. The DoAs are estimated by quantizing the entire range of continuous angle space into discrete grid points. However, the exact DoAs may be located between two grid points; therefore, this estimation has errors. The accuracy of DoA estimation is improved by the minimization of the difference between the new measurement vector and its estimated values. Simulation results revealed that the proposed method can enhance the DoA estimation accuracy of wideband signals.     

干扰条件下的“北斗”信号解扩重构DOA估计

在干扰条件下，卫星导航抗干扰波束形成算法往往需要卫星信号波达方向（Direction-of-Arrival，DOA）的先验信息。但当存在低信噪比信号或主动干扰源时，常规的DOA估计算法性能急剧下降甚至失效。针对此问题，提出了一种被干扰信号压制的低信噪比“北斗”信号的DOA估计算法。该算法首先通过对接收信号进行子空间投影抑制干扰信号，然后对抑制干扰后的信号进行解扩重构处理，最后通过多重信号分类算法完成对“北斗”信号的DOA估计。仿真结果表明，在干扰信号干信比80 dB条件下，“北斗”信号DOA估计误差在5°以内，为下一步进行波束形成计算提供了高精度的入射角信息。     

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

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

使用FPGA与SDRAM实现液晶显示控制模块的浅析

针对液晶显示控制板上存储器(SRAM)存储量小和频率低的情况,提出了基于DDR sdram作为显示存储器的LCD显示控制器的设计。使用了灵活性与可靠性高的现场可编程门阵列(FPGA)来实现各模块的逻辑功能,分析了实现LCD显示屏控制模块的方案。     

Combined hardware–software multi-parallel prefiltering on the Convey HC-1 for fast homology detection

Protein databases used in research are huge and still grow at a fast pace. Many comparisons need to be done when searching similar (homologous) sequences for a given query sequence in these databases. Comparing a query sequence against all sequences of a huge database using the well-known Smith–Waterman algorithm is very time-consuming. Hidden Markov Models pose an opportunity for reducing the number of entries of a database and also enable to find distantly homologous sequences. Fewer entries are achieved by clustering similar sequences in a Hidden Markov Model. Such an approach is used by the bioinformatics tool HHblits. To further reduce the runtime, HHblits uses two-level prefiltering to reduce the number of time-consuming Viterbi comparisons. Still, prefiltering is very time-consuming. Highly parallel architectures and huge bandwidth are required for processing and transferring the massive amounts of data. In this article, we present an approach exploiting the reconfigurable, hybrid computer architecture Convey HC-1 for migrating the most time-consuming part. The Convey HC-1 with four FPGAs and high memory bandwidth of up to 76.8 GB/s serves as the platform of choice. Other bioinformatics applications have already been successfully supported by the HC-1. Limited by FPGA size only, we present a design that calculates four first-level prefiltering scores per FPGA concurrently, i.e. 16 calculations in total. This score calculation for the query profile against database sequences is done by a modified Smith–Waterman scheme that is internally parallelized 128 times in contrast to the original Streaming ‘Single Instruction Multiple Data (SIMD)’ Extensions (SSE)-supported implementation where only 16-fold parallelism can be exploited and where memory bandwidth poses the limiting factor. Preloading the query profile, we are able to transform the memory-bound implementation to a compute- and resource-bound FPGA design. We tightly integrated the FPGA-based coprocessor into the hybrid computing system by employing task-parallelism for the two-level prefiltering. Despite much lower clock rates, the FPGAs outperform SSE-based execution for the calculation of the prefiltering scores by a factor of 7.9.     

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

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

Nonuniform linear array DOA estimation using EM criterion

In this letter, we address the problem of Direction of Arrival (DOA) estimation with nonuniform linear array in the context of sparse Bayesian learning (SBL) framework. The nonuniform array output is deemed as an incomplete-data observation, and a hypothetical uniform linear array output is treated as an unavailable complete-data observation. Then the Expectation-Maximization (EM) criterion is directly utilized to iteratively maximize the expected value of the complete-data log likelihood under the posterior distribution of the latent variable. The novelties of the proposed method lie in its capability of interpolating the actual received data to a virtual uniform linear array, therefore extending the achievable array aperture. Simulation results manifests the superiority of the proposed method over off-the-shelf algorithms, specially on circumstances such as low SNR, insufficient snapshots, and spatially adjacent sources.