We define a set of orthogonal functions on the complex projective space CPN−1, and compute their Clebsch-Gordan coefficients as well as a large class of 6–j symbols. We also provide all the needed formulae for the generation of high-temperature expansions for U(N)-invariant spin models defined on CPN−1.

This paper presents a new variable step-size normalized subband adaptive filter (VSS-NSAF) algorithm. The proposed algorithm uses the prior knowledge of the system impulse response statistics and the optimal step-size vector is obtained by minimizing the mean-square deviation(MSD). In comparison with NSAF, the VSS-NSAF algorithm has faster convergence speed and lower MSD. To reduce the computa...

This paper presents a theoretical study of the selection pressure in asynchronous cellular evolutionary algorithms (cEAs). This work is motivated by the search for a general model for asynchronous update of the individuals in a cellular EA, and by the necessity of better accuracy beyond what existing models of selection intensity can provide. Therefore, we investigate the differences between th...

Improvement of one trait on its own will affect the performance of other traits because ofgenotypic correlations between traits. Index selection is one of the tools used by plant breedersto overcome this problem. The purpose of this paper is to evaluate selection indices developedfor improving grain yield in rice (Oryza sativa L.). Forty-nine rice genotypes were cultivated atTonekabon Rice Rese...

In this study we examined how the introduction of a parallel finger-tapping task influences second language speech (L2) encoding mechanisms and monitoring processes and how the level of proficiency impacts the efficiency and accuracy of L2 performance under single and dual task conditions. The results indicated that imposing dual task demands has a negative effect on the accuracy of lexical sel...

Partial-update algorithms reduce adaptive filter complexity by updating only a subset of taps at each iteration. However, they suffer a processing overhead in tap selection that can substantially reduce the computational advantages of partial-update schemes. Short-sort M-Max NLMS (SM-NLMS) addresses this problem by having the advantages of other partial-update schemes but with very low computat...

While the topic has a long history in research, model structure selection is still one of the more challenging problems in system identification. In this tutorial we focus on impulse response modelling, and link classical techniques such as hypothesis testing and information criteria (e.g. AIC) to recent model estimation approaches, including regularisation. We discuss the problem from minimum ...