Fernado U.

This paper presents a method to extend the period of a linear feedback shift register (LFSR) by proposing an algorithm to generate primitive polynomials, this is archived by using basic LFSR with a maximum period equal to a prime number. The period extension achieved with our proposed method is statistically robust and has a very long extension of the LFSR period, as long of (2120)!(2^N - 1) for a 127 bit length register. Also by separating the phases of setup and running in the algorithm avoid lo

Automatic call routing is one of the most important issues in the call center domain. It can be modeled -once performed the speech recognition of utterances- as a text classification task. Nevertheless, in this case, texts are extremely small (just a few words) and there are a great number of narrow call-type classes. In this paper, we propose a text classification method specially suited to work on this scenario. This method considers a new weighting scheme of terms and uses a multiple stage classification