Smalltalk-80 的形式语义研究

Smalltalk-80是原型的面向对象程序设计语言和环境。本文简要地介绍了Smalltalk-80的基本概念和抽象文法,给出了其形式模型,并基于该模型描述了Smalltalk-80的静态指称语义和动态指称语义。     

舰艇隐身术

隐身是近几十年发展的新技术,它在电子战中发挥了重要作用。本文综述了舰船隐身的种类、机理和措施,并介绍了舰船隐身术的最新发展。     

TURBO PROLOG 2.0开发环境的汉化

本文讨论了目前广泛使用的编译型逻辑程序设计语言TURBO PROLOG2.0开发环境的汉化问题。文中分析了TURBO PROLOG 2.0显示程序的一些特点以及目前使用的汉化版本存在的几个主要问题和汉化时应注意的几个问题,最后给出了2个典型程序段汉化的例子。     

The failure of defense planning in European Post-Communist Defense Institutions: ascertaining causation and determining solutions

By any objective measure, defense institutions in Central and Eastern Europe have all but universally been incapable of producing viable defense plans that are based on objective costing and operational planning data. This situation exists in spite the provision of considerable Western advice and assistance, let alone reporting to and receiving assessments by NATO’s International Staff under Partnership for Peace, as well as via the integrated defense planning and reporting systems. An explanation for this systematic failure across European post-Communist defense institutions can be found in the continued slow development of an over-arching policy framework which directs and approves all activities of the armed forces, as well as the de-centralization of financial decision-making down to capability providers. The essay ends with an examination of the adverse effects of the early introduction of planning programming, budgeting system (PPBS), have had on the development of effective policy and planning capabilities within these defense institutions.     

面向多最优解组合优化问题的决策求解算法

针对具有固定物品总和、多最优解特征的组合优化问题,以固定总和实数子集问题和购买鸡翅问题为例,给出了这类多最优解组合优化问题的形式化表示。在分析枚举等经典算法基础上,提出了基于整数状态表示和实数状态表示的0-1决策递归搜索多最优解动态规划算法。针对该算法在最优解数量较大时,时间复杂度趋向O(mⁿ)的问题,提出了基于相同决策路径合并和基于0-x决策的两种改进算法。实验中两种改进算法的计算时间基本符合与O(nb+nm)的正比关系,表明对于这类多最优解组合优化问题具有良好的求解性能。     

基于随机提前期的备件携行量计算方法

舰艇出海执行任务期间,需要携行一定种类和数量的物资自给。文中研究了这种单级供应条件下,如何确定备件最优携行量的问题。建立了以服务水平为目标,以资源为约束的目标规划模型,模型考虑了随机提前期和备件重要度。提出一种基于边际效费比的增量法用于求解这个模型。最后,给出一个算例并得到了一些结论。     

Integrated production scheduling and preventive maintenance planning for a single machine under a cumulative damage failure process

This paper finds the optimal integrated production schedule and preventive maintenance plan for a single machine exposed under a cumulative damage process, and investigates how the optimal preventive maintenance plan interacts with the optimal production schedule. The goal is to minimize the total tardiness. The optimal policy possesses the following properties: Under arbitrary maintenance plan when jobs have common processing time, and different due dates, the optimal production schedule is to order the jobs by earliest due date first rule; and when jobs have common due date and different processing times, the optimal production schedule is shortest processing time first. The optimal maintenance plan is of control limit type under any arbitrary production schedule when machine is exposed under a cumulative damage failure process. Numerical studies on the optimal maintenance control limit of the maintenance plan indicate that as the number of jobs to be scheduled increases, the effect of jobs due dates on the optimal maintenance control limit diminishes. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Machine maintenance with workload considerations

Machine maintenance is modeled in the setting of a single‐server queue. Machine deterioration corresponds to slower service rates and failure. This leads to higher congestion and an increase in customer holding costs. The decision‐maker decides when to perform maintenance, which may be done pre‐emptively; before catastrophic failures. Similar to classic maintenance control models, the information available to the decision‐maker includes the state of the server. Unlike classic models, the information also includes the number of customers in queue. Considered are both a repair model and a replacement model. In the repair model, with random replacement times, fixed costs are assumed to be constant in the server state. In the replacement model, both constant and variable fixed costs are considered. It is shown in general that the optimal maintenance policies have switching curve structure that is monotone in the server state. However, the switching curve policies for the repair model are not always monotone in the number of customers in the queue. Numerical examples and two heuristics are also presented. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

线性规划优化分析的元模型方法及其比较

线性规划优化分析在经济管理等领域有着广泛的应用。当线性规划约束条件的右端向量在一定范围内变化时,目标函数的最优值是右端向量的一个复杂的分片线性函数,但通常难以给出分析表达式。应用多项式回归、径向基函数、Kriging法及多项式回归 Kriging法这四种元模型方法,能快速预测最优值函数。通过仿真实验,对这四种形式的元模型作较全面的比较分析。数值实验的结果表明,用次数较少的实验设计,后三种方法都具有较高的拟合精度;特别地,多项式回归 Kriging法不仅拟合精度高,而且还能用一个二阶多项式给出最优值函数的一个简明的近似描述。结果表明,元模型方法是研究线性规划优化分析问题的有效途径。     

A stochastic assignment problem

There are n boxes with box i having a quota value Balls arrive sequentially, with each ball having a binary vector attached to it, with the interpretation being that if X_i = 1 then that ball is eligible to be put in box i. A ball's vector is revealed when it arrives and the ball can be put in any alive box for which it is eligible, where a box is said to be alive if it has not yet met its quota. Assuming that the components of a vector are independent, we are interested in the policy that minimizes, either stochastically or in expectation, the number of balls that need arrive until all boxes have met their quotas. © 2014 Wiley Periodicals, Inc. 62:23–31, 2015