In this paper, the main purpose is to consider applications of morphological analysis in
text classifiation. Morphological analysis helps us to learn grammatical features of words,
grammatical semantic and the interaction between the elements of text. We propose the
neurosemantic network based on morphological analysis for learning vector representations
of the text’s grammatical structures and the recursive autoencoder that consists of two
parts - the fist part combines two vectors of words, the second one combines two vectors of
The article discusses development of the segmented characters classifier of the Russian alphabet and of the Arabic numerals on the basis of block neural network structures including the plurality of blocks for each individual character recognition and for the synthesis block decision.
This book is a collection of articles dealing with various aspects of grammatical relations and argument structure in the languages of Europe and North and Central Asia (LENCA). Topics covered with respect to individual languages are: split-intransitivity (Basque), causativization (Agul), transitives and causatives (Korean and Japanese), aspectual domain and quantification (Finnish and Udmurt), head-marking principles (Athabaskan languages), and pragmatics (Eastern Khanty and Xibe). Typology of argument-structure properties of ‘give’ (LENCA), typology of agreement systems, asymmetry in argument structure, typology of the Amdo Sprachbund, spatial realtors (Northeastern Turkic), core argument patterns (languages of Northern California), and typology of grammatical relations (LENCA) are the topics of articles based on cross-linguistic data. The broad empirical sweep and the fine-tuned theoretical analysis highlight the central role of argument structure and grammatical relations with respect to a plethora of linguistic phenomena.
The volume presents several papers on Mehweb, a one-village language spoken in the central part of Daghestan, a republic of the Russian Federation.
We examine the questions of applying large pyramidal neural (intellectual neuron) networks to solve equipment object control problems. We consider the description of a system for dynamic planning of mobile robot behavior, constructed based on a network of similar elements.
This paper is an overview of the so-called second genitive in Russian, a nominal form available for a minority of Russian nouns but widely used with these nouns in certain contexts. In many ways, the second genitive is a secondary case. Thus, it may always be substituted with a regular genitive form, while the opposite is not true. A major subset of the contexts where the second genitive may be used fits into what is known as a functional category of partitive, so this form is sometimes called Russian partitive. To a certain extent, indeed, the second genitive is the form with which the regular genitive may be substituted in partitive contexts. The analysis of the distribution of the second genitive shows, however, that the partitive meaning is not the only function of this form. Not less if not more widespread are uses in combinations with prepositions. These and other types of contexts should be taken into account to build a comprehensive picture of the category distribution and functional load.
The form whose main function is to express indirect commands, called the third person Imperative, Jussive or Exhortative, when compared to the prototypical (second person) Imperative, shows semantic and formal similarities and distinctions at the same time. The study describes formal and functional patterns of Jussive and places this category within the typology of the related categories, such as Imperative and Optative, based on data from six East Caucasian languages (Archi, Agul, Akhvakh, Chechen, Icari and Kumyk). Five formal patterns of Jussive are attested in these languages, including a specialized form, constructions derived from want, from tell him to do and from make him do and the Optative. Jussive forms may express such meanings as third person command, indirect causation, permission, indifference towards the accomplishment of an action and an assumption. While the Jussive is crucially different from the second person Imperative in that it introduces a third participant, this article shows that it is the addressee, not a third person, who is the central participant of a Jussive situation from both formal and functional points of view.
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.
Event logs collected by modern information and technical systems usually contain enough data for automated process models discovery. A variety of algorithms was developed for process models discovery, conformance checking, log to model alignment, comparison of process models, etc., nevertheless a quick analysis of ad-hoc selected parts of a journal still have not get a full-fledged implementation. This paper describes an ROLAP-based method of multidimensional event logs storage for process mining. The result of the analysis of the journal is visualized as directed graph representing the union of all possible event sequences, ranked by their occurrence probability. Our implementation allows the analyst to discover process models for sublogs defined by ad-hoc selection of criteria and value of occurrence probability
The geographic information system (GIS) is based on the first and only Russian Imperial Census of 1897 and the First All-Union Census of the Soviet Union of 1926. The GIS features vector data (shapefiles) of allprovinces of the two states. For the 1897 census, there is information about linguistic, religious, and social estate groups. The part based on the 1926 census features nationality. Both shapefiles include information on gender, rural and urban population. The GIS allows for producing any necessary maps for individual studies of the period which require the administrative boundaries and demographic information.
It is well-known that the class of sets that can be computed by polynomial size circuits is equal to the class of sets that are polynomial time reducible to a sparse set. It is widely believed, but unfortunately up to now unproven, that there are sets in EXPNP, or even in EXP that are not computable by polynomial size circuits and hence are not reducible to a sparse set. In this paper we study this question in a more restricted setting: what is the computational complexity of sparse sets that are selfreducible? It follows from earlier work of Lozano and Torán (in: Mathematical systems theory, 1991) that EXPNP does not have sparse selfreducible hard sets. We define a natural version of selfreduction, tree-selfreducibility, and show that NEXP does not have sparse tree-selfreducible hard sets. We also construct an oracle relative to which all of EXP is reducible to a sparse tree-selfreducible set. These lower bounds are corollaries of more general results about the computational complexity of sparse sets that are selfreducible, and can be interpreted as super-polynomial circuit lower bounds for NEXP.