×

You are using an outdated browser Internet Explorer. It does not support some functions of the site.

Recommend that you install one of the following browsers: Firefox, Opera or Chrome.

Contacts:

+7 961 270-60-01
ivdon3@bk.ru

  • Methodology for increasing the efficiency of managing resource-intensive tasks in distributed computing systems

    Currently, the problem of increasing the efficiency of managing resource-intensive tasks in distributed computing systems is quite acute. Analysis of existing task dispatching algorithms for traditional computing systems showed the limitations of using these methods in heterogeneous systems, as a result of which significant delays can occur between task switching.A functional mathematical model for estimating the workload of distributed computing systems is proposed, based on determining the probability of downtime of the processing center as a criterion for assessing the system load. Using this model will provide increased efficiency in managing resource-intensive tasks in distributed computing systems.

    Keywords: mathematical model, distributed computing system, processing center, loading

  • Development of the method for detecting reference points of aerial images

    In this paper proposed a method based on evaluation characteristics using reference points for cross-linking frames of images obtained from unmanned aerial vehicles. We analyze multi-route (area) aerial photography, which allows you to get images of the area from several parallel routes. The model developed by the authors for detecting reference points of aerial photographs obtained from any type of survey equipment carrier can be used for a wide range of tasks related to the reconstruction of anthropogenic and natural objects and the construction of 3D models for architecture and topography based on digital images.

    Keywords: aerial images, image recognition, reference point detection, photo map, unmanned aerial vehicles

  • Development of search and ranking algorithm for unstructured information

    The analysis of the used algorithms for the search of unstructured information was carried out, during which it was established that they do not take into account the thematic orientation of the specialized collection of documents. It is proposed to use an annealing simulation algorithm to obtain numerical coefficients used in the information retrieval ranking algorithm system. The results of the standard and modified search algorithm and ranking search results unstructured information. As a result, the value of quality metrics failed improve by an average of 8%, and the average error decreased by 29%

    Keywords: information retrieval, ranking, model, quality metrics, relevance, unstructured information

  • Method for reducing the distortions caused by the third harmonic of frequency in the distribution networks

    At present, the problem of measures of the protection against distortion of measured and calculated parameters by signals corresponding to the third harmonic of the mains frequency is quite acute, which is the main parasitic signal entering the distribution networks.The purpose of this study is to develop a technique for reducing distortion caused by the third harmonic frequency in distribution networks.This is achieved by the fact that in each half of the period of the frequencies of the electric network are additionally determined by the times corresponding to 5/6, 4/6, 2/6,1/6 of its part, measure the value of the measured signal at each additional time, sum the values obtained in the main and additional moments in n adjacent halves of the period, calculate the average amplitude value of the signal for n adjacent half periods, and the average amplitude value of the measured signal is obtained by dividing the obtained value by a coefficient equal to 1+√3/2+ 1/2.

    Keywords: measurement error, distribution grid, third frequency harmonic, device for measurement and calculation of electrical parameters

  • Improving the static program analysis based on explicit call graph

    The aim of the study is to develop static analysis algorithms, to search for all possible sequences of function calls leading to a certain point in the program. To achieve this goal the explicit call graph is analyzed, in which all possible paths between two vertices are searched. The analysis is carried out in two stages: 1) at the preparatory stage, a new graph is constructed based on the call graph, from which excess vertices and arcs are removed; 2) in the second stage, a search is made in the new graph for possible paths from the root node to the given one. Also this paper provides an experimental comparison of the developed algorithms with the closest analogue, the Yen algorithm.

    Keywords: static program analysis, call graph, path searching algorithm, Yen's algorithm, call stack