基于正则表达式的深度包检测算法

在深入分析了DFA状态数对算法性能影响的基础上,提出了一种新的基于正则表达式的深度包检测算法,该算法保证在任意有限的系统资源下算法的时间复杂度空间复杂度最小。在Linux下实现了该算法,并对基于L7-filter模式集合的网络数据包进行了大量检测实验。结果表明,与已有的正则表达式算法比较,该算法的时间复杂度和空降复杂度最小。     

使用DFA的Web会话构造方法

会话识别是Web使用挖掘数据预处理中重要的一个环节。将确定的有限自动机（DFA）思想运用于会话构造,针对一段用户访问日志,通过DFA中各个状态间的转换,实现会话构造。该方法更多考虑页面之间的连续性,关注用户的实际访问序列,有利于后续的用户访问模式的挖掘。     

产品可装配性设计方法和使能技术研究

产品可装配性设计（ＤＦＡ）理论研究,对实施并行工程具有重要的意义,上前得到广泛的重视。本文从实现ＤＦＡ目标出发,提出了ＤＦＡ的设计系统模型,论述了ＤＦＡ设计方法的相关使能技术,如并行装配设计、装配结构和装配性能分析、装配约束分析、装配序列规划、装配公差分析等。     

New Techniques for Regular Expression Searching

We present two new techniques for regular expression searching and use them to derive faster practical algorithms. Based on the specific properties of Glushkov’s nondeterministic finite automaton construction algorithm, we show how to encode a deterministic finite automaton (DFA) using O(m2^m) bits, where m is the number of characters, excluding operator symbols, in the regular expression. This compares favorably against the worst case of O(m2^m|Σ|) bits needed by a classical DFA representation (where Σ is the alphabet) and O(m2^2m) bits needed by the Wu and Manber approach implemented in Agrep. We also present a new way to search for regular expressions, which is able to skip text characters. The idea is to determine the minimum length ℓ of a string matching the regular expression, manipulate the original automaton so that it recognizes all the reverse prefixes of length up to ℓ of the strings originally accepted, and use it to skip text characters as done for exact string matching in previous work. We combine these techniques into two algorithms, one able and one unable to skip text characters. The algorithms are simple to implement, and our experiments show that they permit fast searching for regular expressions, normally faster than any existing algorithm.     

New Techniques for Regular Expression Searching

We present two new techniques for regular expression searching and use them to derive faster practical algorithms. Based on the specific properties of Glushkovs nondeterministic finite automaton construction algorithm, we show how to encode a deterministic finite automaton (DFA) using O(m2^m) bits, where m is the number of characters, excluding operator symbols, in the regular expression. This compares favorably against the worst case of O(m2^m||) bits needed by a classical DFA representation (where is the alphabet) and O(m2^2m) bits needed by the Wu and Manber approach implemented in Agrep. We also present a new way to search for regular expressions, which is able to skip text characters. The idea is to determine the minimum length of a string matching the regular expression, manipulate the original automaton so that it recognizes all the reverse prefixes of length up to of the strings originally accepted, and use it to skip text characters as done for exact string matching in previous work. We combine these techniques into two algorithms, one able and one unable to skip text characters. The algorithms are simple to implement, and our experiments show that they permit fast searching for regular expressions, normally faster than any existing algorithm.     

入侵检测系统中模式匹配自动机的构造研究

本文提出了一种新的用于构造入侵检测模式匹配自动机的方法。该方法从构造判定单个模式的NFA自动机入手,通过集成单个的NFA而得到全集的NFA,并将全集NFA转换为与之等价的DFA并化简,从而可得到全集的确定型模式匹配有限自动机。由于该方法可以完全自动完成,从而可以方便地为入侵检测系统构造模式匹配自动机。     

电子鼻系统对危险爆炸物的识别研究

采用纳米氧化锌厚膜气体传感器组成的阵列对硝铵、矿山炸药、苦味酸、2,4二硝基甲苯(DNT)4种典型爆炸物样品进行了实验。称取4mg爆炸物样品,采用动态实验对18只传感器进行筛选、优化,得到6个最优元件组成的阵列。采用静态实验考察了传感器的检测能力,结果表明:随着待测样品浓度的增加,6个传感器的灵敏度均呈指数上升,且该方法能够检测到4种爆炸物样品的最小浓度均低至3.34μg/L。为进一步与实际应用相接近,采用完全动态小剂量实验,结果表明:在15.4μg/L浓度处提取斜率最大值为特征值对阵列进行判别函数分析,可使4种典型爆炸物在该浓度水平能够完全区分。     

基于WEB的DFA的设计与实现

就DFA思想和BDI公司DFMA软件产品的DFA模块进行了分析,并提出一种将BDI DFA扩展到WEB上的方法.这种方法在充分利用软件本身资源的基础上,结合实际情况扩充了一些新的内容.文中给出了一个基于WEB的三层B/S结构模型.     

面向机器人装配的DFA模糊评价方法

本文论述了面向机器人装配生产方式的DFA评价技术 研究的特点,并提出了一种面向机器人装配的产品可装配性模糊综合评价方法．     

基于模糊神经网络产品设计的可装配性评价

首先建立了基于模糊神经网络的可装配性评价模型,然后将产品的可装配性分为零件级可装配性和装配顺序级可装配性,并将影响零件可装配性的因素分为零件装配特征的对称性、零件易于装配的形状特征个数、零件易于识别和零件易于抓取的形状特征个数,将影响装配顺序可装配性的因素分为总的操作数．非装配操作、装配工具的更换次数、平行的装配任务的数量、基础件的重定向次数和装配方向,建立了评价指标体系。最后将评价模型应用于某产品可装配性的评价。