All issues
- 2025 Vol. 17
- 2024 Vol. 16
- 2023 Vol. 15
- 2022 Vol. 14
- 2021 Vol. 13
- 2020 Vol. 12
- 2019 Vol. 11
- 2018 Vol. 10
- 2017 Vol. 9
- 2016 Vol. 8
- 2015 Vol. 7
- 2014 Vol. 6
- 2013 Vol. 5
- 2012 Vol. 4
- 2011 Vol. 3
- 2010 Vol. 2
- 2009 Vol. 1
-
Representation of an invariant measure of irreducible discrete-time Markov chain with a finite state space by a set of opposite directed trees
Computer Research and Modeling, 2015, v. 7, no. 2, pp. 221-226Views (last year): 1.A problem of finding of an invariant measure of irreducible discrete-time Markov chain with a finite state space is considered. There is a unique invariant measure for such Markov chain that can be multiplied by an arbitrary constant. A representation of a Markov chain by a directed graph is considered. Each state is represented by a vertex, and each conditional transition probability is represented by a directed edge. It is proved that an invariant measure for each state is a sum of $n^{n−2}$ non-negative summands, where $n$ is a cardinality of state space. Each summand is a product of $n − 1$ conditional transition probabilities and is represented by an opposite directed tree that includes all vertices. The root represents the considered state. The edges are directed to the root. This result leads to methods of analyses and calculation of an invariant measure that is based on a graph theory.
-
Motion control simulating in a viscous liquid of a body with variable geometry of weights
Computer Research and Modeling, 2011, v. 3, no. 4, pp. 371-381Views (last year): 2. Citations: 16 (RSCI).Statement of a problem of management of movement of a body in a viscous liquid is given. Movement bodies it is induced by moving of internal material points. On a basis the numerical decision of the equations of movement of a body and the hydrodynamic equations approximating dependencies for viscous forces are received. With application approximations the problem of optimum control of body movement dares on the set trajectory with application of hybrid genetic algorithm. Possibility of the directed movement of a body under action is established back and forth motion of an internal point. Optimum control movement direction it is carried out by motion of other internal point on circular trajectory with variable speed.
-
Extraction of characters and events from narratives
Computer Research and Modeling, 2024, v. 16, no. 7, pp. 1593-1600Events and character extraction from narratives is a fundamental task in text analysis. The application of event extraction techniques ranges from the summarization of different documents to the analysis of medical notes. We identify events based on a framework named “four W” (Who, What, When, Where) to capture all the essential components like the actors, actions, time, and places. In this paper, we explore two prominent techniques for event extraction: statistical parsing of syntactic trees and semantic role labeling. While these techniques were investigated by different researchers in isolation, we directly compare the performance of the two approaches on our custom dataset, which we have annotated.
Our analysis shows that statistical parsing of syntactic trees outperforms semantic role labeling in event and character extraction, especially in identifying specific details. Nevertheless, semantic role labeling demonstrate good performance in correct actor identification. We evaluate the effectiveness of both approaches by comparing different metrics like precision, recall, and F1-scores, thus, demonstrating their respective advantages and limitations.
Moreover, as a part of our work, we propose different future applications of event extraction techniques that we plan to investigate. The areas where we want to apply these techniques include code analysis and source code authorship attribution. We consider using event extraction to retrieve key code elements as variable assignments and function calls, which can further help us to analyze the behavior of programs and identify the project’s contributors. Our work provides novel understandings of the performance and efficiency of statistical parsing and semantic role labeling techniques, offering researchers new directions for the application of these techniques.
-
Research on the achievability of a goal in a medical quest
Computer Research and Modeling, 2025, v. 17, no. 6, pp. 1149-1179The work presents an experimental study of the tree structure that occurs during a medical examination. At each meeting with a medical specialist, the patient receives a certain number of areas for consulting other specialists or for tests. A tree of directions arises, each branch of which the patient should pass. Depending on the branching of the tree, it can be as final — and in this case the examination can be completed — and endless when the patient’s goal cannot be achieved. In the work both experimentally and theoretically studied the critical properties of the transition of the system from the forest of the final trees to the forest endless, depending on the probabilistic characteristics of the tree.
For the description, a model is proposed in which a discrete function of the probability of the number of branches on the node repeats the dynamics of a continuous gaussian distribution. The characteristics of the distribution of the Gauss (mathematical expectation of $x_0$, the average quadratic deviation of $\sigma$) are model parameters. In the selected setting, the task refers to the problems of branching random processes (BRP) in the heterogeneous model of Galton – Watson.
Experimental study is carried out by numerical modeling on the final grilles. A phase diagram was built, the boundaries of areas of various phases are determined. A comparison was made with the phase diagram obtained from theoretical criteria for macrosystems, and an adequate correspondence was established. It is shown that on the final grilles the transition is blurry.
The description of the blurry phase transition was carried out using two approaches. In the first, standard approach, the transition is described using the so-called inclusion function, which makes the meaning of the share of one of the phases in the general set. It was established that such an approach in this system is ineffective, since the found position of the conditional boundary of the blurred transition is determined only by the size of the chosen experimental lattice and does not bear objective meaning.
The second, original approach is proposed, based on the introduction of an parameter of order equal to the reverse average tree height, and the analysis of its behavior. It was established that the dynamics of such an order parameter in the $\sigma = \text{const}$ section with very small differences has the type of distribution of Fermi – Dirac ($\sigma$ performs the same function as the temperature for the distribution of Fermi – Dirac, $x_0$ — energy function). An empirical expression has been selected for the order parameter, an analogue of the chemical potential is introduced and calculated, which makes sense of the characteristic scale of the order parameter — that is, the values of $x_0$, in which the order can be considered a disorder. This criterion is the basis for determining the boundary of the conditional transition in this approach. It was established that this boundary corresponds to the average height of a tree equal to two generations. Based on the found properties, recommendations for medical institutions are proposed to control the provision of limb of the path of patients.
The model discussed and its description using conditionally-infinite trees have applications to many hierarchical systems. These systems include: internet routing networks, bureaucratic networks, trade and logistics networks, citation networks, game strategies, population dynamics problems, and others.
-
Simulation of lightning initiation on the basis of dynamical grap
Computer Research and Modeling, 2021, v. 13, no. 1, pp. 125-147Despite numerous achievements of modern science the problem of lightning initiation in an electrodeless thundercloud, the maximum electric field strength inside which is approximately an order of magnitude lower than the dielectric strength of air, remains unsolved. Although there is no doubt that discharge activity begins with the appearance of positive streamers, which can develop under approximately half the threshold electric field as compared to negative ones, it remains unexplored how cold weakly conducting streamer systems unite in a joint hot well-conducting leader channel capable of self-propagation due to effective polarization in a relatively small external field. In this study, we present a self-organizing transport model which is applied to the case of electric discharge tree formation in a thundercloud. So, the model is aimed at numerical simulation of the initial stage of lightning discharge development. Among the innovative features of the model are the absence of grid spacing, high spatiotemporal resolution, and consideration of temporal evolution of electrical parameters of transport channels. The model takes into account the widely known asymmetry between threshold fields needed for positive and negative streamers development. In our model, the resulting well-conducting leader channel forms due to collective effect of combining the currents of tens of thousands of interacting streamer channels each of which initially has negligible conductivity and temperature that does not differ from the ambient one. The model bipolar tree is a directed graph (it has both positive and negative parts). It has morphological and electrodynamic characteristics which are intermediate between laboratory long spark and developed lightning. The model has universal character which allows to use it in other tasks related to the study of transport (in the broad sense of the word) networks.
Indexed in Scopus
Full-text version of the journal is also available on the web site of the scientific electronic library eLIBRARY.RU
The journal is included in the Russian Science Citation Index
The journal is included in the RSCI
International Interdisciplinary Conference "Mathematics. Computing. Education"




