聚合物材料与液氧相容性的研究

为研究聚合物材料与液氧的相容性,针对四种结构不同的环氧树脂与氰酸酯的共聚固化物,以液氧冲击敏感性试验作为其与液氧相容性的判定方法,通过热分析测试手段测定各固化物的恒温氧化热增重、热分解失重和闪点等热氧性能,并与其液氧冲击敏感性进行分析对照,证实环氧/氰酸酯类改性树脂与液氧不相容的程度与其常规热氧化反应的难易程度是一致的,提高其抗氧化性可以改善其与液氧的相容性。由此加深了对于聚合物与液氧相容性本质的认识,为进一步研究与液氧相容的聚合物材料指明了方向。作为常规分析手段的热分析,在聚合物与液氧相容性的科学表征中可发挥重要作用。     

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

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

基于时间序列预测的独立分量排序

独立分量排序是独立分量分析的热点问题,是提高特征空间鲁棒性和减少计算复杂度的必要前提。结合ICA在时间序列预测的应用,给出了基于一阶差分和最小方差误差的多分量联合重构预测排序准则。为了避免联合优化中出现的海量计算问题,提出了添加-测试-接受机制(ATA)的次优搜索方法。实验结果表明,和传统排序方法比较,新方法具有优异的预测能力和搜索效率。     

基于LWT的纹理特征提取方法

介绍了一种利用局部沃尔什变换(LWT)提取图像纹理特征的新方法,给出LWT的定义,并分析了LWT系数的统计特性及其各阶矩的纹理鉴别性能。结果表明:自然纹理图像的LWT系数一般不服从正态分布,其偶数阶矩具有较好的纹理鉴别性能,奇数阶矩的纹理鉴别性能较差,因此选取LWT系数的偶数阶(2、4、6阶)矩作为纹理特征。与Haralick[1]、Wang和He[2,3],以及HuiYu[5]等人提出的纹理特征相比,基于LWT的纹理特征具有更好的鉴别性能,并且计算简单。     

液体火箭发动机故障检测和诊断中数据挖掘策略的分析

分析了液体火箭发动机的工作特点,提出了应用数据挖掘方法从数据仓库的角度对液体火箭发动机进行故障检测和诊断的策略。对在液体火箭发动机故障检测和诊断的不同问题中可能应用的数据挖掘方法进行了分析比较。分析表明,聚类、分类、关联、时间序列分析和孤立点检测等数据挖掘方法适用于液体火箭发动机的故障检测和诊断。     

紫外光谱法分析火场残留物汽油成分

根据汽油燃烧有可能生成复杂的多环芳烃的特点,对火场残留物中可能存在的微量汽油成分进行了提纯,并利用紫外分光光度计对样品进行分析,通过分析总结实验得出的数据及图谱,可以证明紫外光谱法分析火场残留物中可能存在的汽油成分是一种快速有效的鉴定分析方法。     

红外光谱法在材料阻燃分析中的应用

介绍了红外光谱法在表征阻燃材料与防火涂料结构及研究其阻燃性能方面的应用,讨论了红外光谱分析技术在材料阻燃分析中的应用前景。     

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     

Multiple subset sum with inclusive assignment set restrictions

In a traditional multiple subset sum problem (MSSP), there is a given set of items and a given set of bins (or knapsacks) with identical capacities. The objective is to select a subset of the items and pack them into the bins such that the total weight of the selected items is maximized. However, in many applications of the MSSP, the bins have assignment restrictions. In this article, we study the subset sum problem with inclusive assignment set restrictions, in which the assignment set of one item (i.e., the set of bins that the item may be assigned to) must be either a subset or a superset of the assignment set of another item. We develop an efficient 0.6492‐approximation algorithm and test its effectiveness via computational experiments. We also develop a polynomial time approximation scheme for this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Network routing for insurgency: An adversarial risk analysis framework

Problems in counterterrorism and corporate competition have prompted research that attempts to combine statistical risk analysis with game theory in ways that support practical decision making. This article applies these methods of adversarial risk analysis to the problem of selecting a route through a network in which an opponent chooses vertices for ambush. The motivating application is convoy routing across a road network when there may be improvised explosive devices and imperfect intelligence about their locations. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011