{"title":"Reverse geoencoding based route distance calculator","authors":"O. Hornyák","doi":"10.32968/psaie.2022.3.4","DOIUrl":"https://doi.org/10.32968/psaie.2022.3.4","url":null,"abstract":"This paper presents a calculator that can determine the distance by road types and calculate the toll fee for trucks. An overview is given on the toll fees of some neighbor countries. The algorithm uses reverse geocoding and a local toll fee database.","PeriodicalId":117509,"journal":{"name":"Production Systems and Information Engineering","volume":"23 4 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":"116634595","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":"RelOntoUML model of the archaeological findings","authors":"A. Agárdi","doi":"10.32968/psaie.2022.1.5.","DOIUrl":"https://doi.org/10.32968/psaie.2022.1.5.","url":null,"abstract":"In this article, an ontology describing archaeological finds (DhiQar) is converted into the RelOntoUML model, which combines relational database modelling, ontology, and UML modelling. The ontology describing the archaeological finds can be found in OWL on github, it is open source. In this article, the original OWL ontology is also presented using the graphical representation system of the Protége editor. And the RelOntoUML model of the system is also detailed.","PeriodicalId":117509,"journal":{"name":"Production Systems and Information Engineering","volume":"112 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":"116920317","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":"A new approach to software defect prediction based on convolutional neural network and bidirectional long short-term memory","authors":"N. A. A. Khleel, K. Nehéz","doi":"10.32968/psaie.2022.3.1","DOIUrl":"https://doi.org/10.32968/psaie.2022.3.1","url":null,"abstract":"Software defect prediction (SDP) plays an important role in improving software quality and reliability while reducing software maintenance cost. The problem in the field of SDP is how to determine the defective source code with high accuracy. To build more accurate predictor models, a lot of features are presented, e.g., static code features, social network features, and process features, etc. Several machine learning (ML) and deep learning (DL) algorithms have been developed and adopted to identify and remove defects from the source code, where previous studies have proved that DL algorithms are promising techniques for predicting software defects. The aim of this study is to investigate the prediction performance of two DL algorithms namely, Convolutional Neural Network (CNN) and Bidirectional Long short-term memory (BI-LSTM) in the domain of SDP. To establish the effectiveness of the proposed approach, the experiments were conducted on the available benchmark datasets which obtained from open-source java projects GitHub repository and the models were evaluated by applying seven evaluation metrics which are accuracy, precision, recall, f-measure, matthews correlation coefficient (MCC), area under the ROC curve (AUC), mean square error (MSE). We found out that the best accuracy obtained on training dataset is 81% by using CNN model, while the best accuracy obtained on validation dataset is 80% by using BI-LSTM model. The best AUC obtained on training dataset is 88% by using CNN model, while the best AUC obtained on validation dataset is 83% by using the both models. It is nearly impossible to rule which model is better than the other so every model can be analyzed separately and the best model according to the problem at hand can be used, therefore, based on the problem of this study, The evaluation results show the effectiveness of our proposed models based on standard performance evaluation criteria.","PeriodicalId":117509,"journal":{"name":"Production Systems and Information Engineering","volume":"10 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":"128075984","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":"An approach to classify algorithms by complexity","authors":"O. Hornyák","doi":"10.32968/psaie.2022.3.8","DOIUrl":"https://doi.org/10.32968/psaie.2022.3.8","url":null,"abstract":"This paper investigates computer algorithms complexity, which takes an important role in software design. An algorithm is a finite set of instructions, those if followed, accomplishes a particular task. It is not language specific; any language and symbolscan represent instructions. While complexity is usually in terms of time, sometimes complexity is also analyzed in terms of space, which translates to the algorithm's memory requirements. The paper gives an overview of the most widely used O notation. Experienced programmers can evaluate the time and memory complexity of a block of source code; however, this is not possible when the algorithm is available in the form of an executable. In this paper amethod is proposed to evaluate algorithms without havingthe source code. The potential drawbacks of the proposal are also considered.","PeriodicalId":117509,"journal":{"name":"Production Systems and Information Engineering","volume":"1 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":"128702460","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":"Új módszer dolgozók munkájának közvetlen irányítására rugalmas gyártórendszerben","authors":"Norbert Tóth, Gyula Kulcsár","doi":"10.32968/psaie.2022.4.3","DOIUrl":"https://doi.org/10.32968/psaie.2022.4.3","url":null,"abstract":"Az emberi munkavégzésre alapozott rugalmas gyártórendszerek hatékonyságát nagymértékben befolyásolja a dolgozók irányításának módszere. A cikk bemutatja egy rugalmas gyártórendszerben elvégzendő munkák és rendelkezésre álló dolgozók dinamikus összerendelési feladatát és annak egy új megoldási módszerét. A javasolt megoldási módszer egyidejűleg több szempontot és befolyásoló tényezőt vesz figyelembe. A javasolt módszer hatékonyságát szimulációs modell futási eredményei igazolják.","PeriodicalId":117509,"journal":{"name":"Production Systems and Information Engineering","volume":"4 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":"116741452","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 data-collection for personalized facial expression recognition in human-robot interaction","authors":"F. Adjailia, P. Sinčák","doi":"10.32968/psaie.2022.2.6.","DOIUrl":"https://doi.org/10.32968/psaie.2022.2.6.","url":null,"abstract":"Face recognition systems, which attempt to identify the emotions that a person is feeling, have been around for quite some time. Facial expression recognition is the technique of detecting facial expressions based on interpretations of patterns in a picture. Because every person's face is unique, when we apply these methods to pictures of people, we are able to identify their facial expressions as being unique. In this research, we build a web-based data collecting application that is completely automated and includes a virtual avatar to guide users through the procedure. The input data we dealt with included written input in the form of six emotions (anger, disgust, fear, happiness, surprise, and sorrow) plus neutral, as well as video footage with a length of 20 seconds for each. With the use of the data, a customized face expression recognition method based on deep learning architecture known as MobileNets would be developed.","PeriodicalId":117509,"journal":{"name":"Production Systems and Information Engineering","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":"128053356","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":"Analysis of the Maximal Pattern Mining method and its variants","authors":"Dávid Gégény, S. Radeleczki","doi":"10.32968/psaie.2022.2.7.","DOIUrl":"https://doi.org/10.32968/psaie.2022.2.7.","url":null,"abstract":"In this paper, within the framework of process mining we examine the Maximal Pattern Mining method introduced by Liesaputra et al. in [1]. This method constructs a transition graph, i.e. a labelled directed graph for traces with similar structure. The idea behind the algorithm is to analyze the traces in the event log, identify loops, parallel events and optionality between them, in order to determine the maximal patterns. In [1], the authors provide a pseudo code for the skeleton of their algorithm and discuss some parts, but other parts are not detailed. Here, we briefly discuss the steps of the algorithm and elaborate the steps that are not explained in [1]. We introduce some new subroutines to handle the loops, parallel and optional sequences.","PeriodicalId":117509,"journal":{"name":"Production Systems and Information Engineering","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":"133175877","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":"Conversion of companies and source code comment ontology into RelOntoUML","authors":"A. Agárdi","doi":"10.32968/psaie.2022.1.9.","DOIUrl":"https://doi.org/10.32968/psaie.2022.1.9.","url":null,"abstract":"In this article, the conversion of a Companies and a source code commenting (SEM) ontology system into the RelOntoUML modelling system is presented. The two ontology systems are in OWL format available on github. After the simplification of the OWL files, I converted these two systems to RelOntoUML. RelOntoUML is a proprietary modelling that combines ontology, UML, and relational database modeling.","PeriodicalId":117509,"journal":{"name":"Production Systems and Information Engineering","volume":"71 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":"121567207","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":"Protection against remote desktop attacks","authors":"O. Hornyák","doi":"10.32968/psaie.2022.3.3","DOIUrl":"https://doi.org/10.32968/psaie.2022.3.3","url":null,"abstract":"This paper overviews the most common malicious software types. The motivationof writing this paper was a real wordcase studythat had to be investigated. Acomputer was suspected to have had an unwanted remote desktop connection attack. This paper presents how to investigatethe event log artifacts. For the unfortunate case when such an attack is proved to have happened, the second part of the article describes a method that allows the system administrator to detect brute force attacks through the remote desktop connection. When such an attack was revealed, the attacker’s IP address can be blacklisted.","PeriodicalId":117509,"journal":{"name":"Production Systems and Information Engineering","volume":"21 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":"116218494","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 for the generalization of the Vehicle Routing Problem","authors":"A. Agárdi","doi":"10.32968/psaie.2022.3.5","DOIUrl":"https://doi.org/10.32968/psaie.2022.3.5","url":null,"abstract":"This article presents a software solution to the generalization of the Vehicle Routing Problem. The Vehicle Routing Problem is a logistics task, the purpose of which is to transport goods and services to a given place at a given time in a cost-effective manner. Many versions of the task have developed over the years, which model constantly changing, complicated systems. The article details the software solution of a model that models a general system. The software representation contains the following components: vector describing the order of nodes, the matrix describing the assignment of vehicles-nodes-products, vector describing the assignment of vehicle - recharger stations, vector describing the vehicle-start-end-node assignment, vector describing level, vector describing period, solution description vector. The following optimization algorithms were used in the article: Ant Colony System, Genetic Algorithm, Simulated Annealing and Tabu Search. The article presents the literature of the Vehicle Routing Problem, the software solution of the general system, the applied algorithms and their running results through a case study.","PeriodicalId":117509,"journal":{"name":"Production Systems and Information Engineering","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":"127155857","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}