2020 year, volume 24, issue 4 (PDF)

Afonin S.A., Bonushkina A. Yu. Attribute-based access control policy analysis using automated planning technique

The paper considers the problem of testing the possibility of a user of an information system gaining access to the selected object with a given attribute-based security policy. It is shown that under some restrictions on information system model and policy rules, this task is reduced to the task of automated planning. There is a tree structure determined, the construction of which corresponds to planning in the space of plans and allows to take into account the specifics of the problem when constructing heuristic algorithms for checking access. It is proved that the existence of such a structure is a necessary and sufficient condition for the possibility of getting an access to the target.

Keywords: ABAC, access control, automated planning.

Kudryavtsev V.B., Kozlov V.N., Ryjov A.P., Mazurenko I.L., Bokov G.V., Petyushko A.A. Artificial intelligence: problems and prospects

In this article we present the results of a discussion on the problems and prospects of artificial intelligence, held at the Chair of Mathematical Theory of Intelligent Systems on October 14, 2020. The topic of the discussion goes back to the classic works of Alan Turing “Can machines think?” and John von Neumann “The Computer and the Brain”, which emerged at the dawn of Cybernetics as a science. Since then, the discussion on the topic “Can machines think?” appeared and faded, but they did not bring much clarity in the understanding of this issue. In recent years, due to the development of the technological base of computing systems, the topic has become relevant again. Together with the scientific base developed in the theory of artificial intelligence and applications in this area, a lot of speculative works have emerged that are ready to declare any device with trivial algorithmic additions “an artificial intelligence system”. This paper attempts to separate the wheat from the chaff by presenting several points of view on this issue.

Keywords: artificial intelligence, machine learning, neural networks.

Kalachev G.V. Remarks on the definition of cellular automaton with locators

In [1], a cellular automaton with locators is defined. In this paper we indicate some inaccuracies and issues of this definition and clarify it to get rid of these issues. We also give examples of cellular automata classes with locators that have good properties in a certain sense.

Keywords: cellular automata, homogeneous structures.

A. Otroschenko Classes of piecewise parallel functions containing all single functions

For a class of piecewise-parallel functions implemented by schemes of linear elements and Heaviside functions, an algorithm for checking the completeness of finite subsets supplemented by single functions is obtained. Thus, for this class solved the Slupetski problem.

Keyword: The piecewise-linear function piecewise-parallel function, the completeness problem, the Slupetski criterion.

Ishchenko R.A. Estimation of the number of labelings of group automata graphs

If we remove symbols of a state diagram, then we get a directed graph. The inverse operation, when this information is restored, is called graph labeling. This article estimates the number of graph labelings that lead to a group automata.

Keywords: group automata, transition graph, state diagram, permanent, matrix decomposition.

Kalachev G.V., Panteleev P.A. On the minimum distance in one class of quantum LDPC codes

We consider a family of quantum LDPC codes with weight- 6 stabilizer generators and two logical qubits, where some logical operators have a fractal structure. These codes can be considered as local quantum codes on the \(\textit{L} \times \textit{L} \times \textit{L} \) cubic lattice with periodic boundary conditions. We prove that the minimum distance of codes from this family is bounded below by \(\Omega (L^\alpha) \), where \(\alpha = \log_2 (2(\sqrt{5}-1)) \approx \textit{1.306} \).

Keywords: quantum LDPC code, local quantum code, minimum distance, linear cellular automaton, fractal dimension.

Muravev N.V. About orders of linear over rationals automata

We consider the order problem with respect to the superposition operation for linear automata over rational numbers. An upper bound of automata orders is proved.