基于多极化多特征提取和SVM的目标识别方法

充分有效地利用全极化雷达目标高分辨一维距离像极化信息是雷达目标特征提取领域一个热点问题.提取全极化雷达目标高分辨一维距离像的极化特征、结合其能量聚集区长度以及中心距特征共同构成特征向量,采用支持向量机进行特征分类,从而提出了一种基于多极化多特征提取和支持向量机的目标识别方法.基于转台数据的实验结果表明,提出的基于多极化多特征提取和支持向量机的目标识别方法有助于获得较高的分类正确率.     

火箭发动机故障检测的快速增量单分类支持向量机算法

为解决液体火箭发动机故障诊断正负样本不平均问题,以及实现发动机稳态工作段自适应故障检测,建立了基于快速增量单分类支持向量机的异常检测模型。采取特征工程方法,对传感器获得的多变量时间序列进行特征提取。通过增量学习方法,对单分类支持向量机模型进行改进,并应用于液体火箭发动机异常检测,使单分类支持向量机检测模型具备对不同台次、不同工况的自适应性,提高了模型的计算速度。对多台次热试车数据的分析结果表明,该模型十分有效,训练速度快,具备实用价值。     

一种支持向量机增量学习淘汰算法

针对大规模数据集的分类问题,支持向量机的训练成为一个难题。增量学习是解决这一难题的思路之一。分析了新增样本加入训练集后支持向量集的变化情况,提出了一种基于密度法的支持向量机增量学习淘汰算法,淘汰了对最终分类无用的样本,在保证测试精度的同时减少了训练时间。实验仿真证明这种算法是有效的。     

粗糙集和FSVM结合的雷达信号识别法

结合粗糙集的属性约简和支持向量机的分类机理,研究了一种混合算法,即应用粗糙集的属性约简过程作为预处理器,可以把冗余的属性及值和冲突的对象从决策表中删去,但不损失任何有效信息;由于传统支持向量机在多分类问题时出现的不可分区域现象,使用了模糊支持向量机进行后面的分类建模和预测,使得训练时间大大缩短和分类性能显著提高。将这种混合方法应用到雷达信号识别中,仿真实验证明该方法是有效的。     

一种舰船目标一维距离像识别的新方法

提出了一种基于傅里叶-梅林变换和二叉树支持向量机相结合的舰船目标一维距离像识别方法。该方法充分利用了傅里叶-梅林变换具有的时移与尺度不变性和支持向量机在小样本分类中的优势,可以改善目标的特征稳定性,提高识别性能。针对多类舰船目标的识别,提出采用聚类分析中的均值距离来生成二叉树,将分类器分布在各个节点上,构成了多类支持向量机,减少了分类器数量和重复训练样本的数量。对4类舰船目标仿真实验的结果表明,该分类方法具有较高的识别性能、较快的识别速度。     

基于层间嵌入式多级支持向量机的特征选择

针对多故障样本一次性映射之后分类不理想,研究了多级层次式支持向量机,应用UCI数据仿真,结果表明该方法缩短了训练时间、提升了测试准确率、改善了样本的可分类性。由于误差积累,在此基础上,提出了层间嵌入式多级支持向量机,采用Abalone数据仿真,结果表明分类精度有所提高并减少了分类步骤。结合ReliefF算法,对制导设备的故障特征参数进行了选择。     

基于二叉树直觉模糊SVM的弹道目标HRRP识别

弹道目标识别是一个多目标识别过程,二叉树支持向量机(BTSVM)是一种针对多类分类有效的分类器。BTSVM结构简单,训练快,但容易出现误差积累。为提高目标识别率,引入并改进了直觉模糊支持向量机,设计了一种基于自适应隶属度函数和直觉指数的多类直觉模糊SVM分类器。对训练集进行直觉模糊化处理得到直觉模糊数据集,用于训练分类器得到二叉树直觉模糊SVM分类器。将此分类器应用于弹道目标HRRP识别,提高了识别的正确率和识别效率,仿真结果表明了此分类器的有效性。     

基于KKT条件的SVM增量学习算法

为了解决支持向量机(SVM)在增量学习时,由于支持向量选择不完全,导致增量学习过程无法持久进行的问题,提出了最大似然边界SVM增量学习算法。该方法在深入分析分类面变化趋势的基础上,充分利用KKT条件,选择包含支持向量的边界向量参与SVM增量学习。实验表明,该算法可以完全覆盖支持向量,与经典支持向量机算法的结果完全相同,并且节省了大量时间,为今后大样本分类和增量学习的可持续性提供了条件。     

基于GA-SVM的装备保障设备报废技术鉴定方法

