开放存取 开放存取  受限制的访问 ##reader.subscriptionAccessGranted##  受限制的访问 订阅存取

卷 42, 编号 4 (2018)

Article

Factorization of a Symbol Corresponding to the Sum of a Finite Number of Singular Integral Operators with Non-Carleman Shifts

Pivovarova D.

摘要

An equation containing a finite sum of singular integral operators with non-Carleman shifts is considered. The unique solvability of this equation in the Hölder classes under certain constraints imposed on the coefficients is proved. It is shown that the solution can be written in quadratures.

Moscow University Computational Mathematics and Cybernetics. 2018;42(4):145-151
pages 145-151 views

A Solution to Fuller’s Problem Using Constructions of Pontryagin’s Maximum Principle

Kiselev Y., Orlov M., Orlov S.

摘要

The classical two-dimensional Fuller problem is considered. The boundary value problem of Pontryagin’s maximum principle is considered. Based on the central symmetry of solutions to the boundary value problem, the Pontryagin maximum principle as a necessary condition of optimality, and the hypothesis of the form of the switching line, a solution to the boundary value problem is constructed and its optimality is substantiated. Invariant group analysis is in this case not used. The results are of considerable methodological interest.

Moscow University Computational Mathematics and Cybernetics. 2018;42(4):152-162
pages 152-162 views

A Procedure for Constructing Optimum Functional Filters for Linear Stationary Stochastic Systems

Kamenshchikov M., Kapalin I.

摘要

Three problems closely related to the classical unbiased optimal filtration problem: an unbiased optimal filtration problem without a control in the system,a biased optimal filtration problem where the bias does not exceed a given value, and the joint problem of stabilization and optimal filtration. It is proposed these problems be reduced to ones of nonlinear optimization. For unbiased filtration with no control, conditions are provided that allow the one for classical unbiasedness to be weakened or excluded for the filter. A new estimate of the bias of the mean filtration error is proposed.

Moscow University Computational Mathematics and Cybernetics. 2018;42(4):163-170
pages 163-170 views

Calculating the Number of Functions with a Given Endomorphism

Marchenkov S., Chernyshev A.

摘要

An iterative procedure is proposed for calculating the number of k-valued functions of n variables such that each one has an endomorphism different from any constant and permutation. Based on this procedure, formulas are found for the number of three-valued functions of n variables such that each one has nontrivial endomorphisms. For any arbitrary semigroup of endomorphisms, the power is found of the set of all three-valued functions of n variables such that each one has endomorphisms from a specified semigroup.

Moscow University Computational Mathematics and Cybernetics. 2018;42(4):171-176
pages 171-176 views

Properties of Open Procedure of Sequential Veto-Voting

Novikova N., Pospelova I.

摘要

Game-theoretic properties of joint decision making are considered. Procedures based on sequential open voting by veto are investigated. The paper is aimed at the question how to make voters’ behavior intuitively rational when they choose their optimal strategies. The review of the existing results is also presented and the connection between them is established. Further research is discussed as well.

Moscow University Computational Mathematics and Cybernetics. 2018;42(4):177-185
pages 177-185 views

Selecting the Superpositioning of Models for Railway Freight Forecasting

Uvarov N., Kuznetsov M., Malkova A., Rudakov K., Strijov V.

摘要

The problem of selecting the optimum system of models for forecasting short-term railway traffic volumes is considered. The historical data is the daily volume of railway traffic between pairs of stations for different types of cargo. The given time series are highly volatile, noisy, and nonstationary. A system is proposed that selects the optimum superpositioning of forecasting models with respect to features of the historical data. A model of sliding averages, exponential and kernel-smoothing models, the ARIMA model, Croston’s method, and LSTM neural networks are considered as candidates for inclusion in superpositioning.

Moscow University Computational Mathematics and Cybernetics. 2018;42(4):186-193
pages 186-193 views