Русский
12.2015 - Volume 19 Issue 4 (PDF)
The article is devoted to the logic of the human endocrine system using the example of the functioning of α- and β-cells of the pancreas. Several levels of abstraction for this system are presented. The interactions of α- and β-cells of the pancreas with each other, as well as with individual organs and peripheral tissues of the body are considered. In the state space of this system, "alarm states" are identified.
Keywords: endocrine system, pancreas, α-cell, β-cell, automata modeling in biology.
This article provides a brief introduction to classifier ensembles in machine learning and describes an algorithm that improves the quality of classification by recommending classifiers to objects. The hypothesis underlying the algorithm is that a classifier is more likely to correctly classify an object if it correctly predicts the labels of the neighbors of this object from the training set. The author illustrates the principle of the algorithm with a simple example and describes testing on real data.
A discrete model of CO gas exchange in human lungs has been constructed, allowing one to calculate the concentration of CO in exhaled air depending on physiological and real spirometric parameters. Formulas have been obtained for calculating the measured concentration of CO in spontaneous and forced breathing modes. An inverse problem has been formulated, the solution of which, based on the values of the measured concentration of CO and detailed spirometric data, can be used to calculate the diffusion capacity of the membrane and the alveolar volume of the lungs. Based on the obtained results, software can be developed for processing data from functional diagnostic devices for diseases characterized by impaired permeability of the alveolar-capillary membrane, such as chronic obstructive pulmonary disease, pulmonary arterial hypertension, etc.
Keywords: gas exchange, carbon monoxide, diffusion capacity of the lungs, alveolar volume, mathematical modeling.
The paper presents the basic concepts of the theory of probabilistic automata, provides new proofs of classical results of the theory of probabilistic automata related to the equivalence and reduction of probabilistic automata, and presents and proves a criterion for the feasibility of probabilistic responses by finite probabilistic automata of general form, which is a strengthening of the corresponding criterion of R.G. Bukharaev and H. Chomut ([22], [23]).
Keywords: probabilistic automata, probabilistic responses, random functions.
The dynamic identical object search problem (IOSP) is considered. In [1, 2, 3], the author showed how this problem can be solved using a multi-automaton dynamic information graph (MADIG) for any query flow. In this paper, it is shown that there is no finite MADIG with visibility radius one and branching degree two that processes an arbitrary query flow.
Keywords: dynamic databases, key search, information graph, automaton, query flows.
The paper considers a Frege system in the signature {∧, ∨, ¬}. For this system, a nontrivial lower bound for the length of the minimal output is proved.
Keywords: Frege systems, output length, lower bounds.
The paper considers the problem of decoding arithmetic sums of monotone conjunctions defined on an n-dimensional Boolean cube in the model of exact decoding using queries for the value of the function. A decoding algorithm is proposed, based on which an upper bound for the complexity of decoding is obtained. An algorithm for answering queries is also proposed, with the help of which lower bounds for the complexity of decoding the studied class of functions for a small number of monotone conjunctions were obtained.
Keywords: decoding of discrete functions, sums of monotone conjunctions.
An algorithm for restoring the correspondence between two N-point images in a finite-dimensional real Euclidean space related by a non-degenerate affine transformation is proposed. Invariants for finding the correspondence in linear time are studied.
Keywords: tracking the dynamics of images, affine transformation, multidimensional images, correspondence of key points.
The paper considers the problem of the possibility of constructing a signal routing tree with given values of signal delays to tree leaves. A class of trees with signal delay functions, on which some restrictions are imposed, is studied. An algorithm is proposed that solves this problem. For a fixed set of signal delay functions, the running time of the algorithm is polynomial in the number of tree leaves.
Keywords: Synthesis of large-scale integrated circuits, signal routing, buffer tree.
The paper considers two types of circuits made of functional elements. The problem of obtaining a lower bound for the complexity of implementing Boolean functions for one type of circuit is reduced to the problem of obtaining an upper bound for another type of circuit. An exact lower bound for the complexity of laying a binary tree graph in a cellular structure is obtained.
Keywords: Boolean functions, implementation complexity, circuits made of functional elements.