{"title":"Two-stage meta-heuristic for part-packing and build-scheduling problem in parallel additive manufacturing","authors":"Seung Jae Lee, B. Kim","doi":"10.2139/ssrn.4113619","DOIUrl":"https://doi.org/10.2139/ssrn.4113619","url":null,"abstract":"","PeriodicalId":8218,"journal":{"name":"Appl. Comput. Intell. Soft Comput.","volume":"10 1","pages":"110132"},"PeriodicalIF":0.0,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87763794","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}
Antonio Della Cioppa, I. D. Falco, T. Koutny, U. Scafuri, Martin Ubl, E. Tarantino
{"title":"Reducing high-risk glucose forecasting errors by evolving interpretable models for Type 1 diabetes","authors":"Antonio Della Cioppa, I. D. Falco, T. Koutny, U. Scafuri, Martin Ubl, E. Tarantino","doi":"10.2139/ssrn.4189444","DOIUrl":"https://doi.org/10.2139/ssrn.4189444","url":null,"abstract":"","PeriodicalId":8218,"journal":{"name":"Appl. Comput. Intell. Soft Comput.","volume":"32 1","pages":"110012"},"PeriodicalIF":0.0,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86010517","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":"AVFakeNet: A unified end-to-end Dense Swin Transformer deep learning model for audio-visual deepfakes detection","authors":"Hafsa Ilyas, A. Javed, K. Malik","doi":"10.2139/ssrn.4216427","DOIUrl":"https://doi.org/10.2139/ssrn.4216427","url":null,"abstract":"","PeriodicalId":8218,"journal":{"name":"Appl. Comput. Intell. Soft Comput.","volume":"42 1","pages":"110124"},"PeriodicalIF":0.0,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85440026","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}
Pub Date : 2023-01-25DOI: 10.48550/arXiv.2301.10404
Khlood Ahmad, Mohamed Almorsy, Chetan Arora, Muneera Bano, John C. Grundy
[Context] Engineering Artificial Intelligence (AI) software is a relatively new area with many challenges, unknowns, and limited proven best practices. Big companies such as Google, Microsoft, and Apple have provided a suite of recent guidelines to assist engineering teams in building human-centered AI systems. [Objective] The practices currently adopted by practitioners for developing such systems, especially during Requirements Engineering (RE), are little studied and reported to date. [Method] This paper presents the results of a survey conducted to understand current industry practices in RE for AI (RE4AI) and to determine which key human-centered AI guidelines should be followed. Our survey is based on mapping existing industrial guidelines, best practices, and efforts in the literature. [Results] We surveyed 29 professionals and found most participants agreed that all the human-centered aspects we mapped should be addressed in RE. Further, we found that most participants were using UML or Microsoft Office to present requirements. [Conclusion] We identify that most of the tools currently used are not equipped to manage AI-based software, and the use of UML and Office may pose issues to the quality of requirements captured for AI. Also, all human-centered practices mapped from the guidelines should be included in RE.
{"title":"Requirements Practices and Gaps When Engineering Human-Centered Artificial Intelligence Systems","authors":"Khlood Ahmad, Mohamed Almorsy, Chetan Arora, Muneera Bano, John C. Grundy","doi":"10.48550/arXiv.2301.10404","DOIUrl":"https://doi.org/10.48550/arXiv.2301.10404","url":null,"abstract":"[Context] Engineering Artificial Intelligence (AI) software is a relatively new area with many challenges, unknowns, and limited proven best practices. Big companies such as Google, Microsoft, and Apple have provided a suite of recent guidelines to assist engineering teams in building human-centered AI systems. [Objective] The practices currently adopted by practitioners for developing such systems, especially during Requirements Engineering (RE), are little studied and reported to date. [Method] This paper presents the results of a survey conducted to understand current industry practices in RE for AI (RE4AI) and to determine which key human-centered AI guidelines should be followed. Our survey is based on mapping existing industrial guidelines, best practices, and efforts in the literature. [Results] We surveyed 29 professionals and found most participants agreed that all the human-centered aspects we mapped should be addressed in RE. Further, we found that most participants were using UML or Microsoft Office to present requirements. [Conclusion] We identify that most of the tools currently used are not equipped to manage AI-based software, and the use of UML and Office may pose issues to the quality of requirements captured for AI. Also, all human-centered practices mapped from the guidelines should be included in RE.","PeriodicalId":8218,"journal":{"name":"Appl. Comput. Intell. Soft Comput.","volume":"6 1","pages":"110421"},"PeriodicalIF":0.0,"publicationDate":"2023-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89300019","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}
Ransomware attacks are one of the most dangerous related crimes in the coin market. To increase the challenge of fighting the attack, early detection of ransomware seems necessary. In this article, we propose a high-performance Bitcoin transaction predictive system that investigates Bitcoin payment transactions to learn data patterns that can recognize and classify ransomware payments for heterogeneous bitcoin networks into malicious or benign transactions. The proposed approach makes use of three supervised machine learning methods to learn the distinctive patterns in Bitcoin payment transactions, namely, logistic regression (LR), random forest (RF), and Extreme Gradient Boosting (XGBoost). We evaluate these ML-based predictive models on the BitcoinHeist ransomware dataset in terms of classification accuracy and other evaluation measures such as confusion matrix, recall, and F1-score. It turned out that the experimental results recorded by the XGBoost model achieved an accuracy of 99.08%. As a result, the resulting model accuracy is higher than many recent state-of-the-art models developed to detect ransomware payments in Bitcoin transactions.
{"title":"Machine Learning-Based Ransomware Classification of Bitcoin Transactions","authors":"S. Alsaif","doi":"10.1155/2023/6274260","DOIUrl":"https://doi.org/10.1155/2023/6274260","url":null,"abstract":"Ransomware attacks are one of the most dangerous related crimes in the coin market. To increase the challenge of fighting the attack, early detection of ransomware seems necessary. In this article, we propose a high-performance Bitcoin transaction predictive system that investigates Bitcoin payment transactions to learn data patterns that can recognize and classify ransomware payments for heterogeneous bitcoin networks into malicious or benign transactions. The proposed approach makes use of three supervised machine learning methods to learn the distinctive patterns in Bitcoin payment transactions, namely, logistic regression (LR), random forest (RF), and Extreme Gradient Boosting (XGBoost). We evaluate these ML-based predictive models on the BitcoinHeist ransomware dataset in terms of classification accuracy and other evaluation measures such as confusion matrix, recall, and F1-score. It turned out that the experimental results recorded by the XGBoost model achieved an accuracy of 99.08%. As a result, the resulting model accuracy is higher than many recent state-of-the-art models developed to detect ransomware payments in Bitcoin transactions.","PeriodicalId":8218,"journal":{"name":"Appl. Comput. Intell. Soft Comput.","volume":"29 1","pages":"6274260:1-6274260:10"},"PeriodicalIF":0.0,"publicationDate":"2023-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81136372","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}
Dominating set of a graph can be defined as the set of vertices that can cover all other vertices of the graph. The minimum weight dominating set (MWDS) is the minimum number of vertices in the dominating set with minimum total weight. In recent times, the chemical reaction optimization algorithm (CRO) has shown its supremacy in solving these types of problems. Therefore in this paper, a novel approach based on CRO has been proposed to solve the MWDS problem. The proposed method uses a repair-based technique to generate a molecule. To make the solution feasible by covering all vertices and to get better results, three supporting operators are implemented along with the CRO operators. Besides this, two repair operators are introduced. In the first repair operator, the searching procedure works based on the scaling properties of vertices, and the second one is a unique method for eliminating common neighbors of vertices of the dominating set. The performance of the proposed method is better than any other existing related algorithms. The performance is measured from different graphs of the benchmark datasets. It can be mentioned that the proposed method takes minimal running time to obtain the minimum weight compared to other benchmark methods.
{"title":"Chemical Reaction Optimization for Minimum Weight Dominating Set","authors":"Pritam Khan Boni, Md. Rafiqul Islam","doi":"10.1155/2023/9640807","DOIUrl":"https://doi.org/10.1155/2023/9640807","url":null,"abstract":"Dominating set of a graph can be defined as the set of vertices that can cover all other vertices of the graph. The minimum weight dominating set (MWDS) is the minimum number of vertices in the dominating set with minimum total weight. In recent times, the chemical reaction optimization algorithm (CRO) has shown its supremacy in solving these types of problems. Therefore in this paper, a novel approach based on CRO has been proposed to solve the MWDS problem. The proposed method uses a repair-based technique to generate a molecule. To make the solution feasible by covering all vertices and to get better results, three supporting operators are implemented along with the CRO operators. Besides this, two repair operators are introduced. In the first repair operator, the searching procedure works based on the scaling properties of vertices, and the second one is a unique method for eliminating common neighbors of vertices of the dominating set. The performance of the proposed method is better than any other existing related algorithms. The performance is measured from different graphs of the benchmark datasets. It can be mentioned that the proposed method takes minimal running time to obtain the minimum weight compared to other benchmark methods.","PeriodicalId":8218,"journal":{"name":"Appl. Comput. Intell. Soft Comput.","volume":"18 1","pages":"9640807:1-9640807:27"},"PeriodicalIF":0.0,"publicationDate":"2023-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78940648","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 Fuzzy AHP-based approach for prioritization of cost overhead factors in agile software development","authors":"Syed Abu Saeed, Saif Ur Rehman Khan, A. Mashkoor","doi":"10.2139/ssrn.4237372","DOIUrl":"https://doi.org/10.2139/ssrn.4237372","url":null,"abstract":".","PeriodicalId":8218,"journal":{"name":"Appl. Comput. Intell. Soft Comput.","volume":"21 1","pages":"109977"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89869544","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：