面向无人驾驶地图更新的安全信任管理方案

地图的实时性和准确性在无人驾驶车辆导航中发挥着重要作用。基于卫星图像的数字地图能够保证地图中道路信息的准确性,但是根据相关路况信息进行实时更新时,由于车辆用户数较多且来源复杂,因此无法确保数据的安全性和可靠性。提出一种基于区块链的认证与信任管理方案。利用无证书签名技术实现车辆的匿名认证,保证车辆身份的可验证性和不可否认性。设计基于区块链的信任管理机制,通过存储在区块链上的历史信任值计算路况消息的可信度,同时将可靠的路况信息发送给地图更新服务器,根据车辆提供信息的真实与否更新车辆信誉值,实现车辆信誉的同步与更新。从计算开销、通信开销和信任管理功能等方面验证了该方案的有效性。仿真结果表明,该方案具有较高的地图更新效率和防骗能力,能够确保数据来源的安全性和可靠性,为无人驾驶车辆提供实时路况更新服务。     

Fatigue crack growth prediction in nuclear piping using Markov chain Monte Carlo simulation

In this paper, we present and demonstrate a methodology to improve probabilistic fatigue crack growth (FCG) predictions by using the concept of Bayesian updating using Markov chain Monte Carlo simulations. The methodology is demonstrated on a cracked pipe undergoing fatigue loading. Initial estimates of the FCG rate are made using the Paris law. The prior probability distributions of the Paris law parameters are taken from the tests on specimen made of the same material as that of pipe. Measured data on crack depth over number of loading cycles are used to update the prior distribution using the Markov chain Monte Carlo. The confidence interval on the predicted FCG rate is also estimated. In actual piping placed in a plant, the measured data can be considered equivalent to the data received from in-service inspection. It is shown that the proposed methodology improves the fatigue life prediction. The number of observations used for updating is found to leave a significant effect on the accuracy of the updated prediction.     

Comparison of the identification performance of conventional FEM updating and integrated DIC

Full‐field identification methods are increasingly used to adequately identify constitutive parameters to describe the mechanical behavior of materials. This paper investigates the more recently introduced one‐step method of integrated digital image correlation (IDIC) with respect to the most commonly used two‐step method of finite element model updating (FEMU), which uses a subset‐based DIC algorithm. To make the comparison as objective as possible, both methods are implemented in the most equivalent manner and use the same FE model. Various virtual test cases are studied to assess the performance of both methods when subjected to different error sources: (1) systematic errors, (2) poor initial guesses for the constitutive parameters, (3) image noise, (4) constitutive model errors, and (5) experimental errors. Results show that, despite the mathematical similarity of both methods, IDIC produces less erroneous and more reliable results than FEMU, particularly for more challenging test cases exhibiting small displacements, complex kinematics, misalignment of the specimen, and image noise. Copyright © 2015 John Wiley & Sons, Ltd.     

一种基于决策表的核增量式高效更新算法

引入简化决策表,结合简化二进制差别矩阵设计思想,提出一种基于决策表的核增量式高效更新算法.该算法在更新简化的二进制差别矩阵时,只需在原决策表基础上对记录进行相应的更新,不需要重复计算原决策表的二进制差别矩阵.采用边更新简化二进制差别矩阵边计算核,显著地提高了算法的效率和灵活性.新算法的时间复杂度和空间复杂度分别为O(|C||U′|)和O(|C||U′pos||U′|).最后用一个实例说明了新算法的高效性.     

LZW压缩算法在终端程序远程更新中的应用

介绍基于LPC2378开发的配变监测终端程序远程更新方法,利用芯片自带的IAP功能实现片内Flash上的程序更新,从而避免了使用对硬件配置要求较高的商业嵌入式操作系统。同时,将LZW压缩算法应用到程序更新中,使程序更新文件压缩了40%,大大缩减了通信流量,节省了终端的存储空间。     

A perturbed particle swarm algorithm for numerical optimization

The canonical particle swarm optimization (PSO) has its own disadvantages, such as the high speed of convergence which often implies a rapid loss of diversity during the optimization process, which inevitably leads to undesirable premature convergence. In order to overcome the disadvantage of PSO, a perturbed particle swarm algorithm (pPSA) is presented based on the new particle updating strategy which is based upon the concept of perturbed global best to deal with the problem of premature convergence and diversity maintenance within the swarm. A linear model and a random model together with the initial max–min model are provided to understand and analyze the uncertainty of perturbed particle updating strategy. pPSA is validated using 12 standard test functions. The preliminary results indicate that pPSO performs much better than PSO both in quality of solutions and robustness and comparable with GCPSO. The experiments confirm us that the perturbed particle updating strategy is an encouraging strategy for stochastic heuristic algorithms and the max–min model is a promising model on the concept of possibility measure.     

北斗双星／SINS组合导航中的捷联惯导算法研究

摘要针对北斗双星／SINS组合导航系统,研究了捷联惯导的姿态和速度更新算法。将等效旋转矢量算法应用与姿态解算,消除了传统的四元数算法存在的不可交换性误差对导航精度的影响,并对速度解算中的划浆误差进行了补偿。将算法应用到北斗双星／捷联惯导组合导航系统,通过实际的跑车实验验证算法的有效性。     

基于高斯背景模型的车辆检测改进算法

针对车辆检测中实时性、准确性以及自适应性很难兼顾的问题,提出了一种快速有效的车辆检测算法。该算法采用阈值判定背景区域和更新区域,根据背景变化的程度,利用动态权值更新学习率,使用基于单高斯背景模型方法,结合逻辑"或"运算检测出车辆。实验结果表明,该算法能够快速准确地检测出车辆,并且在背景更新过程中实现了自适应,并具有一定的鲁棒性。     

Dynamic harmonic fields for surface processing

Harmonic fields have been shown to provide effective guidance for a number of geometry processing problems. In this paper, we propose a method for fast updating of harmonic fields defined on polygonal meshes, enabling real-time insertion and deletion of constraints. Our approach utilizes the penalty method to enforce constraints in harmonic field computation. It maintains the symmetry of the Laplacian system and takes advantage of fast multi-rank updating and downdating of Cholesky factorization, achieving both speed and numerical stability. We demonstrate how the interactivity induced by fast harmonic field update can be utilized in several applications, including harmonic-guided quadrilateral remeshing, vector field design, interactive geometric detail modeling, and handle-driven shape editing and animation transfer with a dynamic handle set.     

基于动态Light Map的增强现实光照算法

为实现增强现实系统中光照的实时准确性,提出一种基于动态Light Map的快速光照算法。该方法通过采集视频图像中校准物体的像素亮度,计算出摄像机的信号放大量和信号偏置,并利用动态更新的Light Map所记录的环境光照信息实现虚、实场景之间的一致光照,且能够适应光照变化的场景。实验结果表明该算法的显示速度能够达到实时交互的帧率。