目标识别中Hu矩、Zernike矩和小波矩的比较

在图像识别中利用矩特征是一种重要的方法。综述了前人使用Hu矩、 Zernike矩和小波矩进行目标识别的研究工作,并比较了它们在具体应用中的特点, 为图像识别算法中目标矩特征的选择提供了一定的依据。     

平面微波光子晶体的表面波带隙

光子晶体在微波毫米波领域已经有了广泛的应用,适合于微波集成电路结构的光子晶体结构将具有很大的应用前景。在微带介质层上周期加载矩形金属贴片,可以获得平面微波光子晶体,并且在特定频段内禁止表面波传播。利用格林函数和矩量法对这种平面微波光子晶体结构进行了计算,通过求解特征方程,得到在这种微带结构中表面波的传播常数,并通过参数设计得到所需要的表面波带隙。这种结构对于微波集成电路和相控阵天线具有很大的应用价值。     

机动管线顺序输送混油浓度检测装置研究

在管线顺序输送中,基于油品密度的混油浓度检测技术的应用最为广泛。根据机动管线的使用特点和要求,提出了几种适合机动管线的混油浓度检测方案,进行了分析比较,并设计了一种新型测力式混油浓度检测装置。该装置主体结构采用自力机械式结构。原理简单,无需外部电源,操作使用、维修保养方便。     

离散条件下数字图像矩不变量不变性的分析与研究

对离散条件下数字图像矩不变量的旋转和尺度不变性进行分析,证实了图像识别中采用的矩不变量存在较大变化范围.针对矩不变量变化的主要原因,给出了改进方法,并用实验加以验证.     

Decomposing inventory routing problems with approximate value functions

We present a time decomposition for inventory routing problems. The methodology is based on valuing inventory with a concave piecewise linear function and then combining solutions to single‐period subproblems using dynamic programming techniques. Computational experiments show that the resulting value function accurately captures the inventory's value, and solving the multiperiod problem as a sequence of single‐period subproblems drastically decreases computational time without sacrificing solution quality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Minimal LST representations of MAP(n)s: Moment fittings and queueing approximations

A Markovian arrival process of order n, MAP(n), is typically described by two n × n transition rate matrices in terms of rate parameters. While it is straightforward and intuitive, the Markovian representation is redundant since the minimal number of parameters is n² for non‐redundant MAP(n). It is well known that the redundancy complicates exact moment fittings. In this article, we present a minimal and unique Laplace‐Stieltjes transform (LST) representations for MAP(n)s. Even though the LST coefficients vector itself is not a minimal representation, we show that the joint LST of stationary intervals can be represented with the minimum number of parameters. We also propose another minimal representation for MAP(3)s based on coefficients of the characteristic polynomial equations of the two transition rate matrices. An exact moment fitting procedure is presented for MAP(3)s based on two proposed minimal representations. We also discuss how MAP(3)/G/1 departure process can be approximated as a MAP(3). A simple tandem queueing network example is presented to show that the MAP(3) performs better than the MAP(2) in queueing approximations especially under moderate traffic intensities. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 549–561, 2016     

一种面向混合数据集可视化的高效数据转换技术

应用领域中存在大量多数据类型属性的混合数据集,但是,很多有效多变元可视化方法的适用范围都只局限于单一类型,对于混合数据集可视化效果不甚理想。针对包含数值及分类型属性的多元混合数据集,提出一种面向混合数据集可视化的数据转换技术,首先对每一数值型属性使用聚类技术进行分类化,然后应用对应分析算法量化所有分类型属性,最后将转换后的混合数据集使用经典的数值型可视化方法——星形坐标法进行展现,并且针对变元数量较多或分类型变元势较高的混合数据集,在数据转换过程中提出一套降势策略,减少参与计算的变元数量,提高计算效率。实验表明,该方法对混合数据集的可视化结果不仅易于理解,而且有利于用户发现其中的隐性知识,降势策略在提高内存及时间效率方面作用显著。     

A generalized model for estimation of aerodynamic forces and moments for irregularly shaped bodies

A novel method for estimation of an aerodynamic force and moment acting on an irregularly shaped body (such as HE projectile fragments) during its flight through the atmosphere is presented. The model assumes that fragments can be approximated with a tri-axial ellipsoid that has continuous surface given as a mathematical function. The model was validated with CFD data for a tri-axial ellipsoid and verified using CFD data on aerodynamic forces and moments acting on an irregularly shaped fragment.The contribution of this method is that it represents a significant step toward a modeling that does not require a cumbersome CFD simulation results for estimation of fragment dynamic and kinematic parameters. Due to this advantage, the model can predict the fragment motion consuming a negligible time when compared to the corresponding time consumed by CFD simulations. Parametric representation (generalization) of the fragment geometrical data and the conditions provides the way to analyze various correlations and how parameters influence the dynamics of the fragment flight.     

电子侦察卫星联合侦察的混合调度算法

针对电子侦察卫星的使用约束,及不同任务的调度需求,建立了电子侦察卫星联合侦察的多目标混合整数规划模型.利用进化算法的全局搜索能力和变邻域搜索的局部优化能力,提出了一种多目标进化算法和变邻域搜索相结合两阶段混合调度算法MOEA VNS.针对问题多时间窗组合优化特点,设计了进化算子与邻域移动算子,在确保解多样性的同时使算法...     

A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms

This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013