Русский
03.2014 - Volume 18 Issue 1 (PDF)
The article presents a methodology for constructing a phenomenological dictionary of the theory of intelligent systems based on the post-non-classical information-evolutionary approach to systems analysis and modeling of objective reality, the attributive-ingredient concept of information and the concept of controlled evolution of natural language. The concepts of "information", "evolution" and "modeling" are defined as the terminological basis of the proposed methodology.
Keywords: information, modeling, thinking, knowledge, theory of intelligent systems, phenomenology, phylogenesis, evolution.
The article discusses the main methods for implementing search using regular expressions used in network intrusion detection systems to examine the contents of network packets. Both the simplest non-deterministic and deterministic finite automata and their various modifications that demonstrate higher performance and/or use less RAM are presented.
Keywords: finite automata, regular expressions, network intrusion detection systems, examination of the contents of network packets.
The paper investigates the properties of the operation of multiplication with a parameter, which is significantly used in the cryptographic standards of the Republic of Uzbekistan. The structure of the group of invertible elements is studied; the complexity of the discrete logarithm operation is established.x
Keywords: multiplicative group, cryptography, electronic signature, discrete logarithm.
The problem of developing a modern online support system for scientific and educational processes DvinemNauku (http://dvinemnauku.ru) is considered. The system allows to support scientific and educational processes with online displays of these processes. The system is divided into two parts: server and client. The server part is used to store, process and output data. The client part is used to present and collect data. Within the framework of the work, a subsystem for managing processes, events and comments was implemented, the system architecture and database structure were designed, and auxiliary modules were implemented.
Keywords: scientific and educational process, database design, scientific event, DvinemNauku, web application.
The task of developing a website for familiarization with the materials of the seminars held by the MSU Rector V.A. Sadovnichy is considered. The website http://sa.msu.ru was created, allowing the results of the seminars to be posted to the public: articles, reports and photographs. The architecture of the site implies the use of a ready-made online support system for scientific and educational processes DvinemNauku http://dvinemnauku.ru for storing and maintaining events related to seminars.
Keywords: site, DvinemNauku, database, program interface, seminar materials.
This paper considers a mathematical model of dynamic databases that processes three types of queries: search, insertion and deletion. It is based on the interaction of an information graph [1] and a finite deterministic automaton [2]. The model allows solving dynamic search problems and assessing the complexity of their solution. As an example illustrating the operation of the model, a well-known dynamic problem of searching for identical objects is considered and solved.
Keywords: dynamic databases, mathematical modeling, information graph.
The paper shows that the correctness of a family of functions is equivalent to the correctness of families arising on strong components and blocks of components of the essential dependence graph of the family of functions. The problem of simplifying a family whose essential dependence graph contains a "trivial" path is solved. With this simplification of the family, the property of correctness does not change. The results obtained are valid for families of functions of k-valued logic, where \(k \geq 2\).
Keywords: regular families of functions, Latin squares.
The paper considers the problem of constructing moving images by a cellular automaton on a screen that is a finite or infinite strip. Algorithms for constructing moving images for some classes of images are found. It is shown that for any infinite screen there is a law of motion that is not implemented on this screen.
Keywords: cellular automaton, infinite screen, universal screen, moving image construction, autonomous motion, motion speed.
Within the framework of the discrete geometric approach to pattern recognition, an algorithm is presented that calculates all classes of a’-equivalent images with a given code. The algorithm is applicable to images of arbitrary dimension \(n \geq 2\), and its time complexity depends linearly on the number of points in the image.
Keywords: pattern recognition, image code, image restoration algorithm, time complexity.
Natural languages have the property of constant frequency of occurrence of letters and letter pairs. In the article, regular languages with this property are studied.
Keywords: natural language, regular language, Markov chain, Markov language.
The paper studies spectrum of the class of thin languages. A classification of languages by their spectral properties is given. Two concepts of dimension are defined for the spectrum of a thin language. It turns out that for an arbitrary natural number n, one can give an example of a spectrum in which both the first and second dimensions are equal to n. The question is considered of what valuesof these pairs of dimensions in the aggregate are found in the spectrum of thin languages. For each pair m, n of natural numbers such that \(m = n = 1\) or \(2 \leq m \leq m\), it is possible to construct a thin language with a spectrum in which the first dimension is equal to m and the second is equal to n. The technique used is non-trivial and allows one to pose and solve several number-theoretical problems at once, which in themselves are of some interest.
Keywords: thin languages, regular expressions, alphabetic coding.
The paper proves the property of preserving periodic sequences by pushdown automata and studies estimates for the length of the period of the outgoing sequence depending on the period of the incoming sequence and the characteristics of the automaton.
Keywords: pushdown automaton, deterministic function, periodic sequences.
All A-precomplete subclasses in classes of linear automata functions over finite fields are found. Algorithmic decidability of checking the A-completeness of finite subsets in the classes under consideration is proven.
Keywords: finite automaton, linear automaton, linear automaton function, A-closure operator, A-completeness problem, completeness criterion, A-precomplete class, adder, delay.
The article refines the upper bound for the stratification of arbitrary complete systems of Boolean functions. It also answers the question of whether the stratification of any complete system in the class of k-valued logic functions is finite. The concept of stratification of closed classes of k-valued logic functions is introduced and stratification estimates for all closed classes of Boolean functions are given.
Keywords: Boolean function, k-valued logic function, complete system, complexity, stratification, closed class.