Shock model in Markovian environment

A Markov modulated shock models is studied in this paper. In this model, both the interarrival time and the magnitude of the shock are determined by a Markov process. The system fails whenever a shock magnitude exceeds a pre‐specified level η. Nonexponential bounds of the reliability are given when the interarrival time has heavy‐tailed distribution. The exponential decay of the reliability function and the asymptotic failure rate are also considered for the light‐tailed case. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

基于HLA的电子战仿真测试与评估

针对电子战系统的特点,介绍了电子战系统开发与测试的一般过程。分析基于高层体系结构的电子战仿真测试与评估包括两个方面,HLA各组成部分性能以及电子战系统自身效能的测试与评估。在分析美国电子战仿真测试的基础上,将基于HLA的电子战系统应用于指挥自动化体系对抗仿真中,设计了对应的框架结构。分别对运行支撑系统KD-RTI和DMSORTI1.3v6在不同传输方式下的传输时延和丢包率进行了比较。进一步以信息的完备性为指标,对电子战系统的作战效能进行了评估。     

压力板仪配套及SWCC试验的若干问题探讨

采用高压氮气瓶、压力控制箱及精密电子天平等器件,对从美国土壤水分仪器公司进口的压力板仪核心部件进行了配套完善。介绍了配套后的压力板仪土-水特征曲线测试系统的结构组成与特点,对土-水特征曲线(SWCC)试验过程中应注意的问题进行了剖析。用配套的压力板仪测定了宁夏原状自重湿陷性黄土、北京原状粉质粘土和小浪底防渗斜墙重塑黄土类壤土等3种土样的土-水特征曲线,并对试验结果进行了分析。     

Bin‐packing problem with concave costs of bin utilization

We consider a generalized one‐dimensional bin‐packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin‐packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD). We analyze their worst‐case performances when they are applied to our model. The absolute worst‐case performance ratio of FF and BF is shown to be exactly 2, and that of FFD and BFD is shown to be exactly 1.5. Computational experiments are also conducted to test the performance of these heuristics. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Fully sequential indifference‐zone selection procedures with variance‐dependent sampling

Fully sequential indifference‐zone selection procedures have been proposed in the simulation literature to select the system with the best mean performance from a group of simulated systems. However, the existing sequential indifference‐zone procedures allocate an equal number of samples to the two systems in comparison even if their variances are drastically different. In this paper we propose new fully sequential indifference‐zone procedures that allocate samples according to the variances. We show that the procedures work better than several existing sequential indifference‐zone procedures when variances of the systems are different. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Defence Spending and Income Inequality in Taiwan

The rising trend in income inequality has recently attracted a renewed interest in the determinants of this growing trend across many countries. This article adds to the debate by investigating the impact of defence expenditure as a possible determinant of inequality in Taiwan, a country once was considered to be a poster child of an equitable growth, but now income inequality has become one of the Taiwan’s growing challenges. Applying the bounds test approach to cointegration and four long-run estimators for the period from 1976–2011, we found a long-run relationship between the various measures of inequality and defence expenditure where defence expenditure exerts a positive and a statistically significant impact on the worse income inequality in Taiwan. Further application of the lag-augmented causality test procedure also reveals a unidirectional causality running from defence expenditure to income inequality with defence expenditure causing income inequality to rise.     

Convolutions and generalization of logconcavity: Implications and applications

Additive convolution of unimodal and α‐unimodal random variables are known as an old classic problem which has attracted the attention of many authors in theory and applied fields. Another type of convolution, called multiplicative convolution, is rather younger. In this article, we first focus on this newer concept and obtain several useful results in which the most important ones is that if is logconcave then so are and for some suitable increasing functions ?. This result contains and as two more important special cases. Furthermore, one table including more applied distributions comparing logconcavity of f(x) and and two comprehensive implications charts are provided. Then, these fundamental results are applied to aging properties, existence of moments and several kinds of ordered random variables. Multiplicative strong unimodality in the discrete case is also introduced and its properties are investigated. In the second part of the article, some refinements are made for additive convolutions. A remaining open problem is completed and a conjecture concerning convolution of discrete α‐unimodal distributions is settled. Then, we shall show that an existing result regarding convolution of symmetric discrete unimodal distributions is not correct and an easy alternative proof is presented. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 109–123, 2016     

Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost

Motivated by the flow of products in the iron and steel industry, we study an identical and parallel machine scheduling problem with batch deliveries, where jobs finished on the parallel machines are delivered to customers in batches. Each delivery batch has a capacity and incurs a cost. The objective is to find a coordinated production and delivery schedule that minimizes the total flow time of jobs plus the total delivery cost. This problem is an extension of the problem considered by Hall and Potts, Ann Oper Res 135 (2005) 41–64, who studied a two‐machine problem with an unbounded number of transporters and unbounded delivery capacity. We first provide a dynamic programming algorithm to solve a special case with a given job assignment to the machines. A heuristic algorithm is then presented for the general problem, and its worst‐case performance ratio is analyzed. The computational results show that the heuristic algorithm can generate near‐optimal solutions. Finally, we offer a fully polynomial‐time approximation scheme for a fixed number of machines. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 492–502, 2016     

Minimal LST representations of MAP(n)s: Moment fittings and queueing approximations

A Markovian arrival process of order n, MAP(n), is typically described by two n × n transition rate matrices in terms of rate parameters. While it is straightforward and intuitive, the Markovian representation is redundant since the minimal number of parameters is n² for non‐redundant MAP(n). It is well known that the redundancy complicates exact moment fittings. In this article, we present a minimal and unique Laplace‐Stieltjes transform (LST) representations for MAP(n)s. Even though the LST coefficients vector itself is not a minimal representation, we show that the joint LST of stationary intervals can be represented with the minimum number of parameters. We also propose another minimal representation for MAP(3)s based on coefficients of the characteristic polynomial equations of the two transition rate matrices. An exact moment fitting procedure is presented for MAP(3)s based on two proposed minimal representations. We also discuss how MAP(3)/G/1 departure process can be approximated as a MAP(3). A simple tandem queueing network example is presented to show that the MAP(3) performs better than the MAP(2) in queueing approximations especially under moderate traffic intensities. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 549–561, 2016     

阻隔材料静电屏蔽性能测试方法的实验研究

分析了目前国际上有关静电屏蔽性能测试的标准方法,针对我国目前缺少与国军标GJB2605-96配套的测试装置,作者参照美国电子工业协会标准EIA-541研制了一套静电屏蔽性能测试装置,并将此与美制静电屏蔽测试表ACL-500进行了对比实验,结果表明:在试验基板接地与不接地的两种情况下,试样内感应的峰值电压相差很大;试样的尺寸大小对测试结果影响不大;为了保证所测试的结果具有可比性,必须保持电容探头离试样袋口相等的距离。