The aim of the work is to develop an algorithm for extracting local extremes of images with low computational complexity and high accuracy. The known algorithms for block search for local extrema have low computational complexity, but only strict maxima and minima are distinguished without errors. The morphological search gives accurate results, highlighting the extreme areas formed by non-severe extremes, however, it has high computational complexity. The paper proposes a block-segment search algorithm for local extremums of images based on an analysis of the brightness of adjacent pixels and regions. The essence of the algorithm is to search for single-pixel local extremes and regions of uniform brightness, comparing the values of their boundary pixels with the values of the corresponding pixels of adjacent regions: the region is a local maximum (minimum) if the values of all its boundary pixels are larger (smaller) or equal to the values of all adjacent pixels. The developed algorithm, as well as the morphological search algorithm, allows detecting all single-pixel local extremes, as well as extreme areas, which exceeds the block search algorithms. At the same time, the developed algorithm in comparison with the morphological search algorithm requires much less time and RAM.

Caches are intermediate level between fast CPU and slow main memory. It aims to store copies of frequently used data and to reduce the access time to the main memory. Caches are capable of exploiting temporal and spatial localities during program execution. When the processor accesses memory, the cache behavior depends on if the data is in cache: a cache hit occurs if it is, and, a cache miss occurs, otherwise. In the last case, the cache may have to evict other data. The misses produce processor stalls and slow down the computations. The replacement policy chooses a data to evict, trying to predict the future accesses to memory. The hit and miss rate depends on the cache type: direct mapped, set associative and fully associative cache. The least recently used replacement policy serves the sets. The miss rate strongly depends on the executed algorithm. The all pairs shortest paths algorithms solve many practical problems, and it is important to know what algorithm and what cache type match best. This paper presents a technique of simulating the direct mapped, k-way associative and fully associative cache during the algorithm execution, to measure the frequency of read data to cache and write data to memory operations. We have measured the frequencies versus the cache size, the data block size, the amount of processed data, the type of cache, and the type of algorithm. After comparing the basic and blocked Floyd-Warshall algorithms, we conclude that the blocked algorithm well localizes data accesses within one block, but it does not localize data dependencies among blocks. The direct mapped cache significantly loses the associative cache; we can improve its performance by appropriate mapping virtual addresses to physical locations.

This paper focuses on the Translation Lookaside Buffer (TLB) management as part of memory management. TLB is an associative cache of the advanced processors, which reduces the overhead of the virtual to physical address translations. We consider challenges related to the design of the TLB management subsystem of the OS kernel on the example of the IA-32 platform and propose a simple model of complete and consistent policy of TLB management. This model can be used as a foundation for memory management subsystems design and verification.

The article deals with the results of the development of monitoring system of potentially dangerous hydro-objects. The formal statement of the problem, models of the monitoring scene and its participants are presented. The scene is initially focused on the gradual replacement of participants-people on systems with artificial intelligence. The models are unified and can be refined to the level of program code. On the basis of models the proactive algorithm of monitoring providing fixing of dangerous situations at an initial stage of their emergence and operational synthesis of the corresponding managing decisions is constructed. The algorithm uses a knowledge base containing formalized expert knowledge about the features of the observed objects and resources of the regional administration to combat catastrophic phenomena.

To automate the solution, a hardware and software system using domestic intelligent sensors has been developed. Programs are written in the console version, require a minimum of computing resources. The peculiarity of the system is to minimize the time of decision-making and reducing their subjectivity by reducing the role of the human factor.

The complex is intended for use in areas where possible floods of water bodies with disastrous consequences.

The aim of this work is to reduce the computational complexity of lossless compression in the spatial domain due to the combined coding (arithmetic and Run-Length Encoding) of a series of bits of bit planes. Known effective compression encoders separately encode the bit planes of the image or transform coefficients, which leads to an increase in computational complexity due to multiple processing of each pixel. The paper proposes the rules for combined coding and combined encoders for bit planes of pixel differences of images with a tunable and constant structure, which have lower computational complexity and the same compression ratio as compared to an arithmetic encoder of bit planes.

At the initial stage of engineering design it has to determine the set of units of design object and topological relations between them. The solution making at this stage is very efficiently because the set of operations may be carried out: adding components into the project, mating them to each other’s etc. The procedures of such kind are monotonous and time consuming. Article is dedicated to automation of topological design. However, the creation and adoption of design decisions is a difficult creative task. Currently, there are several approaches that can be applied to specific types of objects, such as injection molds, blacksmith dies, etc. Most of them are various kinds of technological equipment. There is another type of such equipment – fixtures for locating and clamping parts on the technological operations of assembly, welding, cutting, etc. Automated synthesis of fixtures is considered in this article. A method for determining the design situation is proposed. The method is based on location theory and involves the analysis of a solid model of the object being located. An example of carrier system is presented too. It is assumed that the content of the article will be useful for development of application based on CAD system. Moreover, the engineer – CAD-user himself can do this without involving a professional programmer.

The probabilistic analysis of crossing by an unmanned aerial vehicle (UAV) of the boundary of the no-fly area is solved. Condition of stating of the fact of the violation of the boundary of the restricted area is to stand of UAV within the area during a specified time. The substantiation of the mathematical model to research through linearized vector stochastic equation is carried out. The problem is solved by applying the theory of Markov processes of random structure with absorption of realizations at the boundary of a given area. Particularity of the approach is the contemporaneously consideration of two probability densities of the distribution of phase coordinates that describe the boundary conditions. In this case, two equations systems are solved for probabilistic moments: taking into account the absorption of realizations and without taking into account the absorption. The probability of an object gets into specified area and do not leave one during the time that necessary to notice the unmanned aerial vehicle at the restricted area.

When creating porous materials, one of the tasks is to increase the insulating properties of products made from such materials. The properties of the porous material depends on the geometry of the pores and their relative position. Another area of use of porous materials is associated with their use for filtration. Thus, it is necessary to be able to obtain the results of virtual tests of the porous structure for the study of fluid flow in this structure or patterns of the distribution of temperature fields in the material.

In both cases, to perform the simulation, you must first create the geometric part of the finite element model. Note that in the first problem, the geometric region is the material of the pores, and in the second case, the liquid contained in the pores.

In connection with the rapid development of information technology, modern society is in need of solving the problems of the accumulation, storage and automated processing of semiotically heterogeneous arrays of texts. An important task of the developed technologies is the search for operational methods for issuing a wide variety of information in accordance with the user’s request. The aim of the proposed work is to develop a computer information system that allows you to select the most appropriate illustration for the given text of the advertisement. In this case, the main content of the text is proposed to be presented in the form of a certain set of main and secondary keywords, and the content of the illustration in the form of a multi-level complex of descriptors. The proximity of these contents (and, accordingly, the correlation between the image and the verbal component of the advertisement) can be determined through the maximum number of matches of support words and descriptors, taking into account their importance. An important feature of this system is the use of a thesaurus method of representing the image content, which is a description of the illustration in the form of a certain set of words and the relations between these words within a certain subject area.