Pub Date : 2024-06-01DOI: 10.1134/s0361768824700075
P. Timokhin, M. Mikhaylyuk
{"title":"A Method to Order Point Clouds for Visualization on the Ray Tracing Pipeline","authors":"P. Timokhin, M. Mikhaylyuk","doi":"10.1134/s0361768824700075","DOIUrl":"https://doi.org/10.1134/s0361768824700075","url":null,"abstract":"","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141403585","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-01DOI: 10.1134/s0361768824700087
D. D. Zhdanov, I. Potemin, A. Zhdanov
{"title":"Dual Representation of Geometry for Ray Tracing Acceleration in Optical Systems with Freeform Surfaces","authors":"D. D. Zhdanov, I. Potemin, A. Zhdanov","doi":"10.1134/s0361768824700087","DOIUrl":"https://doi.org/10.1134/s0361768824700087","url":null,"abstract":"","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141400491","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-01DOI: 10.1134/s036176882470004x
K. A. Rylov, K. S. Kupriyanova, A. V. Kamensky
{"title":"Influence of Unequilateral Apertures of Digital Filters Laplacian “Trunced Pyramid” and “Double Pyramid” on the Accuracy of Television Measuring Systems","authors":"K. A. Rylov, K. S. Kupriyanova, A. V. Kamensky","doi":"10.1134/s036176882470004x","DOIUrl":"https://doi.org/10.1134/s036176882470004x","url":null,"abstract":"","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141405644","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-05-22DOI: 10.1134/s0361768824010092
M. G. Shirobokov, S. P. Trofimov
Abstract
The KIAM Astrodynamics Toolbox, a new software library for designing spacecraft orbital motion, is introduced. The toolbox is developed at the Keldysh Institute of Applied Mathematics of the Russian Academy of Sciences in Fortran and Python languages and, therefore, combines computational speed and program design flexibility. The library can be useful for space flight mechanics specialists, as well as for students in relevant educational programs.
摘要 介绍了用于设计航天器轨道运动的新软件库 KIAM 天体动力学工具箱。该工具箱由俄罗斯科学院凯尔迪什应用数学研究所使用 Fortran 和 Python 语言开发,因此兼具计算速度和程序设计灵活性。该库对空间飞行力学专家以及相关教育课程的学生都很有用。
{"title":"KIAM Astrodynamics Toolbox for Spacecraft Orbital Motion Design","authors":"M. G. Shirobokov, S. P. Trofimov","doi":"10.1134/s0361768824010092","DOIUrl":"https://doi.org/10.1134/s0361768824010092","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>The KIAM Astrodynamics Toolbox, a new software library for designing spacecraft orbital motion, is introduced. The toolbox is developed at the Keldysh Institute of Applied Mathematics of the Russian Academy of Sciences in Fortran and Python languages and, therefore, combines computational speed and program design flexibility. The library can be useful for space flight mechanics specialists, as well as for students in relevant educational programs.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141153096","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-05-22DOI: 10.1134/s0361768824010079
V. V. Kuliamin
Abstract
A review of software dynamic analysis methods is presented, mainly focusing on the methods supported by tools targeted on software security verification and applicable to system software. Fuzzing, runtime verification and dynamic symbolic execution techniques are considered in detail. Dynamic taint data analysis methods and tools are excluded since gathering technical details on them is complicated. The review of fuzzing and dynamic symbolic execution is focused mostly on the techniques to solve various problems that arise during operation of the tools rather than the particular tools that amount to a number greater than 100. In addition, the fuzzing counteraction techniques are considered.
{"title":"A Survey of Software Dynamic Analysis Methods","authors":"V. V. Kuliamin","doi":"10.1134/s0361768824010079","DOIUrl":"https://doi.org/10.1134/s0361768824010079","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>A review of software dynamic analysis methods is presented, mainly focusing on the methods supported by tools targeted on software security verification and applicable to system software. Fuzzing, runtime verification and dynamic symbolic execution techniques are considered in detail. Dynamic taint data analysis methods and tools are excluded since gathering technical details on them is complicated. The review of fuzzing and dynamic symbolic execution is focused mostly on the techniques to solve various problems that arise during operation of the tools rather than the particular tools that amount to a number greater than 100. In addition, the fuzzing counteraction techniques are considered.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141153081","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-05-22DOI: 10.1134/s0361768824010031
V. A. Fedorenko, K. O. Sorokina, P. V. Giverts
Abstract
This paper discusses the use of a fully connected neural network to classify images of firing pin impressions. The purpose of this work is to investigate the effectiveness of clone images of firing pin impressions in improving the quality of training of fully connected neural networks. Another purpose of the work is to estimate the accuracy of multigroup classification of firing pin impressions left by different firearms by using a neural network. The scientific novelty of this work is in the use of augmentation for creating images of firing pin impressions to increase the number of objects in the training dataset and to artificially improve the feature diversity of objects of each class. The conducted investigation shows that the accuracy of classification of the analyzed objects reaches approximately 84% for a fixed value of the classification criterion and 94–98% when the classification is carried out based on three maximum signals on output neurons. The work is of interest to developers of automated ballistic identification systems.
{"title":"Multigroup Classification of Firing Pin Impressions with the Use of a Fully Connected Neural Network","authors":"V. A. Fedorenko, K. O. Sorokina, P. V. Giverts","doi":"10.1134/s0361768824010031","DOIUrl":"https://doi.org/10.1134/s0361768824010031","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>This paper discusses the use of a fully connected neural network to classify images of firing pin impressions. The purpose of this work is to investigate the effectiveness of clone images of firing pin impressions in improving the quality of training of fully connected neural networks. Another purpose of the work is to estimate the accuracy of multigroup classification of firing pin impressions left by different firearms by using a neural network. The scientific novelty of this work is in the use of augmentation for creating images of firing pin impressions to increase the number of objects in the training dataset and to artificially improve the feature diversity of objects of each class. The conducted investigation shows that the accuracy of classification of the analyzed objects reaches approximately 84% for a fixed value of the classification criterion and 94–98% when the classification is carried out based on three maximum signals on output neurons. The work is of interest to developers of automated ballistic identification systems.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141153084","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-05-22DOI: 10.1134/s0361768824020063
D. V. Divakov, A. A. Tyutyunnik, D. A. Starikov
Abstract
In this work, a symbolic-numerical solution of Maxwell’s equations is constructed, describing the guided modes of a two-dimensional smoothly irregular waveguide in the zeroth approximation of the model of adiabatic waveguide modes. The system of linear algebraic equations obtained in this approximation is solved symbolically. The dispersion relation is solved numerically using the parameter continuation method.
{"title":"Symbolic-Numerical Implementation of the Model of Adiabatic Guided Modes for Two-Dimensional Irregular Waveguides","authors":"D. V. Divakov, A. A. Tyutyunnik, D. A. Starikov","doi":"10.1134/s0361768824020063","DOIUrl":"https://doi.org/10.1134/s0361768824020063","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>In this work, a symbolic-numerical solution of Maxwell’s equations is constructed, describing the guided modes of a two-dimensional smoothly irregular waveguide in the zeroth approximation of the model of adiabatic waveguide modes. The system of linear algebraic equations obtained in this approximation is solved symbolically. The dispersion relation is solved numerically using the parameter continuation method.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141153090","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-05-22DOI: 10.1134/s0361768824020117
M. V. Maisuradze, A. A. Mikhalev
Abstract
The representation of elements of free non-associative algebras as a set of multidimensional tables of coefficients is defined. An operation for finding partial derivatives for elements of free non-associative algebras in the same form is considered. Using this representation, a criterion of primitivity for elements of lengths 2 and 3 in terms of matrix ranks, as well as a primitivity test for elements of arbitrary length, is derived. This test makes it possible to estimate the number of primitive elements in free non-associative algebras with two generators over a finite field. The proposed representation allows us to optimize algorithms for symbolic computations with primitive elements. Using these algorithms, we find the number of primitive elements of length 4 in a free non-associative algebra of rank 2 over a finite field.
{"title":"Primitive Elements of Free Non-associative Algebras over Finite Fields","authors":"M. V. Maisuradze, A. A. Mikhalev","doi":"10.1134/s0361768824020117","DOIUrl":"https://doi.org/10.1134/s0361768824020117","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>The representation of elements of free non-associative algebras as a set of multidimensional tables of coefficients is defined. An operation for finding partial derivatives for elements of free non-associative algebras in the same form is considered. Using this representation, a criterion of primitivity for elements of lengths 2 and 3 in terms of matrix ranks, as well as a primitivity test for elements of arbitrary length, is derived. This test makes it possible to estimate the number of primitive elements in free non-associative algebras with two generators over a finite field. The proposed representation allows us to optimize algorithms for symbolic computations with primitive elements. Using these algorithms, we find the number of primitive elements of length 4 in a free non-associative algebra of rank 2 over a finite field.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141153076","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-05-22DOI: 10.1134/s0361768824010055
M. M. Krasnov, O. B. Feodoritova
Abstract
Modern graphics accelerators (GPUs) can significantly speed up the execution of numerical problems. However, porting programs to graphics accelerators is not an easy task, sometimes requiring their almost complete rewriting. CUDA graphics accelerators, thanks to technology developed by NVIDIA, allow one to have a single source code for both conventional processors (CPUs) and CUDA. However, parallelization on shared memory is still done differently and should be specified explicitly. The use of a functional programming library developed by the authors makes it possible to hide the use of one or another parallelization mechanism on shared memory within the library and make the user’s source code completely independent of the computing device used (CPU or CUDA). This article shows how this can be done.
摘要现代图形加速器(GPU)可以大大加快数值问题的执行速度。然而,将程序移植到图形加速器上并非易事,有时几乎需要完全重写。得益于英伟达™(NVIDIA®)公司开发的 CUDA 图形加速器技术,人们可以用一个源代码同时处理传统处理器(CPU)和 CUDA。不过,共享内存上的并行化仍然采用不同的方式,并应明确指定。通过使用作者开发的函数式编程库,可以将共享内存上的一种或另一种并行化机制隐藏在库中,使用户的源代码完全独立于所使用的计算设备(CPU 或 CUDA)。本文展示了如何做到这一点。
{"title":"The Use of Functional Programming Library for Parallel Computing on CUDA","authors":"M. M. Krasnov, O. B. Feodoritova","doi":"10.1134/s0361768824010055","DOIUrl":"https://doi.org/10.1134/s0361768824010055","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>Modern graphics accelerators (GPUs) can significantly speed up the execution of numerical problems. However, porting programs to graphics accelerators is not an easy task, sometimes requiring their almost complete rewriting. CUDA graphics accelerators, thanks to technology developed by NVIDIA, allow one to have a single source code for both conventional processors (CPUs) and CUDA. However, parallelization on shared memory is still done differently and should be specified explicitly. The use of a functional programming library developed by the authors makes it possible to hide the use of one or another parallelization mechanism on shared memory within the library and make the user’s source code completely independent of the computing device used (CPU or CUDA). This article shows how this can be done.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141153222","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-05-22DOI: 10.1134/s0361768824020026
Yu. A. Blinkov
Abstract
First differential approximation has been used to analyze various numerical methods for solving systems of ordinary differential equations. This has made it possible to estimate the stiffness of the ODE system that models the oscillations of the Van der Pol oscillator and the error of the method as well as to propose simple criteria for choosing a calculation step. The presented methods allow one to perform efficient calculations using computer algebra systems.
AbstractFirst differential approximation has been used to analyze various numerical methods for solving systems of ordinary differential equations.这使得估算范德尔波尔振荡器振荡模型的常微分方程系统的刚度和方法的误差以及提出选择计算步骤的简单标准成为可能。所提出的方法允许人们使用计算机代数系统进行高效计算。
{"title":"Computer-Algebraic Approach to First Differential Approximations: Van der Pol Oscillator","authors":"Yu. A. Blinkov","doi":"10.1134/s0361768824020026","DOIUrl":"https://doi.org/10.1134/s0361768824020026","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>First differential approximation has been used to analyze various numerical methods for solving systems of ordinary differential equations. This has made it possible to estimate the stiffness of the ODE system that models the oscillations of the Van der Pol oscillator and the error of the method as well as to propose simple criteria for choosing a calculation step. The presented methods allow one to perform efficient calculations using computer algebra systems.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141153118","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}