The resolution of a mathematically bad-defined problem in the approximation of a cellular automation by the example of the description of human states

A mathematical model describing the mutual influence of bad-defined various human characteristics is constructed. This model is described by a system of differential equations that reflect the “rate” of change in a characteristic as a function of the frequency of interaction with other characteristics. The transition from differential equations to equations in finite differences and the introduction of the von Neumann neighborhood on the resulting square space of the frequency of interaction of various human characteristics allows us to introduce a cellular automaton. The sequential execution of iterations in the cellular automaton allows to track how each of the entered characteristics depends on the behavior of other characteristics.

CONSTRUCTION OF A MODULAR STRUCTURE OF AN AUTOMATED SYSTEM FOR INTEGRATING SUPPORT FOR THE PROTECTION OF STRATEGICALLY IMPORTANT RESOURCES OF A TRANSPORT ENTERPRISE

The purpose of the scientific work is to build a scheme for the interaction of modules of an automated system for integrated protection of strategically important resources of an enterprise, in particular, a transportation industry enterprise. To ensure a high efficiency of the presented system, efficient allocation between the modules is necessary for the protection functions. Within the framework of this task, the article presents sets of functions for each security module. The outstanding feature of the work is the proposed scheme of optimal interaction of the modules of the automated system of integrated protection of strategically important resources of the enterprise. The article considers the mechanism of isolation of "affected" resources (and modules) of the main automated control systems of a transportation enterprise, consisting of the sequential execution of the functions of forming "affected zones and quarantine", the function of redirecting datastream. The paper presents a structural diagram of the interaction of modules of an automated system for integrated protection of strategically important enterprise resources, sets of functions for each module are formed, a scheme for ensuring isolation of "affected" resources is presented, the main difficulties of implementing an automated system are described, in particular, the features of its implementation at the transportation industry enterprise connected with the client-server architecture of the main AS, a number of additional organizational and technical measures for protecting strategically important enterprise resources are proposed.

Measuring the dynamic energy efficiency of FPGAs over processors

This work investigates the dynamic energy efficiency of the parallel execution model of an FPGA and the sequential execution model of a processor, for latency-insensitive applications. We create the temporal implementations (sequential instructions) of the MCNC benchmarks to be executed on a processor that employs a 4LUT as its functional unit. This processor is ~716 times inefficient for dynamic energy than a 4LUT FPGA, mainly due to the large amount of memory (instruction/data) that is required to encode the 4LUT based instructions. The size of the memory (instruction/data) can be reduced by increasing the data-path width and the logic complexity of the ASIC-based functional units of the processor. Particularly, at 64-bit data-path width and when the (instruction/data) memory sizes are reduced to less than ~9% of their corresponding 4LUT-based instructions, the processor with ASIC-based complex functional unit can achieve higher dynamic energy efficiency than the FPGA for MCNC benchmarks.

Measuring the dynamic energy efficiency of FPGAs over processors

This work investigates the dynamic energy efficiency of the parallel execution model of an FPGA and the sequential execution model of a processor, for latency-insensitive applications. We create the temporal implementations (sequential instructions) of the MCNC benchmarks to be executed on a processor that employs a 4LUT as its functional unit. This processor is ~716 times inefficient for dynamic energy than a 4LUT FPGA, mainly due to the large amount of memory (instruction/data) that is required to encode the 4LUT based instructions. The size of the memory (instruction/data) can be reduced by increasing the data-path width and the logic complexity of the ASIC-based functional units of the processor. Particularly, at 64-bit data-path width and when the (instruction/data) memory sizes are reduced to less than ~9% of their corresponding 4LUT-based instructions, the processor with ASIC-based complex functional unit can achieve higher dynamic energy efficiency than the FPGA for MCNC benchmarks.

Parallelization of Atomic Image Reconstruction from X-ray Fluorescence Holograms with XcalableMP

