This article discusses the basic principles of the poetological thesaurus embracing all the branches of learning related to comprehensive theoretical and historical study of poetry. This thesaurus is conceived of as a subject-oriented reference system, as an information search tool, and an analytical instrument. The proposed conceptual and engineering design is evaluated from the standpoint of modern standards of thesaurus implementation in information retrieval systems.

The article considers the analysis of an order management automated system used within the process of production technological preparation at the construction depart¬ment of the tool set design, its conceptual model using Petri nets is formulated, its mathematical model based on matrix method is worked out.

Properties of automaton counter machines are investigated. We prove that reachability sets of automaton one-counter machines are semilinear. An algorithm of construction of these semilinear reachability sets is resultexl. Besides, it is shown that reachability sets of reversal-boundexl automaton counter machines and reachability sets of hat automaton counter machines are also semilinear.

In the article is proposed a doublestep extragradient method for solving nonintrinsic problems of linear programming, variational inequalities and some related problems. The convergence of this method in general case is proved. The convergence of the method at the rate of geometric progression is proved for the problems of linear programming.

A d-polytope P is 2-neighborly if each 2 vertices of P determine an edge. It is conjectured that the number f₀(P) of vertices for such polytope does not exceed the number f_d-1(P) of facets. The conjecture is separately proved for d < 7 and for f₀(P) <
d+6.

The generalization of the Swift-Hohenberg equation is considerexl in this artide. We establish that the number of steady-state solutions unrestricctexHy grows up when the delay tends to infinity and other parameters are correxctly fixed.

The paper deals with a formalism of constructing a zero order approximation of an asymptotic solution for a singularly perturbed linear-quadratic optimal control problem with discontinuous coefficients. This formalism is based on immediate substituting a postulated asymptotic expansion of boundary layer type for the solution into the problem condition and on defining four optimal control problems for finding asymptotics terms. The unique solvability of the problems, the solutions of which form the zero order approximation for the asymptotic solution, is proven. An illustrative example is given.

The work describes a technique for dynamic graph visualization that helps us to analyze complex networks. Our method builds layouts for a sequence of graphs, while preserving the mental map. We show how to modify force-directed algorithms for the dynamic graphs. The proposed method is applied for visualization of several social networks. The experiments demonstrate the effectiveness of dynamic graph drawing for analyzing real-world data and the evolution of social relationships changing over time.