Accelerating BPC-PaCo through Visually Lossless Techniques

Fast image codecs are a current need in applications that deal with large amounts of images. Graphics Processing Units (GPUs) are suitable processors to speed up most kinds of algorithms, especially when they allow fine-grain parallelism. Bitplane Coding with Parallel Coefficient processing (BPC-PaCo) is a recently proposed algorithm for the core stage of wavelet-based image codecs tailored for the highly parallel architectures of GPUs. This algorithm provides complexity scalability to allow faster execution at the expense of coding efficiency. Its main drawback is that the speedup and loss in image quality is controlled only roughly, resulting in visible distortion at low and medium rates. This paper addresses this issue by integrating techniques of visually lossless coding into BPC-PaCo. The resulting method minimizes the visual distortion introduced in the compressed file, obtaining higher-quality images to a human observer. Experimental results also indicate 12% speedups with respect to BPC-PaCo.     

基于VMD和BSA-KELM的高陡边坡位移预测模型研究

边坡位移的时间序列曲线存在复杂的非线性特性,传统的预测模型精度不足以满足预测要求。为此提出了基于变分模态分解的鸟群优化-核极限学习机的预测模型,并用于河北省某水泥厂的边坡位移预测。该方法首先采用VMD把边坡位移序列分解为一系列的有限带宽的子序列,再对各子序列分别采用相空间重构并用核极限学习机预测,采用鸟群算法优化相空间重构的嵌入维度和KELM中惩罚系数和核参数三个数值,以取得最优预测模型。最后将各个子序列预测值叠加,得到边坡位移的最终预测值。结果表明：和KELM、BSA-KELM、EEMD-BSA-KELM模型相比,基于VMD的BSA-KELM预测精度更高,为边坡位移的预测提供一种有效的方法。     

Structure-sensitive semantic matching for aggregate question answering over knowledge base

Aggregate question answering essentially returns answers for given questions by obtaining query graphs with unique dependencies between values and corresponding objects. Word order dependency, as the key to uniquely identify dependency of the query graph, reflects the dependencies between the words in the question. However, due to the semantic gap caused by the expression difference between questions encoded with word vectors and query graphs represented with logical formal elements, it is not trivial to match the correct query graph for the question. Most existing approaches design more expressive query graphs for complex questions and rank them just by directly calculating their similarities, ignoring the semantic gap between them. In this paper, we propose a novel Structure-sensitive Semantic Matching(SSM) approach that learns aligned representations of dependencies in questions and query graphs to eliminate their gap. First, we propose a cross-structure matching module to bridge the gap between two modalities(i.e., textual question and query graph). Then, we propose an entropy-based gated AQG filter to remove the structural noise caused by the uncertainty of dependencies. Finally, we present a two-channel query graph representation that fuses the semantics of abstract structure and grounding content of the query graph explicitly. Experimental results show that SSM could learn aligned representations of questions and query graphs to eliminate the gaps between their dependencies, and improves up to 12% (F1 score) on aggregation questions of two benchmark datasets.     

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.     

基于推理注意力机制的二阶段网络图像修复

现有的图像修复方法在处理大面积缺失或高度纹理化的图像时，通常会产生扭曲的结构或与周围区域不一致的模糊纹理，无法重建合理的图像结构。为此，提出了一种基于推理注意力机制的二阶段网络图像修复方法。首先通过边缘生成网络生成合理的幻觉边缘信息，然后在图像补全网络完成图像的重建工作。为了进一步生成视觉效果更逼真的图像，提高图像修复的精确度，在图像补全网络采用推理注意力机制，有效控制了生成特征的不一致性，从而生成更有效的信息。所提方法在多个数据集上进行了实验验证，结果表明该图像修复方法的结构相似性指数达到了88.9%，峰值信噪比达到了25.56 dB，与现有的图像修复方法相比，该方法具有更高的图像修复精确度，生成的图像更逼真。     

基于机器视觉的轮胎表面缺陷检测系统的研究与应用

