Let G be a semisimple algebraic group over a local field K of characteristic p. If the universal covering map Gsc → G is inseparable then no open subgroup of G(K) is finitely generated. Otherwise, for any compact open subgroup G with probability 1 two randomly chosen elements generate an open subgroup of G(K). Our main tool is a recent theorem by R. Pink characterizing compact groups linear ove...

A single linear programming formulation is proposed which generates a plane that minimizes an average sum of misclassi ed points belonging to two disjoint points sets in n-dimensional real space. When the convex hulls of the two sets are also disjoint, the plane completely separates the two sets. When the convex hulls intersect, our linear program, unlike all previously proposed linear programs...

 In this paper, a new coordination method based on non-linear hierarchical control for large-scale robots is presented. The large-scale system is considered as combination of subsystems so that each subsystem has interaction with others. The procedure is to use interaction prediction principle with optimal control for each subsystem. At the first level, applying optimal control principle to e...

Planning, as an inseparable component of intelligent behavior, became a research interest as early as AI was founded. The possibility of an automated planning system has been studied at different levels of complexity and over a wide area of application domains. Many methodologies have been proposed and several planning systems have been built, nevertheless there is a long way to go before we ca...

We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence the algorithm achieves a competitive speed. We approach the problem of the impossibility of perfect non trivial online Support Vector Learning by parameterising the exactness. Even in the case of linearly inseparable data withi...