舰船机械设备备件保障决策分析——可靠性分析

针对典型的舰船机械设备系统,运用故障树分析等现代可靠性理论分析方法,结合系统设备的技术性能分析、非电产品的结构和故障特点以及运行管理实际情况,研究系统设备、部件的故障机理,故障模式和故障影响效应,明确导致设备、部件故障的原因及发生模式。应用FTAS故障树分析软件包对其进行了定性、定量分析,获得了以概率结构事件、最小割集等形式表达的系统设备、部件故障对系统故障的作用模式,并对系统故障概率随时间的变化进行了拟合检验及评价了系统可靠性,为确定在指定远航任务期(90天)内所需的备品备件决策提供依据。     

动态云的真实感计算机模拟

纹理模拟是计算机生成真实感图形中一种重要且不可缺少的手段。详细介绍了运用Frdactal几何和Fournier级数产生各种形态云的纹理模拟方法,具体描述了动态云的生成过程,以及多个云团的合成、云与背景的合成等问题,最后给出了基于这一方法所实现的云团模拟图例。     

IBAD氮化钛中N/Ti对膜层性能影响研究

研究了离子束辅助沉积(IBAD)制备氮化钛(TiN)重要参数氮钛到达比(N/Ti)对膜层性能的影响,并且采用俄歇谱分析(AES)、光电子谱分析(XPS)、X射线衍射分析(XRD)对膜层进行了相组成与成分分析,摸索了N/Ti对膜层的影响规律.     

塑性状态下光学及电子镜面的亚纳米级精密磨削

本文讲述了由PC机控制的多用途超精机床(MPUMT)的设计及光学镜平滑表面的加工。已研制出的机床可用于磨削、切削、研磨或抛光塑性状态下的硬脆材料。作为建立新的加工系统的关键部分,采用了大型磁致伸缩调节器(GMA),在没有放大器元件的情况下,它具有大功率的输出和大于压电陶瓷调节器几倍的纳米级的位移。切削DOC的深度和控制塑性状态过程的微塑性区域能够被调节器设置为具有高于1nm的精度,并能用金刚石磨削砂轮研磨。在当前研究中所用到的镜为多晶体、非晶体,也有加固玻璃。磨削实验的结果表明,已研制出来的超精机床能够实现对塑性状态下的玻璃和陶瓷材料的加工。材料特性参数和微裂纹之间的关系已被检测到,适用于大多数被研究玻璃的脆性到塑性磨削方式的转换已经确定。运用AFM、SEM和ZYGO对磨削表面进行了分析,例如BK7和TRC5(新材料;加固玻璃)的磨削表面分别具Ra=0.15nm和Ra=0.32nm的表面粗糙度。     

接地双层介质上平面螺旋天线的数值分析与实验结果

本文对接地双层介质结构上的阿基米德平面螺旋天线进行了研究。以接地双层结构上水平赫芝偶极子Ｓｏｍｍｅｒｆｅｌｄ型积分的格林函数为基础,用矩量法求解积分方程,从而确定出螺旋天线臂上的电流分布。用渐近法估计Ｓｏｍｍｅｒｆｅｌｄ积分得到远区电场的解析表达式,由此计算出输入阻抗、方向图、功率增益和轴比。这些参数值对于双层结构上印刷线天线的优化设计具有重要指导意义。实验结果证明了数值方法的正确性     

The traveling salesman problem: An update of research

During the course of the last few years, attacks on the traveling salesman problem have resulted in a variety of often innovative and rather powerful computational procedures. In this article, we present a review of these results for problems defined on weighted and unweighted graphs. Some account of computational behavior for exact algorithms is provided; however, the primary coverage deals with the strategy of particular procedures. In addition, we include some aspects of nonexact algorithms with major interest confined to the establishment of worst-case bounds.     

A game theoretic approach to a two firm bidding problem

In this paper a model is developed for determining optimal strategies for two competing firms which are about to submit sealed tender bids on K contracts. A contract calls for the winning firm to supply a specific amount of a commodity at the bid price. By the same token, the production of that commodity involves various amounts of N different resources which each firm possesses in limited quantities. It is assumed that the same two firms bid on each contract and that each wants to determine a bidding strategy which will maximize its profits subject to the constraint that the firm must be able to produce the amount of products required to meet the contracts it wins. This bidding model is formulated as a sequence of bimatrix games coupled together by N resource constraints. Since the firms' strategy spaces are intertwined, the usual quadratic programming methods cannot be used to determine equilibrium strategies. In lieu of this a number of theorems are given which partially characterize such strategies. For the single resource problem techniques are developed for determining equilibrium strategies. In the multiple resource problem similar methods yield subequilibrium strategies or strategies that are equilibrium from at least one firm's point of view.     

An operator theory of parametric programming for the generalized transportation problem—IV—global operators

This paper investigates the effect of the optimal solution of a (capacitated) generalized transportation problem when the data of the problem (the rim conditions—i.e., the available time of machine types and demands of product types, the per unit production costs, the per unit production time and the upper bounds) are continuously varied as a linear function of a single parameter. Operators that effect the transformation of optimal solution associated with such data changes, are shown to be a product of basis preserving operators (described in our earlier papers) that operate on a sequence of adjacent basis structures. Algorithms are furnished for the three types of operators—rim, cost, and weight. The paper concludes with a discussion of the production and managerial interpretations of the operators and a comment on the “production paradox”.     

Optimal design of a multi-item,multi-location,multi-repair type repair and supply system

The design of a system with many locations, each with many items which may fail while in use, is considered. When items fail, they require repair; the particular type of repair being governed by a probability distribution. As repairs may be lengthy, spares are kept on hand to replace failed items. System ineffectiveness is measured by expected weighted shortages over all items and locations, in steady state. This can be reduced by either having more spares or shorter expected repair times. Design consists of a provisioning of the number of spares for each item, by location; and specifying the expected repair times for each type of repair, by item and location. The optimal design minimizes expected shortages within a budget constraint, which covers both (i) procurement of spares and (ii) procurement of equipment and manning levels for the repair facilities. All costs are assumed to be separable so that a Lagrangian approach is fruitful, yielding an implementable algorithm with outputs useful for sensitivity analysis. A numerical example is presented.