基于动态模板匹配的非接触超声弹体厚度测量方法

为了实现某弹体在车削加工过程中弹体厚度的自动测量,采用喷水式的非接触超声检测方法,利用弹体和刀架的匀速旋转和移动,在工控机的控制下实现弹体的全面检测。通过动态模板匹配的超声回波处理方法计算出弹体各检测位置的厚度值。检测结果表明,该检测方法的检测精度可达到0.1 mm。     

改进蚁群算法在DSR路由协议中的应用

针对移动Ad hoc网络节点移动频繁和单路径DSR路由协议不能均衡负载、网络健壮性低以及蚁群算法存在局部查询最优的问题,提出一种改进的蚁群算法,并把改进的蚁群算法应用到单路径路由协议DSR,设计出基于蚁群算法的多路径路由协议IDSR,通过仿真实验,从影响Ad hoc网络路由协议性能优劣的3个主要指标来比较IDSR、DSR路由协议和SMR路由协议的性能,实验结果表明,虽然改进协议IDSR路由开销比DSR、SMR稍有增加,但分组的投递率和平均端到端延时性能都有明显提高。     

RCS特性辅助的CMIMO雷达功率资源分配方法

针对集中式多输入多输出(collocated multiple-input multiple-output, CMIMO)雷达在实际探测过程中,未有效结合目标雷达散射截面(radar cross section, RCS)高动态变化特性导致雷达跟踪精度不高甚至失跟的问题,提出一种基于目标RCS高动态特性的CMIMO雷达功率资源自适应分配方法。考虑到目标RCS特征的角度敏感性,利用目标运动状态的可预测性动态获取实际观测角度,从而完成跟踪帧的极化方式优选;在此基础上构建包含功率与RCS的多目标跟踪误差后验克拉美罗下界,将其作为目标函数进行优化,利用内点惩罚法求解该凸优化问题即可实现RCS高动态情况下的功率优化分配。实验结果表明:该方法可结合目标不同方向RCS动态分集特性实现功率的有效分配,相比于传统RCS模型分配方案,有效解决了分配方案与实际跟踪场景之间的失配问题,从而提升了CMIMO雷达的多目标跟踪性能。     

Dynamic proximity calculations for situation awareness

We apply dynamic proximity calculations (density and clustering) from dynamic computational geometry to a military application. The derived proximity information serves as an abstract view of a current situation in the battlefield that can help a military commander achieve situation awareness. We employ Delaunay triangulation as a computational tool in our framework, and study its dynamic update in depth. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

关于圆柱壳在水下爆炸冲击波作用下二次加载现象的数值模拟研究

运用大型商业有限元程序MSC.DYTRAN数值模拟了水下爆炸冲击波载荷作用下自由环肋圆柱壳的非线性动态响应.采用一般耦合算法(generalcoupling)模拟流体与结构的耦合效应,计算中考虑了材料的应变率强化效应,几何非线性的影响,分析了空穴现象的产生和二次加载对结构响应的影响.仿真结果表明,相同工况和厚度下的无限自由平板和自由环肋圆柱壳,后者的空化时间比前者长,而壳体运动的最大速度后者比前者低.     

基于DTRC的形式自动证明平台及其应用

动态项重写计算(DTRC)是项重写系统(TRS)的元计算模型,具有层次化结构和动态重写等特征,可应用于归纳定理的形式自动证明以及项重写系统弱终止性的形式自动证明等方面.文中介绍了一个基于DTRC的形式自动证明平台及其在TRS弱终止性自动证明上的应用.     

基于ASP．NET技术的动态网页实现

ASP .NET为Web应用系统开发提供了一种全新的灵活的基础结构,是迄今为止最先进的Web应用服务系统开发平台.动态网页是Web应用服务系统的核心.提出了采用ASP .NET技术实现动态网页的方法,在数字化油库与油库信息可视化项目研究中得到很好的应用.     

Newsvendor problems with sequentially revealed demand information

This article analyzes a capacity/inventory planning problem with a one‐time uncertain demand. There is a long procurement leadtime, but as some partial demand information is revealed, the firm is allowed to cancel some of the original capacity reservation at a certain fee or sell off some inventory at a lower price. The problem can be viewed as a generalization of the classic newsvendor problem and can be found in many applications. One key observation of the analysis is that the dynamic programming formulation of the problem is closely related to a recursion that arises in the study of a far more complex system, a series inventory system with stochastic demand over an infinite horizon. Using this equivalence, we characterize the optimal policy and assess the value of the additional demand information. We also extend the analysis to a richer model of information. Here, demand is driven by an underlying Markov process, representing economic conditions, weather, market competition, and other environmental factors. Interestingly, under this more general model, the connection to the series inventory system is different. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 2012     

Optimal path finding in direction,location, and time dependent environments

This article examines optimal path finding problems where cost function and constraints are direction, location, and time dependent. Recent advancements in sensor and data‐processing technology facilitate the collection of detailed real‐time information about the environment surrounding a ground vehicle, an airplane, or a naval vessel. We present a navigation model that makes use of such information. We relax a number of assumptions from existing literature on path‐finding problems and create an accurate, yet tractable, model suitable for implementation for a large class of problems. We present a dynamic programming model which integrates our earlier results for direction‐dependent, time and space homogeneous environment, and consequently, improves its accuracy, efficiency, and run‐time. The proposed path finding model also addresses limited information about the surrounding environment, control‐feasibility of the considered paths, such as sharpest feasible turns a vehicle can make, and computational demands of a time‐dependent environment. To demonstrate the applicability and performance of our path‐finding algorithm, computational experiments for a short‐range ship routing in dynamic wave‐field problem are presented. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Economic lot sizing with constant capacities and concave inventory costs

This article studies the classical single‐item economic lot‐sizing problem with constant capacities, fixed‐plus‐linear order costs, and concave inventory costs, where backlogging is allowed. We propose an O(T³) optimal algorithm for the problem, which improves upon the O(T⁴) running time of the famous algorithm developed by Florian and Klein (Manage Sci18 (1971) 12–20). Instead of using the standard dynamic programming approach by predetermining the minimal cost for every possible subplan, we develop a backward dynamic programming algorithm to obtain a more efficient implementation. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012