基于动态流能量高效的无线传感网路由算法

针对无线传感网中结点能量受限,提出了一种基于动态流能量高效的路由算法DFEERA(Dynamic Flow-based Energy-Efficient Routing Algorithm)。该算法通过在无线传感网内设置多个基站收集区域内传感器结点的数据流拓扑结构建立数据传输能量消耗模型,将该模型转换为最大流问题求解最优传输路径,作为某时期内结点数据传输路径。随着结点能量的消耗,动态调整该能量消耗模型重新规划路径,作为新的传输路径,从而平衡结点间的能量消耗,提高网络结点的存活率。仿真结果表明,与其他典型的路由算法相比,DFEERA能够更好地平衡结点的能耗,获得更高的能量消耗率和更长的网络生存期。     

改进的Canny算法在直焊缝图像缺陷边缘检测中的应用

对含有夹渣、气孔和裂纹缺陷的直焊缝X射线图像进行缺陷的边缘检测时,传统的Canny算法虽然可以检测出缺陷的边缘,但具有自适应差和容易出现伪边缘的缺点。提出了一种改进的Canny算法,对经过非极大值抑制后的梯度直方图,利用像素最值梯度和像素最值梯度方差自适应获取连接缺陷边缘所需的高、低阈值;同时也改进了计算梯度图像所需的模板。实验结果证明,改进的Canny算法不仅进一步抑制了噪声,也避免了伪边缘的出现,在保留缺陷的边缘细节方面具有良好的效果。     

基于改进蚁群算法的云计算任务调度研究

把改进的蚁群算法应用到云计算任务调度中,通过将任务在虚拟机上的一次分配作为蚂蚁的一次成功搜索,实现了虚拟机的负载均衡和调度时间的优化,提高云计算资源分配的效率。通过在Cloud Sim平台下进行仿真测试,结果显示,改进蚁群算法在负载均衡性能和总的任务调度时间方面均优于基本的蚁群算法。     

基于反向射线追踪的多径预测方法研究

多径效应是影响通信、导航系统性能的关键因素,不仅影响信号传播的功率衰落,还会引起信号时延、频移、极化等参数的变化,导致通信、导航系统性能下降。针对多径效应,本文提出基于虚拟源树、环境分区处理、背向检测等加速技术的反向射线追踪算法进行快速三维路径追踪,准确预测多径信号的损耗、时延分布。在此基础上,以城市场景为例进行算法仿真,并对任意尖劈绕射算法进行了深入研究。最后以信号在简易街道传播为例,对比分别利用基于本文提出的算法原理的MATLAB程序和利用Wireless Insite仿真得到的反射路径与功率分布,验证了算法的有效性。     

视觉目标跟踪现状与发展

视觉目标跟踪系统在军事和民用领域都有重大的应用需求,如武器制导、视觉导航、安防监控等。视觉目标跟踪系统的目的是在视频序列的每一帧中准确地定位目标位置,还原目标完整的运动路径,为高层应用提供决策依据。根据任务需求不同,目标跟踪系统可以分为单目标跟踪和多目标跟踪。在算法层面分别介绍了视觉单目标跟踪和多目标跟踪的发展现状,并对相关算法的优点和不足做了简要分析。结合当前研究现状,简要地梳理了目标跟踪算法的发展趋势。研究表明,视觉目标跟踪是一个非常开放的研究领域,相关的理论和方法层出不穷,不同算法的侧重点也不尽相同,研究经典的目标跟踪算法有助于把握视觉目标跟踪中潜在的问题,为设计目标跟踪系统提供依据。     

An experiment evaluating how the tiny mass eccentricities in spin-stabilized projectiles affect the position of impact points

This study investigates and quantifies some possible sources affecting the position of impact points of small caliber spin-stabilized projectiles (such as 12.7 mm bullets). A comparative experiment utilizing the control variable method was designed to figure out the influence of tiny eccentric centroids on the projectiles. The study critically analyzes data obtained from characteristic parameter measurements and precision trials. It also combines Sobol's algorithm with an artificial intelligence algorithm—Adaptive Neuro-Fuzzy Inference Systems (ANFIS)—in order to conduct global sensitivity analysis and determine which parameters were most influential. The results indicate that the impact points of projectiles with an entry angle of 0° deflected to the left to that of projectiles with an entry angle of 90°. The difference of the mean coordinates of impact points was about 12.61 cm at a target range of 200 m. Variance analysis indicated that the entry angle — i.e. the initial position of mass eccentricity — had a notable influence. After global sensitivity analysis, the significance of the effect of mass eccentricity was confirmed again and the most influential factors were determined to be the axial moment and transverse moment of inertia (Izz Iyy), the mass of a projectile (m), the distance between nose and center of mass along the symmetry axis for a projectile (Lm), and the eccentric distance of the centroid (Lr). The results imply that the control scheme by means of modifying mass center (moving mass or mass eccentricity) is promising for designing small-caliber spin-stabilized projectiles.     

基于遗传算法的整周模糊度OTF解算

建立了一种基于简单遗传算法的改进模糊度搜索方法。首先采用一组约束方程求解模糊度浮点数解 ,然后UDUT 和LDLT 分解对整周模糊度进行整数高斯变换以降低各整周模糊度之间的相关性 ,最后利用遗传算法进行整周模糊度搜索。在种群个体较少的情况下 ,为了避免早熟使搜索陷入局部最优 ,提出两种变异算子 ,保持个体的多样性。仿真结果表明改进后的算法能够实时动态解算整周模糊度 ,且较使用简单遗传算法具有更快的搜索速度和鲁棒性。     

基于遗传算法的通信网络可靠性优化设计

在可靠性条件约束下 ,使网络成本最低是网络规划NP hard问题 .文章提出一种基于遗传算法的优化方法解决了这类问题 .仿真结果表明这种算法是有效的 .     

单静止站纯方位系统的可观测性与目标参数估计算法

分析了目标参数Vmx/Do,Vmy/Do 可观测的条件 ,给出了估计这对参数的一种递推算法 .     

Distribution free bounds for service constrained (Q,r) inventory systems

A classical and important problem in stochastic inventory theory is to determine the order quantity (Q) and the reorder level (r) to minimize inventory holding and backorder costs subject to a service constraint that the fill rate, i.e., the fraction of demand satisfied by inventory in stock, is at least equal to a desired value. This problem is often hard to solve because the fill rate constraint is not convex in (Q, r) unless additional assumptions are made about the distribution of demand during the lead‐time. As a consequence, there are no known algorithms, other than exhaustive search, that are available for solving this problem in its full generality. Our paper derives the first known bounds to the fill‐rate constrained (Q, r) inventory problem. We derive upper and lower bounds for the optimal values of the order quantity and the reorder level for this problem that are independent of the distribution of demand during the lead time and its variance. We show that the classical economic order quantity is a lower bound on the optimal ordering quantity. We present an efficient solution procedure that exploits these bounds and has a guaranteed bound on the error. When the Lagrangian of the fill rate constraint is convex or when the fill rate constraint does not exist, our bounds can be used to enhance the efficiency of existing algorithms. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 635–656, 2000