Ашық рұқсат Ашық рұқсат  Рұқсат жабық Рұқсат берілді  Рұқсат жабық Тек жазылушылар үшін

Том 41, № 1 (2017)

Article

Consistent grid operators with the cell-nodal definition of grid functions

Sablin M., Ardelyan N., Kosmachevskii K.

Аннотация

A principle of consistency for grid operators that ensures grid-operator inhomogeneous boundary-value problems are posed well is considered. Grid analogs of first-order differential operators and boundary operators that are consistent in the sense of fulfilling the grid analogs of integral relations are constructed on an irregular triangular grid. These relations are corollaries to the divergence theorem for vector fields that are the product of a scalar by a vector, the vector product of vectors, or the interior product of a vector by a dyadic. In each grid relation, one function is defined at the nodes; the other, in cells. Construction is performed using a grid-operator interpretation of the corollaries to the integral relations, which hold if one of the functions is a piecewise-linear interpolant to the nodal grid function, and the other is the piecewise-constant interpolant of the cell grid function.

Moscow University Computational Mathematics and Cybernetics. 2017;41(1):1-10
pages 1-10 views

On the calculation of neutral subspaces of a matrix

Ikramov K.

Аннотация

A technique for constructing solutions to the quadratic matrix equation XTDX +AX + XTB + C = 0 is outlined. It is similar to the well-known Schur approach for solving algebraic Riccati equations.

Moscow University Computational Mathematics and Cybernetics. 2017;41(1):11-13
pages 11-13 views

Asymptotic behavior of the loss function in the multiplicative scaling of the wavelet coefficients of a signal function

Kudryavtsev A., Shestakov O.

Аннотация

The construction of an estimator for a signal function from noisy data is considered. The technique depends on minimizing the probability of exceeding the maximum error in calculating the wavelet coefficients for a given critical value. In a model with additive Gaussian noise, the order of the loss function is estimated in a class of Lipschitz regular functions.

Moscow University Computational Mathematics and Cybernetics. 2017;41(1):14-17
pages 14-17 views

One control problem of a pencil of trajectories

Nikolskii M.

Аннотация

A linear control problemwith a nonsingleton initial set is dealt with. For this problem,we consider the problem of transforming this initial set along trajectories of a linear controlled system into some fixed terminal set in a finite time using a single control. Various aspects of this control problem are studied using the machinery of support functions.

Moscow University Computational Mathematics and Cybernetics. 2017;41(1):18-24
pages 18-24 views

Multi-level defense system models: overcoming by means of attacks with several phase constraints

Lesik I., Perevozchikov A., Reshetov V.

Аннотация

The Germeyer “defense–attack” model is modified to allow for an echeloned defence system in a given direction. The model is a special case of the terminal-type discrete optimal control problem, and it can be solved using the subgradient-descent method. The posed control problem refines the resource level-distribution problem for a given direction, counting more general constraints with allowance for the action abilities of defense tools at various borders.

Moscow University Computational Mathematics and Cybernetics. 2017;41(1):25-31
pages 25-31 views

Closure operators with positive connectives and quantifiers

Marchenkov S.

Аннотация

Closure operators based on the logical connectives & and ∨ and the quantifiers ∃ and ∀ and extend the superposition operator are classified. The (&∃∀)-closure operator, which uses only the connective & and both quantifiers, is considered. The basic properties of the (&∃∀)-closure operator are determined. All of the 15 (&∃∀)-closed classes of Boolean functions are found.

Moscow University Computational Mathematics and Cybernetics. 2017;41(1):32-37
pages 32-37 views

On the deductive security of queries to confidential databases in cloud computing systems

Varnovsky N., Zakharov V., Shokurov A.

Аннотация

We study certain 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.

Moscow University Computational Mathematics and Cybernetics. 2017;41(1):38-43
pages 38-43 views

Ant algorithms for scheduling computations in data centers

Kostenko V., Plakunov A.

Аннотация

An ant colony algorithm is considered for the problem ofmapping requests onto physical resources of data centers. Results from an experimental study of the properties of the algorithm are presented, and it is compared to algorithms that combine greedy strategies and limited searches.

Moscow University Computational Mathematics and Cybernetics. 2017;41(1):44-50
pages 44-50 views