An O(log log m) time n logm log logm-processor CRCW-PRAM algorithm for the string preex-matching problem over general alphabets is presented. The algorithm can also be used to compute the KMP failure function in O(log log m) time on m log m log logm processors. These results improve on the running time of the best previous algorithm for both problems, which was O(log m), while preserving the sa...

Seed dormancy is a genetically inherited trait whose intensity is modified by the environment during seed development and maturation. In order to study the effect of harvest time on the seed quality and optimum time of sowing to obtain good quality seeds, freshly threshed seeds of ten diverse rice genotypes harvested from six environments were evaluated for seed dormancy and seedling vigour ind...

background: the aim of present study was to evaluate the protective efficacy of live recombinant l. tarentolae expressing kmp11-ntgp96-gfp fusion as candidates for live engineered recombinant vaccine against visceral leishmaniasis in balb/c mice. methods: kmp-11 and nt-gp96 genes cloned into the pjet1.2/blunt cloning vector and then into pegfp-n1 expression vector. the kmp-11, nt-gp96 and gfp f...

Although data reusers request information about how research was created and curated, this is often non-existent or only briefly covered in descriptions. The need for such contextual particularly critical fields like archaeology, where old legacy during different time periods through varying methodological framings fieldwork documentation practices retains its value as an important source. This...

This paper presents a Chinese spelling check approach based on language models combined with string match algorithm to treat the problems resulted from the influence caused by Cantonese mother tone. N-grams first used to detecting the probability of sentence constructed by the writers, a string matching algorithm called KnuthMorris-Pratt (KMP) Algorithm is used to detect and correct the error. ...

An O(log log m) time n log m log logm-processor CRCW-PRAM algorithm for the string preex-matching problem over a general alphabet is presented. The algorithm can also be used to compute the KMP failure function in O(log log m) time on m log m loglog m processors. These results improve on the running time of the best previous algorithm for both problems, which was O(log m), while preserving the ...

Given any C semialgebraic function f defined on a non bounded open set of R, we prove, following VERY CLOSELY the lines of the proof of the gradient conjecture of R. Thom ([KM] and [KMP]) and its extensions in the o-minimal setting ([KP]), that the limit set of any non trivial trajectory of the gradient vector field ∇f has at most two limit points, looking this curve in a spherical compactifica...

The aim of this work is to describe a procedure for the partial evaluation of functional logic programs in rewriting-based languages using constraint-based information propagation. The partial evaluation algorithm incorporated with local and global control describes a KMP partial evaluator. We show results from the implementation of the partial evaluator in the rewriting-based functional logic ...

In the context of Markov processes, both in discrete and continuous setting, we show a general relation between duality functions and symmetries of the generator. If the generator can be written in the form of a Hamiltonian of a quantum spin system, then the “hidden” symmetries are easily derived. We illustrate our approach in processes of symmetric exclusion type, in which the symmetry is of S...