BP神经网络在电子设备可靠性验证中的应用

讨论了借助MATLAB的BP神经网络解决电子设备在寿命分布未知和小样本试验数据时的可靠性评估方法, 并给出了一个应用实例, 该方法可以提高可靠性评估置信度, 并能节省试验时间和费用, 特别适用于大型复杂电子设备。     

应用AHP法分析地域通信网可靠性

研究了地域通信网的可靠性,提出应用AHP法简化地域通信网可靠性研究的复杂度,给出一种适于通信网可靠性求解的AHP算法,最后结合装甲兵地域通信网的应用,分析了一个地域通信网可靠性实例,说明各层因素对整个通信网可靠性的综合作用。     

数据融合中的Dempster-Shafer证据理论

虽然 D- S方法已广泛地应用于各种数据融合系统中 ,但在实际应用中依然存在着许多困难。总结了数据融合应用中的 Dempster- Shafer证据理论研究概况 ,从四个方面阐述和对比分析了一些有代表性的研究成果 ;同时为下一步的研究提出了新的课题和思路     

热力设备可靠性分析的问题与对策

以热力设备为研究对象 ,从可靠性分析特点出发 ,对应用故障统计方法所遇到的典型问题作了探讨 ,就分析方法、建模技术等方面论述了作者的观点     

Life distribution analysis based on Lévy subordinators for degradation with random jumps

For a component or a system subject to stochastic degradation with sporadic jumps that occur at random times and have random sizes, we propose to model the cumulative degradation with random jumps using a single stochastic process based on the characteristics of Lévy subordinators, the class of nondecreasing Lévy processes. Based on the inverse Fourier transform, we derive a new closed‐form reliability function and probability density function for lifetime, represented by Lévy measures. The reliability function derived using the traditional convolution approach for common stochastic models such as gamma degradation process with random jumps, is revealed to be a special case of our general model. Numerical experiments are used to demonstrate that our model performs well for different applications, when compared with the traditional convolution method. More importantly, it is a general and useful tool for life distribution analysis of stochastic degradation with random jumps in multidimensional cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 483–492, 2015     

基于搜索论的远程反舰导弹搜捕概率建模方法

针对传统捕捉概率模型难以满足远程反舰导弹机动搜捕概率建模计算的问题,提出利用搜索论进行导弹机动搜捕概率计算的建模方法。该方法根据目标机动规律建立其分布概率密度函数,并依据末制导雷达发现目标概率的"倒四次方律"及弹目相对运动轨迹,构建其探测函数,通过求取两者之积的积分实现搜捕概率计算。计算结果显示:若远程反舰导弹不采取机动搜捕策略,目标指示误差增加1km时搜捕概率降低0.47,目标速度增加10节时搜捕概率降低0.3,末制导雷达搜索半径减小50%时搜捕概率降低0.3;若采取平行搜捕策略,上述因素对其影响大幅下降。可见,该方法综合考虑了目标机动规律、传感器探测规律、导弹搜捕策略,可实现远程反舰导弹机动搜捕概率的解算。     

半自动输弹机模糊控制系统

针对某半自动输弹机系统实际的输弹过程,提出了模糊控制系统的控制方案,根据本输弹机系统的模型设计了模糊控制参数。运用Matlab/Simulink仿真软件分别对采用模糊控制的系统和采用普通PID控制算法的系统进行仿真,得到各系统的单位阶跃响应曲线图和抗干扰信号图。对输弹机进行上炮试验,对比采用模糊控制的系统和采用普通PID控制算法的系统的实验结果,得到采用模糊算法的输弹机系统的卡膛一致性能很好的满足要求,具有一定的实践意义。     

序降应力加速寿命试验(下)——优化设计篇

如何设计试验方案使试验评估结果更准确、试验代价更小,是序降应力加速寿命试验应用中面临的一个重要问题。以试验评估精度和试验代价共同需求为背景,建立一类新的基于加权系数的优化目标函数。为解决仿真优化设计过程中的计算量问题,在深入分析目标函数性质基础上,提出一种新的优化设计法——正交搜索法。与优化设计过程的全局搜索法不同,该方法能够逐次缩小目标函数值,快速逼近最优试验方案。最后通过仿真算例验证了新方法的正确性和高效性。     

战略后方仓库综合技术保障中心建设方案评估

构建了后方仓库综合技术保障中心建设方案综合评估指标体系,先运用多人层次分析法对评价指标进行主观赋权,再对指标权值加以客观修正,从而得到较为客观准确的综合权重,最后运用模糊综合评价法对若干备选方案进行评判,得到各备选方案的评级结果,并从中选择最优方案。算例分析表明,该方法能够较好地适用于建设方案的评价,得出的量化描述结果可以作为建设方案评判与选择的参考依据。     

Designing rewards-based crowdfunding campaigns for strategic (but distracted) contributors

In rewards-based crowdfunding, entrepreneurs solicit donations from a large number of individual contributors. If total donations exceed a prespecified funding target, the entrepreneur distributes nonmonetary rewards to contributors; otherwise, their donations are refunded. We study how to design such campaigns when contributors choose not just whether to contribute, but also when to contribute. We show that strategic contribution behavior—when contributors intentionally delay until campaign success is likely—can arise from the combination of nonrefundable (potentially very small) hassle costs and the risk of campaign failure, and can explain pledging patterns commonly observed in crowdfunding. Furthermore, such delays do not hurt the entrepreneur if contributors are perfectly rational, but they do if contributors are distracted, that is, if they might fail to return to the campaign after an intentional delay. To mitigate this, we find that an entrepreneur can use a simple menu of rewards with a fixed number of units sold at a low price, and an unlimited number sold at a higher price; this segments contributors over time based on the information they observe upon arrival. We show that, despite its simplicity, such a menu performs well compared to a theoretically optimal menu consisting of an infinite number of different rewards and price levels under many conditions.