A model is studied that describes the process of good transportation occurring in some technologies. Transportation regimes satisfying a given management system are examined. Such regimes are described by traveling-wave solutions to a nonlinear finite-difference analogue of a parabolic equation. Possible transportation regimes are described, and the stability of stationary regimes is analyzed.
An approach to discovering rules in nonstationary k-valued Multidimensional time series is proposed. It allows one to discover rules that are subject to “smooth” structural changes with the course of time. A measure of rule similarity is proposed to describe such changes, and its application in the form of weight in the graph of rules is discussed. The discovered rules can be used to predict the next elements in the multidimensional time series, to analyze the phenomenon described by this multidimensional time series, and to model it. This allows one to use the proposed algorithm for predicting time series and for examining and describing the processes that can be represented by a multidimensional time series. Means for the direct practical application of the proposed methods of the analysis and prediction of time series are described, and the use of those methods for the short-range prediction of a real-life multidimensional time series consisting of the stock prices of companies operating in similar fields is discussed.
An approach is proposed for estimating absolute errors and finding approximate solutions to classical NP-hard scheduling problems of minimizing the maximum lateness for one or many machines and makespan is minimized. The concept of a metric (distance) between instances of the problem is introduced. The idea behind the approach is, given the problem instance, to construct another instance for which an optimal or approximate solution can be found at the minimum distance from the initial instance in the metric introduced. Instead of solving the original problem (instance), a set of approximating polynomially/pseudopolynomially solvable problems (instances) are considered, an instance at the minimum distance from the given one is chosen, and the resulting schedule is then applied to the original instance.