基于灰色关联度和模糊贴近度的复杂设备瞬态虚警辨识

分析了电子设备和武器装备的ＢＩＴ系统虚警形式之一——瞬态虚警的产生原因和一般的预防措施；提出运用灰色关联度和模糊贴近度对瞬态虚警进行辨识并给出了这两种方法的基本原理；分别采用数值模拟和物理模拟的手段，获得了具有温度、湿度、振动（电源）三环境参数系统的状态变化样本群，以及因振动（电源）参数突变而产生的瞬态虚警样本；运用灰色关联度和模糊贴近度方法识别虚警及产生虚警的环境因素，结果表明两种方法可以胜任要求。     

C~3I 系统多传感器的信息融合——Fuzzy 函数聚类算法

在对多类传感器收集空中目标状态信息描述的基础上,用Ｆｕｚｚｙ目标函数聚类算法建立了对空情数据融合的数学模型。对数据融合过程,参数的初始化问题进行了实际应用的讨论;并对其应用效果和优势作了实际的分析。该方法是Ｃ３Ｉ系统数据融合技术的有效方法之一。     

42－160柴油机离合器换向拨叉叉头优化设计的光弹验证

本文用光弹性实验方法验证了有限元法对４２—１６０柴油机离合器换向拨叉优化设计的结果。实验证明,有限元优化设计是正确、可靠的,效果是非常好的。     

故障类别的模糊聚类分析

本文通过故障状态-特征的模糊聚类分析,按故障间的相似性对故障进行分类,然后按类别实施故障诊断,可在最少监测点的条件下,获得最多的设备运行故障信息。从而简化故障诊断过程,提高诊断速度和精度。     

用配点法求解四边搁支板的弯曲问题

根据弹性薄板微分方程的一般解和边界条件的配点法来求四边搁支板的弯曲问题,并以对称荷载作用下的正方形板为例进行了分析计算。     

表格驱动程序设计方法

本文提出了一种具有广泛应用前景的程序设计方法——表格驱动(Formdriven)程序设计方法(以下简称表格驱动法)。文中首先描述了表格驱动法的基本思想、解的结构;分析了这种方法的特点与适用性;剖析了基于表格驱动法的办公自动化软件ALL-IN-1的设计思想,并指出表格驱动法特别适合于设计软件开发工具。     

基于模糊综合的红外目标融合识别

为了提高在复杂背景和强干扰条件下目标识别的可靠性,提出了一种基于模糊综合的目标融合识别算法,并采用双色红外成像系统所获得的红外图像数据进行了实验仿真。实验结果表明该算法在较大程度上提高了目标识别的可信度。     

用非线性规划求解有限推力最优交会

利用非线性规划方法研究了航天器的有限推力最优交会问题。这种方法利用了近年来发展起来的直接优化技术,用分段多项式来表示整个轨道的状态和控制向量,将最优控制问题转化为非线性规划问题。在应用这种方法时,先将整个轨道分为若干推力段和无推力段,然后利用配置方法产生推力段的约束段,利用状态转移矩阵来产生无推力段的约束。最后,对共面轨道情况下的交会进行了数值仿真,验证了方法的有效性和鲁棒性。     

Coordinated replenishments from multiple suppliers with price discounts

In this study we present an integer programming model for determining an optimal inbound consolidation strategy for a purchasing manager who receives items from several suppliers. The model considers multiple suppliers with limited capacity, transportation economies, and quantity discounts. We propose an integrated branch and bound procedure for solving the model. This procedure, applied to a Lagrangean dual at every node of the search tree, combines the subgradient method with a primal heuristic that interact to change the Lagrangean multipliers and tighten the upper and lower bounds. An enhancement to the branch and bound procedure is developed using surrogate constraints, which is found to be beneficial for solving large problems. We report computational results for a variety of problems, with as many as 70,200 variables and 3665 constraints. Computational testing indicates that our procedure is significantly faster than the general purpose integer programming code OSL. A regression analysis is performed to determine the most significant parameters of our model. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 579–598, 1998     

Scheduling deteriorating jobs to minimize makespan

We consider a single-machine problem of scheduling n independent jobs to minimize makespan, in which the processing time of job J_j grows by w_j with each time unit its start is delayed beyond a given common critical date d. This processing time is p_j if J_j starts by d. We show that this problem is NP-hard, give a pseudopolynomial algorithm that runs in time and O(nd) space, and develop a branch-and-bound algorithm that solves instances with up to 100 jobs in a reasonable amount of time. We also introduce the case of bounded deterioration, where the processing time of a job grows no further if the job starts after a common maximum deterioration date D > d. For this case, we give two pseudopolynomial time algorithms: one runs in O(n²d(D − d) time and O(nd(D − d)) space, the other runs in p_j)²) time and p_j) space. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 511–523, 1998