Regular expression matching is playing an important role in deep inspection. The rapid development of SDN and NFV makes the network more dynamic, bringing serious challenges to traditional deep inspection matching eng...Regular expression matching is playing an important role in deep inspection. The rapid development of SDN and NFV makes the network more dynamic, bringing serious challenges to traditional deep inspection matching engines. However, state-of-theart matching methods often require a significant amount of pre-processing time and hence are not suitable for this fast updating scenario. In this paper, a novel matching engine called BFA is proposed to achieve high-speed regular expression matching with fast pre-processing. Experiments demonstrate that BFA obtains 5 to 20 times more update abilities compared to existing regular expression matching methods, and scales well on multi-core platforms.展开更多
Some modifications of two-constant Kubelka-Munk theory has been made for the color matching of pre-colored fiber blends. The scattering coefficients of three primaries are averaged and taken as initial coefficients in...Some modifications of two-constant Kubelka-Munk theory has been made for the color matching of pre-colored fiber blends. The scattering coefficients of three primaries are averaged and taken as initial coefficients in each wavelength. The unit sums of concentration in E-Allen’s Algorithm were removed in the case of pre-colored fiber blends. Predicted blend ratios and reflectance curves agree very well with measured ones and color differences are within the tolerant limit, showing satisfactory matching results.展开更多
基金supported by the National Key Technology R&D Program of China under Grant No. 2015BAK34B00the National Key Research and Development Program of China under Grant No. 2016YFB1000102
文摘Regular expression matching is playing an important role in deep inspection. The rapid development of SDN and NFV makes the network more dynamic, bringing serious challenges to traditional deep inspection matching engines. However, state-of-theart matching methods often require a significant amount of pre-processing time and hence are not suitable for this fast updating scenario. In this paper, a novel matching engine called BFA is proposed to achieve high-speed regular expression matching with fast pre-processing. Experiments demonstrate that BFA obtains 5 to 20 times more update abilities compared to existing regular expression matching methods, and scales well on multi-core platforms.
文摘Some modifications of two-constant Kubelka-Munk theory has been made for the color matching of pre-colored fiber blends. The scattering coefficients of three primaries are averaged and taken as initial coefficients in each wavelength. The unit sums of concentration in E-Allen’s Algorithm were removed in the case of pre-colored fiber blends. Predicted blend ratios and reflectance curves agree very well with measured ones and color differences are within the tolerant limit, showing satisfactory matching results.