Search

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]

Steganography methods are considered to be one of the most common technologies for the protection of any digital data when transmitted over open communication channels at a given time. The solution of the problem of digital data protection using steganography methods is used not only by government services, but also by terrorist organizations. Therefore, the need for research, development and continuous improvement of steganoanalytical methods is becoming extremely important. The steganoanalytical algorithm based on the study of the singular decomposition of digital image matrix blocks is proposed in the paper. The main purpose of this paper is to increase the efficiency of digital image steganoanalysis, in the absence of a container, by developing a new steganoanalytical algorithm based on the study of the singular decomposition of digital image matrix blocks. As a result of a detailed study of the steganography algorithm using the singular decomposition of digital image matrix blocks, the statistical characteristics of the singular values of image matrix blocks are established. Based on the defined characteristics, the paper presents the main steps of the stegananoanalytical algorithm. As a criterion for assessing the effectiveness of the developed steganoanalytical algorithm, the probability of detecting additional information was used. Errors of the first and second type are considered. To compare the results of the developed steganoanalytical algorithm with existing algorithms in open access, the following applications are selected: XSteg; StegSpy. The software product "StegoAnalysis" has been implemented for the automated solution of the stegananalytical problem for digital image. [ABSTRACT FROM AUTHOR]

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]

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]

Objectives: Partial errors⁃in⁃variables (PEIV) model is a more general form of errors in variables (EIV) model. It has been widely used in the data processing of global navigation satellite system (GNSS), coordinate conversion, deformation monitoring and data fitting in the past ten years.Methods: First, the development history of PEIV model is reviewed. Then, five core problems of PEIV model are summarized and analyzed, including parameter estimation algorithm, precision estimation, random model estimation, expansion algorithm and data processing application. Finally, the applications of PEIV model are outlined. Results: We point out three questions for further research, including how to process big data by PEIV parameter estimation method, how to correct the bias of weighted total least squares(WTLS) adjustment by sampling method, and how to derive the formula of higher order parameter estimation covariance matrix are.Conclusions: This review paper aims to further promote the development of surveying and mapping da⁃ ta processing and provide readers with suggestions and references. [ABSTRACT FROM AUTHOR]

Today, the world is undergoing a digital transformation of society. Most of human activities are gradually being transferred to the digital dimension. In this regard, the digitalization of the peer review process is a very urgent task. The description of the implementation of automated peer review systems is not publicly available, because such systems are the intellectual property of the respective journals. The aim of the work is to develop an automated system for double-blind reviewing of articles for the professional Informatics and Mathematical Methods in Simulation journal. The paper discusses the process of reviewing in an automated system for reviewing articles. Described actions of reviewer, editor and authors. The sequence of these actions is considered. Designed the database that ensures the functioning of the developed system. An algorithm has been developed that removes the personal information of authors from the file. The algorithm allows you to delete: personal information of the author from the first page, headers of even pages, annotations in Russian and English at the end of the file. The article has developed an automated system for double-blind reviewing of articles, which provides double-blind reviewing, automates the workflow of the journal editor and reviewer, and minimizes the possibility of a third-party reviewing. Due to the introduction of an automated system for reviewing articles, the speed of reviewing will significantly increase and a single database of reviews will appear. The developed automated review system is used by the editors of the Informatics and Mathematical Methods in Simulation journal to improve the efficiency of the review process. The results of this work can be used to build a similar system for reviewing articles. [ABSTRACT FROM AUTHOR]

The protection of electronic information by cryptographic and steganographic methods, as well as their combination, is in great demand today. However, the new type of steganography - hash-steganography, fundamentally differs from classical steganography in that there is no need to embed messages in a container, no need to worry about the amount of information that can be transmitted in one container without compromising the visual stability of the image. A certain sequence of ordinary digital images is a message. The purpose of this work is to increase the efficiency of transmitting a secret message by modifying the hash-method of steganography. Previously, algorithms for obtaining hash functions of digital images have not been used to transmit messages, but they have found their application in hash-steganography. This paper compares two algorithms for obtaining hash codes and suggests a method of their application for transforming a text message into a sequence of digital images. It is a certain order of files transferred that is decisive in the decryption of a message. The symbols of the message are put in correspondence with the part of the hash code of the digital image. Thus, the necessary combination of files is formed, the number of which is equal to the number of symbols in the message. A comparative analysis of the two algorithms of the method has been performed. The results obtained have confirmed the effectiveness of the hash code algorithm based on the analysis of digital image DCT coefficients. This algorithm makes the method resistant to attack by compression, changing brightness and contrast, magnification and rotation. [ABSTRACT FROM AUTHOR]

Ill this paper wc propose a novel fuzzy-measurement algorithm for the assessment of the impact of electromagnetic fields on human health. The algorithm was developed to unify complex and diverse measuring mctjiodologics, standards and fuzzy logic control into a single entity - a comprehensive methodology for the assessment of the impact of electromagnetic fields on humans. The algorithm will enable multiple criteria automated assessment based on measurement results and the existing electromagnetic field standards, guidelines and recommendations in order to avoid potential subjectivity and varied approach. Wc have therefore considered two classes of fuzzy logic systems (Type-1 and Typc-2) and developed a graphic model intended for scenarios where expert opinions differ and where such a difference might significantly affect the assessment. The fuzzy model was developed on the principles of the proposed algorithm and this resulted in a unique procedure for the assessment of all types of electromagnetic fields on human health. [ABSTRACT FROM AUTHOR]

It is shown that at the present time the calculation methods, which allow determining induction in the weld pool zone, which is generated by two-rod devices for input of transverse magnetic field during arc welding. However, these methods are extremely difficult to use. In this paper, the calculation methods for determining numerical values of the induction components of a transverse magnetic field in the weld pool were proposed. The methods are based on the use of experimental data on the value of the induction generated by the transverse magnetic field input device in the weld pool zone at different value of rod crosssections of these input devices. The calculation expressions and an algorithm for their use are proposed to determine the magnetic field induction components in the indicated zone. The satisfactory convergence of the calculated data with the experimental ones is shown. The methods are recommended for using in arc surfacing and welding of products of materials which are not ferromagnetics. 8 Ref., 6 Fig. [ABSTRACT FROM AUTHOR]