Scientific papers of Donetsk National Technical University. Series: Informatics, Cybernetics and Computer Science最新文献

{"title":"THE DEVELOPMENT OF PHYSICALLY CORRECT LIGHT REFLECTANCE MODEL BASED ON ANGLE CALCULATION BETWEEN VECTORS","authors":"Y. Zavalniuk, O. Romaniuk, A. Snigur, R. Shevchuk","doi":"10.31474/1996-1588-2023-1-36-45-50","DOIUrl":"https://doi.org/10.31474/1996-1588-2023-1-36-45-50","url":null,"abstract":"The new physically correct reflectance model based on angle calculation between vectors is proposed in this article. The main bidirectional reflectance distribution functions groups characteristics are analyzed. The models based on angle calculations allow to approximate the etalon Blinn model with low degree function. The approximated Blinn model was modified with correction coefficient in order to increase the realism level of the epicenter zone glow formation. The computer program for the modified model correction coefficient calculation was developed. The modified model normalizing coefficient for the energy conservation law adherence was proposed. The dataset for the coefficient formula selection using TuringBot software was created. The normalizing coefficient formula was selected from calculated variants. The absolute error value between 1 and hemispherical integral reflectivity value is not bigger than 210^(-2). The developed physically correct reflectance model can be used in high realism level computer graphics systems.","PeriodicalId":104072,"journal":{"name":"Scientific papers of Donetsk National Technical University. Series: Informatics, Cybernetics and Computer Science","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124959685","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":"TOPOLOGICAL ASPECTS OF MODELING PARALLEL COMPUTATIONS WHEN SOLVING DYNAMIC PROBLEMS BASED ON THE MESSAGE PASSING INTERFACE","authors":"I. A. Nazarova, S. Golub","doi":"10.31474/1996-1588-2023-1-36-69-78","DOIUrl":"https://doi.org/10.31474/1996-1588-2023-1-36-69-78","url":null,"abstract":"\"transmission when solving complex multidimensional dynamic problems. Models of interprocessor exchange are obtained for computing systems with distributed memory and topological architectures: ring, 2D-torus, hypercube, etc. The application of double arithmetic based on the GMP-library and its effect on the temporal characteristics of parallel applications are considered. The dependence of the parallelism characteristics of numerical algorithms when using the streaming SIMD-extension is analyzed. The modern stage of development of computer and information technologies has one of its directions - the use of the idea of parallelism in order to reduce the time of solving multidimensional problems that have a high temporal complexity or are even NP-complete. Despite the significant increase in the productivity of existing parallel systems, reducing the cost of components for their construction, development and implementation of parallel methods remains the most difficult problem due to the lack of study of the internal structure of algorithms and their properties. Thus, the introduction of parallel computing requires not so much the mastering of parallel data processing as the development of parallel algorithms based on the parallelization of sequential ones or the construction of fundamentally new, more efficient parallel methods. That is why the analysis of existing parallel algorithms, studying the possibilities of improving their characteristics is an important, promising and practically demanded task. The purpose of the work is to increase the efficiency of solving complex multidimensional dynamic problems implemented on parallel architectures of distributed memory using the message passing interface (MPI) due to the reduction of communication time. Tasks of the work: firstly, it is the development of analytical models of multiple data transfer operations for different topologies of connection of processors, substantiation of the models and research of the quality of parallel calculations of various classes of numerical methods for cluster systems. The possibility and effectiveness of using double arithmetic (GMP-library) and its influence on the temporal characteristics of parallel implementation are separately investigated. Additionally, the paper analyzes the dependence of the parallelism characteristics of the methods on the use of Streaming SIMD-Extension (SSE). The scientific novelty of the field lies in the development and development of analytical models for processes of interprocessor exchange given by cluster systems, which allow to increase the efficiency of parallel implementations of numerical methods in rich dynamic tasks for a short period of time on a communication warehouse. The practical significance of the field is in the development of split models for the analysis of the efficiency of collective operations of multiple data transfer within the MPI interface, which is the current standard for software implementation of robots","PeriodicalId":104072,"journal":{"name":"Scientific papers of Donetsk National Technical University. Series: Informatics, Cybernetics and Computer Science","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127751801","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":"VISUALIZATION AS A MEANS OF INCREASING THE EFFICIENCY OF MASTERING THE COURSE OF ALGORITHMS AND DATA STRUCTURES","authors":"Y. Prokop, O. Trofymenko, D. Novikov, O. Shevchenko","doi":"10.31474/1996-1588-2023-1-36-97-103","DOIUrl":"https://doi.org/10.31474/1996-1588-2023-1-36-97-103","url":null,"abstract":"In the modern world, visualization of information plays an important role in all spheres of life, because visual information is perceived and assimilated much better than sound or text. The analysis of modern research made it possible to find out that the visualization of educational materials is one of the effective ways to improve the quality of education in universities. This issue became especially relevant after the transition of Ukrainian educators to distance education, which was initially caused by the COVID-19 pandemic, and later by martial law due to full-scale Russian aggression. Under such circumstances, teachers faced the need to find new forms of presenting educational materials to students. In order to increase the interest of future IT-specialists and improve the results of their mastering the \"Algorithms and Data Structures\" course, a software complex of dynamic data structures and algorithms visualization was developed.","PeriodicalId":104072,"journal":{"name":"Scientific papers of Donetsk National Technical University. Series: Informatics, Cybernetics and Computer Science","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117138230","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":"DESIGNING A TEXT DATA RECOGNITION MODEL USING COMPUTATIONAL INTELLIGENCE","authors":"O. Dmitrieva, E. Babenko","doi":"10.31474/1996-1588-2023-1-36-4-10","DOIUrl":"https://doi.org/10.31474/1996-1588-2023-1-36-4-10","url":null,"abstract":"The article is devoted to the development, justification, software implementation and research of a text data recognition model based on the use of neural networks with a hybrid architecture. The proposed model allows you to gain new knowledge through a combination of different activities and methods of text analysis. The main tasks implemented in the work were to study the essence and relevance of text data recognition, determine the criteria for assessing the quality of recognition, design the architecture of the model and software application, develop and train a software model of text recognition. Software application testing and a comparative analysis of recognition quality in terms of accuracy, reliability, completeness and time were carried out with the involvement of other neural networks. As a criterion for assessing the quality of neural network training, the loss function was used, which characterized the normalized deviation of the results of the actual values obtained by the neural network from the expected ones. At the stages of training and testing, the model was tuned, the optimal number of training epochs was determined in terms of the reliability metric. Based on the results obtained, it can be argued that the proposed hybrid architecture of the ConvBiGRU neural network has the highest quality indicators, similar to the ConvBiLSTM model, but the time spent on the implementation of one epoch is less. There was also a tendency to equalize the times of realization of epochs for combined models compared to simple models when large arrays of text data were processed.","PeriodicalId":104072,"journal":{"name":"Scientific papers of Donetsk National Technical University. Series: Informatics, Cybernetics and Computer Science","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126421277","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 A USER AUTHENTICATION METHOD BASED ON KEYBOARD HANDWRITING","authors":"Y. Bashkov, T. Altukhova, Y. Yezhova","doi":"10.31474/1996-1588-2023-1-36-61-68","DOIUrl":"https://doi.org/10.31474/1996-1588-2023-1-36-61-68","url":null,"abstract":"\"In this research paper, a study of user authentication by keyboard handwriting when entering a passphrase is performed. Based on the analysis and development of a mathematical function for the distribution of \"\"own\"\" and \"\"foreign\"\" areas, a module for filtering the author's input was created. To authenticate a user by keyboard handwriting when entering a passphrase, it is necessary to recognize the speed and dynamics of input (gaps between keystrokes and their retention). The time intervals between keystrokes and the period of keystroke hold allow us to characterize the user's handwriting on the keyboard quite unambiguously, which is confirmed by a number of experiments conducted during the study of user authentication features. In addition, the authentication method based on keyboard handwriting can be used to protect against fraudsters trying to gain unauthorized access to the system and for remote authentication when users are at a distance from the server. The results of the study and the developed software module can be used to create a hybrid access control system that combines two authentication methods - password and biometric. Thus, the final control system will provide an enhanced authentication procedure compared to classical password authentication. The keyboard handwriting authentication method has great potential for use in the field of cybersecurity and can be used as an effective tool to ensure system security. \"","PeriodicalId":104072,"journal":{"name":"Scientific papers of Donetsk National Technical University. Series: Informatics, Cybernetics and Computer Science","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116936087","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":"APPROACHES TO CONFIRMING MUTUAL SYNCHRONIZATION IN TREE-LIKE PARITY MACHINES","authors":"M. Aleksandrov","doi":"10.31474/1996-1588-2021-2-33-65-69","DOIUrl":"https://doi.org/10.31474/1996-1588-2021-2-33-65-69","url":null,"abstract":"This paper presents the experimental results of comparing algorithms for confirming the completion of mutual synchronization using polynomial and hash functions. The approach based on the polynomial function was experimentally tested for resistance to failure. All experiments were performed on neural networks with an architecture that uses real numbers with float accuracy. As a result, the approach using the polynomial function was not sufficiently resistant to failure and does not exceed the approach using the hash function in speed. The tasks of further research are determined.","PeriodicalId":104072,"journal":{"name":"Scientific papers of Donetsk National Technical University. Series: Informatics, Cybernetics and Computer Science","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122278317","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":"MATHEMATICAL SUBSTANTIATION OF THE INFLUENCE OF DIAGNOSTIC SIGNS ON THE TECHNICAL CONDITION OF THE INTERPHASE INSULATION OF ELECTRIC MOTORS","authors":"T. Altukhova","doi":"10.31474/1996-1588-2023-1-36-30-35","DOIUrl":"https://doi.org/10.31474/1996-1588-2023-1-36-30-35","url":null,"abstract":"In this scientific work, a study of the negative impact of diagnostic signs on the technical condition of the interphase insulation of electric motors was performed. A computer model was developed to determine the relationship between the leakage current through the interphase insulation and the phase currents. A computational experiment was conducted, where it was established that the damage to the interphase insula-tion reliably correlates with the differences between the phase currents, but not with the currents themselves. The obtained values of the correlation coefficient showed that there is a functional relationship between the insulation resistance and the difference in the phase currents of the electric motors, thus confirming the hy-pothesis of the influence of certain factors on the technical condition of the interphase insulation. It was de-termined that the probability of such damage occurring in the presence of a difference in phase currents in electric motors due to relevant factors is 33%. The obtained research results can be used in the development of models of diagnostic systems under the condition of monitoring the condition and prevention of insula-tion damage and prevention of emergency situations associated with its violations.","PeriodicalId":104072,"journal":{"name":"Scientific papers of Donetsk National Technical University. Series: Informatics, Cybernetics and Computer Science","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128727889","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":"LOAD BALANCING IN A DISTRIBUTED SYSTEM OF GROUP MUTUAL SUPPORT FOR PERFORMING CURRENT TASKS","authors":"O. Dmitrieva, I. Omelchenko","doi":"10.31474/1996-1588-2021-2-33-10-15","DOIUrl":"https://doi.org/10.31474/1996-1588-2021-2-33-10-15","url":null,"abstract":"\"The article is devoted to the development of a software platform for load balancing in a distributed system of group mutual support for the implementation of current tasks, approaches to visualizing progress and factors influencing the achievement of goals are determined. A comparative analysis of existing assistance services has been carried out. The basic requirements for the logical and functional components of the service being developed and the software for its implementation are substantiated. The architecture of the service being developed is designed, the structure of the personal profile of a user who has problems in terms of motivation, goal setting and planning is determined. A system of automatic selection of users, a calendar of tasks, a system of messaging has been developed. The programmatic result of the work is a web application with load balancing functionality. The developed web application consists of client and server parts and uses public cloud services. The purpose of the work is to develop a distributed system of service for group mutual support for performing personal tasks in the format of a web application using technologies for horizontal scaling of the load from the server side, and the development of the client part in the format of a single-page web application SPA (Single Page Application). The objectives of the research are to conduct a comparative analysis of modern software and instrumental platforms, to determine approaches to visualizing progress in setting up a group mutual support service and factors affecting the achievement of goals. Also, the main tasks should be noted the design of the architecture of the service being developed, the definition of the structure of the user's personal profile, the development of a subsystem for automatic selection of users, a calendar of tasks, a messaging subsystem, as well as the development of web applications, consisting of a client part in the form of SPA and distributed server software with load balancing functionality. To scale the software system, a preliminary division into separate microservices with their subsequent containerization was carried out, and a distributed architecture with placement schemes was designed.\"","PeriodicalId":104072,"journal":{"name":"Scientific papers of Donetsk National Technical University. Series: Informatics, Cybernetics and Computer Science","volume":"270 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133349361","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":"METRIC SYSTEMS FOR EVALUATING THE EFFICIENCY AND SCALABILITY OF PARALLEL COMPUTING","authors":"I. Nazarova, Y. Klymenko","doi":"10.31474/1996-1588-2021-2-33-50-56","DOIUrl":"https://doi.org/10.31474/1996-1588-2021-2-33-50-56","url":null,"abstract":"\"The current state of development of computer technology allows you to build parallel computer systems that use almost unlimited number of processors. The availability of such systems has aroused interest in studying the performance of parallel computers, which contain a large number of processors, in the implementation of real multidimensional problems. One way to increase the efficiency of parallel architectures is to reduce the time required to perform a time-consuming task, which should be commensurate with the number of processing resources used to solve this problem. The second direction is the development of highly scalable parallel or parallel algorithms. Under the scalability of the parallel algorithm on the parallel architecture we will consider a measure of its ability to efficiently use a growing number of processors. Scalability analysis can be used to select the best combination of algorithm architecture for a problem with different constraints on the size of the problem and the number of processors. It can be used to predict the performance of a parallel algorithm and a parallel architecture for a large number of processors based on known performance on a smaller number of processors. For a fixed size of the problem, it can be used to determine the optimal number of processors, which will be used and the maximum possible acceleration that can be obtained. Scalability analysis can also predict the impact of changes in hardware technology on performance and thus help develop the best parallel architectures to solve different problems The aim of the work is to critically evaluate the state of modern theory of analysis of aircraft performance and scalability and to demonstrate further research on the development of new and more complex analytical tools to analyze the effective use of the benefits of parallel equipment. The main task of the study is to develop new and modify existing theoretical models, methods and formalisms to study the problems of efficiency and scalability of parallel computing. Mathematically, to simplify the analysis, it is assumed that all temporal characteristics are non-negative. This means that acceleration is always limited by the number of processors, p, and efficiency - by one. For example, acceleration can be super-linear, overhead can be negative if memory is hierarchical and access time is increased discretely by increasing the memory used by the program. In this case, the effective computing speed of a large program will be slower on a serial processor than on a parallel computer with similar processors.\"","PeriodicalId":104072,"journal":{"name":"Scientific papers of Donetsk National Technical University. Series: Informatics, Cybernetics and Computer Science","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122376754","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":"MATHEMATICAL MODELING OF THE PROCESS OF FORECASTING THE TIME SPENT ON THE IMPLEMENTATION OF A TYPICAL TASK FOR SOFTWARE DEVELOPMENT","authors":"I. Yarosh, E. Pavlovskyi, I. A. Nazarova","doi":"10.31474/1996-1588-2023-1-36-79-84","DOIUrl":"https://doi.org/10.31474/1996-1588-2023-1-36-79-84","url":null,"abstract":"The article is devoted to the creation, justification and verification of a mathematical model for forecasting time labor costs for solving typical problems of a software development project. Forecasting is carried out on the basis of information about the duration of each typical task by an individual employee from the development team. The constructed model takes into account information about the time frame for the employee to complete the task with a certain number of repetitions of its implementation. The work was done using the cftool service tools of the MatLab package. The adequacy of the parameters of the mathematical model was checked experimentally, a comparative assessment of the results obtained with the indicators calculated by the theoretical method was carried out.","PeriodicalId":104072,"journal":{"name":"Scientific papers of Donetsk National Technical University. Series: Informatics, Cybernetics and Computer Science","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128964203","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}