Русский
2020 year, volume 24, issue 3 (PDF)
The adoption of effective management decisions in the field of healthcare and disease prevention can increase the duration and quality of life. The process of making such decisions takes place in conditions of limited completeness and reliability of the available information and has a significant expert component. The paper presents one of the approaches that allow making informed decisions in the field of preventive medicine.
Keywords: reventive medicine, process evaluation and monitoring, hybrid intelligence.
The question of whether a word belongs to a given regular language finds its application in areas where it is relevant to search for certain patterns in data of different nature. Growth of the deterministic finite automaton (DFA) states number which is exponential in number of regular expressions of the given language is still a real problem. In this article, we take a look at modifying a finite automaton by using compression algorithms. These approaches modify the finite automaton without changing the language and without adding additional structural elements.
Keywords: DFA, NDF, regular language, exponential blowup, compression algorithm.
The dynamic system of field and bugs - colony - them is considered. Bugs live on the field that is modeled by integer lattice in each sell of which there are the same count of the food for bugs at the first moment. Bugs must move around field or eat food or divide or dye according to the some algorithm moreover all activities spending energy. This system is modeled by cellular automaton. The colony whose linearized population size infinite number of times crossing line from some class built in this work.
Keywords: automaton modelling of biological system, growth rate of homogeneous structures, cellular automaton.
This paper is concerned with the learning complexity of Boolean fixed-weight functions using membership queries, comparation queries, equivalence queries, and extended equivalence queries. Moreover, it is allowed to use only one type of queries during learning. This paper gives exact values of learning complexity for all the types of queries besides comparation queries. The paper presents the upper bound on learning complexity for comparation queries. In addition, the paper demonstrates that the upper bound is equal to the lower bound for the 1-, 2-, 3-weight functions.
Keywords: Boolean fixed-weight functions, membership queries, comparation queries, equivalence queries, extended equivalence queries, exact learning.
The paper considers applying the locator cellular automaton model to the closest neighbour search problem. The locator cellular automaton model assumes the possibility for each cell to translate a signal through any distance using ether. It is proven in this paper that such possibility allows to decrease the problem complexity from linear to logarithmic (against the classic cellular automaton model).
Keywords: cellular automata, homogeneous structures,the closest neighbour search problem.
In the present paper, we find the lattice of 1-traces of closed classes of piecewise linear functions.
Keywords: piecewise linear functions, continuous piecewise linear functions, finite-parallel functions, continuous finite- parallel functions, continuous finite linear functions, piecewise parallel functions, finite linear functions, parallel finite linear functions, 1-trace lattice, Heaviside function, 2-precomplete class.