对一体化联合作战的思考

对一体化联合作战的概念及基本特征作了介绍,探讨了研究一体化联合作战的迫切性,对我军一体化联合作战的的现状及如何加速提高我军一体化联合作战的能力作了详细的论述。     

威胁评估中的一种直觉模糊推理方法

针对战场信息中存在大量不确定性因素的特点,利用一种新的直觉模糊推理方法进行威胁企图分析。推理方法有效利用两个传统Zadeh模糊系统的输出结果,更接近于专家的思维。通过实例研究证明了该方法的可行性。直觉模糊推理是对一般模糊推理的有效扩充和发展,该方法对于提高作战指挥决策智能化具有一定的参考意义。     

Emergency transshipment in decentralized dealer networks: When to send and accept transshipment requests

While there has been significant previous literature on inventory transshipment, most research has focused on the dealers' demand filling decision (when to fill transshipment requests from other dealers), ignoring the requesting decision (when to send transshipment requests to other dealers). In this paper we develop optimal inventory transshipment policies that incorporate both types of decisions. We consider a decentralized system in which the dealers are independent of the manufacturer and of each other. We first study a network consisting of a very large number of dealers. We prove that the optimal inventory and transshipment decisions for an individual dealer are controlled by threshold rationing and requesting levels. Then, in order to study the impact of transshipment among independent dealers in a smaller dealer network, we consider a decentralized two‐dealer network and use a game theoretic approach to characterize the equilibrium inventory strategies of the individual dealers. An extensive numerical study highlights the impact of the requesting decision on the dealers' equilibrium behavior in a decentralized setting. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Optimal maintenance policies for serial,multi‐machine systems with non‐instantaneous repairs

We study optimal age‐replacement policies for machines in series with non‐instantaneous repair times by formulating two nonlinear programs: one that minimizes total cost‐rate subject to a steady‐state throughput requirement and another that maximizes steady‐state throughput subject to a cost‐rate budget constraint. Under reasonable assumptions, the single‐machine cost‐optimal and throughput‐optimal solutions are unique and orderable, and the multi‐machine optimal solutions have appealing structure. Furthermore, we establish equivalence between the two formulations and provide an illustrative numerical example. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

A stochastic model for burn‐in procedures in accelerated environment

Burn‐in procedure is a manufacturing technique that is intended to eliminate early failures of system or product. Burning‐in a component or system means to subject it to a period of use prior to being used in field. Generally, burn‐in is considered expensive and so the length of burn‐in is typically limited. Thus, burn‐in is most often accomplished in an accelerated environment in order to shorten the burn‐in process. A new failure rate model for an accelerated burn‐in procedure, which incorporates the accelerated ageing process induced by the accelerated environmental stress, is proposed. Under a more general assumption on the shape of failure rate function of products, which includes the traditional bathtub‐shaped failure rate function as a special case, upper bounds for optimal burn‐in time will be derived. A numerical example will also be given for illustration. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel

We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is required if a machine switches over from one job to another. Each order is released at time zero and has a positive weight. Preemptions are not allowed. The completion time of an order is the time at which all jobs of that order have been completed. The objective is to minimize the total weighted completion time of the orders. The problem is NP‐hard for any fixed number (≥2) of machines. Because of this, we focus our attention on two classes of heuristics, which we refer to as sequential two‐phase heuristics and dynamic two‐phase heuristics. We perform a worst case analysis as well as an empirical analysis of nine heuristics. Our analyses enable us to rank these heuristics according to their effectiveness, taking solution quality as well as running time into account. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Transient analysis of Markov models of fault‐tolerant systems with deferred repair using split regenerative randomization

The (standard) randomization method is an attractive alternative for the transient analysis of continuous time Markov models. The main advantages of the method are numerical stability, well‐controlled computation error, and ability to specify the computation error in advance. However, the fact that the method can be computationally very expensive limits its applicability. In this paper, we develop a new method called split regenerative randomization, which, having the same good properties as standard randomization, can be significantly more efficient. The method covers reliability‐like models with a particular but quite general structure and requires the selection of a subset of states and a regenerative state satisfying some conditions. For a class of continuous time Markov models, model class C₂, including typical failure/repair reliability‐like models with exponential failure and repair time distributions and deferred repair, natural selections are available for both the subset of states and the regenerative state and, for those natural selections, theoretical results are available assessing the efficiency of the method in terms of “visible” model characteristics. Those results can be used to anticipate when the method can be expected to be competitive. We illustrate the application of the method using a large class C₂ model and show that for models in that class the method can indeed be significantly more efficient than previously available randomization‐based methods. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

爆炸复合接头剪切强度测试方法研究

参照正交各向异性层压复合板层间剪切强度的测试方法,提出了用于测试爆炸复合接头复合界面剪切强度的3种方法;并建立三维有限元模型,分别对3种测试方法进行模拟;最后分别对3种方法进行了测试试验.结果表明,3种试验方法均能有效测试爆炸复合接头的剪切强度,其中对称试件双切口拉伸法最适合实际应用.     

整环上不定方程组的通解公式及其应用

借助Z上矩阵A∈Mm×n(Z)的标准形式D=VAU=diag(d1,d2,…,dq,0,…,0),得到了整环上不定方程组AX=B的通解公式以及矩阵初等变换法.     

On the normality and abnormality of offsets obligations

Defence offsets have often been described as government‐to‐business compensation arrangements or contracts involving “reciprocity beyond that associated with normal market exchange”. This paper argues that it is irrelevant and misleading to use this notion as a criterion for defining offsets.

The paper also explores the apparent inconsistency between the maximising efficiency in defence procurement and the application of offsets requirements. It is shown that defence offsets are a subset of all the price‐quality‐quantity trade‐offs which in general characterise negotiations surrounding complex transactions.

It is argued that although reciprocal or offsetting arrangements are a normal aspect of commercial transacting, the operation of certain offsets schemes namely mandatory offsets obligations, may inhibit the buyer's flexibility in negotiating deals and result in inefficient procurement. This leads us to ask why these offsets schemes have persisted for so long.