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

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

基于神经网络算法的井下裂缝诊断与堵漏技术

在钻井过程中，常常钻遇不同宽度的井下地层裂缝。钻遇裂缝时容易发生钻井液漏失现象，甚至发生钻井液失返现象，严重影响了安全、高效钻井。目前裂缝封堵的方法常存在封堵成功率不高、堵漏承压能力低的问题，其中一个重要的原因是对井下地层的裂缝宽度等特征认识不清。基于地层裂缝产生的岩石力学机理，确定影响裂缝宽度关键的6个力学和工程因素，并利用神经网络计算的非线性、大数据特点建立了井下地层裂缝宽度的分析模型，模型包含输入层、输出层和3个隐藏层。通过该模型诊断井下裂缝宽度，提高了计算精度，平均误差仅为2.09%，最大误差为5.88%，解决钻井现场仅凭经验判断裂缝误差较大和依靠成像测井成本较高的问题。同时根据神经网络模型诊断得到的裂缝宽度优化堵漏材料的粒径配比，提高了裂缝内的架桥封堵强度和架桥的稳定性，封堵层的承压能力达到12.8 MPa，反向承压能力达到4.5 MPa。现场堵漏试验最高憋压10 MPa，经过封堵作业后大排量循环不漏，达到了裂缝性地层高效堵漏的目的，堵漏一次成功。      

基于时频域的卷积神经网络运动想象脑电信号识别方法

针对目前运动想象脑电（EEG）信号识别率较低的问题，考虑到脑电信号蕴含着丰富的时频信息，提出一种基于时频域的卷积神经网络（CNN）运动想象脑电信号识别方法。首先，利用短时傅里叶变换（STFT）对脑电信号的相关频带进行预处理，并将多个电极的时频图组合构造出一种二维时频图；然后，针对二维时频图的时频特性，通过一维卷积的方法设计了一种新颖的CNN结构；最后，通过支持向量机（SVM）对CNN提取的特征进行分类。基于BCI数据集的实验结果表明，所提方法的平均识别率为86.5%，优于其他传统运动想象脑电信号识别方法；同时将该方法应用在智能轮椅上，验证了其有效性。     

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

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

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

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

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

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

基于多尺度双线性卷积神经网络的多角度下车型精细识别

针对多角度下车辆出现一定的尺度变化和形变导致很难被准确识别的问题，提出基于多尺度双线性卷积神经网络（MS-B-CNN）的车型精细识别模型。首先，对双线性卷积神经网络（B-CNN）算法进行改进，提出MS-B-CNN算法对不同卷积层的特征进行了多尺度融合，以提高特征表达能力；此外，还采用基于中心损失函数与Softmax损失函数联合学习的策略，在Softmax损失函数基础上分别对训练集每个类别在特征空间维护一个类中心，在训练过程中新增加样本时，网络会约束样本的分类中心距离，以提高多角度情况下的车型识别的能力。实验结果显示，该车型识别模型在CompCars数据集上的正确率达到了93.63%，验证了模型在多角度情况下的准确性和鲁棒性。     

Coupling in situ experiments and modeling – Opportunities for data fusion,machine learning,and discovery of emergent behavior

This paper reviews recent studies, that not only includes both experiments and modeling components, but celebrates a close coupling between these techniques, in order to provide insights into the plasticity and failure of polycrystalline metals. Examples are provided of studies across multiple-scales, including, but not limited to, density functional theory combined with atom probe tomography, molecular dynamics combined with in situ transmission electron miscopy, discrete dislocation dynamics combined with nanopillars experiments, crystal plasticity combined with digital image correlation, and crystal plasticity combined with in situ high energy X-ray diffraction. The close synergy between in situ experiments and modeling provides new opportunities for model calibration, verification, and validation, by providing direct means of comparison, thus removing aspects of epistemic uncertainty in the approach. Further, data fusion between in situ experimental and model-based data, along with data driven approaches, provides a paradigm shift for determining the emergent behavior of deformation and failure, which is the foundation that underpins the mechanical behavior of polycrystalline materials.     

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.