Military Off the Shelf Procurements: A Norwegian Case Study

Buying off the shelf procurements (OTS) has become an important part of the national acquisition strategy in several countries, and this paper seeks to bring empirical evidence on OTS as the preferred acquisition strategy by use of data from 2015 to 2022 investment portfolio of the Norwegian Armed Forces. We develop definitions for three categories of procurement – OTS, modified OTS and development projects – as well as a method to classify projects into these categories. Our first finding is that the characteristics of OTS projects correspond to modified OTS and development projects. Our second finding indicates that OTS projects perform better when it comes to the completion of projects according to the initial schedule, compared to development projects.     

基于大数据分析的网络管理智能化

军事通信网综合管理系统中,各专业网络运行情况的主要数据都可汇总到综合网管数据库中。这些网管数据中隐含了网络运行的几乎全部信息,但即使是最有经验的网络管理专家面对这些繁杂的数据也只能望洋兴叹。面对大数据的智能分析技术则有可能实现网络运行态势的高度可视化,充分理解和详细把握全网运行状态,像知识、经验、联想丰富的专家一样不知疲倦地对网络运行状况进行全面细致地分析,从海量的网管数据中发现网络故障的蛛丝马迹,发现隐含的问题,预知网络变化。论文介绍了利用大数据分析技术实现网络管理智能化的现实目标,基于性能的网络异常预测预报、基于性能和事件的故障分析诊断、网络运行知识的挖掘利用等方面的功能和技术途径。     

目标宽频带RCS的快速算法研究

目标宽带RCS预估算法一直是计算电磁学的一个研究热点,本文分别研究了渐近波形估计技术（AWE）与最佳一致逼近技术在宽频带RCS预估领域内的应用。首先,介绍了传统矩量法计算RCS的原理,并分析了两种快速算法的计算过程。然后,采用这两种技术,分别计算了简易飞机模型的RCS值,并对这两种方法进行比较。计算结果表明相比传统的矩量法,这两种方法在不影响精度的前提下大大提高了计算效率。同时,相比渐近波形估计技术,最佳一致逼近技术在节省内存,节约时间方面更具优势。最后,采用最佳一致逼近理论,结合电磁计算软件,实现较大尺寸目标的宽频带RCS的计算。     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

Dynamic inventory management with cash flow constraints

In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

并行离散事件仿真中的DDM机制实现

在并行离散事件仿真系统中实现仿真模型间的互操作机制需要引入类似HLA中定义的声明管理(DM)和数据分发管理(DDM)服务.我们开发的KD-PADSE高性能并行离散事件仿真环境采用谓词断言和对象代理方法在面向对象的并行离散事件仿真系统中实现了基于平行结构和事件调度机制的声明管理(DM)和数据分发管理(DDM)服务.在以千兆以太网互联的10节点Linux集群计算机上,采用DDM机制后仿真模型每秒(物理时间)可以进行1万次属性更新,是没有采用DDM机制时的20倍,在功能性和性能上验证了该DDM机制在并行离散事件仿真系统中的适用性.     

布尔函数的Walsh谱绝对值分布及其性质研究

提出并研究了布尔函数的Walsh谱绝对值分布.指出布尔函数Walsh谱绝对值分布在仿射变换下的不变性,计算了n(n≤5)元布尔函数的Walsh谱绝对值分布,研究了Walsh谱绝对值分布与Walsh谱支撑和Walsh谱中非零取值个数以及其他一些密码学难题的联系,最后研究了布尔函数的Walsh谱绝对值分布的大小.     

基于排队论的反舰导弹突防概率研究

根据水面舰艇对海导弹攻击中作战指挥的需要,提出了基于排队论中随机服务理论的反舰导弹突防概率解算模型.综合研究了目标舰艇编队采用各种手段进行抗击帮助条件下,反舰导弹突防概率的计算问题,并且结合想定装备参数进行了算例分析.为指挥员实施导弹攻击提供辅助决策和量化支持.     

海战场时空查询及索引机制研究

针对目前海战场信息系统的不足,引入时空数据技术对战场数据建模,并支持设计了海战场时空数据库原型系统.对系统要求的时空查询问题进行归纳,结合海战场数据特性加以分析,为后续的索引建立提供了依据.3D R-tree相较现有的其他时空索引更适用于海战场的环境,并通过扩充部分的弥补了其检索效率的不足.