决策树报文分类算法

报文分类是网络的基本功能,研究人员在过去二十年提出了众多解决方案,其中决策树报文分类算法由于吞吐量高、适用于多字段、可流水线化等特点受到了广泛关注和深入研究。本文介绍了决策树算法最新研究成果,阐述了决策树报文分类算法的几何意义、常用技术和测试基准,从节点切割技术和规则集分组技术两个维度对决策树算法进行了系统分析和归纳。针对两类常用的决策树构建技术介绍了其中的典型算法,对比了各种典型算法的设计思路和特点,分析了它们的适用场景。总结并展望了决策树算法的下一步研究方向。     

A quasi-isentropic model of a cylinder driven by aluminized explosives based on characteristic line analysis

A quasi-isentropic study on the process of driving a cylinder with aluminized explosives was carried out to examine the influence of the aluminum (Al) reaction rate on cylinder expansion and the physical parameters of the detonation products. Based on the proposed quasi-isentropic hypothesis and relevant isentropic theories, the characteristic lines of aluminized explosives driving a cylinder were analyzed, and a quasi-isentropic model was established. This model includes the variation of the cylinder wall velocity and the physical parameters of the detonation products with the Al reaction degree. Using previously reported experimental results, the quasi-isentropic model was verified to be applicative and accurate. This model was used to calculate the physical parameters for cylinder experiments with aluminized cyclotrimethylenetrinitramine explosives with 15.0 % and 30.0 % Al content. The results show that this quasi-isentropic model can be used not only to calculate the cylinder expansion rule or Al reaction degree, but also to calculate the physical parameters of the detonation products in the process of cylinder expansion. For explosives with 15.0 % and 30.0 % Al, 24.3 % and 18.5 % of the Al was found to have reacted at 33.9 μs and 34.0 μs, respectively. The difference in Al content results in different reaction intensity, occurrence time, and duration of two forms of reaction (diffusion and kinetic) between the Al powder and the detonation products; the post-detonation burning reaction between the Al powder and the detonation products prolongs the positive pressure action time, resulting in a continuous rise in temperature after detonation.     

Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations

We study a single batching machine scheduling problem with transportation and deterioration considerations arising from steel production. A set of jobs are transported, one at a time, by a vehicle from a holding area to the single batching machine. The machine can process several jobs simultaneously as a batch. The processing time of a job will increase if the duration from the time leaving the holding area to the start of its processing exceeds a given threshold. The time needed to process a batch is the longest of the job processing times in the batch. The problem is to determine the job sequence for transportation and the job batching for processing so as to minimize the makespan and the number of batches. We study four variations (P1, P2, P3, P4) of the problem with different treatments of the two criteria. We prove that all the four variations are strongly NP‐hard and further develop polynomial time algorithms for their special cases. For each of the first three variations, we propose a heuristic algorithm and analyze its worst‐case performance. For P4, which is to find the Pareto frontier, we provide a heuristic algorithm and an exact algorithm based on branch and bound. Computational experiments show that all the heuristic algorithms perform well on randomly generated problem instances, and the exact algorithm for P4 can obtain Pareto optimal schedules for small‐scale instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 269–285, 2014     

基于非负矩阵分解的电磁超声系统优化研究

针对孤立脉冲群电磁超声系统信号特征容易被噪声淹没的问题,提出基于改进的非负矩阵分解（INMF）优选特征的支持向量机（SVM）方法．首先,用3种不同的方法提取高维特征;其次,用NMF方法实现特征降维,并保证降维结果的唯一性,避免对特征的直接选择;最后,应用支持向量机方法对降维特征进行分类．对孤立脉冲群电磁超声系统采集的4种信号特征进行提取、选择和分类,实验结果表明：INMF方法能有效提取微弱信号的特征,减少运算量,提高电磁超声系统特征采集的准确率．     

Review of the ordered and proportionate flow shop scheduling research

Ordered flow shop models have appeared in the literature since the mid‐1970s and proportionate flow shop models have appeared since the early 1980s. We provide a detailed review of these models along with some analysis and potential topics for future research. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

虚拟维修仿真数据编辑系统研究

为有效解决虚拟维修系统中仿真数据编辑技术不通用的问题,在深入研究虚拟维修数据模型、交互任务分析、仿真数据管理等关键技术的基础上,设计开发了具有工程应用价值的虚拟维修仿真数据编辑系统.在分析系统设计需求的基础上,设计了系统总体结构,基于S1000D设计了虚拟维修数据模型,基于UML分析了维修样机编辑和维修规程编辑过程中的交互任务,基于XML实现了仿真数据的编辑、存储与发布.该系统应用于某型复杂装备虚拟维修,验证了系统的各项功能和应用效果.     

精密加工过程切削用量和表面粗糙度关系的模糊化处理方法

在金属切削原理中,用切削用量可以估计理论表面粗糙度。由于切削过程的复杂性,实际加工表面粗糙度和理论表面粗糙度有较大差距。本文采用模糊模式识别方法,对切削用量和表面粗糙度的关系进行了实验研究。本人介绍的理论方法、实现技术路线和实验结果,为以后开展ＦＭＳ或ＣＩＭＳ中智能化质量监控技术的进一步研究打下了基础。     

一种新型CVD铁涂层吸波纤维

利用Fe(CO)5受热分解,以CVD方法在SiC纤维表面涂覆单质铁的涂层。研究表明,涂层的引入对SiC纤维力学性能基本没有损伤;纤维依靠涂层导电,其电阻率显著降低;改变工艺条件,可以在较大范围内调节涂层纤维的介电常数,同时也引入了磁损耗机制;采用较低的沉积温度和较高的载气流速,可以提高介电常数和磁导率,同时有好的频散效应。     

An FPTAS for scheduling a two‐machine flowshop with one unavailability interval

We study a deterministic two‐machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. The problem is known to be NP‐hard. Pseudopolynomial dynamic programming algorithms and heuristics with worst case error bounds are given in the literature to solve the problem. They are different for the cases when the unavailability interval is for the first or second machine. The existence of a fully polynomial time approximation scheme (FPTAS) was formulated as an open conjecture in the literature. In this paper, we show that the two cases of the problem under study are equivalent to similar partition type problems. Then we derive a generic FPTAS for the latter problems with O(n⁵/ε⁴) time complexity. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Proactive release procedures for just‐in‐time job shop environments,subject to machine failures

In this paper, we consider just‐in‐time job shop environments (job shop problems with an objective of minimizing the sum of tardiness and inventory costs), subject to uncertainty due to machine failures. We present techniques for proactive uncertainty management that exploit prior knowledge of uncertainty to build competitive release dates, whose execution improves performance. These techniques determine the release dates of different jobs based on measures of shop load, statistical data of machine failures, and repairs with a tradeoff between inventory and tardiness costs. Empirical results show that our methodology is very promising in comparison with simulated annealing and the best of 39 combinations of dispatch rules & release policies, under different frequencies of breakdowns. We observe that the performance of the proactive technique compared to the other two approaches improves in schedule quality (maximizing delivery performance while minimizing costs) with increase in frequency of breakdowns. The proactive technique presented here is also computationally less expensive than the other two approaches. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004