X-ray fluorescence holography is a three-dimensional middle range local structure analysis method, which can provide three-dimensional atomic images around specific elements within a radius of a few nanometers. Three-dimensional atomic images are reconstructed by applying discrete Fourier transform (DFT) to hologram data. Presently, it takes long time to process this DFT. In this study, the DFT program is parallelized by using a parallel programming language XcalableMP. The DFT process, whose input is 21 holograms data of 179 × 360 points and output is a three-dimensional atomic image of 1923 points, is executed on PC cluster which consists of 8 nodes of Intel Xeon X5660 processors and 96 cores in total and we confirmed that the parallelized DFT execution is 94 times faster than the sequential execution.

Improving the performance of fragments of computer code with high time costs based on parallel programming technologies

This article describes the process of converting the program from single-threaded to multithreaded mode. The influence of the number of threads of execution on the total execution time of the code. The problem of spending much time to run programs solved by incremental parallelization when the code is designed for sequential execution, are added to the parallelizing directives. Are similar libraries for working with threads in other programming languages and the advantages of OpenMP over other libraries. Considered a model of parallelizing OpenMP directives, which is time-consuming to run the snippet in multi-threaded mode. The article also presents example code implemented using the C++ language, which built the parallelizing directives of OpenMP. In this model, the estimated execution time of a code snippet of a program with different number of threads. The study showed that with increasing the number of threads the run time is significantly reduced on the average in 1,5–2 times. This happens until the moment when the number of threads will be equal to the number of processor cores. If the number of threads becomes greater than the number of processor cores, the execution time of the program remains virtually unchanged. Are the OpenMP library allows to significantly shorten the program, which can be critical for works of real-time systems, to reduce the time of creating multithreaded applications is simple inserts directives of the library, to reduce the number of errors made by the programmer in the course of working with multi-threaded applications.

AUTOMATION OF THE PROCESS OF CREATING PSYCHOLOGICAL INFLUENCE PRODUCTS

The article discusses the process of creating psychological influence products. The characteristics for the creation of these materials are given. An analysis algorithm of target audience is proposed, which acts as the main object for the implementation of the supporting goal of a psychological operation (action). The algorithm presupposes the sequential execution of the following steps: definition and refinement of the specifications of the target audience; calculation of the target audience effectiveness; identifying the causes and consequences of existing behavior of the target audience; description of vulnerabilities of the target audience; determination of the target audiences’ susceptibility; development of arguments and recommendations for a psychological operation (action); clarification of the primary criteria for evaluation of the target audience. The block diagram of the automation process algorithm of creating psychological influence products is provided in the article. According to the presented algorithm, specialized software has been developed and involves step-by-step filling of the relevant points of the program, taking into account the methodology which is used in the units of psychological operations of the NATO armed forces. The result of the specialized software’s work is the concept of creation of the printed psychological influence product. In addition, at the stage of designing of the printed psychological influence products, there is a database which contains ready-made materials and reference information which serve as the examples. There are two groups of criteria that are used while extending the database: the first group characterizes the psychological (manipulative) component of the psychological influence products, the second – the rules for its design in terms of perception (attention) of the target audience.

Cost-efficient inter-robot delivery for resource-constrained and interdependent multi-robot schedules

A multi-robot system in resource-constrained environments needs to obtain resources for task execution. Typically, resources can be fetched from fixed stations, which, however, can be costly and even impossible when fixed stations are unavailable, depleted or distant from task execution locations. We present a method that allows robots to acquire urgently required resources from those robots with superfluous residual resources, by conducting rendezvouses with these robots. We consider a scenario where tasks are organised into a schedule on each robot for sequential execution, with cross-schedule dependencies for inter-robot collaboration. We design an algorithm to systematically generate such rendezvouses for entire multi-robot system to increase the proportion of tasks whose resource demands are satisfied. We also design an algorithm that periodically reallocates tasks among robots to improve the cost-efficiency of schedules. Our experiment shows the synergetic effectiveness of both algorithms, when fixed stations are unavailable and all resources are fetched through inter-robot delivery. We also investigate the effectiveness of inter-robot delivery in scenarios where fixed stations are existent but distant from the locations of tasks.