e Informatica Softw. Eng. J.最新文献

{"title":"A Deep-Learning-Based Bug Priority Prediction Using RNN-LSTM Neural","authors":"Hani Bani-Salameh, Mohammed Sallam, B. Al-Shboul","doi":"10.37190/e-inf210102","DOIUrl":"https://doi.org/10.37190/e-inf210102","url":null,"abstract":"Context: Predicting the priority of bug reports is an important activity in software maintenance. Bug priority refers to the order in which a bug or defect should be resolved. A huge number of bug reports are submitted every day. Manual filtering of bug reports and assigning priority to each report is a heavy process, which requires time, resources, and expertise. In many cases mistakes happen when priority is assigned manually, which prevents the developers from finishing their tasks, fixing bugs, and improve the quality. Objective: Bugs are widespread and there is a noticeable increase in the number of bug reports that are submitted by the users and teams’ members with the presence of limited resources, which raises the fact that there is a need for a model that focuses on detecting the priority of bug reports, and allows developers to find the highest priority bug reports. This paper presents a model that focuses on predicting and assigning a priority level (high or low) for each bug report. Method: This model considers a set of factors (indicators) such as component name, summary, assignee, and reporter that possibly affect the priority level of a bug report. The factors are extracted as features from a dataset built using bug reports that are taken from closed-source projects stored in the JIRA bug tracking system, which are used then to train and test the framework. Also, this work presents a tool that helps developers to assign a priority level for the bug report automatically and based on the LSTM’s model prediction. Results: Our experiments consisted of applying a 5-layer deep learning RNN-LSTM neural network and comparing the results with Support Vector Machine (SVM) and K -nearest neighbors (KNN) to predict the priority of bug reports. The performance of the proposed RNN-LSTM model has been analyzed over the JIRA dataset with more than 2000 bug reports. The proposed model has been found 90% accurate in comparison with KNN (74%) and SVM (87%). On average, RNN-LSTM improves the F -measure by 3% compared to SVM and 15.2% compared to KNN. Conclusion: It concluded that LSTM predicts and assigns the priority of the bug more accurately and effectively than the other ML algorithms (KNN and SVM). LSTM significantly improves the average F -measure in comparison to the other classifiers. The study showed that LSTM reported the best performance results based on all performance measures (Accuracy = 0.908, AUC = 0.95, F -measure = 0.892).","PeriodicalId":11452,"journal":{"name":"e Informatica Softw. Eng. J.","volume":"3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78857079","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":"Fixing Design Inconsistencies of Polymorphic Methods using Swarm Intelligence","authors":"Renu George, P. Samuel","doi":"10.37190/e-inf210101","DOIUrl":"https://doi.org/10.37190/e-inf210101","url":null,"abstract":"Background: Modern industry is heavily dependent on software. The complexity of designing and developing software is a serious engineering issue. With the growing size of software systems and increase in complexity, inconsistencies arise in software design and intelligent techniques are required to detect and fix inconsistencies. Aim: Current industrial practice of manually detecting inconsistencies is time consuming, error prone and incomplete. Inconsistencies arising as a result of polymorphic object interactions are hard to trace. We propose an approach to detect and fix inconsistencies in polymorphic method invocations in sequence models. Method: A novel intelligent approach based on self regulating particle swarm optimization to solve the inconsistency during software system design is presented. Inconsistency handling is modelled as an optimization problem that uses a maximizing fitness function. The proposed approach also identifies the changes required in the design diagrams to fix the inconsistencies. Result: The method is evaluated on different software design models involving static and dynamic polymorphism and inconsistencies are detected and resolved. Conclusion: Ensuring consistency of design is highly essential to develop quality software and solves a major design issue for practitioners. In addition, our approach helps to reduce the time and cost of developing software.","PeriodicalId":11452,"journal":{"name":"e Informatica Softw. Eng. J.","volume":"5 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75238323","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":"Point Cloud Compression and Transmission for Remote Handling Applications","authors":"S. Gutierrez, I. Caliskanelli, R. Skilton","doi":"10.17706/jsw.16.1.14-23","DOIUrl":"https://doi.org/10.17706/jsw.16.1.14-23","url":null,"abstract":"Remote handling systems are commonly used for decommissioning and maintenance of hazardous environments, especially in the nuclear sector. The necessity for a more realistic and accurate user interaction with the remote environment has led research towards the usage of immersive technologies such as augmented and virtual reality. In order for this to succeed, the state of the remote environment needs to be known accurately at all times. Information gathered using RGB-D cameras can serve this purpose. The high accuracy and density of data retrieved by these devices provide an extraordinary insight of the remote environment but can represent a burden on the communication channels. This paper addresses two point cloud compression techniques based on kd-trees and octrees for point cloud data transmission within a Robot Operative System (ROS) communications middleware.","PeriodicalId":11452,"journal":{"name":"e Informatica Softw. Eng. J.","volume":"8 1","pages":"14-23"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87620661","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 systematic reuse process for automated acceptance tests: Construction and elementary evaluation","authors":"Mohsin Irshad, K. Petersen","doi":"10.37190/e-inf210107","DOIUrl":"https://doi.org/10.37190/e-inf210107","url":null,"abstract":"","PeriodicalId":11452,"journal":{"name":"e Informatica Softw. Eng. J.","volume":"81 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88062173","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":"Unknown Oriented Programming: Mathematical Continuation","authors":"Zhu Ping","doi":"10.17706/jsw.16.5.200-207","DOIUrl":"https://doi.org/10.17706/jsw.16.5.200-207","url":null,"abstract":"","PeriodicalId":11452,"journal":{"name":"e Informatica Softw. Eng. J.","volume":"78 1","pages":"200-207"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86832564","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":"From Smart Data LifeCycle to Smart Simulation Project LifeCycle: The Case of the Voluntary Departure Program of Civil Servants in Morocco","authors":"Khadija Ouazzani Touhami, M. E. Arass, N. Souissi","doi":"10.17706/jsw.16.2.80-94","DOIUrl":"https://doi.org/10.17706/jsw.16.2.80-94","url":null,"abstract":"This paper investigates the potential of discrete event simulation for the analysis and evaluation of public strategies and policies and discusses the opportunities offered by the use of a simulation project lifecycle. Following this cycle, we evaluate a public policy use case, the voluntary departure operation initiated in Morocco in 2005, and analyses the success rate of this operation, as well as its impact on the Moroccan pension fund, and this for the period from 2005 to 2025. The results of this simulation highlighted, as already indicated in the Court of Auditors' reports, the irrelevance of this operation, particularly from a financial point of view.","PeriodicalId":11452,"journal":{"name":"e Informatica Softw. Eng. J.","volume":"35 1","pages":"80-94"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91209242","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":"Resource Scheduling Based on Reinforcement Learning Based on Federated Learning","authors":"Yabin Wang, J. Yu","doi":"10.17706/jsw.16.1.39-45","DOIUrl":"https://doi.org/10.17706/jsw.16.1.39-45","url":null,"abstract":"The emergence of edge computing makes up for the limited capacity of devices. By migrating intensive computing tasks from them to edge nodes (EN), we can save more energy while still maintaining the quality of service. Computing offload decision involves collaboration and complex resource management. It should be determined in real time according to dynamic workload and network environment. The simulation experiment method is used to maximize the long-term utility by deploying deep reinforcement learning agents on IOT devices and edge nodes, and the alliance learning is introduced to distribute the deep reinforcement learning agents. First, build the Internet of things system supporting edge computing, download the existing model from the edge node for training, and unload the intensive computing task to the edge node for training; upload the updated parameters to the edge node, and the edge node aggregates the parameters with the The model at the edge node can get a new model; the cloud can get a new model at the edge node and aggregate, and can also get updated parameters from the edge node to apply to the device.","PeriodicalId":11452,"journal":{"name":"e Informatica Softw. Eng. J.","volume":"4 1","pages":"39-45"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87755020","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":"Business Model Flexibility and Software-intensive Companies: Opportunities and Challenges","authors":"Magnus Wilson, K. Wnuk, Lars-Håkan Bengtsson","doi":"10.37190/e-inf210109","DOIUrl":"https://doi.org/10.37190/e-inf210109","url":null,"abstract":"","PeriodicalId":11452,"journal":{"name":"e Informatica Softw. Eng. J.","volume":"70 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80288242","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 Potential Friend Recommendation Algorithm for Obtaining Spatial Information","authors":"Hang Zhang, Zhongliang Cai","doi":"10.17706/jsw.16.2.46-54","DOIUrl":"https://doi.org/10.17706/jsw.16.2.46-54","url":null,"abstract":"With the rapid development of social network, friend recommendation algorithm has become an important component of social application. Location-based social network (LBSN) enables users to record and share their locations anytime and anywhere, which is a high quality information source. In order to meet people's demand of expanding social circle and obtaining diversified spatial information when making friends, this paper proposes a potential friend recommendation algorithm based on the similarity of user's check-in behavior and spatial information acquisition level in the real world. Firstly, we employ kernel density estimation and time entropy to solve the problems of data sparsity and low concentration, then employ cosine distance to measure the check-in behavior similarity. Secondly, we analyze users’ spatial distribution of checkin location and cognitive differences on spatial information. Finally, the method mentioned above is tested with dataset called Foursquare. The results of the experiment show that the proposed method has competitive performance.","PeriodicalId":11452,"journal":{"name":"e Informatica Softw. Eng. J.","volume":"17 1","pages":"46-54"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88050328","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":"Permissioned vs. Permissionless Blockchain: How and Why There Is Only One Right Choice","authors":"Siamak Solat, P. Calvez, Farid Naït-Abdesselam","doi":"10.17706/jsw.16.3.95-106","DOIUrl":"https://doi.org/10.17706/jsw.16.3.95-106","url":null,"abstract":"The blockchain structure can be utilized in an efficient way to verify and ensure the integrity of the data and prevent historical transactions from tampering, such that if one block is altered, then the rest of next blocks are no longer valid. However, it is possible to re-calculate all the next blocks in a closed and permissioned network, such that all altered blocks will become valid again. In other words, only chaining blocks to each other, based on the hash of the previous one, cannot ensure the integrity and the security of the data and protect transactions against tampering. In this paper, we motivate why permissionless blockchain in an open network should be considered as the only acceptable type of blockchain and show that permissioned blockchain and closed network makes chaining transactions (i.e. blockchain) as an unhelpful structure. Of course, this never means that we ignore the existing problems in permissionless blockchains (such as, scalability of the network and transaction throughput), but also, we argue that permissioned blockchain cannot be an acceptable solution for those problems, where chaining transactions will no longer be meaningful. In other words, in a closed network, we no longer need to chain transactions. Although, this is a central issue and has been addressed in recent years, we are trying to bring new elements and an enriched point of view.","PeriodicalId":11452,"journal":{"name":"e Informatica Softw. Eng. J.","volume":"51 1","pages":"95-106"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87464491","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}