Description:
Drensky and Lakatos (Lecture Notes in Computer Science, 357 (Springer, Berlin, 1989), pp. 181-188) have established a convenient property of certain ideals in polynomial quotient rings, which can now be used to determine error-correcting capabilities of combined multiple classifiers following a standard approach explained in the well-known monograph by Witten and Frank (Data Mining: Practical Machine Learning Tools and Techniques (Elsevier, Amsterdam, 2005)). We strengthen and generalise the result of Drensky and Lakatos by demonstrating that the corresponding nice property remains valid in a much larger variety of constructions and applies to more general types of ideals. Examples show that our theorems do not extend to larger classes of ring constructions and cannot be simplified or generalised.
Description:
Drensky and Lakatos (Lecture Notes in Computer Science, 357 (Springer, Berlin, 1989), pp. 181-188) have established a convenient property of certain ideals in polynomial quotient rings, which can now be used to determine error-correcting capabilities of combined multiple classifiers following a standard approach explained in the well-known monograph by Witten and Frank (Data Mining: Practical Machine Learning Tools and Techniques (Elsevier, Amsterdam, 2005)). We strengthen and generalise the result of Drensky and Lakatos by demonstrating that the corresponding nice property remains valid in a much larger variety of constructions and applies to more general types of ideals. Examples show that our theorems do not extend to larger classes of ring constructions and cannot be simplified or generalised.
Description:
Nonsmooth optimisation problems are problems which deal with minimisation or maximisation of functions that are not necessarily differentiable. They arise frequently in many practical applications, for example in engineering, machine learning and economics. In addition, some smooth problems can be reformulated as nonsmooth optimisation problems with a simpler structure or a smaller dimension. Despite the fact that there exist many algorithms for solving nonsmooth optimisation problems, the field is still very much in development. Nonsmooth nonconvex optimisation, in particular, is far from being considered a mature branch of optimisation.
Description:
The variety of topological groups generated by the class of all abelian k(omega)-groups has been shown to equal the variety of topological groups generated by the free abelian topological group on [0, 1]. In this paper it is proved that the free abelian topological group on a compact Hausdorff space X generates the same variety if and only if X is not scattered.
Description:
The variety of topological groups generated by the class of all abelian k(omega)-groups has been shown to equal the variety of topological groups generated by the free abelian topological group on [0, 1]. In this paper it is proved that the free abelian topological group on a compact Hausdorff space X generates the same variety if and only if X is not scattered.
Description:
It is proved that any surjective morphism f : Z(k) -> K onto a locally compact group K is open for every cardinal k. This answers a question posed by Hofmann and the second author.
Description:
It is proved that any surjective morphism f : Z(k) -> K onto a locally compact group K is open for every cardinal k. This answers a question posed by Hofmann and the second author.