排序方式: 共有85条查询结果,搜索用时 15 毫秒
71.
72.
设H为实Hilbert空间,C为H的非空闭凸子集,T:C→2H为极大单调算子,假设S(T)={x∈H:0∈Tx}≠Φ。 xk∈H,βk>0,求 xk及ek满足( ) xk+ek∈ xk+βkT( xk),‖ek‖≤ηk‖xk- xk‖, k≥0,其中,ηk≥0,supk>0ηk<1,βk≥β>0。设PC:H→C为H到C上的最近点投影算子,定义xk+1=PC( xk-ek),k≥0,证明了若T满足(S)型条件,则{xk}k≥0强收敛于T的某个零点。 相似文献
73.
针对BP网络存在易陷入局部极小和收敛速度慢的问题,采用遗传算法(GA)优化BP网络;采用混配的方法,对遗传算法进行了改进,克服了遗传算法中所存在的种群内过早收敛的缺点,并在光纤陀螺温度漂移建模中,取得了预测的效果。 相似文献
74.
75.
讨论了舰炮武器系统机械零位检测校准常用方法的不足,提出了新的检测校准原理和方法,该方法可提高校准的精度和工效,适应性强,特别适应于用软件校准机械零位,有较大的应用价值。 相似文献
76.
Accelerated degradation testing (ADT) is usually conducted under deterministic stresses such as constant‐stress, step‐stress, and cyclic‐stress. Based on ADT data, an ADT model is developed to predict reliability under normal (field) operating conditions. In engineering applications, the “standard” approach for reliability prediction assumes that the normal operating conditions are deterministic or simply uses the mean values of the stresses while ignoring their variability. Such an approach may lead to significant prediction errors. In this paper, we extend an ADT model obtained from constant‐stress ADT experiments to predict field reliability by considering the stress variations. A case study is provided to demonstrate the proposed statistical inference procedure. The accuracy of the procedure is verified by simulation using various distributions of field stresses. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006. 相似文献
77.
风对旋转弹丸弹道轨迹的交叉影响 总被引:1,自引:0,他引:1
本文解释了风对旋转弹丸弹道轨迹交叉影响的物理本质,分析了风对直射弹道和曲射弹道的影响。指出横风对于直射弹道的交叉影响引起的射程偏差较大;而纵风对于曲射弹道的交叉影响所引起的方向偏差在大射角时也较为明显。 相似文献
78.
材料力学性能纳米压入测试仪器发展综述 总被引:1,自引:0,他引:1
综述了材料力学性能纳米压入测试仪器的发展现状。阐述了纳米压入测试技术的发展历程;从驱动、载荷测量和位移测量3方面对目前材料力学性能纳米压入测试仪器的基本结构进行了比较分析;介绍了材料力学性能纳米压入测试仪器集成技术,包括影响压入深度测量精度的集成技术、观测技术、大载荷模块和高温试验模块等;最后,对未来材料力学性能纳米压力测试仪器的发展趋势作了展望。 相似文献
79.
80.
In an accumulation game, a HIDER attempts to accumulate a certain number of objects or a certain quantity of material before a certain time, and a SEEKER attempts to prevent this. In a continuous accumulation game the HIDER can pile material either at locations $1, 2, …, n, or over a region in space. The HIDER will win (payoff 1) it if accumulates N units of material before a given time, and the goal of the SEEKER will win (payoff 0) otherwise. We assume the HIDER can place continuous material such as fuel at discrete locations i = 1, 2, …, n, and the game is played in discrete time. At each time k > 0 the HIDER acquires h units of material and can distribute it among all of the locations. At the same time, k, the SEEKER can search a certain number s < n of the locations, and will confiscate (or destroy) all material found. After explicitly describing what we mean by a continuous accumulation game on discrete locations, we prove a theorem that gives a condition under which the HIDER can always win by using a uniform distribution at each stage of the game. When this condition does not hold, special cases and examples show that the resulting game becomes complicated even when played only for a single stage. We reduce the single stage game to an optimization problem, and also obtain some partial results on its solution. We also consider accumulation games where the locations are arranged in either a circle or in a line segment and the SEEKER must search a series of adjacent locations. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 60–77, 2002; DOI 10.1002/nav.1048 相似文献