基于IEEE 802.11的无线多跳网络路径容量分析模型

旨在建立一个适用于无线多跳路径性能研究的闭合分析模型。首先对导致多跳路径中流内竞争现象的干扰问题进行了详细分析并给出了定量计算方法,然后通过将多跳路径建模为排队网络,利用扩散近似法建立了路径性能分析模型,最后在网络稳定性约束条件下对多跳路径的容量问题进行了研究。利用该模型可以在无线多跳网络中分析网络传输的吞吐能力,同时有助于研究网络对QoS业务的支持能力。通过仿真实验结果与数值分析结果的对比,验证了分析模型的准确性。     

舰艇编队综合作战能力评估的模糊聚类分析

评估舰艇编队综合作战能力强弱的模糊聚类分析涉及编队对海作战能力、编队反潜作战能力、编队防空作战能力、编队电子战能力、编队指挥控制能力和编队战场适应能力等因素.以若干舰艇编队为研究对象,对因素指标进行标准量化.据标准化数据用指数相似系数法计算样本间的相似关系,最后根据各样本与基准样本相聚类或分离进行量化分析,判断各舰艇编队综合作战能力的强弱次序.     

新疆兵团土地人口承载力预测分析

随着国家西部大开发战略的实施,新疆生产建设兵团(以下简称兵团)的经济发展速度开始加快,人口增长与兵团资源的矛盾也逐渐凸现,研究兵团人口承载力问题就迫在眉睫。本文以数量经济学的理论和思想为指导,主要采用灰色系统理论、Logistic模型等定量分析方法对兵团人口、经济、资源及可持续发展进行研究。     

Robust capacity planning in semiconductor manufacturing

We present a stochastic programming approach to capacity planning under demand uncertainty in semiconductor manufacturing. Given multiple demand scenarios together with associated probabilities, our aim is to identify a set of tools that is a good compromise for all these scenarios. More precisely, we formulate a mixed‐integer program in which expected value of the unmet demand is minimized subject to capacity and budget constraints. This is a difficult two‐stage stochastic mixed‐integer program which cannot be solved to optimality in a reasonable amount of time. We instead propose a heuristic that can produce near‐optimal solutions. Our heuristic strengthens the linear programming relaxation of the formulation with cutting planes and performs limited enumeration. Analyses of the results in some real‐life situations are also presented. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Modeling multiple stage manufacturing systems with generalized costs and capacity issues

This study introduces one modeling methodology that describes a broad range of multiple stage production planning issues, including multiple limited resources with setup times and joint fixed cost relationships. An existing production system is modeled in this fashion, creating a new set of 1350 highly generalized benchmark problems. A computational study is conducted with the 1350 benchmark problems introduced in this paper and 2100 benchmark problems, with more restrictive assumptions, from the existing literature. The relative merits of a decomposition‐based algorithm and a neighborhood search technique known as NIPPA, or the Non‐sequential Incremental Part Period Algorithm, are assessed. NIPPA is generally the more successful of the two techniques, although there are specific instances in which the decomposition‐based algorithm displayed a distinct advantage. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

石化企业设置火灾事故应急水池的必要性及容量计算

简要阐述了石化企业设置火灾事故情况下事故应急水池的必要性,并对事故应急水池的计算方法进行分析,最后结合工程实例进行容量计算,对同类的设计提供一定的参考。     

反辐射无人机在电子战中的应用及其效能分析

简要讨论了反辐射无人机系统的组成和两种典型的反辐射无人机,指出了其在电子战中的应用。并针对某型反辐射无人机的系统能力,即命中概率和毁伤概率进行了理论分析和计算。     

一类带配送中心运输问题的容量扩张模型研究

运输问题一般采用表上作业法来解决,考虑一类带配送中心的运输问题,若仍采用表上作业法,会使问题复杂化.文中采用一种构造辅助网络的方法:在运输网络中将每个配送中心均拆分成两个点,连接两点形成新弧,构造出新的网络,并给每条弧赋予参数,将此类运输问题转换为最小费用流模型来解决,可以使问题模型和运算简单化.在此基础上,考虑运输网络中配送中心和边的容量扩张问题.     

新型钢-混凝土组合板的力学性能研究

以加劲肋形式、组合板厚度和栓钉布置为参数,进行了9块新型组合板的力学性能试验.试验结果表明,组合板的正截面承载力可按基于修正平截面假定的极限状态计算;组合板的跨中挠度,可在按现行规范计算的基础上,加上考虑界面滑移影响的附加变形值予以修正.     

Capacity allocation with traditional and Internet channels

In this paper we study a capacity allocation problem for two firms, each of which has a local store and an online store. Customers may shift among the stores upon encountering a stockout. One question facing each firm is how to allocate its finite capacity (i.e., inventory) between its local and online stores. One firm's allocation affects the decision of the rival, thereby creating a strategic interaction. We consider two scenarios of a single‐product single‐period model and derive corresponding existence and stability conditions for a Nash equilibrium. We then conduct sensitivity analysis of the equilibrium solution with respect to price and cost parameters. We also prove the existence of a Nash equilibrium for a generalized model in which each firm has multiple local stores and a single online store. Finally, we extend the results to a multi‐period model in which each firm decides its total capacity and allocates this capacity between its local and online stores. A myopic solution is derived and shown to be a Nash equilibrium solution of a corresponding “sequential game.” © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006