PROBLEMS IN PROGRAMMING最新文献

{"title":"The method for assessing the connectivity of nodes of wireless episodic networks under the condition of using unmanned aeral vehicles","authors":"S. Valuiskyi, O. Lysenko, S. Chumachenko, O. Guida, O.V. Furtat, I.O. Sushyn","doi":"10.15407/pp2022.03-04.455","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.455","url":null,"abstract":"The paper considers a method for assessing the connectivity of nodes of wireless episodic networks (WEN) under the condition of using unmanned aerial vehicles (UAVs). It is proposed to perform an evaluation of the connectivity of a pair of nodes according to a method, which is based on: an evaluation of geometric connectivity, which is limited to the maximum range of radio visibility at the physical level and the vulnerability interval of a given multiple access protocol at the channel level; assessment of information connectivity, which takes into account the presence of not only a physical connection of a given reliability, but also the presence of a free channel resource, a given amount of transmission delay at a given traffic limit value; assessment of the duration of connectivity taking into account the mobility of network nodes. On the basis of analytical mathematical models, the duration of connectivity of mobile subscribers (nodes) (MS) of the WEN consisting of MS and UAVs in direct radio visibility conditions and taking into account relaying was investigated. The connectivity of a pair of nodes is determined by the characteristics of different levels of OSI information interaction, such as radio range, channel bandwidth, information transmission delay, etc. It is shown that the duration of connectivity is directly proportional to the size of the coverage zone and inversely proportional to the speed of movement of nodes. The nature (scenario) of node mobility also affects the duration of connectivity. The simulation of the movement of nodes was carried out under 4 scenarios: «march», «skirmish», «random wandering in the field» and «random wandering in the city». The largest values of the duration of connectivity correspond to the third scenario, and the smallest to the second (with a fixed radius of the coverage area and the speed of movement of nodes). Thus, the average connection duration of the UAV-pedestrian connection in the event of a «difference» will be of the order of 36 minutes, and the UAV-car connection of the order of 5 minutes. The obtained results can be used in the UAV network topology control method.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122431363","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Algebraic approach to the analysis of legal documents","authors":"O. Letychevskyi, V. Peschanenko, Maksym Poltorackiy, © О.О. Летичевський, В.С. Песчаненко, М.Ю. Полторацький","doi":"10.15407/pp2022.03-04.117","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.117","url":null,"abstract":"In this study, problems regarding the analysis of law articles and their conformance to legal documents are considered. The algebraic approach is used for the formal verification of legal texts that is presented as specification of behavior algebra. Having a formal presen- tation of legal texts allows for the application of algebraic methods, such as symbolic modeling, automatic proving of statements and algebraic matching. The approach was implemented for Ukrainian-language legal documents to detect inconsistency, incompleteness, and prove conformance. The analysis of legal texts has been implemented for Tax code and examples of inconsistency of some statements were demonstrated in the paper. Another experiment has been performed for checking of conformance of court statements, agreements, licenses, new laws, taxation acts to the articles of law with usage of methods of algebraic matching. The formalization of legal documents, like court verdicts, shall be implemented fully automatically, and the existing database with such documents shall provide the possibility to use big data technologies and machine learning. In this study, we consider the use of the algebraic approach in the analysis of legal requirements and law artifacts within the scope of the Insertion Modeling System (IMS). The subject of this research is the laws created by the legislature and the artifacts of legal activity, such as lawsuit decisions, agreements, licenses, and juridical cases. The problem to be considered is the analysis of legal documents for conformance with the law and the analysis of the law’s articles, checking for inconsisten- cies, incompleteness, and other interested properties. In this paper, we consider every element of the technology in detail, and we describe the methods and results of the experiments.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125881218","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Flow based bonet traffic detection using AI","authors":"B.O. Panchuk","doi":"10.15407/pp2022.03-04.376","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.376","url":null,"abstract":"This paper outlines the generalized framework for building end-to-end botnet network activity detection systems using artificial intelligence (AI) techniques. The paper describes network flows reconstruction as a primary feature-extraction method and considers different AI classifiers for achieving a better detection rate. The results of the latest research by other authors in the field are incorporated to implement a more efficient approach for botnet discovery. The described intrusion detection pipeline was tested on a dataset with real botnet activity traces. The performance metrics for different AI classification models were obtained and analyzed in detail. Different data preprocessing techniques were tried and described which helped improve the results even further. Some options for future enhancement of network feature selection were proposed as well. The comparison of the obtained performance metrics was drawn against the results provided by other researchers in this field.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122012823","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Development of decision support system using OLAP-technologies for information security monitoring systems","authors":"K. Dashdamirova","doi":"10.15407/pp2022.03-04.403","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.403","url":null,"abstract":"The article highlighted the need for continuous monitoring of the computer networks (CN) for information security and analyzed the sources of data for information security monitoring (ISM). Methods of data collection from various sources have been investigated, and categories of ISM systems have been studied. The architectural-technological model of the system supporting decision-making based on OLAP (Online Analytical Processing) and data warehouse has been proposed for quick response to security-related incidents and detected incidents in ISM systems.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124051087","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Automated parallelization of a program for modeling intraparticle diffusion and adsorption in heterogeneous nanoporous media","authors":"A. Doroshenko, M. Petryk, D. Mykhalyk, P. Ivanenko, O. Yatsenko","doi":"10.15407/pp2022.03-04.059","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.059","url":null,"abstract":"Heterogeneous media consisting of thin layers of particles of forked porous structure with different physical-chemical properties are widely used in science-intensive technologies and priority sectors of industry, medicine, ecology, etc. Such layers are distributed systems of pores consisting of two main spaces: micro- and nanopores of particles and macropores and cavities between particles. Mass transfer in the system of heterogeneous media causes two types of mass transfer: diffusion in macropores, owing to interparticle space, and diffusion in the system of micro- and nanopores inside particles of the heterogeneous medium. Intraparticle space has a higher level of adsorptive capacity, and at the same time, has a lower velocity of diffusion intrusion in comparison with interparticle space. In modeling concentra- tion and gradient fields for various diffusible components, an important scientific problem is the identification of kinetic parameters of a transfer, predetermining mass transfer velocity on macro- and micro levels, and also equilibrium conditions. The results of designing and parallelization of a program implementing a Crank-Nicolson scheme using algebra-algorithmic specifications represented in a natural- linguistic form are given. The tools for automated design, synthesis and auto-tuning of programs were applied that provided the translation of algebra-algorithmic schemes into source code in a target programming language and its tuning for execution environment to increase the program performance. Numerical distributions of values of diffusion coefficients for intraparticle transfer along coordinate of medium thickness for various time snapshots were obtained. Based on the results of the identification, the models were checked for adequacy and numerical modeling and analysis of concentration and gradient fields of mass transfer were carried out. The experiment results of auto- tuning the software implementation demonstrated high multiprocessor speedup on test data input.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127887905","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Molecular modeling in the radiation therapy. The algebraic approach","authors":"Yuliia Tarasich, Vladislav Volkov, V.M.Glushkov","doi":"10.15407/pp2022.03-04.231","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.231","url":null,"abstract":"The rapid development of the chemical industry and science, and new challenges in the healthcare sector, put forward increased demands for the development of the theory of organic and inorganic chemistry, for the search and implementation of new modeling and analysis methods, and for the improvement of technological processes. One of the main challenges at the intersection of chemistry, physics, biol- ogy, medicine, and genetics is the search for new methods and approaches to the diagnosis and treatment of cancer. A deeper understanding of cancer’s genetics and molecular biology has led to the identification of an increasing number of potential molecular targets that can be used for the discovery and development of anticancer drugs, radiation therapy, etc. One of the main places in this is occupied by molecular modeling. Despite the availability of more and more data on existing proteins and nucleic acids and the availability of modeling methods and tools, the development and use of a wide variety of combined methods and tools for modeling and computing large molecular systems remain an open issue. One of the possible solutions for this problem is the application of the algebraic approach and the corresponding formal methods, which have proven effective in many other fields today. The main idea of the research is the application of algebraic modeling technology and quantum chemical apparatus for modeling and verification of organic chemistry problems, in particular, modeling and analysis of radiation therapy problems. The paper presents the first steps of the research. The example of the formalization of the synchrotron operation principle and the example of the interaction of protons with substance in the example of the determination/calculation of the physically absorbed dose are given in the paper.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134098190","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Bicomponent sorting algorithms","authors":"V. Shynkarenko, A. Doroshenko, O. Yatsenko, V. Raznosilin, K. K. Halanin","doi":"10.15407/pp2022.03-04.032","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.032","url":null,"abstract":"he possibilities of improving sorting time parameters through preprocessing by stochastic sorting were investigated. The hypothesis that two-component stochastic + classical sorting outperforms classic one-component sorting in terms of time efficiency was experimentally confirmed. Sorting with different computational complexity is accepted as classical sorting algorithms: shaker sort- ing with computational complexity O(n2), insertions O(n2), Shell O(n·(log n)2) ... O(n3/2), fast with optimization of ending sequences O(n·log n). The greatest effect is obtained when performing comparisons using stochastic sorting in the amount of 160 percent of the array’s size. Indicators of the efficiency of the exchange of two elements, as well as series of exchanges, are introduced. This allowed to determine the highest efficiency of stochastic sorting (as the first component of two-component sorting), when one element for comparison is chosen from the first part of the array and the other from the second. For algorithms with a computational complexity of O(n2) the improvement in time efficiency reached 70–80 percent. However, for Shell sort and quick sort, the stochas- tic presort has no positive effect, but instead increases the total sorting time, which is apparently due to the initial high efficiency of these sorting methods. The hypothesis that three-component sorting fast + stochastic + insertions would increase sorting time efficiency was not confirmed. However, during the experiment, the recommended size of the array was determined, at which point the two-component quick + insertion sort must be switched to the second component – insertion sorting. The optimal length of the ending sequences is between 60 and 80 elements. Given that algorithm time efficiency is affected by computer architecture, operat- ing system, software development and execution environment, data types, data sizes, and their values, time efficiency indicators should be specified in each specific case.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"67 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130268791","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Simulation of optimal pursuit strategies with simple motion","authors":"S. V. Pashko","doi":"10.15407/pp2022.03-04.478","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.478","url":null,"abstract":"Strategies for pursuit of a target by one pursuer with simple movement are considered. The criterion is the time to capture the target. The proof of the optimality of the parallel approach strategy and the chas- ing strategy is presented. The strategy of parallel approach consists in the fact that the pursuer, knowing the velocity vector of the target at current moment, considers this vector to be constant and calculates a point on the target’s line of motion at which capture can occur if the pursuer moves at a constant maxi- mum speed. At each instant of time, the pursuer’s velocity vector is directed to the capture point, and the magnitude of the velocity is maximal. If the pursuer moves at maximum speed in the direction of the target, the pursuit strategy is called a chasing strategy. A number of examples of pursuit using the strate- gies of parallel approach and chasing strategy, calculated by the numerical method, are given. The main parameters of the movement of the agents affecting the time of capture are determined: the speed of the target and the pursuer, the coordinates of the target and the pursuer at the time of the beginning of the pursuit, the type and parameters of the target’s movement line; the pursuit task is determined by these para-meters. On the basis of numerical modeling, a sets of problems is outlined for which the parallel approach strategy is better then the chasing strategy or vice versa. The selected movement parameters roughly correspond to the movement parameters of modern combat aircraft and air defense equipment; in numerical experiments, the absolute value of the acceleration of the target does not exceed 10g, where g is the accele-ration of free fall. Since the pursuer’s motion is considered simple, any absolute value of its acceleration is allowed. In the case of applying the parallel approach strategy, this value slightly differs from the absolute value of the target’s acceleration; if a chasing strategy is used, the absolute magnitude of the pursuer’s acceleration can be much larger.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120906141","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Improving methods for generating encryption keys using strange attractors","authors":"V. Shevchenko, I. Sinitsyn, V.L. Shevchenko","doi":"10.15407/pp2022.03-04.417","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.417","url":null,"abstract":"The urgency of the work is determined by the need to transfer confidential information through open communication channels. Such information can be of two types: symmetric encryption keys and directly informational messages that are encrypted with encryption keys. The article deals with the problem of improving the transmission of closed information over open channels using the Diffie- Hellman algorithm. The improvement is due to the introduction of a new type of one-sided function based on the numerical solution of the system of ordinary differential equations describing the dynamics of the phase coordinate movement of the strange attractor. For this purpose, the classic Diffie-Hellman algorithm based on the one-sided function of the discrete logarithm was considered. The required properties of one-sided functions in the general case were considered. Next, the peculiarities of algorithm modification in the case of transition to a one-sided function based on the use of a strange attractor were considered. It is assumed that at the beginning of the operation of the modified algorithm, through a secret channel, the exchange parties (agents) exchange information regarding the properties of the strange attractor to be used, namely, the definition of the differential equations describing the dynamics of a strange attractor, the values of the parameters of the equations, the initial integration conditions and the integration step (for methods with a constant step of integration). After that, all exchanges are conducted exclusively through open channels. The paper also considers the case of information exchange between more than two agents, in particular, the approach of hiding the number of agents participating in the exchange. Approbation of the method is carried out and intermediate and final results of the one-sided function based on strange attractors are given. Possibilities regarding partial disclosure by agents of certain parameters of the use of one-way functions are discussed. But at the same time, the safety of revealing such information is justified in the general case (both in the classical and in the modified Diffie-Hellman method). It was determined that depending on the needs of users, the complexity of the encryption keys can be increased by changing the initial parameters of the attractor, which will also allow controlling speed of key generation and encryption in general. The software that implements the proposed modified algorithm is implemented in three programming languages, C#, Python, and MatLab. This made it possible to perform a comparative analysis of the results and consciously choose the programming language of individual parts of the software to optimize the encryption key generation process for specific conditions.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125049503","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Software package for estimation of the stereo camera calibration error in the computer vision system","authors":"A.Ye. Vitiuk, A. Doroshenko","doi":"10.15407/pp2022.03-04.469","DOIUrl":"https://doi.org/10.15407/pp2022.03-04.469","url":null,"abstract":"The approach for accuracy assessment of the object model a for the problem of stable grasping in the combined system of the proposal of grasping and the reconstruction of the three-dimensional model of the object was considered. Such a combined system allows stable capture of objects of any shape without restrictions on the types of shapes in the training data set. Novel approaches to surface reconstruction of the object are based on restoring the depth of points from a pair of images from two cameras. The quality of the 3D reconstruction is affected by several factors: the movement of the camera and environmental objects, spatial quantization of the image coordinates, correspondence of key points, camera calibration parameters, unaccounted camera distortions, as well as numerical and statistical properties of the selected reconstruction method. Camera parameter errors can be minimized by improving the calibration procedure, so the impact of errors on the quality of the 3D model was investigated. The deviation of the model from the plane is chosen as a metric for quality assessment. For its calculation, the point cloud is processed by plane identification and segmentation, for which an algorithm based on the RANSAC method is considered. The software package for accuracy estimation was developed. An experiment was conducted to obtain the dependence of the accuracy of the reconstructed planes on the errors of the camera parameters. The impact of calibration errors on 3D reconstruction was evaluated by comparing metrics for individual planes at different levels of artificial error and evaluating the impact of the error on these metrics. Modeling the error of the camera calibration parameters with a given noise level shows that the calibration parameters deteriorate as the noise level increases. In particular, it was established that an increase in error contributes to an increase in the error of estimation of calibration parameters. In addition, orientation parameters (rotation and translation) are more complex and therefore more sensitive to measurement noise than other parameters.","PeriodicalId":313885,"journal":{"name":"PROBLEMS IN PROGRAMMING","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129318570","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}