• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
Of all publications in the section: 34
Sort:
by name
by year
Article
Yakushkina T. Moscow University Computational Mathematics and Cybernetics. 2016. Vol. 40. No. 1. P. 19-27.

Reaction–diffusion type replicator systems are investigated for the case of a bimatrix. An approach proposed earlier for formalizing and analyzing distributed replicator systems with one matrix is applied to asymmetric conflicts. A game theory interpretation of the problem is described and the relation between dynamic properties of systems and their game characteristics is determined. The stability of a spatially homogeneous solution for a distributed system is considered and a theorem on maintaining stability is proved. The results are illustrated with two-dimensional examples in the case of distribution.

Added: Feb 16, 2016
Article
Kosorukov O. Moscow University Computational Mathematics and Cybernetics. 2019. Vol. 43. No. 3. P. 138-142.

In this paper, we consider the problem of optimal resource allocation for the Gale problem of demand and supply in the presence of uncertain factors. Based on the Danzig-Wolfe decomposition method and the generalized potential method developed by the author earlier for the deterministic version of the problem, a numerical algorithm for solving the problem is constructed and justified

Added: Oct 29, 2019
Article
Lapshin V. A. Moscow University Computational Mathematics and Cybernetics. 2009. Vol. 33. No. 4. P. 206-213.
Added: Feb 5, 2010
Article
Nikitin A. A., Nikolaev M. Moscow University Computational Mathematics and Cybernetics. 2018. Vol. 42. No. 3. P. 105-113.

Integral equations emerging in a model of stationary biological communities such that their kernels have variable coefficients of excess (kurtosian kernels)are investigated. The dependence of the first and second spatial moment on the dimension of the environment is considered. A fastcomputation algorithm for the multi-dimensional nonlinear convolution is considered. The existence of a radial solution is proved.

Added: Oct 25, 2018
Article
Bodrov A.G., Nikitin A. A. Moscow University Computational Mathematics and Cybernetics. 2015. Vol. 39. No. 4. P. 157-162.

