10 results
Search Results
2. COMBINED ALGORITHMS FOR DETERMINING THE INITIAL SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS.
- Author
-
Yukhimenko, B. I., Volkova, N. H., and Kozina, Yu. Yu.
- Subjects
- *
GREEDY algorithms , *ANT algorithms , *MATHEMATICAL ability , *KNAPSACK problems , *SIMULATED annealing , *ALGORITHMS , *COMPUTATIONAL complexity - Abstract
The problem of solving the task of discrete optimization is not completely solved. Lack of publications, scientific developments, algorithms and software products do not give the ability to transfer the mathematical apparatus of solving discrete optimization problems to the class P of computational complexity. All analytical and combinatorial algorithms for solving problems of linear and non-linear optimization are NP completeness. There are developments to improve the efficiency of robotic algorithms, they are filled with requests and actual ones. In this paper, it is proposed to use deterministic and probabilistic methods for forming a priority queue of decision vector components in order to assign positive values to them. After the formation of the variant of the solution, it is possible to vectorize as if the approached solution is taken away from the record value of the goal function, which in exact algorithms is like a solution, which results in a polyp. In this paper has a method for forming a priority line for concretizing the components of the solution vector. The basis of deterministic methods is the idea of a greedy algorithm. The location in the queue is determined by the value of the corresponding component of the cost vector. The appearance of the value of non-visibility in the system of restrictions increases the priority of the component. Behind such a way, another method of determination is modified. Probability assessment probability of priorities is based on the ideas of algorithms in an ant colony and simulated annealing. The scope of probability indicates the significance of the component - a contender for a positive value. A numerical example of a small variability of the task about a knapsack has been introduced, which demonstrates the imitation of a nearby solution. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
3. РОЗРОБКА АВТОМАТИЗОВАНОЇ СИСТЕМИ РЕЦЕНЗУВАННЯ СТАТЕЙ ДЛЯ НАУКОВОГО ЖУРНАЛУ
- Author
-
Шеремет, Г. О.
- Subjects
ALGORITHMS ,DIGITAL technology ,AUTHOR-editor relationships ,DATABASE design ,INTELLECTUAL property - Abstract
Copyright of Informatics & Mathematical Methods in Simulation / Informatika ta Matematičnì Metodi v Modelûvannì is the property of Odessa Polytechnic University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
- Published
- 2021
- Full Text
- View/download PDF
4. AN APPROACH TO THE ELIMINATION OF CONFLICTS IN MULTI-AGENT SYSTEMS BASED ON DIJKSTRA'S ALGORITHM.
- Author
-
Penko, V. G., Penko, O. V., and Kogan, V. V.
- Subjects
- *
MULTIAGENT systems , *ALGORITHMS , *DISTRIBUTED algorithms - Abstract
The task of path finding by an agent is one of the basic tasks and is of great practical importance. As a rule, this is an optimization task that is solved in the space of the state graph in order to minimize the length of the path. Such a task becomes more difficult and becomes even more popular if it is solved on the basis of one graph space by several agents. In this case, another practically important optimization parameter appears, which is expressed by the number of conflicts between agents. Such an abstract formulation of the task has numerous variants of formalization and a large number of approaches to its solution. In this paper, the main element of the approach is the application of the classic Dijkstra algorithm, which is executed sequentially by each agent. When finding the shortest route, each agent modifies the graph space in such a way as to reduce the probability of conflicts with subsequent agents. This approach is original and a number of computational experiments were performed to verify it using software developed for this purpose. The experiments that were conducted demonstrate the adequate behavior of the main algorithm. The work analyzes the limitations inherent in the proposed approach within the framework of the abstract formulation of the task. The directions of further development of the basic approach have been determined. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
5. МОДИФІКАЦІЯ МЕТОДУ ХЕШ-СТЕГАНОГРАФІЇ, ЗАСНОВАНОГО НА ПЕРЕДАЧІ ПОСЛІДОВНОСТІ ЦИФРОВИХ ЗОБРАЖЕНЬ
- Author
-
Зоріло, В. В., Лебедєва, О. Ю., and Бохонько, М. В.
- Subjects
IMAGE analysis ,TEXT messages ,DIGITAL images ,CRYPTOGRAPHY ,ALGORITHMS ,HASHING - Abstract
Copyright of Informatics & Mathematical Methods in Simulation / Informatika ta Matematičnì Metodi v Modelûvannì is the property of Odessa Polytechnic University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
- Published
- 2020
- Full Text
- View/download PDF
6. ВИЯВЛЕННЯ ЧАСТИН ЦИФРОВОГО ЗОБРАЖЕННЯ, ЗМЕНШЕНИХ ПІСЛЯ ФАЛЬСИФІКАЦІЇ
- Author
-
Гулич, В. В., Зоріло, В. В., and Лебедєва, О. Ю.
- Subjects
- *
DATA integrity , *INFORMATION technology security , *FALSIFICATION , *DIGITAL images , *ALGORITHMS - Abstract
At a time when the use of digital content in all spheres of life is constantly growing, the ability to verify the authenticity of digital files, in particular digital images, is extremely important in protecting information from integrity violations. In the information war, photo fakes are always used to achieve certain, often criminal, goals. Both society as a whole and individuals must take care of information security and protect their information space from unverified information. Modern methods of detecting violations of the integrity of graphic information to some extent address some issues of information security, however, they are not universal and often require development, improvement, additional research and so on. Thus, existing methods for detecting such a common method of image falsification as scaling are effective only in cases where the falsified part is enlarged, however, when reducing part of the image, they are not effective. Moreover, in open printing the problem of detecting reduced scalable parts of the image is not covered. Therefore, the aim of this work is to increase the efficiency of scaling detection as digital image falsification by developing an algorithm for detecting scaling with a negative coefficient. In this paper, the method of error level analysis is adapted to detect reduced parts of the digital image. The efficiency of the adapted method in terms of errors of the 1st and 2nd kind was: errors of the 1st kind - 2%, 2nd kind - 7%. In addition, it has been found that this method is also effective in detecting simultaneously scalable (reduced) and moved parts of a digital image. This method detects artifacts (errors) in the digital image, which occur when reducing its part - the falsified area has a higher high-frequency component than the rest of the image, which is amplified under the influence of compression after saving the falsification in a lossy format. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
7. INFORMATION COGNITIVE MODEL OF TECHNOLOGICAL INTERDEPENDENCE OF MARINE TECHNICAL RECOURSES.
- Author
-
Rudnichenko, Nick D. and Vichuzhanin, Vladimir V.
- Subjects
MARINE equipment ,INFORMATION technology ,TECHNOLOGICAL complexity ,INTEGRATED circuit interconnections ,POWER plants ,RELIABILITY in engineering ,ALGORITHMS - Abstract
This paper contains the results of studies of the cognitive model developed information technology interdependence and interrelation of complex technical systems to assess their vulnerability. A general block diagram of a ship interconnectedness of complex technical systems. The interaction of ship power plant units, the power supply system of the ship and ship's auxiliary systems in extreme emergency situations. Based on the results of research developed an information processing model of cognitive functioning marine interdependence of complex technical systems. In accordance with the established algorithm vulnerability assessment information elements of the cognitive model calculated the coefficients of the structural vulnerability of its elements. The calculation results have allowed to identify the most critical elements of the model in terms of reliability. The results of research and development will improve the efficiency of operation of complex technical systems that provide high-quality prediction of the reliability of their operation in extreme emergency situations. [ABSTRACT FROM AUTHOR]
- Published
- 2013
8. STEGANALYSIS OF DIGITAL IMAGES THAT SAVED IN RANDOM FILE FORMATS.
- Author
-
Uzun, Illya A.
- Subjects
CRYPTOGRAPHY ,INFORMATION resources management ,DIGITAL images ,IMAGE processing ,ALGORITHMS - Abstract
This paper is devoted to steganalysis algorithm determining presence a secret message embedded into digital image which is stored in compressed or uncompressed form. The algorithm is based on the analysis of pairs of colors and uses the method of modifying the least significant bit. [ABSTRACT FROM AUTHOR]
- Published
- 2013
9. POINT PREDICTION ALGORITHM FOR STOCHASTIC PROCESSES IN AIRCRAFT COMMUNICATION NETWORKS.
- Author
-
Chirkov, Dmytro V. and Lipovsky, Valery G.
- Subjects
INFORMATION networks ,STOCHASTIC processes ,PREDICTIVE control systems ,ALGORITHMS ,TELECOMMUNICATION systems - Abstract
The paper focuses on general method of predictive control of modern multi-service networks, which is a major component includes algorithms for the identification of structural models of regular components (trends) of the observed processes. The general structure for predictive control of aircraft communication systems is described. The general view of the structural identification algorithm is discussed. [ABSTRACT FROM AUTHOR]
- Published
- 2013
10. SINGULAR VECTORS SIGN-INSENSITIVE AS BASIS TO DEVELOPMENT COMPRESSIONSTABLE STEGANOGRAPHIC ALGORITHM.
- Author
-
Melnik, Margaret A.
- Subjects
- *
COMPRESSION loads , *MATHEMATICAL singularities , *VECTORS (Calculus) , *CRYPTOGRAPHY , *ALGORITHMS - Abstract
The paper focuses on new steganographic algorithm development. Proposed algorithm is stable to compression, including high rate compression, and based on singular vectors insensitive of image matrix blocks which corresponding to maximal singular values. Algorithm is polynomial of degree 2. The results of numerical experiments confirm the efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2013
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.