In a celebrated paper, Borwein, Erdélyi, Ferguson and Lockhart constructed cosine polynomials of the form f A ( x ) = ∑ ∈ cos , with ⊆ N | n as few 5 / 6 + o 1 zeros in [ 0 2 π ] thereby disproving an old conjecture Littlewood. Here we give sharp analysis their constructions and, result, prove that there exist examples C log 3 zeros.

With the enormous growth of data, which exhibit sequentiality, it has become important to investigate the impact of embedded sequential information within the data. Sequential data are growing enormously, hence an efficient classification of sequential data is needed. k-Nearest Neighbor (kNN) has been used and proved to be an efficient classification technique for two-class problems. This paper...

The paper presents novel recursive algorithms for realization of one-dimensional type-II discrete cosine transform (DCT) and inverse discrete cosine transform (IDCT) of any length. By using some mathematical techniques, recursive expressions for DCT and IDCT have been developed. The number of additions and multiplications in the recursive algorithm for DCT are less in comparison with some other...

An effective technique for identifying nonlinear discrete-time systems using raisedcosine radial basis function (RBF) networks is presented. Raised-cosine RBF networks are bounded-input bounded-output stable systems, and the network output is a continuously differentiable function of the past input and the past output. The evaluation speed of an n-dimensional raised-cosine RBF network is high b...

This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. We propose this algorithm, called CPMerge, for the τ overlap join of inverted lists. First we show that this task is solvable exactly by a τ -overlap join. Given inverted lists retrieved for a query, the algorithm coll...