船舶动力装置监控系统CAN总线的设计

以某船动力装置监控系统CAN总线的应用设计为例 ,提出了先建立系统各部分都必须遵守的约定 ,然后根据CAN2 .0A协议、用户建立的约定和系统配置来进行设计的方法     

相似系统间调整因子的量化方法

探讨一种便于操作、系统而量化的方法 ,以预计新研系统的可靠性参数。在相似设备法的基础上 ,提出了利用可量化的调整因子对相似系统的可靠性参数进行转换的方法 ,有效地提高了相似设备法的可操作性和分析精度 ,对研究相似设备法在工程技术领域的应用也具有一定的参考价值     

炮射导弹飞行可靠性试验法研究

结合炮射导弹的性能特点 ,研究分析了传统的飞行可靠性试验法的不足 ,提出了炮射导弹飞行可靠性试验的寿命型定时截尾指数分布新方法 ,该方法的应用使试验的方法更为可行 ,结果更为合理     

一种评价导弹研制方案的新方法

对新型导弹武器系统的各种研制方案作出迅速、合理的评价是武器系统方案论证中非常重要的一项工作。过去常用的评价方法存在评价速度慢、评价结果客观性不强等缺点 ,利用神经网络的模式识别功能 ,建立了用于评价研制方案的神经网络模型 ,该模型充分利用过去已定型的导弹研制信息 ,减少了评价过程中的主观性。通过实例计算 ,证明该方法是可行的     

用人工神经网络BP算法评价城市火灾风险

深入讨论了人工神经网络的BP算法在城市火灾风险评价中应用的可行性和一些具体做法.     

“逻辑学”与“独立思考”——俊杰、小弟、豹死、金花、树叶

逻辑思考方法与科学求真精神是现代社会的物质建设和精神建设的前提。逻辑学可以澄清日常用语的歧解 ,并有责任和可能对各种语言的用法进行“理智的重建”。可以通过对一些智力趣题的逻辑解决方法和演示来进行思维训练。但这些不同的训练方法也大有讨论、批评的余地     

从简单句的切分看俄语词序

俄语词序有很大的自由度,但要受词汇、语法、交际目的和修辞色彩的限制,不能任意安排。本文拟从简单句的结构切分和实义切分着手分析,来了解俄语词序的一般规律及其功能。     

A branch and bound algorithm for the minimum storage‐time sequencing problem

The minimum storage‐time sequencing problem generalizes many well‐known problems in combinatorial optimization, such as the directed linear arrangement and the problem of minimizing the weighted sum of completion times, subject to precedence constraints on a single processor. In this paper we propose a new lower bound, based on a Lagrangian relaxation, which can be computed very efficiently. To improve upon this lower bound, we employ a bundle optimization algorithm. We also show that the best bound obtainable by this approach equals the one obtainable from the linear relaxation computed on a formulation whose first Chvàtal closure equals the convex hull of all the integer solutions of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 313–331, 2001     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001     

The NBUL class of life distribution and replacement policy comparisons

Let X and X_τ denote the lifetime and the residual life at age τ of a system, respectively. X is said to be a NBUL random variable if X_τ is smaller than X in Laplace order, i.e., X_τ ≤_L X. We obtain some characterizations for this class of life distribution by means of the lifetime of a series system and the residual life at random time. We also discuss preservation properties for this class of life distribution under shock models. Finally, under the assumption that the lifetimes have the NBUL property, we make stochastic comparisons between some basic replacement policies. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 578–591, 2001.