模拟式火控系统仿真通用建模方法

根据模拟式火控系统的数学模型和基本组成,本文论述了实施系统仿真时解算公式系和各主要子系统的一般建模方法。作为应用举例,给出了一种火控系统的仿真数学模型。同时提出了仿真模型有效性的一种通用检验方法。     

超动态变化的压力测量

本文介绍了采用MS-1215A/D板与IBM兼容机等组成的压力信号采集处理系统。该系统能对模拟压水堆大破口失水事故时超动态变化的压力进行高速采集,并能及时进行数据处理;根据需要还可打印有关参数和图表。此外,本文还介绍了为确保输入计算机的信号可信而采取的有效措施。     

鱼雷武器系统效能评价数学模型

如何建立鱼雷武器系统的效能(Effectiveness)评价模型,是当前研究的新课题。本文给出这个数学模型,并讨论了其工程用法。     

M/G/1(RVT,P(j))排队系统的另一分析方法及其应用

M/G/1(RVT,P(j))表示服务员具有随机长度休息时间(RVT)的、且一休息时间结束时有 j 个顾客等待的概率为 P(j)的、修正的 M/G/1 排队系统。我们用嵌入 Markov 链的技术已详细地分析过这一排队系统,这里提供另一分析方法。最后,应用这个排队系统的分析结果,对时隙 ALOHA 卫星公用信道的分组碰撞概率计算公式作了推导。     

论新型智能消防系统在大空间建筑中的应用

结合大空间建筑的消防特点,对防火墙与防火卷帘、普通闭式系统、雨淋系统等传统大空间建筑消防设施存在的问题进行了详细的分析,并对大空间建筑新型智能型消防灭火系统的优越性进行了探讨,提出应用建议。     

部队会计控制制度建设研究

建立健全内部会计控制制度,是加强财务管理和资产管理的重要措施,可有效降低财务风险和减少资产损失,规范会计行为,提高会计信息质量,从而保证国家会计法律法规和规章制度的有效实施。     

Coherent systems based on sequential order statistics

The sequential order statistics (SOS) are a good way to model the lifetimes of the components in a system when the failure of a component at time t affects the performance of the working components at this age t. In this article, we study properties of the lifetimes of the coherent systems obtained using SOS. Specifically, we obtain a mixture representation based on the signature of the system. This representation is used to obtain stochastic comparisons. To get these comparisons, we obtain some ordering properties for the SOS, which in this context represent the lifetimes of k‐out‐of‐n systems. In particular, we show that they are not necessarily hazard rate ordered. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Dynamic inventory and pricing models for competing retailers

We address infinite‐horizon models for oligopolies with competing retailers under demand uncertainty. We characterize the equilibrium behavior which arises under simple wholesale pricing schemes. More specifically, we consider a periodic review, infinite‐horizon model for a two‐echelon system with a single supplier servicing a network of competing retailers. In every period, each retailer faces a random demand volume, the distribution of which depends on his own retail price as well as those charged by possibly all competing retailers. We also derive various comparative statics results regarding the impact several exogenous system parameters (e.g., cost or distributional parameters) have on the equilibrium decisions of the retailers as well as their expected profits. We show that certain monotonicity properties, engrained in folklore as well as in known inventory models for centralized systems, may break down in decentralized chains under retailer competition. Our results can be used to optimize the aggregate profits in the supply chain (i.e., those of the supplier and all retailers) by implementing a specific wholesale pricing scheme. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

An adaptive forecasting algorithm and inventory policy for products with short life cycles

Products with short life cycles are becoming increasingly common in many industries, such as the personal computer (PC) and mobile phone industries. Traditional forecasting methods and inventory policies can be inappropriate for forecasting demand and managing inventory for a product with a short life cycle because they usually do not take into account the characteristics of the product life cycle. This can result in inaccurate forecasts, high inventory cost, and low service levels. Besides, many forecasting methods require a significant demand history, which is available only after the product has been sold for some time. In this paper, we present an adaptive forecasting algorithm with two characteristics. First, it uses structural knowledge on the product life cycle to model the demand. Second, it combines knowledge on the demand that is available prior to the launch of the product with actual demand data that become available after the introduction of the product to generate and update demand forecasts. Based on the forecasting algorithm, we develop an optimal inventory policy. Since the optimal inventory policy is computationally expensive, we propose three heuristics and show in a numerical study that one of the heuristics generates near‐optimal solutions. The evaluation of our approach is based on demand data from a leading PC manufacturer in the United States, where the forecasting algorithm has been implemented. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Flow shop scheduling with earliness,tardiness, and intermediate inventory holding costs

We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding), and intermediate (work‐in‐process) inventory holding costs. We formulate this problem as an integer program, and based on approximate solutions to two different, but closely related, Dantzig‐Wolfe reformulations, we develop heuristics to minimize the total cost. We exploit the duality between Dantzig‐Wolfe reformulation and Lagrangian relaxation to enhance our heuristics. This combined approach enables us to develop two different lower bounds on the optimal integer solution, together with intuitive approaches for obtaining near‐optimal feasible integer solutions. To the best of our knowledge, this is the first paper that applies column generation to a scheduling problem with different types of strongly ????‐hard pricing problems which are solved heuristically. The computational study demonstrates that our algorithms have a significant speed advantage over alternate methods, yield good lower bounds, and generate near‐optimal feasible integer solutions for problem instances with many machines and a realistically large number of jobs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.