Search

Search Results

• HYBRID METHOD FOR SOLVING THE PROBLEM OF PLACEMENT OF DIGITAL COMPUTER DEVICES

  L. A. Gladkov , N. V. Gladkova , M.J. Yasir

  2021-11-14

  Abstract ▼

  The problem of placing elements of digital computing technology is considered in the article.
  The analysis of the current state of research on this topic is carried out, the relevance of the
  problem under consideration is noted. The importance of developing new effective methods for
  solving such problems are highlighted. The place of the placement problem in the general cycle ofthe design stage is shown. The importance of a high-quality solution to the placement problem
  from the point of view of the successful implementation of subsequent design stages is noted. The
  importance of minimizing connection delays in the design process of large-scale devices is noted.
  A review and analysis of various models and criteria for evaluating the solution to the placement
  problem is carried out. It was emphasized that the most important criterion is the length of the
  joints, it has a significant impact on the technologies used in the design. A complex mathematical
  formulation of the problem of placing elements of digital computing equipment has been completed.
  Perspective approaches to solving design problems are analyzed, hybrid methods and models
  for solving complex multicriteria optimization and design problems are described. The principles
  of operation and the model of a fuzzy logic controller are described. The description of the used
  fuzzy control scheme is given. The functions of various blocks of a fuzzy logic controller are determined.
  The structure of a multilayer neural network that implements the Gaussian function is
  proposed. The interaction of blocks of a fuzzy genetic algorithm is described. A model of a hybrid
  algorithm for solving the placement problem is proposed. The control parameters of the fuzzy
  logic controller are determined. The proposed hybrid algorithm is implemented as an application
  program. A series of computational experiments to determine the effectiveness of the developed
  algorithm and select the optimal values of the control parameters were carried out.

• HYBRID APPROACH THE JOINT SOLUTION OF PLACEMENT AND TRACING PROBLEMS

  L.A. Gladkov , N. V. Gladkova , Dzhabbar Yasir Yasir Mukhanad

  2020-11-22

  Abstract ▼

  The article proposes an integrated approach to solving the problems of placing and tracing elements
  of circuits of electronic computing equipment. The approach is based on the joint solution of
  placement and tracing problems using fuzzy genetic methods. A description of the problem under
  consideration is given and a brief analysis of existing approaches to its solution is performed. The
  article discusses integrated approaches to solving optimization problems of computer-aided design of
  digital electronic computing equipment circuits. The urgency and importance of developing new
  effective methods for solving such problems is emphasized. It is noted that an important direction in
  the development of optimization methods is the development of hybrid methods and approaches that
  combine the advantages of various methods of computational intelligence. The article describes the
  following main points: the structure of the proposed algorithm and its main stages; modified genetic
  crossover operators; models for the formation of the current population are proposed; modified heuristics,
  operators and strategies for finding optimal solutions. The results of computational experiments
  are presented. The experiments carried out confirm the effectiveness of the proposed approach.
  In conclusion, a brief analysis of the results obtained is given.

• A BIOINSPIRED APPROACH TO SOLVING THE PROBLEM OF 3D PACKAGING

  V.I. Danilchenko , V.V. Bova , М. М. Semenova , S.V. Ignateva , М. B. Shayliev

  2026-02-27

  Abstract ▼

  This article examines one of the most important combinatorial optimization problems – three-dimensional packaging. Optimizing three-dimensional packaging reduces costs and improves logistics efficiency, making it relevant for industry. This paper analyzes classical approaches such as greedy algorithms and dynamic programming, as well as widely used methods, including evolutionary algorithms and local search. An analysis of existing methods, including greedy search, dynamic programming, evolutionary algorithms, and local search, revealed their key characteristics and identified suitable areas of application. In the context of this analysis, an overview of the key methods that dominated during certain historical periods is presented. The analysis includes consideration of the application conditions of various methods, their effectiveness for specific types of problems, as well as their advantages and limitations.
  A multi-level search algorithm is presented that combines the advantages of traditional and modern optimization methods. This multi-level algorithm improves the accuracy of the packaging problem solution through dynamic parameter adjustment. A software package for solving the three-dimensional packaging optimization problem using bioinspired algorithms has been developed. A computational experiment was conducted on test examples (benchmarks). The packing quality obtained using the developed combined bioinspired algorithm is, on average, 7% higher than the packing results obtained using known algorithms, while the solution time is 7% to 25% shorter, demonstrating the effectiveness of the proposed approach. A series of tests and experiments allowed us to refine theoretical estimates of the time complexity of packing algorithms. In the best case, the time complexity of the algorithms is O(n²), and in the worst case, O(n³).

