2024 year, volume 28, issue 4 (PDF)

Antonov A.P., Afonin S.A., Kozitsyn A.S., Staroverov V.M., Stupakova A.V., Suslova A.A., Zavyalova A.P., Chupakhina V.V., Sautkin R.S., Osipov S.V. Automated construction of realistic lithofacies maps using combinatorial optimization methods

Lithofacies maps display spatial changes in the lithological composition of rocks and the direction of their replacement characteristics for a certain geological time depending on the physical and geographical conditions of their sedimentation. Lithofacies maps are constructed based on the analysis of complexes of genetically related deposits with characteristic material features of lithofacies. The initial data can be either only points on a plane — well coordinates where certain lithofacies occur — or additionally a map of sediment accumulation rates. It is assumed that identical facies should have similar sedimentation rates. The task of constructing a lithofacies map is to determine the boundaries of facies distribution areas. The paper proposes to reduce the map construction problem to the graph coloring problem, which in turn is solved using integer linear programming methods. This approach allows us to automatically construct realistic maps – that is, maps that satisfy expert constraints and rules.

Keywords: paleo-reconstruction; lithofacial mapping; optimization; integer programming

Vopilova E.V., Kryuchkova E.N. Methods and algorithms for automatic extraction of information from scientific texts for creating a scientific terminology thesaurus

The paper proposes a method for automatic construction of a scientific terminology thesaurus based on algorithms for extraction of multi-word terms from special encyclopedias and scientific publications. The results of the algorithms for thesaurus creation and replenishment are presented on the example of mathematical text processing. We propose the algorithm for comparative semantic analysis of scientific publications and the ways of quantitative estimation of their semantic similarity.

Keywords: aspect-oriented analysis, scientific vocabulary, semantic graph, classification of scientific text, automatic processing of unstructured texts.

Drobyshev A.S. On limit cycles of homogeneous neural networks

The paper considers a formal model of neural networks in which each neuron is represented as an automaton consisting of a threshold Boolean function and a time delay. The criterion of belonging of the starting configuration to the limit cycle is proved.

Keywords: neural networks, threshold functions, boolean circuits, limit cycles.

Zhigliaev R.A. On the relationship between cryptographically important properties of finite quasigroups

In this paper we establish a relationship between some properties of finite quasigroups. It is proved that in the case of quasigroups of prime order, all shapeless quasigroups are polynomially complete. Examples are given to show that the converse statement and the generalization to composite orders are not true.

Keywords: finite quasigroup, polynomial completeness, shapeless quasigroup.

Kapustin I.S. On algebraic system created from set algebra by adding the set power indicator

This paper concerns the properties of the functional system \[C_n\]. This system has the domain \[2^\mathbb{Z}\], and is generated by functions \[\frac{2^\mathbb{Z}}{x}\], \[ x \cup y \], \[ x \cap y \] and power indicators \[card_0(x)\] . . . \[card_n(x)\].

Keywords: functional system, precomplete class, set algebra, com- pletion criteria.

Kuznetsova E.V. Classes of bidirectional motion on a beam implemented by 4-state automata

In [1] it is shown that there is a universal screen with 5 states for the class of all laws of motion with a forward speed of no more than 1/2, while there is no universal screen with 4 states for this class of laws of motion. This paper presents 3 classes of bidirectional motion cocoons on a ray that can be implemented by a cellular automaton with 4 states.

Keywords: cellular automaton, number of states, infinite screen, bidirectional motion, image construction.

Nosov M.V. Representation of the SFE

In this paper, we obtain a representation of all schemes of functional elements with the same number of elements in the basis from the Schaeffer stroke for a Boolean function in the form of a natural number. Decoding this number allows you to build all the schemes.

Keywords: Boolean function, a scheme of functional elements.