信息知识库中的数据可用性恢复策略

信息知识库在工业生产中能够提高生产效率、降低资源消耗,但数据失效频率高。针对多节点失效重构的纠删码策略较少,且未充分考虑失效数据重构时各参与节点间的链路关系,导致重构效率较低。针对信息知识库数据失效,提出一种新的重构策略。根据节点的数据处理能力,选取数据处理能力最高的新生节点为路由节点;依据路由节点与候选供应节点及剩余空闲节点的链路带宽,确定供应节点及新生节点,从而构建数据重构网络拓扑,提高失效数据重构效率。实验结果证实,与传统纠删码策略性能比较,该方法有较短的重构时间和较高的重构成功率。     

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     

动态灰色时序系统 DGTS 及其在安全策略规范中的应用

设计安全策略模型时应考虑安全策略的时序特性和灰色特性,还应综合考虑保密性、完整性和可用性三方面的需求。已有的安全模型没有描述时序性和灰色特性,而且一般只侧重描述保密性或完整性。为此,本文提出了动态灰色时序系统（简称ＤＧＴＳ）。本文详细描述了ＤＧＴＳ,以及基于ＤＧＴＳ的动态语义设计的灰色时序安全策略规范语言ＧＴＳＬ。     

WHO IS THE ENEMY?

We examine who benefits when there is a strong leader in place, and who benefits when a situation lacks a proper leader. There are fractious terrorist groups who seek to serve the same people in common cause against a common enemy. The groups compete for rents obtained from the public by engaging in actions against the common enemy. We determine the leadership structure under which each group is better off, as well as the circumstance that the common enemy prefers. We are able to state simple and general conditions for each group and the common enemy to benefit.     

ECONOMIC GROWTH AND VIOLENT INTERNATIONAL CONFLICT: 1875–1999

This paper extends the joint product model of military alliances to apply to the new strategic doctrine adopted by NATO in the 1990s. In particular, a choice must be made between protecting one's own territory and pooling forces for an alliancewide rapid reaction force. This new model accounts for a host of externalities and their implications for burden sharing, full financing, and allocative efficiency. The Pigouvian taxes that adjust for force thinning and attack deflection are shown to finance optimal border‐protecting forces under a variety of circumstances. Second‐best considerations arise owing to the pure publicness of rapid reaction forces. The ideal toll arrangement does not currently characterize NATO financing, nor is it likely to do so.     

THE F‐35 JOINT STRIKE FIGHTER AS A SOURCE OF INNOVATIon AND EMPLOYMENT: SOME INTERIM RESULTS

The F‐35 Joint Strike Fighter (JSF) programme is important for innovation in the Dutch economy and also contributes to other programmes in the aerospace industry (spin‐off) and other industries (spillover). On top of the expected value of US$9.2 billion in development and production, based on interviews with 10 companies and research institutes, an expected spin‐off of US$1.1 billion and an expected spillover of US$120 million will result. In addition, over 23,000 man‐years are associated with the activities in the development and production of the JSF. This study excludes the large and labour‐intensive Maintenance, Repair and Overhaul (MRO) activities. Further validation of data and an update of current results is planned for 2006.