### Article

## Автоматическая аннотация изображений на основе классификации статистических классов

The paper makes a brief introduction into multiple classifier systems and describes a particular algorithm which improves classification accuracy by making a recommendation of an algorithm to an object. This recommendation is done under a hypothesis that a classifier is likely to predict the label of the object correctly if it has correctly classified its neighbors. The process of assigning a classifier to each object involves here the apparatus of Formal Concept Analysis. We explain the principle of the algorithm on a toy example and describe experiments with real-world datasets.

This proceedings publication is a compilation of selected contributions from the “Third International Conference on the Dynamics of Information Systems” which took place at the University of Florida, Gainesville, February 16–18, 2011. The purpose of this conference was to bring together scientists and engineers from industry, government, and academia in order to exchange new discoveries and results in a broad range of topics relevant to the theory and practice of dynamics of information systems. Dynamics of Information Systems: Mathematical Foundation presents state-of-the art research and is intended for graduate students and researchers interested in some of the most recent discoveries in information theory and dynamical systems. Scientists in other disciplines may also benefit from the applications of new developments to their own area of study.

**Importance****.** Variety of forms of non-profit organizations, the strict legal requirement for purposes of the data according to business entities with their statutory goals causes difficulty in identifying possible to form and use the types of funding sources. Thus, the object of study in this article are the types of sources of funding for non-profit organizations prescribed by law as non-profit organizations.

**Objective****.** The purpose of this paper is to systematize the types of sources financing of non-profit organizations on the existing forms of non-profit organizations at the legislative level. The main objectives are:

- The study of the possible types of sources of funding for nonprofit-profit organizations under civil, accounting and tax legislator-favored;

- Clarification of the conceptual apparatus of the study area;

- Grouping types of sources of funding NGOs in their fore-mothers.

**Methods****.** The research methodology in this article is represented by such scientific methods of cognition as: analysis, synthesis, classification, logical method.

**Results.** The work was the preparation of, firstly, the author's classification of target financing of non-profit organizations according to the civil and accounting legislation, and secondly, the author's classification of sources of funding for non-profit organizations under the direction of their use, and thirdly, managing sources Financing for non-profit organizations in the context of statutory forms submitted by non-profit organizations;

**Conclusions and Relevance**. The proposed results of this article have practical value in the activities of non-profit organizations of any kind. Under the terms of the charter and the additional activities of NGOs, knowing the right to the options for the trust fund, and it is also true classifying sources of funding, non-profit organizations can avoid a number of problems in reporting for internal and external users.

Symbolic classifiers allow for solving classification task and provide the reason for the classifier decision. Such classifiers were studied by a large number of researchers and known under a number of names including tests, JSM-hypotheses, version spaces, emerging patterns, proper predictors of a target class, representative sets etc. Here we consider such classifiers with restriction on counter-examples and discuss them in terms of pattern structures. We show how such classifiers are related. In particular, we discuss the equivalence between good maximally redundant tests and minimal JSM-hyposethes and between minimal representations of version spaces and good irredundant tests.

This book constitutes the refereed proceedings of the 6th IAPR TC3 International Workshop on Artificial Neural Networks in Pattern Recognition, ANNPR 2014, held in Montreal, QC, Canada, in October 2014. The 24 revised full papers presented were carefully reviewed and selected from 37 submissions for inclusion in this volume. They cover a large range of topics in the field of learning algorithms and architectures and discussing the latest research, results, and ideas in these areas.

In this paper, we use robust optimization models to formulate the support vector machines (SVMs) with polyhedral uncertainties of the input data points. The formulations in our models are nonlinear and we use Lagrange multipliers to give the first-order optimality conditions and reformulation methods to solve these problems. In addition, we have proposed the models for transductive SVMs with input uncertainties.

In this paper we consider the problem of automatic image annotation by the set of keywords that allows us to search images in great data bases by a textual inquiry. We consider also the general scheme of classification based on low-level features and global features presented as statistical classes. With the help of the statistical classes classification based on inclusion measures we get the secondary features that provide the final classification giving us the required annotations.

This volume is the first of its kind to offer a detailed, monographic treatment of Semitic genealogical classification. The introduction describes the author's methodological framework and surveys the history of the subgrouping discussion in Semitic linguistics, and the first chapter provides a detailed description of the proto-Semitic basic vocabulary. Each of its seven main chapters deals with one of the key issues of the Semitic subgrouping debate: the East/West dichotomy, the Central Semitic hypothesis, the North West Semitic subgroup, the Canaanite affiliation of Ugaritic, the historical unity of Aramaic, and the diagnostic features of Ethiopian Semitic and of Modern South Arabian. The book aims at a balanced account of all evidence pertinent to the subgrouping discussion, but its main focus is on the diagnostic lexical features, heavily neglected in the majority of earlier studies dealing with this subject. The author tries to assess the subgrouping potential of the vocabulary using various methods of its diachronic stratification. The hundreds of etymological comparisons given throughout the book can be conveniently accessed through detailed lexical indices.

A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.

Let k be a field of characteristic zero, let G be a connected reductive algebraic group over k and let g be its Lie algebra. Let k(G), respectively, k(g), be the field of k- rational functions on G, respectively, g. The conjugation action of G on itself induces the adjoint action of G on g. We investigate the question whether or not the field extensions k(G)/k(G)^G and k(g)/k(g)^G are purely transcendental. We show that the answer is the same for k(G)/k(G)^G and k(g)/k(g)^G, and reduce the problem to the case where G is simple. For simple groups we show that the answer is positive if G is split of type A_n or C_n, and negative for groups of other types, except possibly G_2. A key ingredient in the proof of the negative result is a recent formula for the unramified Brauer group of a homogeneous space with connected stabilizers. As a byproduct of our investigation we give an affirmative answer to a question of Grothendieck about the existence of a rational section of the categorical quotient morphism for the conjugating action of G on itself.

Let G be a connected semisimple algebraic group over an algebraically closed field k. In 1965 Steinberg proved that if G is simply connected, then in G there exists a closed irreducible cross-section of the set of closures of regular conjugacy classes. We prove that in arbitrary G such a cross-section exists if and only if the universal covering isogeny Ĝ → G is bijective; this answers Grothendieck's question cited in the epigraph. In particular, for char k = 0, the converse to Steinberg's theorem holds. The existence of a cross-section in G implies, at least for char k = 0, that the algebra k[G]G of class functions on G is generated by rk G elements. We describe, for arbitrary G, a minimal generating set of k[G]G and that of the representation ring of G and answer two Grothendieck's questions on constructing generating sets of k[G]G. We prove the existence of a rational (i.e., local) section of the quotient morphism for arbitrary G and the existence of a rational cross-section in G (for char k = 0, this has been proved earlier); this answers the other question cited in the epigraph. We also prove that the existence of a rational section is equivalent to the existence of a rational W-equivariant map T- - - >G/T where T is a maximal torus of G and W the Weyl group.