大型散货堆体积的快速测量

针对现有散货测量系统对堆场环境适应性差、盘点时间长、效率低、操作复杂等不足,提出了一种散货堆体积快速测量方法。同时,利用二维激光扫描仪、差分GPS和姿态测量系统设计了一种体积测量系统。该系统用激光扫描仪动态测量堆体表面的几何信息,用姿态测量系统实时测量扫描仪的空间姿态数据,用GPS测出扫描仪在测量过程中的三维位置;最后通过数据融合计算形成堆体的三维点云,利用点云获得散货堆体积。文中基于单条堆体轮廓点云特征,提出快速堆体下边缘查找算法来去除扫描过程中地面点云的误差影响;采用投影剖分法完成完整堆体点云计算体积。实验显示,利用本文设计的测试系统可在30s内完成体积为69m3的标准堆体测量,平均相对误差为0.42%,重复测量误差为0.41%。在实际散货堆实验中,可在10min内完成大小约为31 500m3的散货堆测量,4个不同料堆体积测量的平均重复测量误差为0.74%。结果表明,本方法可在保证测量精度的同时,简单、高效地测量散货堆体积。     

A Computer Modeling of the China Central Television Headquarters in Beijing

This paper deals with the computer modeling of structures starting from a point cloud. The CCTV （China Central Television） tower headquarters is the case for study because the shape of this building is non-stellar, concave and multi-connected. It is composed of sowns and chains. The sown is the representation of a horizontal plane formed by dense points. The chain is a planar path modeled by rare points. The CCTV structure is defined only by the three orthogonal Cartesian coordinates of the points. The proposed computer modeling uses a sequence of procedures and the desired outputted 3D model is consistent. The first procedure is devoted to attributing points to their voxel and to estimating three values needed afterwards. The second procedure is devoted to analyzing clusters vertically and horizontally, to preliminarily distinguishing chains from sowns and to generating relational matching. The third procedure is devoted to building closed paths between all chains and all their projections on sowns. The fourth procedure is devoted to connecting points with triangles. The fifth procedure, still being implemented, is devoted to interpolating triangles with triangular splines. The results show it is possible to achieve the 3D model using the above mentioned procedures. These procedures are written, implemented and tested and they form a library of people＇s own software. The code is written using Matlab. It is not possible to obtain the required 3D model if the procedures are applied in the wrong order or one step is skipped. To conclude, it is possible to obtain the computer model of the CCTV using the provided sequence of procedures.     

Delaunay-固定距离滑动邻域Kriging算法

地质统计学中的Kriging 算法是利用空间变异结构进行插值预报的算法,作为一种区域性算法,邻近点的选择是Kriging 算法实际应用中无法回避的重要问题。文章结合温度场计算的实际应用详细分析了Kriging 邻近点选择中需要考虑的原则,并采用Delaunay 三角划分搜索和固定距离搜索相结合的邻近点搜索策略,提出一种利用变程的Delaunay-固定距离滑动邻域算法。通过温度场数据的计算结果证明新算法在精确度上优于普通固定半径的滑动邻域Kriging 算法。     

跟踪式偏振光三角法测头

针对三角法测量的不足,设计了一种跟踪式偏振光三角法测头。对三角测量法的理论分析表明减小测量范围能提高测量精度。测头结合表面跟踪方法与三角测量法,跟踪使测量范围不受限制;仅在小范围内进行三角法测量,测量精度大大提高。对金属表面的反射特性进行了分析和推导,得出镜面反射与漫反射具有不同的偏振特性。通过偏振滤光减少了镜面反射光对测量的影响,从而降低了对被测表面材质的要求。本文给出了测头结构和工作原理。试验表明,测头能测量镜面反射较强的金属表面,测头可自动跟踪表面,并可结合测距仪实现表面形状的高精度测量。     

One machine,one minute,three billion tetrahedra

This paper presents a new scalable parallelization scheme to generate the 3D Delaunay triangulation of a given set of points. Our first contribution is an efficient serial implementation of the incremental Delaunay insertion algorithm. A simple dedicated data structure, an efficient sorting of the points, and the optimization of the insertion algorithm have permitted to accelerate reference implementations by a factor three. Our second contribution is a multithreaded version of the Delaunay kernel that is able to concurrently insert vertices. Moore curve coordinates are used to partition the point set, avoiding heavy synchronization overheads. Conflicts are managed by modifying the partitions with a simple rescaling of the space-filling curve. The performances of our implementation have been measured on three different processors: an Intel core-i7, an Intel Xeon Phi, and an AMD EPYC, on which we have been able to compute three billion tetrahedra in 53 seconds. This corresponds to a generation rate of over 55 million tetrahedra per second. We finally show how this very efficient parallel Delaunay triangulation can be integrated in a Delaunay refinement mesh generator, which takes as input the triangulated surface boundary of the volume to mesh.     

