运动目标检测与跟踪的DSP实现

研究了运动目标检测与跟踪的DSP（DigitalSignalProcessor）实现算法,以形心跟踪算法为整个处理系统的核心。采用目标形心跟踪算法,通过目标分割阶段的目标标记,如目标面积、周长、形心位置等信息的提取建立目标跟踪波门,实现目标的连续跟踪,并将此算法移植到sEED—VPM642硬件平台,实验结果表明能够达到预定目标。此外,为了克服形心算法的准确性和实时性缺陷,采用粒子滤波对算法进行必要的扩展,从MATLAB的仿真结果看,除个别采样点存在误差较大的情况,真实值曲线与粒子滤波跟踪曲线拟合较好。     

基于滚动时域优化的机场起降动态调度

为了减少作战时军用飞机实际起降时刻与计划起降时刻产生的偏差,提出一种基于滚动时域优化原理的动态机场起降调度策略,分析军用飞机起降过程中的时间窗口约束和尾流间隔约束。对进入每个预测窗口内的飞机队列,以加权提前/延误时间和最小作为目标函数,将军用飞机起降调度模型转换为带到达时间的单机加权E/T调度模型。设计一种针对自然数域的离散粒子群算法,并应用该算法进行模型求解。通过仿真实验确定了算法的参数,仿真结果说明了模型和算法的有效性。     

基于Vega粒子系统的自由大气分子运动虚拟仿真

在军事训练中,三维仿真的战场环境发挥了极为重要的作用。本文将对战场环境中的自由大气进行虚拟仿真。首先分析自由大气中运动分子的性质,详细介绍在模拟不规则自然现象中运用最多的粒子系统技术,最后在Vega中运用粒子系统对大气分子的运动进行模拟仿真。仿真结果能基本模拟出大气分子的运动特性,且可以通过接口编程访问粒子的属性,从而能在无人机等航迹规划的危险天气现象的规避中加以运用。     

火焰动画快速模拟的新方法

针对火焰动画难以快速建模和绘制的问题,提出了完全利用GPU过程化生成火焰动画的高效算法。先用建模工具在预处理阶段构建一个由平面正方形组成的三维模型,在绘制阶段通过GPU编程对这些方形进行Billboard方式的变换,并用一些简单公式对他们的运动方式、大小和颜色来用过程化方式进行控制,最后通过alpha混合得到最终结果。算法完全在GPU里实现,能满足实时的绘制要求。     

基于AUPF的TDOA几何定位跟踪算法研究

使用无源时差（TDOA）定位技术确定无人机等小型辐射源目标的位置是当前研究的热点,针对时差定位算法较为复杂的实际情况,推导了时差双曲线的几何解,并提出了一种基于自适应无迹粒子滤波（AUPF）技术的移动目标定位跟踪方法。通过仿真对该方法在不同场景的应用效果进行了验证,进一步比较分析了算法的定位精度。结果表明,基于自适应无迹粒子滤波的时差几何定位跟踪算法可以在多种情况下较好地拟合出目标真实运动轨迹,实现对运动目标的定位跟踪,同时拥有更低的定位误差和更高的轨迹包容度,使用该方法可以显著提高对非合作移动辐射源目标的位置估计性能。     

基于智能垃圾桶的垃圾分类动态收运路径优化问题研究

针对城市生活垃圾分类收运过程中存在的环境二次污染和垃圾产生量不确定性等问题,提出了一种基于智能垃圾桶的动态收运车辆路径优化方法。建立以最小化碳排放成本、燃油消耗成本、固定成本和车辆延迟到达惩罚成本为目标的动态车辆路径优化模型。采用滚动时域的方式将动态问题转换为一系列静态问题,并设计两阶段算法进行求解。首先采用粒子群算法对收运车辆路径进行规划,而后在每个时域末,综合考虑待清运垃圾桶的位置和垃圾量、垃圾收运车辆的位置和装载量以动态调整现有车辆路径。研究结果表明,相较于传统的静态收运方案,动态垃圾收运方案能够在降低车辆运输成本和碳排放成本的同时,显著降低由于清运不及时造成的环境二次污染的风险。     

