Radial basis function classifier construction using particle swarm optimisation aided orthogonal forward regression

We develop a particle swarm optimisation (PSO) aided orthogonal forward regression (OFR) approach for constructing radial basis function (RBF) classifiers with tunable nodes. At each stage of the OFR construction process, the centre vector and diagonal covariance matrix of one RBF node is determined efficiently by minimising the leave-one-out (LOO) misclassification rate (MR) using a PSO algorithm. Compared with the state-of-the-art regularisation assisted orthogonal least square algorithm based on the LOO MR for selecting fixednode RBF classifiers, the proposed PSO aided OFR algorithm for constructing tunable-node RBF classifiers offers significant advantages in terms of better generalisation performance and smaller model size as well as imposes lower computational complexity in classifier construction process. Moreover, the proposed algorithm does not have any hyperparameter that requires costly tuning based on cross validation

Sparse kernel density estimation technique based on zero-norm constraint

A sparse kernel density estimator is derived based on the zero-norm constraint, in which the zero-norm of the kernel weights is incorporated to enhance model sparsity. The classical Parzen window estimate is adopted as the desired response for density estimation, and an approximate function of the zero-norm is used for achieving mathemtical tractability and algorithmic efficiency. Under the mild condition of the positive definite design matrix, the kernel weights of the proposed density estimator based on the zero-norm approximation can be obtained using the multiplicative nonnegative quadratic programming algorithm. Using the -optimality based selection algorithm as the preprocessing to select a small significant subset design matrix, the proposed zero-norm based approach offers an effective means for constructing very sparse kernel density estimates with excellent generalisation performance

Proof of a Conjecture of Hirschhorn and Sellers on Overpartitions

Let $\bar{p}(n)$ denote the number of overpartitions of $n$. It was conjectured by Hirschhorn and Sellers that \bar{p}(40n+35)\equiv 0\ ({\rm mod\} 40) for $n\geq 0$. Employing 2-dissection formulas of quotients of theta functions due to Ramanujan, and Hirschhorn and Sellers, we obtain a generating function for $\bar{p}(40n+35)$ modulo 5. Using the $(p, k)$-parametrization of theta functions given by Alaca, Alaca and Williams, we give a proof of the congruence \bar{p}(40n+35)\equiv 0\ ({\rm mod\} 5). Combining this congruence and the congruence \bar{p}(4n+3)\equiv 0\ ({\rm mod\} 8) obtained by Hirschhorn and Sellers, and Fortin, Jacob and Mathieu, we give a proof of the conjecture of Hirschhorn and Sellers.Comment: 11 page

The q-WZ Method for Infinite Series

Motivated by the telescoping proofs of two identities of Andrews and Warnaar, we find that infinite q-shifted factorials can be incorporated into the implementation of the q-Zeilberger algorithm in the approach of Chen, Hou and Mu to prove nonterminating basic hypergeometric series identities. This observation enables us to extend the q-WZ method to identities on infinite series. As examples, we will give the q-WZ pairs for some classical identities such as the q-Gauss sum, the $_6\phi_5$ sum, Ramanujan's $_1\psi_1$ sum and Bailey's $_6\psi_6$ sum.Comment: 17 page

Magic Wavelengths for Terahertz Clock Transitions

Magic wavelengths for laser trapping of boson isotopes of alkaline-earth Sr, Ca and Mg atoms are investigated while considering terahertz clock transitions between the $^{3}P_{0}, ^{3}P_{1}, ^{3}P_{2}$ metastable triplet states. Our calculation shows that magic wavelengths of trapping laser do exist. This result is important because those metastable states have already been used to realize accurate clocks in the terahertz frequency domain. Detailed discussions for magic wavelength for terahertz clock transitions are given in this paper.Comment: 7 page