This paper explores a relationship between parameters for the context tree weighting and weights for a general model weighting technique. In particular, an algorithm is proposed that approximately computes the parameters from the weights, and a condition under which no error for the approximation occurs is derived. key words: model weighting technique, tree source, context tree weighting.

Using separate indices for each element and merging their results has proven to be a feasible way of performing XML element retrieval; however, there has been little work on evaluating how the main method parameters affect the results. We study the effect of using different weighting models for computing rankings at the single index level and using different merging techniques for combining suc...

Automatic beat tracking is challenging task, especially for audio music with time-varying meters. This study proposes a dynamic programming approach with positional weighting window to handle beat tracking with time-varying meters. In particular, the tempo curve is the reference to obtain correct beat positions. The weighting window is used to adapt bandwidth of tempo which reciprocal represent...

The connectivity index chi can be regarded as the sum of bond contributions. In this article, boiling point (bp)-oriented contributions for each kind of bond are obtained by decomposing the connectivity indices into ten connectivity character bases and then doing a linear regression between bps and the bases. From the comparison of bp-oriented contributions with the contributions assigned by ch...

This study proposed a weighting function for a dynamic (DP) programming approach as the cost function to handle beat tracking. The function is utilized to adapt bandwidth of tempo deviation which reciprocal represents likelihood of relative beat position. The beat tracking surpass those scores of other algorithms for MAZ dataset, in which seven out of ten performance indexes outperforms in MIRE...

In this article we report on a study of how to use the context tree weight-ing (CTW) algorithm for lossless image compression. This algorithm has been shown to perform optimally, in terms of redundancy, for a wide class of data sources. Our study shows that this algorithm can successfully be applied to image compression even in its basic form. We also report on possible modiica-tions of the bas...

The article provides a fuzzy set theoretic feature evaluation index and a connectionist model for its evaluation along with their theoretical analysis. A concept of weighted membership function is introduced which makes the modeling of the class structures more appropriate. A neuro-fuzzy algorithm is developed for determining the optimum weighting coefficients representing the feature importanc...