Simulating stable stochastic systems,V: Comparison of ratio estimators

The regenerative method for estimating parameters in a simulation requires the simulator to estimate the ratio of two means. Five point estimates and four confidence intervals for this ratio have been computed for three stochastic simulations. The jackknife method appears to be the most promising for both point and interval estimation.     

Least-absolute-value estimators for one-way and two-way tables

This paper concerns itself with the problem of estimating the parameters of one-way and two-way classification models by minimization of the sum of the absolute deviations of the regression function from the observed points. The one-way model reduces to obtaining a set of medians from which optimal parameters can be obtained by simple arithmetic manipulations. The two-way model is transformed into a specially structured linear programming problem, and two algorithms are presented to solve this problem. The occurrence of alternative optimal solutions in both models is discussed, and numerical examples are presented.     

Multiproduct lot-size scheduling with proportional product demands

In this paper we consider the multiproduct, multiperiod production-scheduling model of Manne under the assumption that, across products, demands are interrelated over time. When demand requirements are proportional we show that the solution has a specific structure determined by the ratio of setup to production-run time of each product. This structure holds for any length horizon and may permit a substantial (time) savings for column generation solution procedures.     

The continuous multiple-modular design problem

In this article we extend our previous work on the continuous single-module design problem to the multiple-module case. It is assumed that there is a fixed cost associated with each additional module used. The Kuhn–Tucker conditions characterize local optima among which there is a global optimum. Modules are associated with partitions and a special class, guillotine partitions, are characterized. Branch-and-bound, partial enumeration, and heuristic procedures for finding optimum or good guillotine partitions are discussed and illustrated with examples.     

An approximate solution method for the fixed charge problem

In the absence, to date, of an exact method for solving the linear programming problem with fixed charges, two heuristic methods have been proposed and extensively investigated, computationally, for moderate sized problems. The results indicate that the heuristic methods produce optimal solutions in well over 90 percent of the several hundred problems investigated and very close to optimal (a few percent) in the remaining cases. Hence it should be of practical significance to practitioners in the field.     

Dynamic programming approach to the optimization of Naval aircraft rework and replacement policies

This paper describes a method for determining optimal repair and replacement policies for aireraft, with specific reference to the F–4. The objective of the analysis is to choose the set of policies from all possible alternatives over a finite planning horizon which minimizes the cost of operations. A dynamic program is presented which seeks an optimal path through a series of decision periods, when each period begins with the choice of keeping an aircraft, reworking it before further operation, or buying a new one. We do not consider changes in technology. Therefore, when a replacement does occur, it is made with a similar aircraft. Multivariate statistical techniques are used to estimate the relevant costs as a function of age, and time since last rework.     

舰船研制中设计余量的权衡分析

分析了舰船及其装备研制的时间特点 ,给出了用于预测的空间特性有关计算公式 .对设计余量的种类和体现方式进行了讨论 ,并对国内外现有设计实例进行了详细的得失分析和权衡 ,在此基础上提出了分析结论 .     

某型导弹装备使用保障能力评估

导弹装备是一种高可靠性,单一使用的冷储备系统,其先进的战术技术性能必须在有效协调使用保障的基础上才能充分发挥出来。在对某型导弹装备使用保障工作分析的基础上,提出了基于该导弹装备品质的使用保障能力评估指标体系,运用模糊理论建立了多级模糊层次综合评判模型,给出了导弹装备使用保障能力的量化评估方法,并进行了实例计算,结果可为该装备使用保障工作的进一步优化提供参考和依据。     

一种用于编队协同的Ad Hoc网络MAC协议

结合无人机编队和卫星编队自组织分布协同应用场景,基于IEEE 802.11无线MAC协议,给出了MAC协议优化算法:S-DCF算法和最小竞争窗口调整算法。每个站点通过S-DCF算法估算当前网络中竞争站点的数目,然后根据最小竞争窗口调整公式调整最小竞争窗口。仿真结果表明,系统吞吐量得到明显提高,时延明显减小。该优化算法对提高和完善编队协同网络的通信性能具有一定意义。