Thanks to the development of information technologies and computing resources, it became possible to obtain and process big data, including geospatial data. Most research in the field of precision farming is interdisciplinary in nature, with experimental field data used by disparate scientific groups. In this connection, it became necessary to develop a unified web-based system for storing, organizing, and exchanging experimental information between researchers. The first step in achieving this goal was to create a geospatial database. Since the system being developed in the future may require extensions, modifications, adjustments, integration into other projects, it seems appropriate to use the ontology to form the database structure. The most popular tools were used as the main tools: the ontology language OWL (Ontology Web Language), the Protege 5.5 development environment. The main initial information obtained in the course of experimental studies carried out at the biopolygon: weather data, agrochemical indicators (sampling of soil and plants with georeferencing), agrophysical parameters (humidity, electrical conductivity), remote sensing data. Based on the results of the analysis of the current state of research in the field of storage and systematization of experimental information in crop production, as well as a survey of ARI employees, a prototype of the database structure was formed based on the ontological approach. Nine parent classes were defined as the foundation: Field, Crop rotation - experience, Agrotechnology, Yield, Meteo, Ground samples, Orthophoto, Calendar, and Dictionary - units of measurement.

Inspired by the Belt and Road Initiative, we introduce a model of two-stage network games, when players first form a directed network (the first stage) and then they may reconsider the actions made at the first stage and choose controls to influence other players in a positive or negative way (the second stage). At both stages players get their payoffs. Considering a cooperative version of the game, we examine the problem of subgame network consistency and design an imputation distribution procedure as a new system of stage payments to guarantee the long-term cooperation. The Shapley value with exogenous directed graph constraint is used as a cooperative solution concept. Finally, we prove that a cooperative subgame is convex which ensures the non-emptiness of the core.

For an arbitrary convex function, using the infimal convolution operation, a family of continuously differentiable convex functions approximating it is constructed. The constructed approximating family of smooth convex functions Kuratowski converges to the function under consideration. If the domain of the considered function is compact, then such smooth convex approximations are uniform in the Chebyshev metric. The approximation of a convex set by a family of smooth convex sets is also considered.

This article explores a discrete-time multiagent system on a line. This requires the design of a control protocol providing equidistant agent deployment on a given segment of the line under the constraint that each agent receives information about distances to its neighbors via an auxiliary agent. An approach to the solution of the stated problem is developed. This proves that, under the proposed control protocol, neither communication delay nor switching of communication graph destroy convergence of agents to the equidistant distribution. The results of a numerical simulation confirming the obtained theoretical conclusions are presented.

Some classes of continuous and discrete generalized Volterra models of population dynamics are considered. It is supposed that there are relationships of the type "symbiosis", "compensationism" or "neutralism" between any two species in a biological community. The objective of the work is to obtain conditions under which the investigated models possess the convergence property. This means that the studying system admits a bounded solution that is globally asimptotically stable. To determine the required conditions, the V. I. Zubov's approach and its discrete-time counterpart are used. Constructions of Lyapunov functions are proposed, and with the aid of these functions, the convergence problem for the considered models is reduced to the problem of the existence of positive solutions for some systems of linear algebraic inequalities. In the case where parameters of models are almost periodic functions, the fulfilment of the derived conditions implies that limiting bounded solutions are almost periodic, as well. An example is presented illustrating the obtained theoretical conclusions.

In the paper be considered the problem of optimal control of the differential-difference equation with distributed parameters on the graph in the class of summable functions. Particular attention is given to the connection of the differential-differential system with the evolutionary differential system and the search conditions in which the properties of the differential system are preserved. This connection establishes a universal method of semi- digitization by temporal variable for differential system, providing an effective tool in finding conditions of uniqueness solvability and continuity on the initial data for the differential- differential system. A priori estimates of the norms of a weak solution of differential- differential system give an opportunity to establish not only the solvability of this system but also the existence of a weak solution of the evolutionary differential system. For the differential-difference system analysis of the optimal control problem is presented, containing natural in that cases a additional study of the problem with a time lag. This essentially uses the conjugate state of the system and the conjugate system for a differential-difference system — defining ratios that determine optimal control or the set optimal controls. The work shows courses to transfer the results in case of analysis of optimal control problems in the class of functions with bearer in network-like domains. The transition from an evolutionary differential system to a differential-difference system was a natural step in the study of applied problems of the theory of the transfer of solid mediums. The obtained results underlie the analysis of optimal control problems for differential systems with distributed parameters on a graph, which have interesting analogies with multiphase problems of multidimensional hydrodynamics.

Many of total systems of PDEs can be reduced to the polynomial form. As was shown by various authors, one of the best methods for the numerical solution of the initial value problem for ODE systems is the Taylor Series Method (TSM). In the article, the authors consider the Cauchy problem for the total polynomial PDE system, obtain the recurrence formulas for Taylor coefficients, and then formulate and prove a theorem on the accuracy of its solutions by TSM.

This work is devoted to a comparative analysis of the effectiveness of various methods for the numerical solution of a non-stationary two-dimensional problem of heat conduction in a cylindrical coordinate system in the absence of axial symmetry. The analysis is carried out on the basis of the obtained analytical solution of the two-dimensional problem of heat conduction in a steady state. The results of this work are of great applied importance in calculating the processes of gas transportation through offshore pipelines, as well as in calculating the electrostatic field of focusing systems during transportation of charged particle beams in problems of electronic optics.

This paper presents results of approbation of existing mathematical models, enabling operative assessment of the required link resource to serve data streams, generated by the elements of technical vision subsystem in cyberphysical distributed production systems. Simulation experiments allowed to discover dependencies between achievable multimedia traffic packet processing delay in switching systems and link-level resource, reserved for respective data transfer. Obtained dependencies are to be used during design of algorithm for link resource control for increasing speed of decision making in emergency.

The article considers the problem of point control of the differential-difference equation with distributed parameters on the graph in the class of summable functions. The differential- difference system is closely related to the evolutionary differential system and moreover the properties of the differential system are preserved. This connection is established by the universal method of semi-discretization in a time variable for a differential system, which provides an effective tool in order to find conditions for unique solvability and continuity on the initial data for the differential-difference system. For this differential-difference system, a special case of the optimal control problem is studied: the problem of point control action on the controlled differential-difference system is considered by the control, concentrated at all internal nodes of the graph. At the same time, the restrictive set of permissible controls is set by the means of conditions depending on the nature of the applied tasks. In this case, the controls are concentrated at the end points of the edges adjacent to each inner node of the graph. This is a characteristic feature of the study presented, quite often used in practice when building a mechanism for managing the processes of transportation of different kinds of masses over network media. The study essentially uses the conjugate state of the system and the conjugate system for a differential-difference system — obtained ratios that determine optimal point control. The obtained results underlie the analysis of optimal control problems for differential systems with distributed parameters on the graph, which have interesting analogies with multi-phase problems of multidimensional hydrodynamics.