含诱导缺陷复合材料T型接头的弯曲失效实验

通过实验研究含不同诱导缺陷的复合材料T型接头的弯曲力学性能和失效过程,采用引入脱黏缺陷和三角区填充率缺陷来诱导T型接头的不同失效模式。结果表明不同失效模式下T型接头所表现出来的弯曲力学性能差异极大,完好的T型接头所能承受的载荷为288.5N,界面脱黏会削弱其30%的承载能力,而三角区填充率的减少会导致裂纹在填充区内部引发和扩展,导致T型接头的弯曲力学性能大幅降低。     

水下制氢反应室动态过程数值分析

为研究水下制氢反应室的动态过程规律,基于化学反应动力学和单液滴运动学得到合金/水反应转化率,并在最小自由能法计算得到生成物各组分摩尔数的基础上利用质量守恒方程得到室内各物质质量变化规律。在建立非线性移动边界螺旋管动态模型的前提下,利用能量守恒方程得到室内热力参数变化规律,进而完成制氢反应室动态过程详尽模型的建立。利用该模型编写计算程序,完成某水下制氢反应室动态过程仿真。结果表明,各仿真曲线较好地反映了对应参数的动态变化规律,验证了模型建立与仿真的正确性;合金/水反应转化率决定了反应室的物质质量变化规律及其能量释放特性。该模型可以作为制氢反应室动态特性分析及其过程控制研究的基础模型。     

数字图像复数不变矩构造及稳定性分析

为系统性地给出数字图像不变矩一般性构造方法及对不变矩稳定性进行分析,通过采用复数矩作为描述数字图像识别特征量的方法,研究了复数不变矩所具有不变性的约束条件及其与几何不变矩间的关系,推导出了复数不变矩构造定理,并以在工程应用中的低阶复数不变矩为例对复数不变矩的稳定性进行了分析。研究结果表明:采用复数不变矩构造数字图像特征量具有很好普适性和稳定性,对于图像目标识别特征的描述有较好的效果。     

基于属性的舰载机航材备件品种确定方法

航材备件品种确定是舰载机供应保障工作的重要内容。基于属性对舰载机航材备件品种确定进行研究。基于粗糙集理论对属性集进行属性约简,确定航材备件品种确定的主要影响属性,然后基于属性约简进行航材备件品种确定。给出了单属性、顺次属性和多属性的品种决策方法。最后结合实例进行了应用分析。     

基于GAHP的模糊综合评判法在潜艇 作战方案评估中的应用

潜艇作战方案评估是辅助对潜指挥员决策的重要方法,而评估的科学性对决策的有效性影响很大.利用多人层次分析法(GAHP)和模糊综合评判相结合的方法,对潜艇作战方案进行评估,评估的结果可信度高,有利于对潜指挥员的正确决策.最后,通过实例证明了方法的有效性.     

防空通信系统性能评价及抗毁性分析

分析了防空通信系统的组织结构和对抗特点,利用性能评价过程代数描述防空通信系统的状态演化,提出一种防空通信系统抗毁特性分析方法。通过具体案例,对通信系统的组织结构、抗击软硬杀伤的能力进行建模和仿真验证。实验结果表明,该方法适用于防空通信系统的建模与分析,能够实现对防空通信系统的结构进行对抗过程的建模;通信系统的不同要素对抗毁性能的影响不同,可以采取有效策略以提高防空通信系统的抗毁能力。     

Choosing arrival process models for service systems: Tests of a nonhomogeneous Poisson process

Service systems such as call centers and hospital emergency rooms typically have strongly time‐varying arrival rates. Thus, a nonhomogeneous Poisson process (NHPP) is a natural model for the arrival process in a queueing model for performance analysis. Nevertheless, it is important to perform statistical tests with service system data to confirm that an NHPP is actually appropriate, as emphasized by Brown et al. [8]. They suggested a specific statistical test based on the Kolmogorov–Smirnov (KS) statistic after exploiting the conditional‐uniform (CU) property to transform the NHPP into a sequence of i.i.d. random variables uniformly distributed on [0,1] and then performing a logarithmic transformation of the data. We investigate why it is important to perform the final data transformation and consider what form it should take. We conduct extensive simulation experiments to study the power of these alternative statistical tests. We conclude that the general approach of Brown et al. [8] is excellent, but that an alternative data transformation proposed by Lewis [22], drawing upon Durbin [10], produces a test of an NHPP test with consistently greater power. We also conclude that the KS test after the CU transformation, without any additional data transformation, tends to be best to test against alternative hypotheses that primarily differ from an NHPP only through stochastic and time dependence. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 66–90, 2014     

基于显著性的红外图像强固定模式噪声抑制*

本文针对红外成像设备对天远距离观测中得到的小目标、强固定模式噪声这一类典型数据提出基于显著性的红外图像强固定模式噪声抑制算法。文中首先对此类图像数据进行特性分析,指出图像中目标区域相对于背景固定模式噪声区域是显著的,利用显著性检测算法分离出图像中目标区域及背景,对不同区域分别采取不同处理,仅基于单幅图像信息实现强固定模式噪声的有效抑制。最后,通过大量小目标、强固定模式噪声红外图像对算法性能进行测试,结果表明,本算法能够准确提取出图像中目标区域,实现图像中强固定模式噪声的有效抑制。     

光学显微结核杆菌图像的区域分割算法

为提高结核杆菌目标的分割精度,提出了一种区域级的光学显微结核杆菌图像分割算法。通过顶帽—底帽变换增强彩色图像对比度,融合图像局部特征和全局信息计算图像梯度,利用分水岭算法实现对图像的初始分割;对分割区域采用相邻区域最大相似度准则进行合并,从而得到完整的目标区域;根据结核杆菌图像的特点,通过分析结核杆菌目标区域的颜色特性,采用多阈值分割的方法滤除区域中的杂质,实现对结核杆菌目标的分割。实验结果表明,可以分割出目标对比度低以及饱和度过低的结核杆菌目标,并且对不同染色背景的图像均能取得较好的分割结果。     

Flow shop scheduling with earliness,tardiness, and intermediate inventory holding costs

We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding), and intermediate (work‐in‐process) inventory holding costs. We formulate this problem as an integer program, and based on approximate solutions to two different, but closely related, Dantzig‐Wolfe reformulations, we develop heuristics to minimize the total cost. We exploit the duality between Dantzig‐Wolfe reformulation and Lagrangian relaxation to enhance our heuristics. This combined approach enables us to develop two different lower bounds on the optimal integer solution, together with intuitive approaches for obtaining near‐optimal feasible integer solutions. To the best of our knowledge, this is the first paper that applies column generation to a scheduling problem with different types of strongly ????‐hard pricing problems which are solved heuristically. The computational study demonstrates that our algorithms have a significant speed advantage over alternate methods, yield good lower bounds, and generate near‐optimal feasible integer solutions for problem instances with many machines and a realistically large number of jobs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.