Three‐dimensional superconvergent gradient recovery on tetrahedral meshes

In this paper, finite element superconvergence phenomenon based on centroidal Voronoi Delaunay tessellations (CVDT) in three‐dimensional space is investigated. The Laplacian operator with the Dirichlet boundary condition is considered. A modified superconvergence patch recovery (MSPR) method is established to overcome the influence of slivers on CVDT meshes. With these two key preconditions, a CVDT mesh and the MSPR, the gradients recovered from the linear finite element solutions have superconvergence in the l₂ norm at nodes of a CVDT mesh for an arbitrary three‐dimensional bounded domain. Numerous numerical examples are presented to demonstrate this superconvergence property and good performance of the MSPR method. Copyright © 2016 John Wiley & Sons, Ltd.     

基于导波的焊接方管损伤检测的仿真与实验分析

基于导波的损伤检测方法是结构健康监测领域的研究热点,并在工程应用上表现出很大的潜力。通过有限元仿真和实验分析的方法对某型列车底盘转向架局部焊接方管结构上的损伤检测问题进行研究。仿真中建立结构的三维模型以模拟导波在其中的传播过程,实验中采用主动式换能器网络激发和接受在结构中传播的导波。优选激励频率以减少导波固有的多模式现象对后续信号分析的影响。借助小波变换和希尔伯特变换等方法对所有采集到的信号进行处理,并利用“导波三角定位法”进行损伤定位。实验结果验证了该方法的有效性。     

Effects of dividing attention on the memory-block effect.

S. M. Smith and D. R. Tindell (1997) reported that prior study of words that are orthographically similar to the solutions of test word fragments (e.g., studying ANALOGY and completing the fragment A L_ _GY, whose solution is ALLERGY) reduced the fragment completion rate relative to a baseline condition in which unrelated words were studied. They called this effect the memory-block effect. In the present experiment, the authors replicated this effect using a larger set of materials than that used by S. M. Smith and D. R. Tindell. The authors also found that dividing attention at study eliminated the memory-block effect. This pattern mimicked the effect of dividing attention on recognition memory but differed from the effect on repetition priming effects. The authors suggest that the memory-block effect is driven by a mechanism different from that responsible for producing repetition priming effects in an implicit fragment completion test. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Intensity-modulated radiotherapy – a large scale multi-criteria programming problem

Abstract. Radiation therapy planning is often a tight rope walk between dangerous insufficient dose in the target volume and life threatening overdosing of organs at risk. Finding ideal balances between these inherently contradictory goals challenges dosimetrists and physicians in their daily practice. Todays inverse planning systems calculate treatment plans based on a single evaluation function that measures the quality of a radiation treatment plan. Unfortunately, such a one dimensional approach cannot satisfactorily map the different backgrounds of physicians and the patient dependent necessities. So, too often a time consuming iterative optimization process between evaluation of the dose distribution and redefinition of the evaluation function is needed. In this paper we propose a generic multi-criteria approach based on Pareto's solution concept. For each entity of interest – target volume or organ at risk – a structure dependent evaluation function is defined measuring deviations from ideal doses that are calculated from statistical functions. A reasonable bunch of clinically meaningful Pareto optimal solutions are stored in a data base, which can be interactively searched by physicians. The system guarantees dynamic planning as well as the discussion of tradeoffs between different entities. Mathematically, we model the inverse problem as a multi-criteria linear programming problem. Because of the large scale nature of the problem it is not possible to solve the problem in a 3D-setting without adaptive reduction by appropriate approximation schemes. Our approach is twofold: First, the discretization of the continuous problem results from an adaptive hierarchical clustering process which is used for a local refinement of constraints during the optimization procedure. Second, the set of Pareto optimal solutions is approximated by an adaptive grid of representatives that are found by a hybrid process of calculating extreme compromises and interpolation methods. Correspondence to: K.-H. Küfer     

渐开线蜗杆(Z1)传动的蜗轮齿厚的测量

本文用与螺纹、蜗杆、齿轮等相类似的计算方法计算渐开线蜗杆（Z1）传动的蜗轮的M值，以确定其齿厚大小。较其他计算方法几何关系更清晰、准确。建议用恰当直径钢球进行测量，这样才能测出分度圆齿厚。文章介绍了恰当直径不仅与模数有关，而且与齿厚公差、变位系数有关。测量计算方法是从用钢球测量时的几何关系，再将蜗轮转到钢球接触点处于啮合的位置，并将蜗杆的几何关系引入进行计算。