为提高装备保障设备报废技术鉴定的准确性,提出了一种基于支持向量机的报废技术鉴定方法.分析了报废技术鉴定主要特征,并给出了各特征的量化和预处理公式.介绍了支持向量机基本原理,并引入遗传算法对支持向量机的惩罚参数和核参数进行寻优.算例验证结果表明,与常见分类算法相比,基于高斯核的支持向量机在装备保障设备报废技术鉴定中,训练时间更短、分类精度更高.     

基于遗传算法与支持向量机的火炮内膛疵病分类方法研究

支持向量机能够较好解决小样本、非线性数据特征的多分类问题,适用于火炮内膛疵病的分类,但其性能依赖于其参数的选取;对基本遗传算法进行改进,使用自适应的交叉算子和变异算子,并应用于支持向量机参数优化;通过对火炮内膛疵病分类精度的对比研究,改进的遗传算法确定支持向量机优化参数的方法取得了良好的效果,验证了该方法对疵病分类的有效性。     

基于GAHP和熵法的虚拟训练综合评价

针对武器装备虚拟训练中评价一次操作数据无法客观反映受评者真实水平问题,提出了基于灰色层次分析和熵理论的虚拟训练评价方法。在获取每名受评者操作数据样本的前提下,通过灰色层次分析,确定指标层次和初始权重,利用灰色评估方法确定相应指标的灰类,对灰数归一化加权得到每个指标的评分,并确定综合总评分;引入不稳定因子,借助熵法确定受评者每个指标的不稳定性。最后,通过实例验证了方法的有效性,并根据不稳定因子和各指标评分向受评者提供了后续训练提升的建议。     

Optimal control of a production‐inventory system with both backorders and lost sales

We consider the optimal control of a production inventory‐system with a single product and two customer classes where items are produced one unit at a time. Upon arrival, customer orders can be fulfilled from existing inventory, if there is any, backordered, or rejected. The two classes are differentiated by their backorder and lost sales costs. At each decision epoch, we must determine whether or not to produce an item and if so, whether to use this item to increase inventory or to reduce backlog. At each decision epoch, we must also determine whether or not to satisfy demand from a particular class (should one arise), backorder it, or reject it. In doing so, we must balance inventory holding costs against the costs of backordering and lost sales. We formulate the problem as a Markov decision process and use it to characterize the structure of the optimal policy. We show that the optimal policy can be described by three state‐dependent thresholds: a production base‐stock level and two order‐admission levels, one for each class. The production base‐stock level determines when production takes place and how to allocate items that are produced. This base‐stock level also determines when orders from the class with the lower shortage costs (Class 2) are backordered and not fulfilled from inventory. The order‐admission levels determine when orders should be rejected. We show that the threshold levels are monotonic (either nonincreasing or nondecreasing) in the backorder level of Class 2. We also characterize analytically the sensitivity of these thresholds to the various cost parameters. Using numerical results, we compare the performance of the optimal policy against several heuristics and show that those that do not allow for the possibility of both backordering and rejecting orders can perform poorly.© 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

一种应用聚类技术检测网络入侵的新方法

基于聚类技术提出了一种能处理不带标识且含异常数据样本的训练集数据的网络入侵检测方法。对网络连接数据作归一化处理后 ,通过比较数据样本间距离与类宽度W的关系进行数据类质心的自动搜索 ,并通过计算样本数据与各类质心的最小距离来对各样本数据进行类划分 ,同时根据各类中的样本数据动态调整类质心 ,使之更好地反映原始数据分布。完成样本数据的类划分后 ,根据正常类比例N来确定异常数据类别并用于网络连接数据的实时检测。结果表明 ,该方法有效地以较低的系统误警率从网络连接数据中检测出新的入侵行为 ,更降低了对训练数据集的要求。     

Analysis of the finite‐source multiclass priority queue with an unreliable server and setup time

In this article, we study a queueing system serving multiple classes of customers. Each class has a finite‐calling population. The customers are served according to the preemptive‐resume priority policy. We assume general distributions for the service times. For each priority class, we derive the steady‐state system size distributions at departure/arrival and arbitrary time epochs. We introduce the residual augmented process completion times conditioned on the number of customers in the system to obtain the system time distribution. We then extend the model by assuming that the server is subject to operation‐independent failures upon which a repair process with random duration starts immediately. We also demonstrate how setup times, which may be required before resuming interrupted service or picking up a new customer, can be incorporated in the model. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Adaptive subspace detection based on two-step dimension reduction in the underwater waveguide

