This letter introduces a new frequency domain approach for either MIMO System Identification or Source Separation of convolutive mixtures in cyclostationary context. We apply the joint diagonalization algorithm to a set of cyclic spectral density matrices of the measurements to identify the mixing system at each frequency up to permutation and phase ambiguity matrices. An efficient algorithm to...

In this paper we consider the solution methods for mixed-integer linear fractional programming (MILFP) models, which arise in cyclic process scheduling problems. We first discuss convexity properties of MILFP problems, and then investigate the capability of solving MILFP problems with MINLP methods. Dinkelbach's algorithm is introduced as an efficient method for solving large scale MILFP proble...

We describe a generic algorithm for computing discrete logarithms in groups of known order in which a smoothness concept is available. The running time of the algorithm can be proved without using any heuristics and leads to a subexponential complexity in particular for nite elds and class groups of number and function elds which were proposed for use in cryptography. In class groups, our algor...

We describe a generic algorithm for computing discrete logarithms in groups of known order in which a smoothness concept is available. The running time of the algorithm can be proved without using any heuristics and leads to a subexponential complexity in particular for nite elds and class groups of number and function elds which were proposed for use in cryptography. In class groups, our algor...

The well known problem in an orthogonal frequency division multiplexing (OFDM) system is its sensitivity to frequency offset. Most of the coherent OFDM systems transmit pilot symbols on some of the subcarriers to estimate channel attenuation and also add a cyclic prefix (CP) to avoid intercarrier interference and intersymbol interference. An estimation algorithm based on the redundancy of both ...

The problem NASH is that of finding one Nash equilibrium of a bimatrix game. The computational complexity of this problem is a long-standing open question. The Lemke–Howson algorithm is the classical algorithm for NASH. In an earlier paper, this algorithm was shown to be exponential, even in the best case, for square bimatrix games using dual cyclic polytopes. However the games constructed ther...

This work explores the configurations of complex networks that would exhibit the maximum entropy using both degree and cyclic entropies measures. Theoretical models for such networks were proposed and were validated by using our developed genetic algorithms. A complex network configuration with the maximum cyclic entropy was identified as a cyclic star network; a star network with all non centr...

The least common subsumer (lcs) w.r.t general EL-TBoxes does not need to exists in general due to cyclic axioms. In this paper we present an algorithm for computing role-depth bounded EL-lcs based on the completion algorithm for EL. We extend this computation algorithm to a recently introduced probabilistic variant of EL: Prob-EL.

A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH bound and the Hartmann–Tzeng (HT) bound is formulated explicitly. We show that for many cases our approach improves the HT bound. Furthermore, we refine our bound for several families of cyclic codes. We define syndro...

This paper studies the equivalence problem for cyclic codes of length p and quasi-cyclic codes of length pl. In particular, we generalize the results of Huffman, Job, and Pless (J. Combin. Theory. A, 62, 183–215, 1993), who considered the special case p. This is achieved by explicitly giving the permutations by which two cyclic codes of prime power length are equivalent. This allows us to obtai...