Based on a critical review of known research and developments in recent years, the article presents a methodology for analyzing the capacity of the sugar beet sweeping-transport complex. The research aims to find rational use of machinery resources in the technological complex. A reloading method of transportation of root crops was considered. Its peculiarity was flexibility, adaptability to weather, and climatic and economic conditions during the gathering of sugar beet. Under favorable weather conditions and the availability of a sufficient number of vehicles, dug roots, removed from the combine from the field by a tractor semi-trailer, were reloaded into the heavy trucks. They were on the road from the edge of the field and transported to the plant. In case of changing conditions (in rainy weather, when the soil was too wet, or when there were not enough vehicles), a cleaner loader was added to the machines complex. After, the production process was carried out in a transshipment or flow-transshipment way. Beet harvesting and transportation of root crops were considered as work of the technological chain, which consists of three links: “field – beet harvester”, “beet harvester – tractor semi-trailer”, and “tractor semi-trailer – vehicle”. The basic steps of the capacity analysis allowed for determining the capacity of the 1st, 2nd, and 3rd links, their comparison, and subsequent analysis and selecting rational options to overcome the possible difference between their values.
The paper considers a three-dimensional mathematical model for a system created using cellular automata. The mathematical model of the system (MMS) is constructed using a cellular automata implements a single methodological approach to the study of systems with a different nature; the analysis of the motion for such a system is described using certain objective laws. The behavior and state of the mathematical model described by the game “Life” under certain rules are studied. The model is based on such rules of automata generation as prolongation of life in the presence of 4.5 and 9 living neighbors and revival with 7,8,3,2 living cells around. The generation was considered in the field $\mathit{5}\boldsymbol{x}\mathit{5}$ and $\mathit{10}\boldsymbol{x}\mathit{10}$ ., It is established that the mathematical model comes to a stable state in the first case regardless of the initial state. The transition time for the automata into a stable state increases significantly when the number of living cells reaches more than 28. The problem of determining 4th class automata in a chaotic structure with a long evolution requires further research.
2 April 2019 in Eastern-European Journal of Enterprise Technologies
The goal of this paper is to further investigate the properties and advantages of corotational beam spline, CBS, as suggested recently. Emphasis is placed on the relatively simple task of drawing the spline between two endpoints with prescribed tangents. In the capacity of “goodness” of spline, the well-known notion of “fairness” is chosen, which presents itself as the integral from the squared curvature of spline over its length and originates from the elastic beam theory as the minimum of energy of deformation. The comparison is performed with possible variants of the cubic Bezier curve, BC, and geometrically nonlinear beam, GNB, with varying lengths. It was shown that CBS was much more effective than BC, where any attempt to provide better fairness of BC by varying the distances from endpoints to two intermediate points generally leads to lower fairness results than CBS. On the other hand, GNB, or in other words, the elastica curve, can give slightly better values of fairness for optimal lengths of the inserted beam. It can be explained by the more sophisticated scientific background of GNB, which employs 6 degrees of freedom in each section, compared with CBS, which operates only by 4 DoF.
The purpose of this study is to improve the architectural quality of software systems with microservice architecture by investigating and improving methods for automated transition from monolithic architecture to microservice architecture. The study was performed using methods of static source code analysis, graph theory, algorithms for transforming graph structures (detecting strongly connected components, redundant and cyclic dependencies), cluster analysis algorithms, graph neural networks, as well as multi-criteria assessment of internal cluster consistency and inter-cluster connectivity. The results presented in the study are a comprehensive solution to the scientific problem of ensuring the automated transformation of monolithic software systems into a microservice architecture with controlled inter-service connectivity and a high level of internal consistency of architectural components.