• MODERN APPROACHES TO SOLVING THE 3D BIN PACKING PROBLEM

  М.М. Sorokin , L. А. Gladkov , N. V. Gladkova

  131-150

  2026-09-10

  Abstract ▼

  The article is devoted to the consideration of current trends and approaches to solving the urgent optimization problem of three-dimensional bin packing problem. The importance of building effective methods for solving this problem is due to the rapid growth of e-commerce, where achieving even incremental improvements in container filling density can lead to significant reductions in freight transportation and storage costs. The article provides an analysis of various types of problems and suggests a classification of bin packing problems according to various criteria, including: offline and online packing, by dimension, by type and quantity of containers and cargo. The formulation of the classical optimization knapsack problem is given and various options for constraints due to the specifics of the tasks being solved are considered. A brief overview of the main approaches to solving the problem is given. The analysis and generalization of the characteristic features of the application of metaheuristic approaches based on the use of evolutionary and bioinspired algorithms and machine learning methods is carried out, their advantages and disadvantages are noted. Due to the complexity of the problem under consideration, it is proposed to actively use known and develop new modifications of metaheuristic algorithms that make it possible to find quasi-optimal solutions in polynomial time. The analysis of known machine learning methods and bioinspired algorithms is given, the principles of their operation are described, their main features, advantages and disadvantages are highlighted, and the prospects for their development and application to solve NP-complete combinatorial optimization problems are noted. A generalized principle of operation of metaheuristic algorithms is given. A comparative analysis of the application of various optimization methods has shown the effectiveness of using metaheuristic methods to solve the problem of three-dimensional packaging.

• TRANSFORMATION AND ANALYSIS OF INFORMATION WHEN CREATING A DATABASE OF PARTICIPANTS OF THE GREAT PATRIOTIC WAR 1941-1945 IN THE MEMORIAL COMPLEX «ROAD OF MEMORY» IN THE MAIN RUSSIAN ARMED FORCES CATHEDRAL ON THE BASIS OF COMPUTER METHODS OF INFORMATION PR

  S. A. Botsvin , V.A. Khvatkov

  2021-11-14

  Abstract ▼

  Preserving the historical memory of the participants of the Great Patriotic War
  1941–1945 is a world-class task that should preserve the truth about the most terrible war and the
  feat of our people. In modern conditions, attracting interest in history, traditions and finally
  recognition of one's duty to the past generations requires modern methods. One of these methods
  is the transformation of information, which allows you to present this information in such a way
  that it can be used most effectively. At the same time, the main goal in the transformation of historical
  data is to optimize their representations and formats and not change the information content.
  The presented algorithms of transformation and analysis of information when creating a database
  of participants of the Great Patriotic War were aimed at maximizing the preservation of historical
  value and reliability of information. To achieve this goal, computer methods of information processing
  for normalization and consolidation of personal data obtained from various sources are
  considered. The analysis of the content of information in archival documents with the presentation
  of statistical data on the number of documents (records) from various sources (archives, databases,
  information resources, etc.) is carried out and the procedure for translating information
  from archival documents into electronic form, which has been applied in practice, is described.
  Based on the analysis of the information, diagrams of the content of personal information in archival
  sources are constructed, the stages of systematization and bringing the generalized information
  array records to a single format are presented, as well as the procedure for combining and
  deleting duplicate records. For the possibility of using in other projects, an algorithm for consolidating
  data obtained from various sources is described in detail, and its block diagram is constructed.
  In addition, the applied fuzzy search algorithms are described, which made it possible to
  minimize errors in records, as well as image comparison algorithms for searching for duplicates
  from photographs. All of these algorithms have made it possible to bring together information
  contained on various media, having different structures and geographical location. The created
  information resource allows you to enormously reduce the resources needed to find the necessary
  information, including access to which was limited or not at all. Further improvement of algorithms
  for normalization and consolidation of information can serve as a basis for data migration
  from outdated to promising systems, as well as for the formation of information resources from
  existing heterogeneous archival funds.

