深刻理解和准确把握"实现富国和强军的统一"的战略思想

胡锦涛关于在全面建设小康社会进程中实现富国和强军的统一的战略思想,是总结历史经验得出的科学结论;是实现中华民族伟大复兴的重要举措;为国防和军队建设指明了正确方向。     

油库压缩机组温度变送器法兰根部泄漏失效分析

为了解决基地油库压缩机组温度变送器法兰根部焊缝泄漏问题,采用照相、无损检测、化学成分分析、金相分析、显微硬度分析、扫描电镜观察与能谱分析等方法,对失效法兰进行失效分析。研究结果表明,法兰焊缝根部泄漏系焊缝未焊透和存在夹杂物所致,并因外应力作用而在熔合区马氏体区域沿晶扩展,导致角焊缝最终脆性断裂。结合现场实际情况,提出防止发生类似事故的建议。     

一种新的一体化压水型反应堆──热管输热核反应堆构想

本文提出了热管输热核动力反应堆的构想,即用热管代替现今压水堆的一回路管道、主泵和稳压器,并对热管输热反应堆进行了原理分析,提出了工程应用可行性等急需研究的问题。     

移动式C3I机动路线选择多准则决策折衷对话算法

提出非劣路径和满意路径的概念,给出准则网络图满意路径问题的数学模型,利用多准则决策理论和方法,通过构造辅助问题,研究辅助问题和非劣路径的关系,设计出多准则网络图的交互式满意路径算法。     

基于广域网的建筑工程管理系统设计

针对韩村河建筑集团工程与办公的特点,设计出基于公共数据交换网环境的工程管理系统。它以建筑工程管理为主,包含办公管理、合同管理、财务管理、材料管理、进度控制和数据接口等功能。系统采用模块化设计并具备多层安全控制机制。     

核动力装置主系统对蒸汽发生器给水流量的动态响应

本文把集总参数法用于堆芯、一回路和二回路,导出了主系统对蒸汽发生器给水流量丧失的动态方程组及其解析解,非常适用于运行监督性快速计算。     

基于Visual Basic故障诊断专家系统设计

从分析传统专家系统入手,把WINDOWS下的可视化技术和面向对象技术引入到人工智能程序设计中来。讨论了故障树模型的面向对象表示方法及其推理算法。根据雷达故障诊断中的典型故障树,给出了一个基于Visual Basic语言的故障诊断专家系统设计实例。     

模拟电路子网络级故障诊断的新方法

针对目前模拟电路子网络级故障诊断方法普遍存在的问题,提出了一种新的诊断方法,阐述了该方法的诊断原理,给出了可诊断性条件,通过仿真例子,证明了该方法具有测试量少,方法简单,实时性好,适用于非线性电路等特点     

Allocation with demand competition: Uniform,proportional, and lexicographic mechanisms

We examine capacity allocation mechanisms in a supply chain comprising a monopolistic supplier and two competing retailers with asymmetric market powers. The supplier allocates limited capacity to retailers according to uniform, proportional, or lexicographic mechanism. We study the impact of these allocation mechanisms on supplier pricing decisions and retailer ordering behavior. With individual order size no greater than supplier capacity, we show that all three mechanisms guarantee equilibrium ordering. We provide precise structures of retailer ordering decisions in Nash and dominant equilibria. Further, we compare the mechanisms from the perspective of the supplier, the retailers, and the supply chain. We show that regardless of whether retailer market powers are symmetric, lexicographic allocation with any priority sequence of retailers is better than the other two mechanisms for the supplier. Further, under lexicographic allocation, the supplier gains more profit by granting higher priority to the retailer with greater market power. We also extend our study to the case with multiple retailers. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 85–107, 2017     

Deterministic and stochastic scheduling with teamwork tasks

We study a class of new scheduling problems which involve types of teamwork tasks. Each teamwork task consists of several components, and requires a team of processors to complete, with each team member to process a particular component of the task. Once the processor completes its work on the task, it will be available immediately to work on the next task regardless of whether the other components of the last task have been completed or not. Thus, the processors in a team neither have to start, nor have to finish, at the same time as they process a task. A task is completed only when all of its components have been processed. The problem is to find an optimal schedule to process all tasks, under a given objective measure. We consider both deterministic and stochastic models. For the deterministic model, we find that the optimal schedule exhibits the pattern that all processors must adopt the same sequence to process the tasks, even under a general objective function GC = F(f₁(C₁), f₂(C₂), … , f_n(C_n)), where f_i(C_i) is a general, nondecreasing function of the completion time C_i of task i. We show that the optimal sequence to minimize the maximum cost MC = max f_i(C_i) can be derived by a simple rule if there exists an order f₁(t) ≤ … ≤ f_n(t) for all t between the functions {f_i(t)}. We further show that the optimal sequence to minimize the total cost TC = ∑ f_i(C_i) can be constructed by a dynamic programming algorithm. For the stochastic model, we study three optimization criteria: (A) almost sure minimization; (B) stochastic ordering; and (C) expected cost minimization. For criterion (A), we show that the results for the corresponding deterministic model can be easily generalized. However, stochastic problems with criteria (B) and (C) become quite difficult. Conditions under which the optimal solutions can be found for these two criteria are derived. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004