基于非概率理论的混合不确定性结构可靠性分析方法

摘要: 针对不确定性结构可靠性分析中的输入变量分布参数具有不确定性和输入变量为区间模型的混合不确定性结构展开研究。考虑可用信息最少的情况,将分布参数的不确定性描述为区间模型。通过等概率转换方法将随机变量与其分布参数进行分离,使问题转化为随机与区间变量混合的可靠性问题,建立了混合不确定性问题的可靠性分析模型。基于非概率可靠性理论,建立混合不确定结构分析模型的二级极限状态函数并结合Kriging代理模型建立了高效的求解方法。此外,将所建立的混合不确定模型应用于飞行器结构的不确定性分析中,验证所建模型的合理性和所提方法的高效性和准确性。     

基于AHP云模型的舰艇长独立操纵综合评价

独立操纵考核是评价舰艇长组织指挥和操纵技能的重要组成部分。针对训练评价过程中定性定量指标的转换计算问题,提出基于AHP云模型的综合评价方法,以处理评价指标中出现的随机性和模糊性。依据海图作业等4个项目15个指标建立独立操纵评价指标体系,运用云模型建立各个指标的评价模型。用隶属函数描述评价等级的模糊性,用超熵概念描述其随机性,更加符合实际评判的情况。应用AHP法确定各个评价指标的相对权重,经过模糊转换对参加训练的5名舰艇长进行综合评价。     

训练电磁环境生成和逼真度评估方法

构建与战场电磁环境尽可能相似的训练电磁环境、评估所构建的训练电磁环境与战场电磁环境的相似程度,是基地训练电磁环境构建必须解决的突出问题。基于相似理论基本原理和相似度计算基本方法,结合基地训练电磁环境构建实践,采用精确值相似度计算生成训练电磁环境,采用区间值相似度计算评估训练电磁环境的逼真度。     

基于复杂网络理论的航材配送网络抗毁性分析

航材配送是航材保障工作的重要环节,科学地构建航材配送网络是提高航材保障效率的前提和基础。深入开展航材配送网络研究,对提高航材保障工作效益具有重要意义。针对航材配送网络节点繁多、线路交错的特点,分析了航材配送网络的复杂特性,构建了基于复杂网络理论的航材配送网络模型,设计了航材配送网络的拓扑特征参数,研究了航材配送网络的抗毁性。理论分析和实验结果表明,随机攻击时航材配送网络的抗毁性要大于选择性攻击,节点选择攻击时航材配送网络的抗毁性小于边选择攻击。     

基于博弈论计算机网络对抗问题研究

针对日益普遍和多样的网络攻击行为,如何对网络各种攻防过程进行分析已逐渐成为热点研究方向。在对计算机网络对抗问题复杂性表现和产生根源进行探讨基础上,从完全信息静态博弈、完全信息动态博弈、不完全信息静态博弈、不完全信息动态博弈4个视角,对计算机网络对抗问题进行分类论述,对各解决方法进行了综合比较,并对今后的研究进行了展望。     

横向效应增强型弹丸正侵穿金属薄靶轴向剩余速度近似计算与分析

运用冲击波理论,对横向效应增强型弹丸(Penetration with Enhanced Lateral Efficiency,PELE)侵穿金属靶板的机理进行了分析,将PELE侵彻过程中能量损失分为外壳撞击靶板区域环形塞块获得的能量,内芯撞击靶板区域塞块获得的能量,冲击波影响范围内外壳和内芯增加的内能,外壳前端外沿和内沿对靶板冲塞剪切耗能等几部分,给出了确定这些能量的计算方法;并依据能量守恒原理,给出了PELE正撞金属薄靶板靶后剩余速度的近似计算公式。公式计算结果与多种条件下实验结果均吻合较好。分析计算所得各能量损失结果表明,弹体内芯材料的变化对弹体侵彻能力的影响较小;侵彻中靶板塞块获得的能量在弹体侵彻动能损失中比重最大;外壳前端内沿对靶板的剪切能耗对弹体动能损失的影响可以忽略。     

基于搜索论的反舰导弹机动搜捕策略建模方法

针对概略射击条件下反舰导弹机动搜索目标策略优化选择的需求,采用搜索论的基本理论对反舰导弹机动搜捕策略问题进行了研究,建立了反舰导弹随机搜索策略、平行搜索策略和螺旋搜索策略搜捕概率计算模型,并进行了仿真计算。仿真结果表明:在已知目标概略位置的条件下,反舰导弹假若采取螺旋式搜索策略,能以较高的概率快速捕捉目标。     

基于投影分解与k最近邻距离的异常证据检测算法

为降低异常证据对合成结果的影响,提出了基于投影分解与k最近邻距离的异常证据检测算法。该算法在对证据集中所有证据进行焦元单一元素投影分解的基础上,重新构造证据的基本概率赋值,然后利用证据之间形成的欧式距离,采用k最近邻距离算法对异常证据进行检测。无线传感器网络应用实验分析表明:该算法可有效地对异常证据进行检测。对检测前后的证据利用证据合成规则进行融合对比结果发现,剔除了异常证据的合成结果并具有良好的峰值性和可分辨性,合成结果有利于融合决策。     

Complexity and workload considerations in product mix decisions under the theory of constraints

The literature on the product mix decision (or master production scheduling) under the Theory of Constraints (TOC), which was developed in the past two decades, has addressed this problem as a static operational decision. Consequently, the developed solution techniques do not consider the system's dynamism and the associated challenges arising from the complexity of operations during the implementation of master production schedules. This paper aims to address this gap by developing a new heuristic approach for master production scheduling under the TOC philosophy that considers the main operational factors that influence actual throughput after implementation of the detailed schedule. We examine the validity of the proposed heuristic by comparison to Integer Linear Programming and two heuristics in a wide range of scenarios using simulation modelling. Statistical analyses indicate that the new algorithm leads to significantly enhanced performance during implementation for problems with setup times. The findings show that the bottleneck identification approach in current methods in the TOC literature is not effective and accurate for complex operations in real‐world job shop systems. This study contributes to the literature on master production scheduling and product mix decisions by enhancing the likelihood of achieving anticipated throughput during the implementation of the detailed schedule. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 357–369, 2015     

Synchronization in hub terminals with the circular arrangement problem

Hub terminals are important entities in modern distribution networks and exist for any transportation device, that is, cross docks and parcel distribution centers for trucks, container ports for ships, railway yards for trains, and hub airports for aircraft. In any of these hubs, the mid‐term planning task of synchronizing the transshipment of goods and passengers when servicing the transportation devices has to be solved, for which many different solution approaches specifically tailored to the respective application exist. We, however, take a unified view on synchronization in hubs and aim at a general building block. As a point of origin, a basic vertex ordering problem, the circular arrangement problem (CAP), is identified. We explain the relation between the CAP and hub processes, develop suited algorithms for solving the CAP, and extend the basic CAP by multiple additions, for example, arrival times, limited storage space, and multiple service points, make the problem adaptable to a wide range of hub terminals. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 454–469, 2015