在传统的轮胎表面缺陷依靠人工检测,存在劳动强度高、受人的主观影响大以及效率低下的问题。针对这一现象,研究了一种基于机器视觉的轮胎表面缺陷3D检测系统。该系统依靠机器视觉系统获取检测轮胎的表面图像,然后创建3D模型、判定缺陷类型,最终实现实时自动预警,为轮胎生产商提供一种自动化检测方案。系统集成了先进的技术、软件和工具,配套的信息管控系统可以对轮胎型号和生产数据进行采集、存储、分析,以便在生产过程中实现更高效、更可靠的质量控制,具有较高的实际应用推广价值。     

A novel strategy based on salp swarm algorithm for extracting the maximum power of proton exchange membrane fuel cell

Cell temperature and water content of the membrane have a significant effect on the performance of fuel cells. The current-power curve of the fuel cell has a maximum power point (MPP) that is needed to be tracked. This study presents a novel strategy based on a salp swarm algorithm (SSA) for extracting the maximum power of proton-exchange membrane fuel cell (PEMFC). At first, a new formula is derived to estimate the optimal voltage of PEMFC corresponding to MPP. Then the error between the estimated voltage at MPP and the actual terminal voltage of the fuel cell is fed to a proportional-integral-derivative controller (PID). The output of the PID controller tunes the duty cycle of a boost converter to maximize the harvested power from the PEMFC. SSA determines the optimal gains of PID. Sensitivity analysis is performed with the operating fuel cell at different cell temperature and water content of the membrane. The obtained results through the proposed strategy are compared with other programmed approaches of incremental resistance method, Fuzzy-Logic, grey antlion optimizer, wolf optimizer, and mine-blast algorithm. The obtained results demonstrated high reliability and efficiency of the proposed strategy in extracting the maximum power of the PEMFC.     

基于K-means和SOM的水下传感器数据采集方法

随着海洋资源勘探和海洋污染物监控工作的开展，水文数据的监测和采集等已经成为重要的研究方向。其中，水下无线传感器网络在水文数据采集过程中起着举足轻重的作用。本文研究的是水下无线传感器二维监测网络模型中，传感器节点数据采集的问题，其设计方法是通过自组织映射（Self-organizing mapping，SOM）对传感器节点进行路径最优化处理，结合优化的路径图形和K-means算法找到路径内部聚合点，利用聚合点和传感器的节点得到传感器通信半径内的数据采集点，最后通过SOM得到水下机器人（Autonomous underwater vehicle，AUV）到各个数据采集点采集数据的最优路径。经过实验验证，在水下1 200 m×1 750 m范围内布置52个传感器节点的情景下，数据采集点相比于传感器节点路径规划采用相同的采集顺序得到的路径优化了6.7%；对数据采集点重新进行自组织路径规划得到的路径比传感器结点路径的最优解提高了12.2%。增加传感器节点的数量，其结果也大致相同，因此采用该方法可以提高水下机器人采集数据的效率。     

基于改进SOA-VMD的磁声发射信号去噪算法

磁声发射（MAE）是铁磁性材料磁化过程中产生的声发射信号，在构件应力检测和微观损伤检测中有着广泛的应用。针对MAE信号非稳态、复杂性、衰减性等特点，提出海鸥算法结合变分模态分解（SOA-VMD）的去噪方法，为克服海鸥算法求解过程中易陷入局部最优解问题，利用柯西变异算子产生随机迭代过程，使改进算法即柯西变异海欧算法（CVSOA）跳出早熟收敛。采用以幅值谱熵为适应度函数，优化VMD算法中分解模态个数K和二次惩戒因子α两个参数，将含噪声的MAE信号进行VMD分解重构。经仿真信号和实际检测信号分析表明，改进后的CVSOA-VMD算法全局寻优能力和去噪性能优于传统的SOA-VMD算法，降噪后的MAE信号特征值对于不同应力下均方根、偏斜度特征值的重复性更好，可靠性更高。     

2种侧围加强内框总成检具结构对比分析

概述了侧围加强内框总成与周边零件的匹配关系,从检具操作的人机工程出发,描述了侧围加强内框总成检具的2种定位方式和结构设计,对比了2种定位方式对于检测结果的影响,总结了其优点和弊端,结果表明侧围加强内框总成检具采用车内方向朝下的定位方式效果更好。