表格/文本图像歪斜度检测方法

在表格处理和光符识别软件中．歪斜图像校正是一项重要的预处理技术。针对文本和表格图像,本文提出了一种基于线条检测模型的高精度、快速的歪斜图像检测方法。     

Stochastic duels with multiple hits and limited ammunition supply

Ancker's stochastic duels with limited ammunition supply are extended to cases where a kill is obtained through repetitive multiple hits with two firing modes, single-shot firing and pattern firing. Examples with negative exponential firing time and geometric ammunition supply are given.     

Estimation and prediction in a semi-markov model for evasive vehicle movement along a fixed path

In Turner and Holmes [8] a model for evasive vehicle movement along a fixed track is developed within the mathematical framework of a two-state semi-Markov process. They derive a number of analytical properties of the model. In this article we address problems concerning the estimation of parameters in the model and the construction of data-based prediction equations.     

社会网络分析在军事C^4ISR组织结构中的应用

针对C^4ISR组织结构的复杂特点,运用社会网络分析概念分析军事C。ISR（指挥、控制、通信、计算机、情报、监视和侦察）组织结构,旨在对军事组织结构中的C^4ISR的效能给出一种定量分析的方法。具体讲,就是描述了FINC（力量、情报、网络和指挥控制）方法,给出了大量的基本运算法则来比较和定量分析C^4ISR组织结构的组织网络,便于更全面地分析评估不同组织结构的费效比,并将其应用于一个想定的C^4ISR组织结构中。     

基于UML的作战视图描述

作战视图是进行系统顶层设计的体系结构技术中的重要组成部分.为提高设计效率,用面向对象语言来设计美国国防部体系结构框架中作战视图的方法,实现描述完成使命所需要的任务和行动、作战要素和信息交换.并给出了UML (统一建模语言)的实例,用以指导产品开发.     

基于“当前”统计模型的衰减因子自适应跟踪算法

针对机动目标跟踪问题,叙述了加速度方差自适应的"当前"统计模型.提出了一种具有自适应衰减因子的滤波算法,并对该算法进行了较为深入的理论分析.这种衰减记忆滤波具有集机动检测与参数自调整于一体的能力,最后Monte-Carlo仿真结果表明,这种自适应算法较原算法有较大的改进.     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008