• DEVELOPMENT OF HOMOMORPHIC DIVISION METHODS

  I.D. Rusalovsky, L.K. Babenko, О.B. Makarevich

  2022-11-01

  Abstract ▼

  The article deals with the problems of homomorphic cryptography. Homomorphic cryptography
  is one of the young areas of cryptography. Its distinguishing feature is that it is possible to
  process encrypted data without decrypting it first, so that the result of operations on encrypted
  data is equivalent to the result of operations on open data after decryption. Homomorphic encryption
  can be effectively used to implement secure cloud computing. To solve various applied problems,
  support for all mathematical operations, including the division operation, is required, but
  this topic has not been sufficiently developed. The ability to perform the division operation
  homomorphically will expand the application possibilities of homomorphic encryption and will
  allow performing a homomorphic implementation of many algorithms. The paper considers the
  existing homomorphic algorithms and the possibility of implementing the division operation within
  the framework of these algorithms. The paper also proposes two methods of homomorphic division.
  The first method is based on the representation of ciphertexts as simple fractions and the
  expression of the division operation through the multiplication operation. As part of the second
  method, it is proposed to represent ciphertexts as an array of homomorphically encrypted bits, and
  all operations, including the division operation considered in this article, are implemented
  through binary homomorphic operations. Possible approaches to the implementation of division
  through binary operations are considered and an approach is chosen that is most suitable for a
  homomorphic implementation. The proposed methods are analyzed and their advantages and disadvantages
  are indicated.

• METHOD OF IMPLEMENTING HOMOMORPHIC DIVISION

  L. K. Babenko, I. D. Rusalovsky

  2020-11-22

  Abstract ▼

  The article deals with the problems of homomorphic cryptography. Homomorphic cryptography
  is one of the young directions of cryptography. Its peculiarity lies in the fact that it is possible
  to process encrypted data without preliminary decryption in such a way that the result of operations
  on encrypted data is equivalent, after decryption, to the result of operations on open data.
  The article provides a brief overview of the areas of application of homomorphic encryption. To
  solve various applied problems, support for all mathematical operations is required, including the
  division operation, and the ability to perform this operation homomorphically will expand the
  possibilities of using homomorphic encryption. The paper proposes a method of homomorphic
  division based on an abstract representation of the ciphertext in the form of an ordinary fraction.
  The paper describes in detail the proposed method. In addition, the article contains an example of
  the practical implementation of the proposed method. It is proposed to divide the levels of data
  processing into 2 levels – cryptographic and mathematical. At the cryptographic level, a completely homomorphic encryption algorithm is used and the basic homomorphic mathematical operations
  are performed – addition, multiplication and difference. The mathematical level is a superstructure
  on top of the cryptographic level and expands its capabilities. At the mathematical level,
  the ciphertext is represented as a simple fraction and it becomes possible to perform the
  homomorphic division operation. The paper also provides a practical example of applying the
  homomorphic division method based on the Gentry algorithm for integers. Conclusions and possible
  ways of further development are given.

• HYBRID BIOINSPIRED ALGORITHM FOR ONTOLOGIES MAPPING IN THE TASKS OF EXTRACTION AND KNOWLEDGE MANAGEMENT

  D.Y. Kravchenko, Y.A. Kravchenko, V. V. Markov

  2020-07-20

  Abstract ▼

  The article is devoted to solving the problem of mapping ontological models in the processes
  of extracting and knowledge management. The relevance and significance of this task are due to
  the need to maintain reliability and eliminate redundancy of knowledge during the integration
  (unification) of various origins structured information sources. The proximity and consistency of
  the conceptual semantics of the combined resource during the mapping is the main criterion for
  the effectiveness of the proposed solutions. The article considers the problems of choosing appropriate
  solution approaches that preserve semantics when displaying concepts. The strategy of
  choosing bio-inspired modeling is substantiated. The aspects of the effectiveness of various decentralized
  bio-inspired methods are analyzed. The reasons for the need for hybridization are identified.
  The paper proposes to solve the problem of mapping ontological models using a bio-inspired
  algorithm based on hybridization of bacterial and cuckoo search algorithms optimization mechanisms.
  The hybridization of these algorithms allowed us to combine their main advantages: a consistent
  bacterial search that provides a detailed study of local areas, and a significant number of
  the cuckoo agent during the implementation global movements of Levy flights. To evaluate the
  effectiveness of the proposed hybrid bio-inspired algorithm, a software product was developed and
  experiments were performed on the mapping of different sizes ontologies. Each concept of any
  ontology has a certain set of attributes, which is a semantic vector of attributes. The degree of the
  semantic vectors similarity for the compared concepts of displayed ontologies is a criterion for
  their integration. To improve the quality of the display process, a new encoding of solutions has
  been introduced. The quantitative estimates obtained demonstrate time savings in solving problems
  of relatively large dimension (from 500,000 ontograph vertices) of at least 13 %. The time
  complexity of the developed hybrid algorithm is O (n 2). The described studies have a high level of
  theoretical and practical significance and are directly related to the solution of classical problems
  of artificial intelligence aimed at finding hidden dependencies and patterns on a multitude of
  knowledge elements.