D. G. Asatryan, M. E. Haroutunian, G. S. Sazhumyan, A. V. Kupriyanov, R. A. Paringer, D. V. Kirsh
{"title":"Hybrid Binarization Method for Historical Handwritten Documents","authors":"D. G. Asatryan, M. E. Haroutunian, G. S. Sazhumyan, A. V. Kupriyanov, R. A. Paringer, D. V. Kirsh","doi":"10.1134/s0361768823090037","DOIUrl":"https://doi.org/10.1134/s0361768823090037","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>Binarization of historical documents is a rather complex task that is being intensively studied by researchers all over the world. A large number of approaches, procedures, and binarization algorithms have been proposed, but methods that work equally well in all cases have not yet been proposed. The literature offers various criteria for assessing the quality of the binarization result. In the case of binarization of ancient handwritten texts, the criterion for the quality of the binarization algorithm is the degree of readability of the text using a visual method or technical means. One of the approaches proposed in the literature to improve the quality of the binarization result is pre-processing the original image using filtering methods, morphological analysis, spectral analysis, etc. This article proposes a hybrid binarization method, consisting of an arbitrary global or adaptive binarization algorithm and a special segmentation procedure for selecting segments of certain sizes. The proposed procedure makes it possible to identify objects of certain sizes in an image, in particular artifacts that exist in a binarized image. This work experimentally explores the possibility of improving the quality of a binary image by applying the proposed procedure.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140881603","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}
{"title":"Enhanced S2E for Analysis of Multi-Thread Software","authors":"F. V. Niskov, E. A. Kutovoy, Sh. F. Kurmangaleev","doi":"10.1134/s0361768823090074","DOIUrl":"https://doi.org/10.1134/s0361768823090074","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>Code analysis for defect detection is very important in the modern world, especially in the case of complex multi-thread applications. An example of a tool, suitable for software of high complexity, is the famous S2E, which allows for full-system emulation with symbolic execution. This paper presents several major enhancements for S2E, including: firstly, support for multiple virtual cores, allowing to have parallel speed-up; secondly, on this basis, a race checker plugin to detect defects of this sort in multi-thread programs. This development has concerned such interesting points of research as scheduling in multi-core emulation and race detection with symbolic execution.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140881604","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}
{"title":"Requirements Validation in the Information System Software Development Lifecycle: A Software Quality in Use Evaluation","authors":"L. Canchari, P. Angeleri, A. Dávila","doi":"10.1134/s0361768823080054","DOIUrl":"https://doi.org/10.1134/s0361768823080054","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>The Peruvian government adopted the ISO/IEC 12207 standard and established its mandatory implementation in public entities to improve the quality of the software products. In this context, software requirements validation tasks were introduced to improve the quality of the software product. In this study, the relationship between the improvement of software requirement quality and the software product quality in use was explored and analyzed. Analysis was based on the design of software product quality-in-use and the measure of metrics from ISO/IEC 25010 standard in two software products. The results show that the validation activities introduced in the software requirements stage have a positive relationship with the quality in use of the software products analyzed. In the software studied, it can be said that the improvement of the quality of the requirements has contributed to the improvement of the quality in use of software products. In this case, it has increased time efficiency to complete tasks by 45%, reduced errors for a task by 40%, the number of tasks with errors by 47%, the cost of time to perform tasks by 29%, and unnecessary actions by 53%. In addition, overall satisfaction, user pleasure, information quality, and interfaces quality are the metrics that significantly improve.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139559549","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}
Sofía Isabel Fernández Gregorio, Luis G. Montané-Jiménez, Carmen Mezura Godoy, Viviana Yarel Rosales-Morales
{"title":"Architecture for Groupware Oriented to Collaborative Medical Activities in the Rehabilitation of Strokes","authors":"Sofía Isabel Fernández Gregorio, Luis G. Montané-Jiménez, Carmen Mezura Godoy, Viviana Yarel Rosales-Morales","doi":"10.1134/s0361768823080078","DOIUrl":"https://doi.org/10.1134/s0361768823080078","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>When a person suffers a stroke, they require rehabilitation to recover from the consequences caused by this event. In order to carry out the rehabilitation, a multidisciplinary team of specialists intervenes, providing care from diverse areas such as neurology, nutrition, psychology, and physiotherapy. In the rehabilitation process, physicians interact with medical computing software and devices. The interactions represent medical activities that follow rehabilitation. However, there is no clear conception of how specialists coordinate to carry out medical activities. There are no specific communication channels that allow multidisciplinary collaboration for complete rehabilitation. This paper presents a systematic review of the state of the art that addresses this problem. On the other hand, a collaborative software architecture is proposed to support this area, which allows the monitoring medical activities from human-computer multimodal interactions. The architecture is composed of 3 layers: (1) to perceive the interactions and to monitor the activities, (2) to control the multidisciplinary access and share the information, and (3) to analyze and evaluate the execution of the multidisciplinary activities. Evaluating how the activities are carried out will help the physicians make decisions regarding the execution of the treatment plan. Therefore, we propose an activities representation diagram that facilitates this evaluation. Finally, we developed a prototype with a user-centered design that perceives human-computer interactions supported by the architecture.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140881590","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}
{"title":"Symbolic Computation of an Arbitrary-Order Resonance Condition in a Hamiltonian System","authors":"A. B. Batkhin, Z. Kh. Khaidarov","doi":"10.1134/s0361768823080030","DOIUrl":"https://doi.org/10.1134/s0361768823080030","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>The study of formal stability of equilibrium positions of a multiparametric Hamiltonian system in a generic case is traditionally carried out using its normal form under the condition of the absence of resonances of small orders. In this paper we propose a method of symbolic computation of the condition of existence of a resonance of arbitrary order for a system with three degrees of freedom. It is shown that this condition for each resonant vector can be represented as a rational algebraic curve. By methods of computer algebra the rational parametrization of this curve for the case of an arbitrary resonance is obtained. A model example of some two-parameter system of pendulum type is considered.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140881865","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}
J. Navas-Su, A. Gonzalez-Torres, M. Hernandez-Vasquez, J. Solano-Cordero, F. Hernandez-Castro, A. Bener
{"title":"A Metrics Suite for Measuring Indirect Coupling Complexity","authors":"J. Navas-Su, A. Gonzalez-Torres, M. Hernandez-Vasquez, J. Solano-Cordero, F. Hernandez-Castro, A. Bener","doi":"10.1134/s0361768823080157","DOIUrl":"https://doi.org/10.1134/s0361768823080157","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>Software development can be a time-consuming and costly process that requires a significant amount of effort. Developers are often tasked with completing programming tasks or making modifications to existing code without increasing overall complexity. It is essential for them to understand the dependencies between the program components before implementing any changes. However, as code evolves, it becomes increasingly challenging for project managers to detect indirect coupling links between components. These hidden links can complicate the system, cause inaccurate effort estimates, and compromise the quality of the code. To address these challenges, this study aims to provide a set of measures that leverage measurement theory and hidden links between software components to expand the scope, effectiveness, and utility of accepted software metrics. The research focuses on two primary topics: (1) how indirect coupling measurements can aid developers with maintenance tasks and (2) how indirect coupling metrics can quantify software complexity and size, leveraging weighted differences across techniques. The study presents a comprehensive set of measures designed to assist developers and project managers with project management and maintenance activities. Using the power of indirect coupling measurements, these measures can enhance the quality and efficiency of software development and maintenance processes.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140882059","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}
Kenia Nieto-Benitez, Noe Alejandro Castro-Sanchez, Hector Jimenez Salazar, Gemma Bel-Enguix, Dante Mújica Vargas, Juan Gabriel González Serna, Nimrod González Franco
{"title":"Elements for Automatic Identification of Fallacies in Mexican Election Campaign Political Speeches","authors":"Kenia Nieto-Benitez, Noe Alejandro Castro-Sanchez, Hector Jimenez Salazar, Gemma Bel-Enguix, Dante Mújica Vargas, Juan Gabriel González Serna, Nimrod González Franco","doi":"10.1134/s0361768823080170","DOIUrl":"https://doi.org/10.1134/s0361768823080170","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>Political speeches frequently use fallacies to sway voters during electoral campaigns. This study presents an approach for implementing machine learning models to automatically identify a specific type of fallacy known as an “appeal to emotion” fallacy. The objective is to establish a set of elements that enable the application of fallacy mining, as in existing literature, fallacies are typically identified manually, and there is no established structure for applying mining techniques. Our method utilizes features derived from an emotion lexicon to differentiate between valid arguments and fallacies, and we employed Support Vector Machine and Multilayer Perceptron models. Our results indicate that the Multilayer Perceptron model achieved an F1‑score of 0.60 in identifying fallacies. Based on our analysis, we recommend the use of lexical dictionaries to effectively identify “appeal to emotion” fallacies.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139562358","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}
M. D. Bragin, N. V. Zmitrenko, V. V. Zmushko, P. A. Kuchugov, E. V. Levkina, K. V. Anisiforov, N. V. Nevmerzhitskiy, A. N. Razin, E. D. Senkovskiy, V. P. Statsenko, V. F. Tishkin, Yu. V. Tret’yachenko, Yu. V. Yanilkin
{"title":"Mathematical Modeling of Turbulent Mixing in Gas Systems with a Chevron Contact Boundary using NUT3D, BIC3D, EGAK, and MIMOSA Numerical Codes","authors":"M. D. Bragin, N. V. Zmitrenko, V. V. Zmushko, P. A. Kuchugov, E. V. Levkina, K. V. Anisiforov, N. V. Nevmerzhitskiy, A. N. Razin, E. D. Senkovskiy, V. P. Statsenko, V. F. Tishkin, Yu. V. Tret’yachenko, Yu. V. Yanilkin","doi":"10.1134/s0361768823080042","DOIUrl":"https://doi.org/10.1134/s0361768823080042","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>This paper presents results of computational and experimental studies of the evolution of turbulent mixing in three-layer gas systems with the development of hydrodynamic instabilities, in particular, the Richtmyer–Meshkov and Kelvin–Helmholtz instabilities, under the action of shock waves. One of the contact boundaries between gases is flat, while the other one has the form of a chevron. The numerical simulations are carried out both with and without initial perturbations of contact boundaries. It is shown that the roughness of the contact boundary significantly affects the width of the mixing zone.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139559923","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}
Gayatri Nayak, Swadhin Kumar Barisal, Mitrabinda Ray
{"title":"CGWO: An Improved Grey Wolf Optimization Technique for Test Case Prioritization","authors":"Gayatri Nayak, Swadhin Kumar Barisal, Mitrabinda Ray","doi":"10.1134/s0361768823080169","DOIUrl":"https://doi.org/10.1134/s0361768823080169","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>The convergence rate has been widely accepted as a performance measure for choosing a better metaheuristic algorithm. So, we propose a novel technique to improve the performance of the existing Grey Wolf Optimization (GWO) algorithm in terms of its convergence rate. The proposed approach also prioritizes the test cases that are obtained after executing the input benchmark programs. This paper has three technical contributions. In our first contribution, we generate test cases for the input benchmark programs. Our second contribution prioritizes test cases using an improved version of the existing GWO algorithm (CGWO). Our third contribution analyzes the obtained result and compares it with state-of-the-art metaheuristic techniques. This work is validated after running the proposed model on six benchmark programs. The obtained results show that our proposed approach has achieved 48% better APFD score for the prioritized order of test cases than the non-prioritized order. We also achieved a better convergence rate, which takes around 4000 fewer iterations, when compared with the existing methods on the same platform.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140881940","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}
{"title":"Development of Multi-Platform Steganographic Software Based on Random-LSB","authors":"Gabor Attila Tibor, Jozsef Katona","doi":"10.1134/s0361768823080224","DOIUrl":"https://doi.org/10.1134/s0361768823080224","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>Today, users can’t even imagine the creative and advanced methods of disguising and hiding our data. However, the free software tools available for such purposes are often outdated or rudimentary in terms of functionality, and sometimes even contain vulnerabilities. The purpose of this article is to design and implement an easy-to-use and secure data hiding application that meets modern expectations and requirements, and also has a functionality that also returns the detectability level of the data to the user. The study first explores and evaluates currently available free software based on a certain set of criteria. After that, we describe in detail the development of a multi-platform stegenographic application with a new function, focusing on the methods and algorithms used. After successful implementation, the finished application is evaluated and compared with the tested, freely available software based on the set criteria.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140881690","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}