A computational solution to the integral equation in the biological spatial model is found. The numerical techniques that are used (the Nystr{\"o}m and Neumann series methods, the latter being one of successive approximations) yield a reasonably accurate solution. An approach of moving from multidimensional equations to a one-dimensional equation for high-dimensional spaces is proposed. Explicit formulas for kernels when there are normal initial kernels are also proposed.

Added: Sep 28, 2017
Article
Sorokin C. Moscow University Computational Mathematics and Cybernetics. 2008. Vol. 32. No. 1. P. 17-24.
Added: Mar 18, 2010
Article
Veselov S. I., Gribanov D., Malyshev D. Moscow University Computational Mathematics and Cybernetics. 2019. Vol. 43. No. 1. P. 1-11.

The problem of computing the width of simplices generated by the convex hull of their integer vertices is considered. An FPT algorithm, in which the parameter is the maximum absolute value of the rank minors of the matrix consisting from the simplex vertices, is presented.

Added: Apr 22, 2019
Article
Веселов С. И., Грибанов Д. В., Малышев Д. С. Вестник Московского университета. Серия 15: Вычислительная математика и кибернетика. 2019. № 1. С. 4-14.
Added: Jun 6, 2019
Article
Krylov A. S., Umnov A. Moscow University Computational Mathematics and Cybernetics. 2016. Vol. 40. P. 155-160.

The influence of ringing effect (which is based on the Gibbs phenomenon) on the mutual coherence in sparse representation approach is considered. It is shown that for random vectors, the ringing effect increases the average mutual coherence. Numerical results that demonstrate that the mutual coherence behaves identically for real images are given. It is also shown how the ringing effect affects the sparsity of representations (which is closely related to the mutual coherence).

Added: Oct 17, 2016
Article
Danilov B.R. Moscow University Computational Mathematics and Cybernetics. 2013. Vol. 37. No. 4. P. 180-188.

The article investigates a model of delays in a network of functional elements (a gate network) in an arbitrary finite complete basis B, where basis elements delays are arbitrary positive real numbers that are specified for each input and each set of boolean variables supplied on the other inputs. Asymptotic bounds of the form τ B n ± O(1), where τ B is a constant that depends only on the basis B, are obtained for the delay of a multiplexer function of order n. These bounds are used in the given model to obtain asymptotic bounds of the form τ B n±O(1) for the corresponding Shannon function, i.e., for the delay of the “worst” Boolean function of the given n variables.

Added: Dec 2, 2019
Article
Nikitin A.A., Savost’yanov A. S. Moscow University Computational Mathematics and Cybernetics. 2017. Vol. 41. No. 3. P. 122-129.

The two-species model of self-structured stationary biological communities proposed by U. Dieckmann and R. Law is considered. A way of investigating the system of integro-differential equations describing the model equilibrium is developed, nontrivial stationary points are found, and constraints on the model parameter space resulting in similar stationary points are studied. The results are applied to a number of widely known biological scenarios

Added: Sep 3, 2017
Article
Nikitin A. A., Savost’yanov Anton Sergeevich. Moscow University Computational Mathematics and Cybernetics. 2017. Vol. 41. No. 3. P. 122-129.

The two-species model of self-structured stationary biological communities proposed by U. Dieckmann and R. Law is considered. A way of investigating the system of integro-differential equations describing the model equilibrium is developed, nontrivial stationary points are found, and constraints on the model parameter space resulting in similar stationary points are studied. The results are applied to a number of widely known biological scenarios.

Added: Sep 3, 2018
Article
Kolmakov E.A., Marchenkov S. Moscow University Computational Mathematics and Cybernetics. 2016. Vol. 40. No. 3. P. 128-132.
Added: Dec 5, 2018
Article
Zakharov V., Varnovsky N., Shokurov A. Moscow University Computational Mathematics and Cybernetics. 2017. Vol. 41. No. 1. P. 60-70.

We study some simple models of confidential databases in cloud computing systems. In the framework of these models we introduce a concept of deductive security for queries to such databases, find necessary and sufficient conditions of deductive security, and describe some classes of queries which satisfy these requirements.

Added: Oct 13, 2016
Article
Zakharov V., Varnovsky N., Shokurov A. Moscow University Computational Mathematics and Cybernetics. 2016. Vol. 36. No. 2. P. 83-88.

We study a formal model of cloud computing systems with auxiliary cryptoservers. Assuming an existence of a secure threshold somewhat homomorphic public key cryptosystem we show how to build a cloud computing system secure in this model.

Added: Oct 13, 2016
Article
Romanov D., Romanova E. Moscow University Computational Mathematics and Cybernetics. 2015. Vol. 39. No. 3. P. 144-152.

It is established that for nonconstant Boolean function f(x1, …, xn), there is a testable gen eralized iterative switching circuit in which function f(x1, …, xn) is realized and the single fault detec tion test of constant length is assumed. Ke

Added: Jan 23, 2018
Article
Nikitin A. A., Галкин Е. Г. Moscow University Computational Mathematics and Cybernetics. 2020. Vol. 44. No. 2. P. 61-68.

A study is performed of the main approaches to investigating the stochastic process of population dynamics. Continuous time and space and immovable individuals are used to derive a denumerable system of integrodifferential equations corresponding to the dynamics of the spatial momentum of this process. A way to find an approximate solution using the momentum approach is described.

Added: Apr 27, 2020
Article
Kosorukov O., Belov A. Moscow University Computational Mathematics and Cybernetics. 2014. Vol. 38. No. 2. P. 59-63.

The problem of optimal distribution of resources dedicated to a certain complex of interrelated tasks according to the criterion of minimum execution time of all tasks is described

Added: Aug 17, 2017
Article
Косоруков О. А. Вестник Московского университета. Серия 15: Вычислительная математика и кибернетика. 2019. № 2. С. 25-30.
Added: Oct 29, 2019
Article
Подымов В. В. Вестник Московского университета. Серия 15: Вычислительная математика и кибернетика. 2012. № 4. С. 37-43.
Added: Sep 29, 2015
Article
Крылов А., Умнов А. В. Вестник Московского университета. Серия 15: Вычислительная математика и кибернетика. 2016. Т. 4. С. 10-15.
Added: Oct 17, 2016
1 2