LPNet: A DNN based latency prediction technique for application mapping in Network-on-Chip design

Analytical models used for latency estimation of Network-on-Chip (NoC) are not producing reliable accuracy. This makes these analytical models difficult to use in optimization of design space exploration. In this paper, we propose a learning based model using deep neural network (DNN) for latency predictions. Input features for DNN model are collected from analytical model as well as from Booksim simulator. Then this DNN model has been adopted in mapping optimization loop for predicting the best mapping of given application and NoC parameters combination. Our simulations show that using the proposed DNN model, prediction error is less than 12% for both synthetic and application specific traffic. More than 108 times speedup could be achieved using DPSO with DNN model compared to DPSO using Booksim simulator.     

Turbulent Details Simulation for SPH Fluids via Vorticity Refinement

A major issue in smoothed particle hydrodynamics (SPH) approaches is the numerical dissipation during the projection process, especially under coarse discretizations. High‐frequency details, such as turbulence and vortices, are smoothed out, leading to unrealistic results. To address this issue, we introduce a vorticity refinement (VR) solver for SPH fluids with negligible computational overhead. In this method, the numerical dissipation of the vorticity field is recovered by the difference between the theoretical and the actual vorticity, so as to enhance turbulence details. Instead of solving the Biot‐Savart integrals, a stream function, which is easier and more efficient to solve, is used to relate the vorticity field to the velocity field. We obtain turbulence effects of different intensity levels by changing an adjustable parameter. Since the vorticity field is enhanced according to the curl field, our method can not only amplify existing vortices, but also capture additional turbulence. Our VR solver is straightforward to implement and can be easily integrated into existing SPH methods.     

自适应变异粒子群优化算法及在新冠肺炎疫情传播预测中的应用

为克服粒子群算法容易陷入局部最优和全局寻优精度不高的缺点,通过对算法的局部寻优和全局寻优的特点进行分析,首先使用正态分布衰减策略改进惯性权重;同时基于算法运行的时间自适应采用不同的基于高斯分布及柯西分布的变异优化策略,解决全局搜索和局部开发能力的不平衡问题,实现了局部寻优和全局寻优的双重优化,满足了提高寻优速度和寻优精度的目的.为验证算法有效性及实用性,将改进算法用于预测新冠肺炎疫情传播情况.选取100天新冠肺炎疫情每日新确诊人数的数据,利用算法优化前馈神经网络的参数,使训练好的神经网络模型预测新冠肺炎疫情的性能提升.实验部分首先使用测试函数将改进的算法与其它五种算法进行对比,验证算法的良好性能,最后应用到神经网络完成新冠肺炎疫情传播预测.     

A new time invariant fuzzy time series forecasting method based on particle swarm optimization

In the analysis of time invariant fuzzy time series, fuzzy logic group relationships tables have been generally preferred for determination of fuzzy logic relationships. The reason of this is that it is not need to perform complex matrix operations when these tables are used. On the other hand, when fuzzy logic group relationships tables are exploited, membership values of fuzzy sets are ignored. Thus, in defiance of fuzzy set theory, fuzzy sets’ elements with the highest membership value are only considered. This situation causes information loss and decrease in the explanation power of the model. To deal with these problems, a novel time invariant fuzzy time series forecasting approach is proposed in this study. In the proposed method, membership values in the fuzzy relationship matrix are computed by using particle swarm optimization technique. The method suggested in this study is the first method proposed in the literature in which particle swarm optimization algorithm is used to determine fuzzy relations. In addition, in order to increase forecasting accuracy and make the proposed approach more systematic, the fuzzy c-means clustering method is used for fuzzification of time series in the proposed method. The proposed method is applied to well-known time series to show the forecasting performance of the method. These time series are also analyzed by using some other forecasting methods available in the literature. Then, the results obtained from the proposed method are compared to those produced by the other methods. It is observed that the proposed method gives the most accurate forecasts.