Let G = (X) and H be finite groups and let r : X ~ H be a map from the generating set X of G into H. We describe a simple approach for deciding whether or not r determines a group homomorphism from G to H, and if it does, for computing the kernel of r If O and H are permutation groups the algorithm is a simple application of standard algorithms for bases and strong generating sets. If G and H a...

Blind channel estimation for MIMO-OFDM systems was discussed, and a subspace based blind channel estimation algorithm by re-constructing the received signal and its simplified one were proposed. The algorithm changed the channel matrix of the transfer function into a block Toeplitz high matrix exploiting OFDM cyclic prefix, and the channel estimation characteristic equation was obtained with th...

Mantaci et al have shown that if a word x on the alphabet {a, b} has a Burrows-Wheeler Transform of the form ba then x is a conjugate or a power of a conjugate of a standard word. We give an alternative proof of this result and describe words on the alphabet {a, b, c} whose transforms have the form cba. These words have some common properties with standard words. We also present some results ab...

with coefficients belonging to the same field. Two irreducible m-ic congruences are said to belong to the same conjugate set if one of them can be transformed into the other by a transformation of G. The number of distinct irreducible congruences in a conjugate set will be referred to as the order of the conjugate set. Since the order of the group G is p(pi — l), it follows that the order of an...

1. Definitions and preliminaries. In this note, X and Y denote Banach spaces and X∗ and Y∗ denote the conjugate spaces of X and Y , respectively. Let A⊂X be a closed subset and X/A denote the quotient space. We use S(X) for the unit sphere in X and Plp (Xi) for the lp product space. We refer to [1, 3] for the following definitions and notations. For more recent treatment, one may see, for examp...

According to conjugate gradient algorithm, a new consensus protocol algorithm of discrete-time multi-agent systems is presented, which can achieve finite-time consensus. Finally, a numerical example is given to illustrate our theoretical result. Keywords—Consensus protocols; Graph theory; Multi-agent systems; Conjugate gradient algorithm; Finite-time.

The problem of classifying dynamical systems (flows) with global cross-sections in terms of the associated diffeomorphisms of the crosssections is considered. Suppose that, for i = 1,2, ty is a C flow (r > 0) on the Cr manifold M¡ that admits a global cross-section 5, Q M¡ with associated diffeomorphism ('first return map') d¡. If rank (HX(MX ;Z)) = 1, then (Mx,<j)X) is Cs equivalent (s < r) to...

In this study it has been tried, to compare results and convergence rate of sensitivity analysis and conjugate gradient algorithms to reduce fuel consumption and increasing engine performance by optimizing the timing of opening and closing valves in XU7/L3 engine. In this study, considering the strength and accuracy of simulation GT-POWER software in researches on the internal combustion engine...

Let X be a locally compact Hausdorff space with n proper continuous self maps τ i : X → X for 1 ≤ i ≤ n. To this we associate two topological conjugacy algebras which emerge as the natural candidates for the universal algebra of the system, the tensor algebra A(X, τ) and the semicrossed product C 0 (X) × τ F + n. We introduce a concept of conjugacy for multidimensional systems , which we coin p...