This paper proposes an improved Experience-Weighted Attraction (EWA) selection algorithm with channel handoff scheme in order to meet the practical requirement for Cognitive Radio (CR) application. In further research, sensitivity and stability verification is conducted by focusing on the comparison with Q learning algorithm after the establishment of a wireless simulation space with time slot ...

The q-ary Reed-Muller codes RMq(u,m) of length n = q are a generalization of Reed-Solomon codes, which use polynomials in m variables to encode messages through functional encoding. Using an idea of reducing the multivariate case to the univariate case, randomized list-decoding algorithms for Reed-Muller codes were given in [1] and [15]. The algorithm in [15] is an improvement of the algorithm ...

Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...

We present a new algorithm to recognise, constructively, when a given black box group is a homomorphic image of the unitary group SU(d, q) for known d and q. The algorithm runs in polynomial time assuming oracles for handling SL(2, q) subgroups and for computing discrete logarithms in cyclic groups of order q ± 1.

Abstract. We discuss classical and quantum algorithms for solvability testing and finding integer solutions x, y of equations of the form af + bg = c over finite fields Fq. A quantum algorithm with time complexity q(log q) is presented. While still superpolynomial in log q, this quantum algorithm is significantly faster than the best known classical algorithm, which has time complexity q(log q)...

In this paper we present an algorithm to compute an explicit description for the difference of a semi-group Q generated by vectors in Z and its saturation Qsat. If H = Qsat \ Q is finite, we give an upper bound for the entries of h ∈ H. Finally, we present an algorithm to find all Q-minimal saturation points in Q.

In [8, §8], the first author outlined an algorithm for calculating a parametrization of the conjugacy classes in a Sylow p-subgroup U(q) of a finite Chevalley group G(q), valid when q is a power of a good prime for G(q). In this paper we develop this algorithm and discuss an implementation in the computer algebra language GAP. Using the resulting computer program we are able to calculate the pa...

We present an algorithm that constructively recognises when a given black box group is a nontrivial homomorphic image of the orthogonal group Ωε(d, q) for known ε, d and q. The algorithm runs in polynomial time assuming oracles for handling SL(2, q) subgroups and discrete logarithms in F∗q . © 2006 Elsevier Inc. All rights reserved.

In this paper, a novel method based on a combination of Extended Kalman Filter (EKF) with Self-adaptive Differential Evolution (SaDE) algorithm to estimate rotor position, speed and machine states for a Permanent Magnet Synchronous Motor (PMSM) is proposed. In the proposed method, as a first step SaDE algorithm is used to tune the noise covariance matrices of state noise and measurement noise i...

Embedded systems, e.g., self-driving are becoming larger and more complex, the performance requirements of such platforms increasing. Clustered many-core processors satisfy these because they provide an isolated computing environment, low power consumption, high performance. However, efficiently scheduling many tasks to clustered is a difficult problem. Therefore, this paper proposes algorithm ...