党委领导作战的经验研究及理论思考

党委领导作战是我军的优良传统。本文回顾了党委领导作战的创立发展过程,指出我军实行党委领导作战是历史的选择,分析探讨了党委领导作战的价值作用,以及坚持党委领导作战必须把握的若干关节点,强调在未来战争中必须坚定不移地继续坚持党委领导作战的原则。     

On optimal system designs in reliability‐economics frameworks

Reliability Economics is a field that can be defined as the collection of all problems in which there is tension between the performance of systems of interest and their cost. Given such a problem, the aim is to resolve the tension through an optimization process that identifies the system which maximizes some appropriate criterion function (e.g. expected lifetime per unit cost). In this paper, we focus on coherent systems of n independent and identically distributed (iid) components and mixtures thereof, and characterize both a system's performance and cost as functions of the system's signature vector (Samaniego, IEEE Trans Reliabil (1985) 69–72). For a given family of criterion functions, a variety of optimality results are obtained for systems of arbitrary order n. Approximations are developed and justified when the underlying component distribution is unknown. Assuming the availability of an auxiliary sample of N component failure times, the asymptotic theory of L‐estimators is adapted for the purpose of establishing the consistency and asymptotic normality of the proposed estimators of the expected ordered failure times of the n components of the systems under study. These results lead to the identification of ε‐optimal systems relative to the chosen criterion function. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Pricing bridges to cross a river

We consider a pricing problem in directed, uncapacitated networks. Tariffs must be defined by an operator, the leader, for a subset of m arcs, the tariff arcs. Costs of all other arcs in the network are assumed to be given. There are n clients, the followers, and after the tariffs have been determined, the clients route their demands independent of each other on paths with minimal total cost. The problem is to find tariffs that maximize the operator's revenue. Motivated by applications in telecommunication networks, we consider a restricted version of this problem, assuming that each client utilizes at most one of the operator's tariff arcs. The problem is equivalent to pricing bridges that clients can use in order to cross a river. We prove that this problem is APX‐hard. Moreover, we analyze the effect of uniform pricing, proving that it yields both an m approximation and a (1 + lnD)‐approximation. Here, D is upper bounded by the total demand of all clients. In addition, we consider the problem under the additional restriction that the operator must not reject any of the clients. We prove that this problem does not admit approximation algorithms with any reasonable performance guarantee, unless P = NP, and we prove the existence of an n‐approximation algorithm. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Clustering in defence-related procurement: the case of a Belgian naval construction cluster

ABSTRACT

This paper examines the importance of closer co-operation in defence-related procurement. Led by the decision that Belgium will lead the procurement of 12 Mine CounterMeasures Vessels (MCMV), the case of a potential Belgian naval construction cluster is discussed. The feasibility of a potential cluster is investigated by looking at key elements of a successful naval construction cluster, the Dutch naval construction cluster, and comparing those key elements to the current Belgian situation. Forming a sustainable Belgian naval construction cluster will be difficult. Most of the procurement process of the MCMVs is set on a European tender. In the long run, due to the absence of both a launching customer and leader firms, no party is able to carry the cluster with investments and knowledge spill-overs. In order to keep public support for large defence-related investments, clustering around the MCMV integration system and proactive cluster support is recommended.     

Level product form QSF processes and an analysis of queues with Coxian interarrival distribution

In this article, we study a class of Quasi‐Skipfree (QSF) processes where the transition rate submatrices in the skipfree direction have a column times row structure. Under homogeneity and irreducibility assumptions we show that the stationary distributions of these processes have a product form as a function of the level. For an application, we will discuss the ‐queue that can be modeled as a QSF process on a two‐dimensional state space. In addition, we study the properties of the stationary distribution and derive monotonicity of the mean number of the customers in the queue, their mean sojourn time and the variance as a function of for fixed mean arrival rate. © 2016 Wiley Periodicals, Inc. Naval Research Logisticsxs 66:57–72, 2019