The directions of perspective research in the field of analysis and modeling of the dynamics of time series of processes in complex systems with the presence of the human factor are described. The dynamics of processes in such systems is described by nonstationary time series. Predicting the evolution of such systems is of great importance for managing processes in social (election campaigns), economic (stock, futures and commodity markets) and socio-technical systems (social networks). The general information on time series and tasks of their analysis is given. Modern methods of time series analysis for economic processes are considered. The results show that economic processes cannot be considered completely random, since they tend to self-organize and, moreover, are subject to the influence of memory of previous states. It was revealed that one of the main tasks in modeling processes in sociotechnical systems (for example, social networks) is the development of a mathematical apparatus for bringing data to a single measurement scale. The modern models of analysis and forecasting of electoral processes based on the analysis of time series: structural, polling, hybrid. Based on the analysis, their advantages and disadvantages are considered. In conclusion, it was concluded that to describe processes in complex systems with the presence of the human factor, in addition to traditional factors, it is necessary to develop and use methods and tools to take into account the possibility of self-organization of human groups and the presence of memory about previous states of the system.

This paper presents a dataset containing automatically collected source codes solving unique programming exercises of different types. The programming exercises were automatically generated by the Digital Teaching Assistant (DTA) system that automates a massive Python programming course at MIREA—Russian Technological University (RTU MIREA). Source codes of the small programs grouped by the type of the solved task can be used for benchmarking source code classification and clustering algorithms. Moreover, the data can be used for training intelligent program synthesizers or benchmarking mutation testing frameworks, and more applications are yet to be discovered. We describe the architecture of the DTA system, aiming to provide detailed insight regarding how and why the dataset was collected. In addition, we describe the algorithms responsible for source code analysis in the DTA system. These algorithms use vector representations of programs based on Markov chains, compute pairwise Jensen–Shannon divergences of programs, and apply hierarchical clustering algorithms in order to automatically discover high-level concepts used by students while solving unique tasks. The proposed approach can be incorporated into massive programming courses when there is a need to identify approaches implemented by students.

Objectives. The active digitalization of the Russian economy has resulted in a shortage of IT personnel; this is particularly true of software developers. Thus, the Russian university education is faced with the task of undertaking the large-scale professional training of such specialists. The purpose of the present work was to support the largescale (“massive”) professional training of programmers through the creation and implementation of Digital Teaching Assistant (DTA) computer system, allowing teachers working under stressful conditions to concentrate on functions that require a creative approach, namely, drawing up and discussing nontrivial programming tasks.Methods. Pedagogical methods for the personification of learning processes were employed. The general approach was based on satisfying the constraints for creating programming task generators. Tasks were generated using methods for generating random programs and data based on probabilistic context-sensitive grammars, along with translation methods using an abstract syntax tree. The declarative representation of the task generator was performed using functional programming methods, allowing the creation of a domain-specific language using combinators. The solutions were checked using automated testing methods.Results. The developed structure of the proposed DTA system was presented. Considering the automatic generation of programming tasks, classes of practical tasks that reflected the modern specifics of software development were identified along with examples of their generation. A diagram of the programming task generator was provided along with a description of the procedure for automatically checking the solutions of the tasks using a set of program tests generated by the task generator. The presented procedure for comprehensive assessment of a student’s solution included verification of the correctness of the result and plagiarism checks in the case of tasks created manually by the teacher; this also involved validation for compliance with coding style standards, along with metrics for assessing program complexity, etc. The means for recording of statistics of academic achievement of students was characterized along with the interface of interaction between students and teachers.Conclusions. The experience of introducing a DTA into the learning process of teaching programming in Python confirmed the possibility of personifying the learning process in the form of individual learning paths.

Analyses of the processes of information transfer within network structures shows that the conductivity and percolation threshold of the network depend not only on its density (average number of links per node), but also on its spatial symmetry groups and topological dimension. The results presented in this paper regarding conductivity simulation in network structures show that, for regular and random 2D and 3D networks, an increase in the number of links (density) per node reduces their percolation threshold value. At the same network density, the percolation threshold value is less for 3D than for 2D networks, whatever their structure and symmetry may be. Regardless of the type of networks and their symmetry, transition from 2D to 3D structures engenders a change of percolation threshold by a value exp{−(d − 1)} that is invariant for transition between structures, for any kind of network (d being topological dimension). It is observed that in 2D or 3D networks, which can be mutually transformed by deformation without breaking and forming new links, symmetry of similarity is observed, and the networks have the same percolation threshold. The presence of symmetry axes and corresponding number of symmetry planes in which they lie affects the percolation threshold value. For transition between orders of symmetry axes, in the presence of the corresponding planes of symmetry, an invariant exists which contributes to the percolation threshold value. Inversion centers also influence the value of the percolation threshold. Moreover, the greater the number of pairs of elements of the structure which have inversion, the more they contribute to the fraction of the percolation threshold in the presence of such a center of symmetry. However, if the center of symmetry lies in the plane of mirror symmetry separating the layers of the 3D structure, the mutual presence of this group of symmetry elements do not affect the percolation threshold value. The scientific novelty of the obtained results is that for different network structures, it was shown that the percolation threshold for the blocking of nodes problem could be represented as an additive set of invariant values, that is, as an algebraic sum, the value of the members of which is stored in the transition from one structure to another. The invariant values are network density, topological dimension, and some of the elements of symmetry (axes of symmetry and the corresponding number of symmetry planes in which they lie, centers of inversion).

—One of the problems in forecasting of news events is the development of models that allow working with a weakly structured information space of text documents. A distinctive feature of such...

One of the problems of forecasting events in news feeds, is the development of models which allow for work with semi structured information space of text documents. This article describes a model for forecasting events in news feeds, which is based on the use of stochastic dynamics of changes in the structure of non-stationary time series in news clusters (states of the information space) on the basis of use of diffusion approximation. Forecasting events in a news feed is based on their text description, vectorization, and finding the cosine value of the angle between the given vector and the centroids of various information space semantic clusters. Changes over time in the cosine value of such angles between the above vector and centroids can be represented as a point wandering on the [0, 1] segment. This segment contains a trap at the event occurrence threshold point, which the wandering point may eventually fall into. When creating the model, we have considered probability patterns of transitions between states in the information space. On the basis of this approach, we have derived a nonlinear second-order differential equation; formulated and solved the boundary value problem of forecasting news events, which allowed obtaining theoretical time dependence on the probability density function of the parameter distribution of non-stationary time series, which describe the information space evolution. The results of simulating the events instance probability dependence on time (with sets of parameter values of the developed model, which have been experimentally determined for already occurred events) show that the model is consistent and adequate (all the news events which have been used for the model verification occur with high values of probability (within the order of 80%), or if these are fictitious events, they can only occur over the course of inadmissible long time).