坦克搭乘输送平台海上射击目标决策方法

通过粗糙集方法分析影响坦克对岸滩目标射击效果的各种因素,建立坦克搭乘输送平台海上射击的知识表达系统,将射击效果作为决策属性,将已有数据或作战经验作为条件属性,依粗糙集理论方法挖掘射击决策规则,最后约简得到一些简单的射击决策规则,为单坦克射击决策提供依据。     

单点系泊船舶Hopf分岔的试验研究

对单点系泊船舶的Hopf分岔现象进行了试验研究.给出了试验方法和过程;探讨了不同来流速度和系缆长度对于船舶动力学响应的影响.试验表明,船模运动呈现出典型的非线性特征,观察到了吸引子的共存,平衡点稳定性丧失和Hopf分岔现象.利用振动衰减系数计算了Hopf分岔值,与试验结果相比较,具有良好的一致性.得到了试验条件下的Hopf分岔集,指出其对于系泊系统的设计是有指导意义的.     

Hilbert空间极大单调算子零点的逼近问题

设H为实Hilbert空间,C为H的非空闭凸子集,T:C→2H为极大单调算子,假设S(T)={X∈H:O∈Tx}≠Φ。求xk及ek满足设Pc:H→C为H到C上的最近点投影算子,定义证明了Hilbert空间中由上式产生的序列{xk}k≥0弱收敛于T的某个零点。     

Concave envelopes of monomial functions over rectangles

The construction of convex and concave envelopes of real‐valued functions has been of interest in mathematical programming for over 3 decades. Much of this interest stems from the fact that convex and concave envelopes can play important roles in algorithms for solving various discrete and continuous global optimization problems. In this article, we use a simplicial subdivision tool to present and validate the formula for the concave envelope of a monomial function over a rectangle. Potential algorithmic applications of this formula are briefly indicated. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

战时不完全信息战术导弹需求量预测方法

针对传统方法难以实现战时信息不完备条件下导弹需求量预测的问题,提出了一种基于粗糙集的战术导弹需求量预测方法。在对战术导弹需求量影响因素分析的基础上,建立了战术导弹需求量预测不完备决策信息表。利用相容关系对不完备决策信息表中对象分类,并采用差别函数方法求解各对象的相对约简,从而获取战术导弹需求量的最优广义规则集。算例验证了方法的有效性。     

粗糙集理论在装备保障训练效果评估中的应用

装备维修保障训练效果评估中最关键的步骤就是评估指标体系的构建及优化,为了克服传统评价方法中存在指标关联性大和权重确定主观性强的问题,将粗糙集和信息熵理论引入装备维修保障训练效果评估领域。采用信息熵的算法对连续指标离散化,基于粗糙集区分矩阵的方法对指标体系进行属性约简,降低了模型的复杂性;在此基础上提出了粗糙集属性重要度和AHP法相结合确定指标权重的方法,进而通过专家评议应用于训练效果评估实例,得到了较好的评估效果,为装备维修保障训练评估提供了新的参考方法。     

Stein–Chen approximation and error bounds for order fill rates in assemble‐to‐order systems

Assemble‐to‐order (ATO) is an important operational strategy for manufacturing firms to achieve quick response to customer orders while keeping low finished good inventories. This strategy has been successfully used not only by manufacturers (e.g., Dell, IBM) but also by retailers (e.g., Amazon.com). The evaluation of order‐based performance is known to be an important but difficult task, and the existing literature has been mainly focused on stochastic comparison to obtain performance bounds. In this article, we develop an extremely simple Stein–Chen approximation as well as its error‐bound for order‐based fill rate for a multiproduct multicomponent ATO system with random leadtimes to replenish components. This approximation gives an expression for order‐based fill rate in terms of component‐based fill rates. The approximation has the property that the higher the component replenishment leadtime variability, the smaller the error bound. The result allows an operations manager to analyze the improvement in order‐based fill rates when the base‐stock level for any component changes. Numerical studies demonstrate that the approximation performs well, especially when the demand processes of different components are highly correlated; when the components have high base‐stock levels; or when the component replenishment leadtimes have high variability. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

基于设计参数综合评价决策的维修性设计方案优选方法

针对维修性设计方案的评估优选问题进行分析,给出一种改进的设计参数综合评价优选方法.考虑到维修性设计因素评价的不确定性和模糊性的特点,采用集对分析理论对维修性设计因素的模糊语言值评价进行处理,并将层次赋权方法引入方案贴近度评估决策模型,以提高方案优选的可信性.最后以某航天器电源系统的维修性设计方案优选为例说明了该方法的应...     

基于Rough集理论的数据库推理通道动态消除

提出了一种基于Rough集理论的数据库推理泄漏通道消除方法。在由数据库中所有数据生成的不完备决策表上,该方法应用Rough集理论,分析提取出敏感和非敏感数据之间的确定性推理关系,以此产生推理控制规则。利用这些规则对数据库系统返回给普通用户的数据动态地做最小修改,防止推理通道的产生。实验结果表明,该方法可扩展性强,在保证较高的数据库安全性的同时提高了数据可用性。     

Modeling multiple stage manufacturing systems with generalized costs and capacity issues

This study introduces one modeling methodology that describes a broad range of multiple stage production planning issues, including multiple limited resources with setup times and joint fixed cost relationships. An existing production system is modeled in this fashion, creating a new set of 1350 highly generalized benchmark problems. A computational study is conducted with the 1350 benchmark problems introduced in this paper and 2100 benchmark problems, with more restrictive assumptions, from the existing literature. The relative merits of a decomposition‐based algorithm and a neighborhood search technique known as NIPPA, or the Non‐sequential Incremental Part Period Algorithm, are assessed. NIPPA is generally the more successful of the two techniques, although there are specific instances in which the decomposition‐based algorithm displayed a distinct advantage. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005