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

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

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

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

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

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

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

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

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

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

Approximations and empirics for stochastic war equations

The article develops a theorem which shows that the Lanchester linear war equations are not in general equal to the Kolmogorov linear war equations. The latter are time‐consuming to solve, and speed is important when a large number of simulations must be run to examine a large parameter space. Run times are provided, where time is a scarce factor in warfare. Four time efficient approximations are presented in the form of ordinary differential equations for the expected sizes and variances of each group, and the covariance, accounting for reinforcement and withdrawal of forces. The approximations are compared with “exact” Monte Carlo simulations and empirics from the WWII Ardennes campaign. The band spanned out by plus versus minus the incremented standard deviations captures some of the scatter in the empirics, but not all. With stochastically varying combat effectiveness coefficients, a substantial part of the scatter in the empirics is contained. The model is used to forecast possible futures. The implications of increasing the combat effectiveness coefficient governing the size of the Allied force, and injecting reinforcement to the German force during the Campaign, are evaluated, with variance assessments. © 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     

Production‐inventory systems with imperfect advance demand information and updating

We consider a supplier with finite production capacity and stochastic production times. Customers provide advance demand information (ADI) to the supplier by announcing orders ahead of their due dates. However, this information is not perfect, and customers may request an order be fulfilled prior to or later than the expected due date. Customers update the status of their orders, but the time between consecutive updates is random. We formulate the production‐control problem as a continuous‐time Markov decision process and prove there is an optimal state‐dependent base‐stock policy, where the base‐stock levels depend upon the numbers of orders at various stages of update. In addition, we derive results on the sensitivity of the state‐dependent base‐stock levels to the number of orders in each stage of update. In a numerical study, we examine the benefit of ADI, and find that it is most valuable to the supplier when the time between updates is moderate. We also consider the impact of holding and backorder costs, numbers of updates, and the fraction of customers that provide ADI. In addition, we find that while ADI is always beneficial to the supplier, this may not be the case for the customers who provide the ADI. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

任职教育中案例教学方法探析——以《中国近现代史纲要》课程为例

案例教学法被逐步地引进任职教育的课堂,本文以《中国近现代史纲要》课程为例,探析了任职教育中案例教学法的应用。从教学目的、教学内容和教学对象三个方面分析了《中国近现代史纲要》课程运用案例教学的可行性。从《中国近现代史纲要》课程运用案例教学的意义可以看出,案例教学是作为该课程教学改革的最佳途径。运用案例教学时,在案例选取上兼顾真实性、针对性、时效性,在案例分析过程中注重教学主体和客体的双向交流,在案例总结时注重案例结论与讨论论点的区别。