In the underwater waveguide, the conventional adaptive subspace detector (ASD), derived by using the generalized likelihood ratio test (GLRT) theory, suffers from a significant degradation in detection per-formance when the samplings of training data are deficient. This paper proposes a dimension-reduced approach to alleviate this problem. The dimension reduction includes two steps: firstly, the full array is divided into several subarrays; secondly, the test data and the training data at each subarray are transformed into the modal domain from the hydrophone domain. Then the modal-domain test data and training data at each subarray are processed to formulate the subarray statistic by using the GLRT theory. The final test statistic of the dimension-reduced ASD (DR-ASD) is obtained by summing all the subarray statistics. After the dimension reduction, the unknown parameters can be estimated more accurately so the DR-ASD achieves a better detection performance than the ASD. In order to achieve the optimal detection performance, the processing gain of the DR-ASD is deduced to choose a proper number of subarrays. Simulation experiments verify the improved detection performance of the DR-ASD compared with the ASD.     

A multilevel passenger screening problem for aviation security

Passenger prescreening is a critical component of aviation security systems. This paper introduces the Multilevel Allocation Problem (MAP), which models the screening of passengers and baggage in a multilevel aviation security system. A passenger is screened by one of several classes, each of which corresponds to a set of procedures using security screening devices, where passengers are differentiated by their perceived risk levels. Each class is defined in terms of its fixed cost (the overhead costs), its marginal cost (the additional cost to screen a passenger), and its security level. The objective of MAP is to assign each passenger to a class such that the total security is maximized subject to passenger assignments and budget constraints. This paper shows that MAP is NP‐hard and introduces a Greedy heuristic that obtains approximate solutions to MAP that use no more than two classes. Examples are constructed using data extracted from the Official Airline Guide. Analysis of the examples suggests that fewer security classes for passenger screening may be more effective and that using passenger risk information can lead to more effective security screening strategies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

On two nonprobabilistic utility measures for weapon systems

In this paper an attempt is made to derive two interval utility measures for public goods. The domain of the measures is partitioned into priority classes in such a way that each class contains an element, called a kernel, which can be moved by parameter variation to the immediately preceding class. The “expansion path” from priority class to priority class is determined by an optimality criterion. The measures themselves are based on optimality conditions that are similar to the familiar first-order conditions of consumer analysis. One is a product measure and the other one is additive.     

On the (S − 1, S) lost sales inventory model with priority demand classes

In this paper an inventory model with several demand classes, prioritised according to importance, is analysed. We consider a lot‐for‐lot or (S ? 1, S) inventory model with lost sales. For each demand class there is a critical stock level at and below which demand from that class is not satisfied from stock on hand. In this way stock is retained to meet demand from higher priority demand classes. A set of such critical levels determines the stocking policy. For Poisson demand and a generally distributed lead time, we derive expressions for the service levels for each demand class and the average total cost per unit time. Efficient solution methods for obtaining optimal policies, with and without service level constraints, are presented. Numerical experiments in which the solution methods are tested demonstrate that significant cost reductions can be achieved by distinguishing between demand classes. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 593–610, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10032     

Revenue management with aircraft reassignment flexibility

A well‐studied problem in airline revenue management is the optimal allocation of seat inventory among different fare‐classes, given a capacity for the flight and a demand distribution for each class. In practice, capacity on a flight does not have to be fixed; airlines can exercise some flexibility on the supply side by swapping aircraft of different capacities between flights as partial booking information is gathered. This provides the airline with the capability to more effectively match their supply and demand. In this paper, we study the seat inventory control problem considering the aircraft swapping option. For theoretical and practical purposes, we restrict our attention to the class of booking limit policies. Our analytical results demonstrate that booking limits considering the swapping option can be considerably different from those under fixed capacity. We also show that principles on the relationship between the optimal booking limits and demand characteristics (size and risk) developed for the fixed‐capacity problem no longer hold when swapping is an option. We develop new principles and insights on how demand characteristics affect the optimal booking limits under the swapping possibility. We also develop an easy to implement heuristic for determining the booking limits under the swapping option and show, through a numerical study, that the heuristic generates revenues close to those under the optimal booking limits. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A branch‐and‐price algorithm for parallel machine scheduling with time windows and job priorities

This paper presents a branch‐and‐price algorithm for scheduling n jobs on m nonhomogeneous parallel machines with multiple time windows. An additional feature of the problem is that each job falls into one of ρ priority classes and may require two operations. The objective is to maximize the weighted number of jobs scheduled, where a job in a higher priority class has “infinitely” more weight or value than a job in a lower priority class. The methodology makes use of a greedy randomized adaptive search procedure (GRASP) to find feasible solutions during implicit enumeration and a two‐cycle elimination heuristic when solving the pricing subproblems. Extensive computational results are presented based on data from an application involving the use of communications relay satellites. Many 100‐job instances that were believed to be beyond the capability of exact methods, were solved within minutes. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006