A multilevel passenger screening problem for aviation security

Passenger prescreening is a critical component of aviation security systems. This paper introduces the Multilevel Allocation Problem (MAP), which models the screening of passengers and baggage in a multilevel aviation security system. A passenger is screened by one of several classes, each of which corresponds to a set of procedures using security screening devices, where passengers are differentiated by their perceived risk levels. Each class is defined in terms of its fixed cost (the overhead costs), its marginal cost (the additional cost to screen a passenger), and its security level. The objective of MAP is to assign each passenger to a class such that the total security is maximized subject to passenger assignments and budget constraints. This paper shows that MAP is NP‐hard and introduces a Greedy heuristic that obtains approximate solutions to MAP that use no more than two classes. Examples are constructed using data extracted from the Official Airline Guide. Analysis of the examples suggests that fewer security classes for passenger screening may be more effective and that using passenger risk information can lead to more effective security screening strategies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Approximate dynamic programming methods for an inventory allocation problem under uncertainty

We propose two approximate dynamic programming methods to optimize the distribution operations of a company manufacturing a certain product at multiple production plants and shipping it to different customer locations for sale. We begin by formulating the problem as a dynamic program. Our first approximate dynamic programming method uses a linear approximation of the value function and computes the parameters of this approximation by using the linear programming representation of the dynamic program. Our second method relaxes the constraints that link the decisions for different production plants. Consequently, the dynamic program decomposes by the production plants. Computational experiments show that the proposed methods are computationally attractive, and in particular, the second method performs significantly better than standard benchmarks. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

基于整数规划的地地导弹打击目标优化选取

地地战役战术导弹火力运用中,对导弹打击目标的选取是导弹部队制定合理科学作战方案所面临的现实问题。针对给定弹量和特定作战意图对打击目标进行优化选择问题,运用0-1型整数规划,建立合理的数学模型并确定最优打击目标。通过应用实例表明,此方法简便易行,可操作性较强,具有一定的实用价值。     

任意三角城上的光滑插值

文中描述了任意三角域上插值逼近的两种方法,一种是布尔和插值,一种是凸组合插值,其特点是结构简单,易于计算。文中证明了三角网格区域上的整个插值曲面是c~1连续的,并指出离散化的插值曲面函数是空间散乱数据的一种光滑插值算法。     

显控台命令解释任务的设计方法

命令解释任务是显控台人－机交互软件的关键组成部分。本文介绍了该任务一般设计方法,提出了一种基于新的数据结构的设计,并通过比较探讨了该设计的有效性     

单调光滑函数的保形插值算法

对于给定的单调数组,本文描述了一种保形二次插值样条函数。插值函数结构简单、计算方便。最后估计了插值函数的误差。     

电磁场式头盔瞄准系统计算机提高实时性能问题

头盔瞄准系统是一种时分制的电磁场探测方法。在这种方法中有个非常关键的问题是实时性能问题。该文对控制电磁场的发射、接收以及实时滤波提出了一种独特的软件编排方法,这种方法已取得了较明显的效果;该文还探讨了从计算机硬件编排上进行改进的设想,以期获得更好的实时性能。     

面向对象计算机系统若干问题的研究

现有面向对象的软件环境大都建立在传统的Von Neumann 型计算机结构上,其执行效率很低。传统系统是无法支持面向对象风格高效实现的。很有必要开发新型的体系结构以支持这种良好的程序设计风格。本文从介绍面向对象程序设计的基本思想入手,建立面向对象思想与计算机系统的联系,阐述有关研究问题并给出初步的解决办法。     

Prolog 编译器中暂时变量分配方法研究

文中研究对prolog 编译器的暂时变量的分配,介绍了回溯分配法,着重介绍了一种高效的无回溯分配法的实现原理及其优点。     

未知最优值线性规划的修正 Karmarkar算法

本文对未知最优值的Karmarkar型线性规划,得到了一种复杂性为O(n~(3.5)L)的修正Karmarkar 算法;通过讨论加边矩阵和秩1修正矩阵的LDL~T 分解,得到了一种计算Q—斜投影的有效方法。最后,从理论上分析了算法的收敛性和复杂性。