Search

Search Results

• DETERMINATION OF TARGET COORDINATE ERRORS IN MULTI-POSITION RADAR USING GROUPS OF UNMANNED AIRCRAFT

  I.V. Borisov , А.S. Kuzmenko , V. Е. Kuryan , Е. М. Levchenko , М.V. Kuryan

  273-284

  2025-07-24

  Abstract ▼

  The article proposes and develops an algebraic method for determining the coordinates of targets and their errors as part of a group of unmanned aerial vehicles. The main assumptions of the developed model of the functioning of a group of unmanned aerial vehicles: The speeds of aircraft do not exceed the speed of sound in the air, and the speeds of targets do not exceed the first space were justified. The main assumptions of the model of operation of a group of unmanned aerial vehicles: the UAV speeds do not exceed the speed of sound in the air, and the target speeds do not exceed the first space one, are justified in the article. Qualitative estimates of the radar signal reception time for a given spatial error of the target coordinates were presented. The conditions for the number of aircraft in the group are formulated, which increase the accuracy of determining the location of the target in space. The various types of errors that arise when organizing the search for targets by a group of aircraft are analyzed. The issues of dependence of the resulting error in calculating the coordinates of the search target on the error in measuring the distance between the aircraft in the group and the target itself, depending on their mutual spatial orientation, are investigated. An algorithm has been developed, calculations and analysis of the results for this task have been carried out. The simulation is based on the proposed algorithm, taking into account random coordinates of the target in a fixed sector and taking into account random errors in the measured distance between a group of aircraft and the search object. The results of modeling the influence of the configuration of a group of unmanned aerial vehicles and the location of the target on the error in determining its coordinates are presented. An assessment was carried out to determine the coordinates of the goals and an error estimate of the proposed algebraic approach. The ways of further research are determined. The issues of estimating the amount of calculation for a large number of goals are considered.
  The scope and effectiveness of the proposed algorithm and method for solving the problem as a whole are determined.

• ON THE SIMILARITY FUNCTION OF GRAPHIC REPRESENTATIONS OF EXECUTIVE FILES IN THE OBFUSCING TRANSFORMATION EVALUATION MODEL

  P.D. Borisov , Y.V. Kosolapov

  264-273

  2025-07-24

  Abstract ▼

  Obfuscation of program code is used to complicate its analysis in a model when the analyst has full access to the program. Obfuscation is usually divided into cryptographically secure and heuristically resistant. In the first case, the complexity of the analysis is comparable to the difficulty of solving some known mathematical problem. In the second case, the resistance is usually justified by the lack of effective techniques for analyzing the obfuscation method known at the time of its creation. Cryptographically secure obfuscation has not yet found practical application, while heuristically resistant is widely used. Previously, the authors proposed a model for assessing the efficiency and resistance of heuristic obfuscating transformations based on the use of a similarity function. In this paper, such a similarity function is constructed using machine learning methods based on a comparison of the graphical representation of program executable files. In particular, the comparison is performed using a convolutional network with four convolutional layers, an RMSprop optimizer, an NLLLoss loss function, and two outputs of a fully connected layer. The proposed function is used in the implementation of a model for evaluating the efficiency and resistance of obfuscating transformations. In addition to the similarity function, the implementation of the model also includes: a basic set of obfuscating transformations provided by the Hikari obfuscator; a set of obfuscating transformation sequences based on the basic set; a test set of programs for training models based on the CoreUtils, PolyBench and HashCat program sets; approximation of the most "understandable" version of the program using the smallest version of the program (searched among the versions obtained using various optimization options of the GCC, Clang and AOCC compilers); a program deobfuscation scheme based on the optimizing compiler from LLVM. The results of an experimental study with the implemented model showed that it is impractical to use the constructed similarity function in the framework of the evaluation model due to its low accuracy, but it is possible to use it when constructing more complex functions.