军事虚拟仓库组织结构的博弈分析

简要介绍了军事虚拟仓库及其组织结构形式．以及博弈论的相关知识。结合军事后勤系统的特点,采用完全信息静态博弈纳什均衡的方法分析了军事虚拟仓库的组织结构模式,在假设的合理的条件下模拟3种组织形式的博弈过程。通过各个模型的最终纳什均衡,指出了3种组织结构形式运作的结果和其积极因素、消极因素、噪声构成．结合我军现有的后勤保障体制,提出现行保障体制的合理与不合理的地方,并给出了改进方案,对优化全军后方仓库布局及管理和战备物资储备及应急保障有着重要意义,可以为总部决策提供咨询建议。     

富营养化水体修复技术的研究现状

湖泊、水库的富营养化已经成为当今世界最主要的环境问题之一。针对富营养化治理的关键问题、治理现状以及目前富营养化水体的一些主要修复技术进行了简要的阐述,并指出防治水体富营养化是一项复杂的系统工程,必须坚持从控制污染源出发,重点开展生态修复,完善管理对策,有计划地逐步实施。     

衰减荷载作用下饱和软土的固结分析

研究了衰减荷栽作用下软土一维固结问题,建立了小变形固结模型,探讨了荷载衰减规律,分别求解了相应的小变形和大变形固结边值问题;通过理论解答与6块场地实测沉降的比较,表明用考虑荷载衰减的大变形固结理论计算软土一维固结的沉降值与实测结果接近。     

润滑脂氧化安定性的伏安法测定

应用伏安法测定了润滑脂中的抗氧剂含量,研究了润滑脂的氧化安定性和储存安定性与抗氧剂含量的关系。发现润滑脂在储存过程中抗氧剂的消耗是有规律的,开始阶段抗氧剂消耗较慢,一定时间后抗氧剂消耗突然加快,这一结果为指导润滑脂储存提供了科学依据。     

Simulation of stochastic activity networks using path control variates

This article details several procedures for using path control variates to improve the accuracy of simulation-based point and confidence-interval estimators of the mean completion time of a stochastic activity network (SAN). Because each path control variate is the duration of the corresponding directed path in the network from the source to the sink, the vector of selected path controls has both a known mean and a known covariance matrix. This information is incorporated into estimation procedures for both normal and nonnormal responses. To evaluate the performance of these procedures experimentally, we examine the bias, variance, and mean square error of the controlled point estimators as well as the average half-length and coverage probability of the corresponding confidence-interval estimators for a set of SANs in which the following characteristics are systematically varied: (a) the size of the network (number of nodes and arcs); (b) the topology of the network; (c) the percentage of activities with exponentially distributed durations; and (d) the relative dominance of the critical path. The experimental results show that although large improvements in accuracy can be achieved with some of these procedures, the confidence-interval estimators for normal responses may suffer serious loss of coverage probability in some applications.     

Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs

Jobs with known processing times and due dates have to be processed on a machine which is subject to a single breakdown. The moment of breakdown and the repair time are independent random variables. Two cases are distinguished with reference to the processing time preempted by the breakdown (no other preemptions are allowed): (i) resumption without time losses and (ii) restart from the beginning. Under certain compatible conditions, we find the policies which minimize stochastically the number of tardy jobs.     

电磁屏蔽石墨混凝土电导率实验研究

石墨混凝土具有耐酸碱、成本低、性能稳定等优点。针对电导率是材料电磁屏蔽性能的重要影响参数,以获得最佳导电性能为方向设计了石墨混凝土的探索性制备方案,研究了其配合比对混凝土电导率性能的影响,采用四针电极法考察石墨混凝土的导电性能。实验结果表明,石墨混凝土中电导率存在不均匀性,其中粗颗粒石墨混凝土比细颗粒石墨混凝土具有更好的导电性能,其值约0．8 S/cm,表现出较好的性能一致性,为工程应用提供了条件。增加20%导电镍粉,对导电性能有改善,但水灰比较大。掺碳纤维石墨混凝土样品,针对石墨质量分数71%,相对石墨掺入碳纤维2%,电导率值由0．8 S/cm降为0．17 S/cm。其中材料的多孔性是材料导电性降低的主要因素。     

A planning horizon algorithm for deterministic inventory management with piecewise linear concave costs

We consider a single-product, discrete-time production/inventory-control problem with nonstationary concave nondecreasing costs. Given a forecast horizon K, the problem is to find a decision horizon. We specialize to piecewise linear costs a general approach whereby a problem with horizon K + 1 and arbitrary final demand is parametrically solved. The resulting algorithm is polynomial in the input size.     

A single-machine problem with multiple criteria

The problem considered is that of finding the set of efficient sequences of jobs on a single machine with respect to the total flow time and the number of tardy jobs. We present some properties of an existing algorithm and the problem itself.     

A proof for the longest-job-first policy in one-machine scheduling

We consider a one-machine scheduling problem with earliness and tardiness penalties. All jobs are assigned a common due date and the objective is to minimize the total penalty due to job earliness and tardiness. We are interested in finding the optimal combination of the common due-date value and the job sequence. Despite the fact that this problem in general is very hard to solve, we prove that there exists at least a common property for all optimal solutions: The first job in an optimal sequence is one of the longest jobs. We also prove that this property holds for a general class of unimodal penalty functions.