Results 151 to 160 of about 147,630 (190)

Content audit based on hash string matching algorithm

2010 International Conference on Computer, Mechatronics, Control and Electronic Engineering, 2010
With the information security issues caused by the abuse of enterprise network resources, the objectives and functions of content auditing system are analyzed. According to the principle of content audit, the two-stage classification mechanism and open software architecture have been proposed to support the renewal and extension of application ...
Guo-Dong Sun, Lei Peng, Da-Xing Zhao
openaire   +1 more source

Methodology for evaluating string matching algorithms on multiprocessor

2008 IEEE/ACS International Conference on Computer Systems and Applications, 2008
The Internet is suffering caused by the lacking of security. One of the most promising ways to provide security is Intrusion Detection Systems (IDSs). The heart of almost every IDSs is a string matching algorithm, which is a very computational intensive task.
Benfano Soewito, null Ning Weng
openaire   +1 more source

On the Worst-Case Behavior of String-Searching Algorithms

SIAM Journal on Computing, 1977
Any algorithm for finding a pattern of length k in a string of length n must examine at least $n - k + 1$ of the characters of the string in the worst case. By considering the pattern $00 \cdots 0$, we prove that this is the best possible result. Therefore there do not exist pattern matching algorithms whose worst-case behavior is “sublinear” in n ...
openaire   +2 more sources

Study on flight-string optimization based on partheno-genetic algorithm

2010 8th World Congress on Intelligent Control and Automation, 2010
Scheduled flight planning process is analyzed, and the working out of flight-string is studied. Then A model of flight-string VHP based on the time unit of week is suggested. The model considers not only the link problem between scheduled flights, but also the link between leaving and arriving airports of scheduled flights. A partheno-genetic algorithm
null Yaohua Li, null Na Tan
openaire   +1 more source

Algorithms on Compressed Strings and Arrays

1999
We survey the complexity issues related to several algorithmic problems for compressed one- and two-dimensional texts without explicit decompression: pattern-matching, equality-testing, computation of regularities, subsegment extraction, language membership, and solvability of word equations.
openaire   +1 more source

Universal Data Compression Algorithm Based on Approximate String Matching

Probability in the Engineering and Informational Sciences, 1996
A practical source coding scheme based on approximate string matching is proposed. It is an approximate fixed-length string matching data compression combined with a block-coder based on the empirical distribution. A lemma on approximate string matching, which is an extension of the Kac Lemma, is proved.
openaire   +1 more source

A String Matching Algorithm Based on Real Scaling

2012
A good intrusion detection algorithm is important not only in traditional networks, but also in Ad Hoc networks. This paper proposes a novel intrusion detection algorithm based on the real scale of the string matching. Based on properties of Ad Hoc networks, we design a real indexing tree which gives a complete implementation of the algorithm based on ...
Zhang Ying, Chang Guiran, Jia Jie
openaire   +1 more source

String matching on IDP: a string matching algorithm for vector processors and its implementation

Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93, 2002
The paper describes a new string matching algorithm that is suitable for vector processors. The hardware implementation of the algorithm is also presented. The algorithm consists of two parts. In the first part, candidate strings that are similar to pattern strings are extracted from a text string (cutout part).
Y. Mishina, K. Kojima
openaire   +1 more source

Study on Segmentation Algorithm for Unconstrained Handwritten Numeral Strings

2005 International Conference on Neural Networks and Brain, 2004
In this paper, an integrated system of segmenting unconstrained handwritten numeral strings with unknown number of digits is proposed. The algorithm consists of the extraction of connected components based on vertical projection and isolated components analysis, the length estimation of connected components using syntax analysis and waveform analysis ...
Zhang Chuang, Wu Ming, Guo Jun
openaire   +1 more source

Universal compression algorithms based on approximate string matching

Proceedings of 1995 IEEE International Symposium on Information Theory, 2002
Two practical universal source coding schemes based on approximate string matching are proposed. One is an approximate fixed-length string matching data compression, and the other is an LZ-type quasi parsing method by approximate string matching. It is shown that in the former algorithm the compression rate converges to the theoretical bound of R(D ...
openaire   +1 more source