基于空间几何法的目视探测地面目标模型

通过模仿对地攻击机上飞行员的目视搜索发现地面可视目标的过程,建立了其空间几何模型;通过该几何模型得到目视搜索发现目标的数学模型;根据实际情况对模型进行简化,得到简化模型.该模型可信度高,能有效地提高作战效能评估的准确性,对于指挥决策部门和设计单位有一定的参考意义.     

公安消防机构办理失火案和消防责任事故案法理探讨

办理“两案”案件对公安消防机构来说是一个全新的概念,如何正确充分履行法律赋予的侦查职能,已成为各级公安消防机构面临的重要课题。从法理和实践角度对“两案”办理工作进行探讨。     

搜索引擎的技术现状及发展趋势

本文介绍了搜索引擎的工作原理及分类,并从目前搜索引擎存在的问题出发,展望未来更完美的搜索技术。     

准最优增量搜索效率分析

在对极限搜索圆进行特殊分割的条件下,导出准最优增量搜索和准最优总量搜索发现目标概率的计算公式,并通过对搜索力变化时两种发现概率的比较,得出了准最优增量搜索优于准最优总量搜索的重要结论.     

基于参数优化的SVM联合作战战场建设方案优选

联合作战战场建设方案优选可最大可能降低建设工程的损耗、提高整体建设效益。针对联合作战战场建设方案优选问题进行研究,首先梳理联合作战战场建设方案优选流程,然后构建包括作战保障工程、后勤保障工程、装备保障工程和战场基础信息数据库的指标体系,并提出基于网格搜索和交叉验证优化的改进SVM方法实施方案优选,仿真结果表明优化后参数的性能明显优于默认参数,更加适用于联合作战战场建设方案优选问题。     

New results on a Ruckle problem in discrete games of ambush

This article deals with a two‐person zero‐sum game in which player I chooses in integer interval [1, N] two integer intervals consisting of p and q points where p + q < N, and player II chooses an integer point in [1, N]. The payoff to player I equals 1 if the point chosen by player II is at least in one of the intervals chosen by player II and 0 otherwise. This paper complements the results obtained by Ruckle, Baston and Bostock, Lee, Garnaev, and Zoroa, Zoroa and Fernández‐Sáez. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 98–106, 2001     

地理坐标与直角坐标相互转换的算法

通过对地理坐标与地面直角坐标相互转换原理的分析 ,论述了坐标转换和算法研究及实现方法。此方法具有良好的精确性和实时性 ,完全能够满足军事领域应用的需要。     

An interactive procedure for selecting acceptable alternatives in the presence of multiple criteria

In this paper, we consider the multiple criteria decision‐making problem of partitioning alternatives into acceptable and unacceptable sets. We develop interactive procedures for the cases when the underlying utility function of the decision maker is linear, quasiconcave, and general monotone. We present an application of the procedures to the problem of admitting students to the master's degree program at the Industrial Engineering Department, Middle East Technical University. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 592–606, 2001.     

Rendezvous search when marks are left at the starting points

Leaving marks at the starting points in a rendezvous search problem may provide the players with important information. Many of the standard rendezvous search problems are investigated under this new framework which we call markstart rendezvous search. Somewhat surprisingly, the relative difficulties of analysing problems in the two scenarios differ from problem to problem. Symmetric rendezvous on the line seems to be more tractable in the new setting whereas asymmetric rendezvous on the line when the initial distance is chosen by means of a convex distribution appears easier to analyse in the original setting. Results are also obtained for markstart rendezvous on complete graphs and on the line when the players' initial distance is given by an unknown probability distribution. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 722–731, 2001     

Scheduling stochastic jobs with asymmetric earliness and tardiness penalties

We consider a stochastic counterpart of the well-known earliness-tardiness scheduling problem with a common due date, in which n stochastic jobs are to be processed on a single machine. The processing times of the jobs are independent and normally distributed random variables with known means and known variances that are proportional to the means. The due dates of the jobs are random variables following a common probability distribution. The objective is to minimize the expectation of a weighted combination of the earliness penalty, the tardiness penalty, and the flow-time penalty. One of our main results is that an optimal sequence for the problem must be V-shaped with respect to the mean processing times. Other characterizations of the optimal solution are also established. Two algorithms are proposed, which can generate optimal or near-optimal solutions in pseudopolynomial time. The proposed algorithms are also extended to problems where processing times do not satisfy the assumption in the model above, and are evaluated when processing times follow different probability distributions, including general normal (without the proportional relation between variances and means), uniform, Laplace, and exponential. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44, 531–557, 1997.