基于邻层数据匹配的工业 CT 图像生成 G 代码方法

针对目前工业CT图像转换为3D打印G代码方法效率低的问题,提出一种基于邻层数据匹配的工业CT图像直接转换成G代码的方法。首先采用Canny算子提取工业CT图像的轮廓,然后处理轮廓分叉问题,实现邻层间几何信息数据匹配,其次进行邻层间轮廓插值以满足3D打印层间厚度要求,从而避免"阶梯效应",最后通过填充编码得到用于3D打印的G代码。使用本文提出的方法,轮毂CT图像转换为G代码的时间为10.5 s,耗时远小于其他间接转换方法;3D打印出的轮毂无"阶梯效应",平均尺寸误差率为0.25%。实验结果表明,该方法不涉及中间格式,转换效率高,转换误差与传统方法相当,适用于具有复杂内腔结构的零件。     

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

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

Unconditionally Secure Oblivious Polynomial Evaluation: A Survey and New Results

Oblivious polynomial evaluation (OPE) is a two-party protocol that allows a receiver, R to learn an evaluation f(α), of a sender, S's polynomial f(x), whilst keeping both α and f(x) private. This protocol has attracted a lot of attention recently, as it has wide ranging applications in the field of cryptography. In this article we review some of these applications and, additionally, take an in-depth look at the special case of information theoretic OPE. Specifically, we provide a current and critical review of the existing information theoretic OPE protocols in the literature. We divide these protocols into two distinct cases (three-party and distributed OPE) allowing for the easy distinction and classification of future information theoretic OPE protocols. In addition to this work, we also develop several modifications and extensions to existing schemes, resulting in increased security, flexibility and efficiency. Lastly, we also identify a security flaw in a previously published OPE scheme.     

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.     

基于PolyWorks虚拟装配间隙面差计算分析研究

随着当今社会汽车制造业的迅猛发展,高标准和高需求已经是消费者对汽车制造凯歌的主旋律。而这其中,汽车钣金件的间隙面差就是其中一个重要因素。快速检测间隙面差是否满足设计要求直接关系到汽车白车身的生产精度和企业的工作效率。传统计算间隙面差大多利用量具,易划伤被测物且在零件实际装配后才可测量,降低生产效率,而非接触测量造价昂贵。本课题基于实物的汽车钣金件虚拟装配,对间隙面差的计算方法进行分类与参数调整,提出一种高效率、高标准的间隙面差计算流程。     

基于SVM的充填体强度与采场稳定性需求智能匹配研究

为解决矿山充填体强度的设计问题,提高矿山充填体的强度动态调整能力,本文通过调查国内百座矿山现场充填体强度实际数据,采用SVM方法建立充填体强度智能预测模型,对70组训练样本数据进行训练,采用BP神经网络模型与SVM模型的预测结果进行比较。结果表明：SVM预测模型的最大误差为3.52%,平均误差为2.41%。BP预测模型的最大误差为10.98%,平均误差为7.01%。SVM模型比BP模型预测精度更高,误差更小。采用SVM模型对三山岛金矿充填体强度进行预测,一步骤回采矿房充填体强度1.02MPa,推荐灰砂比1:12,二步骤回采矿房充填体强度0.86MPa,推荐灰砂比1:16。现场采场充填效果良好,未发生充填体失稳现象。基于SVM的充填体强度智能匹配模型能够在满足采场稳定性的前提下,减少充填成本,提高矿山的经济效益。     

利用平面约束的月球车立体匹配方法

为了满足月球车视觉系统对检测障碍物检测的时效性和可靠性的需求，提出了一种基于平面约束和自适应惩罚参数的半全局立体匹配算法。首先，对极线校正后的两幅图像进行SIFT特征点提取与匹配，同时提取边缘特征；然后，利用匹配的SIFT特征点拟合空间平面，并根据平面估计左右图像所有像素点的视差搜索范围；最后，基于传统的半全局匹配算法，采用自适应惩罚参数的策略对左右图像进行立体匹配。实验结果表明：所提出的算法有效地降低了计算复杂度，其计算复杂度只有传统方法的19.9%，对于视差不连续区域以及遮挡区域都能够获得正确的匹配结果。较传统半全局匹配方法无论在速度还是匹配精度上都得到明显提高，为对立体匹配的实际应用奠定了基础。     

Copy Move Forgery Detection based on double matching

Copy Move is a technique widespreadly used in digital image tampering, meaning Copy Move Forgery Detection (CMFD) is still a significant research. In this paper, a novel CMFD method is proposed, including double matching process and region localizing process. In double matching process, the first matching is conducted on Delaunay triangles consisting of Local Intensity Order Pattern (LIOP) keypoints, to find the approximate location of suspicious regions. In order to find sufficient keypoint pairs, the existing set of matching triangles is expanded by adding their neighbors iteratively, covering the whole tampered regions, and the second matching with a looser threshold is conducted on the vertices. In the region localizing process, considering the case of multiple copies, Density-Based Spatial Clustering of Applications with Noise (DBSCAN) is used to classify the keypoint pairs described in a new model. Experimental results indicate that the proposed method, with good robustness, outperforms some state-of-the-art methods.     

基于“炉机对应”原则的连浇优化方案

国内某炼钢厂为保证浇注周期较短的2号连铸机连浇，多座转炉需同时向该连铸机供应钢水，导致炉 机对应关系不明确，生产组织难度较大。通过对该厂炼钢 连铸过程的工序作业周期与生产运行模式进行解析，在保证连铸机连浇的基础上，探究合理的炉 机对应关系，改善该厂的生产顺行。结果表明，在“一一对应”运行模式下，2号连铸机最大连浇炉数仅为6炉；而在“定炉对定机”运行模式下，若适时接受3号转炉冶炼的钢水，2号连铸机最大连浇炉数可延长至19炉。在此基础上，通过对连铸机“柔性”的优化和钢水供应的合理调配，2号连铸机可满足实际生产的连浇要求。此外，运用“炉→机”匹配度进行评价，计算结果表明优化后的炉 机对应关系得到显著改善。