装备研制中技术风险的灰色综合评估

指出装备研制中技术风险的表现形式,建立了技术风险评估的指标体系,阐述了基于灰类白化权函数将定性指标定量化的方法,建立了利用群灰关联度进行综合评估的模型。最后,结合实例验证说明了该模型对研制方案技术风险评估的可用性。     

面向 MPP Fortran 的程序自动并行化初探

ＭＰＰＦｏｒｔｒａｎ是由Ｃｒａｙ公司推出的一种较有代表性的数据并行语言,本文首先介绍了ＭＰＰＦｏｒｔｒａｎ的主要特点,然后,以该语言为例,对面向ＭＰＰ系统程序自动并行化的主要内容进行了初步的探讨。     

汇编语言动态分析工具中的程序插装技术

根据8086/8088语言的结构化特点,提出了程序插装的概念及其实现方法,并基于插装研制出一种动态分析工具,从而实现了对程序分支及语句的自动测试功能.     

SPC交换程序的半自动生成技术

本文介绍我院正在研制的 SPC 交换领域用的半自动编程系统,该系统通过用规范和描述语言 SDL 书写的规范来产生 SPC 交换程序。文中讨论了半自动生成系统的基本结构,并给出一个具体的半自动生成实例。     

石河子科技与经济相关性分析

本文以石河子科技水平和经济发展相互关系的分析为基础,对石河子经济发展与科技水平进行定量分析,分析表明,石河子科技进步与经济发展高度相关,21世纪,要实现石河子经济的可持续发展,应高度重视科技进步与技术创新,进步促进科技与经济的良性互动。     

截击机作战起飞规划分析

根据截击机在优化的目标分配形式下拦截效果的概率模型,导出了截击机在拦截多攻击机机群时的最优目标分配形式,研究了机场飞机起飞架数与机场战术、技术参数、机场飞机的战术、技术参数以及与攻击机的进攻态势之间的关系,确定了多机场飞机对多攻击机机群进行最优目标分配时所应满足的量化关系,给出的模型可对作战决策过程提供理论依据     

Windows设备驱动程序结构及兼容性探讨

介绍了Win95虚拟设备驱动程序、WinNT内核模式驱动程序与Win32设备驱动程序的概念与结构特性．讨论在不同Windows开发平台下设备驱动程序的兼容性．     

战场损伤评估与修复分析及应用

本文根据我国国情和我军实践,论述了武器装备战场损伤评估与修复(BDAR)的基本概念、原理、分析程序及方法,提出了进行BDAR分析、制定HDAR大纲等一系列实际应用问题。     

Minimizing sums and products of linear fractional functions over a polytope

In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametric transformation of the objective function serves as an efficient method for calculating global minima of these nonconvex minimization problems if the number of linear fractional terms in the objective function is less than four or five. It will be shown that the Charnes–Cooper transformation plays an essential role in solving these problems. Also a simple bounding technique using linear multiplicative programming techniques has remarkable effects on structured problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 583–596, 1999     

Solution algorithms for the parallel replacement problem under economy of scale

We consider the parallel replacement problem in which machine investment costs exhibit economy of scale which is modeled through associating both fixed and variable costs with machine investment costs. Both finite- and infinite-horizon cases are investigated. Under the three assumptions made in the literature on the problem parameters, we show that the finite-horizon problem with time-varying parameters is equivalent to a shortest path problem and hence can be solved very efficiently, and give a very simple and fast algorithm for the infinite-horizon problem with time-invariant parameters. For the general finite-horizon problem without any assumption on the problem parameters, we formulate it as a zero-one integer program and propose an algorithm for solving it exactly based on Benders' decomposition. Computational results show that this solution algorithm is efficient, i.e., it is capable of solving large scale problems within a reasonable cpu time, and robust, i.e., the number of iterations needed to solve a problem does not increase quickly with the problem size. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 279–295, 1998