this paper proposes a novel hybrid algorithm namely apso-bfo which combines merits of bacterial foraging optimization (bfo) algorithm and adaptive particle swarm optimization (apso) algorithm to determine the optimal pid parameters for control of nonlinear systems. to balance between exploration and exploitation, the proposed hybrid algorithm accomplishes global search over the whole search spa...

String matching is the problem of finding all the occurrences of a pattern in a text. We propose a very fast new family of string matching algorithms based on hashing q-grams. The new algorithms are the fastest on many cases, in particular, on small size alphabets. © 2007 Elsevier B.V. All rights reserved.

The paper considers the exact number of character comparisons needed to nd all occurrences of a pattern of length m in a text of length n using on-line and general algorithms. For on-line algorithms, a lower bound of about (1 + 9 4(m+1)) n character comparisons is obtained. For general algorithms, a lower bound of about (1 + 2 m+3) n character comparisons is obtained. These lower bounds complem...

String matching algorithm plays the vital role in the Computational Biology. The functional and structural relationship of the biological sequence is determined by similarities on that sequence. For that, the researcher is supposed to aware of similarities on the biological sequences. Pursuing of similarity among biological sequences is an important research area of that can bring insight into ...

This study proposes a local edge matching method with a sequence alignment technique for adjacent spatial datasets. By assuming that the common boundary edges of the datasets are point strings, the proposed method obtains the sequence for point edit operations to align the edges by using the string matching algorithm with the following operations: (1) snapping two points from each string to the...

This paper introduces a novel journal splitting algorithm. It takes full advantage of various kinds of information such as text match, layout and page numbers. The core procedure is a highly efficient text-mining algorithm, which detects the matched phrases between the content pages and the title pages of individual articles. Experiments show that this algorithm is robust and able to split a wi...

A Source code 2 A.1 Tree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 A.2 Searchers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 A.2.1 search tree.hpp . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 A.2.2 selection search tree.hpp . . . . . . . . . . . . . . . . . . . . . . . . . . . ...

Abelian string matching problems are becoming an object of considerable interest in last years. Very recently, Alatabbi et al. [1] presented the first solution for the longest common Abelian factor problem for a pair of strings, reaching O(σn) time with O(σn log n) bits of space, where n is the length of the strings and σ is the alphabet size. In this note we show how the time complexity can be...

A new method is proposed for scatter-correction of cone-beam CT images. A coarse reconstruction is used in initial iteration steps. Modelling of the x-ray tube spectra and detector response are included in the algorithm. Photon diffusion inside the imaging subject is calculated using the Monte Carlo method. Photon scoring at the detector is calculated using forced detection to a fixed set of no...

This paper examines the standard string-matching approach to automated score following of an acoustic performance, looking at limitations imposed by both the score representation used and the matching approach. The approach is then extended through the incorporation of duration information and matchscores based on a model of transcriber error. The resulting score follower promises to allow comp...