Search

Test case selection is to minimize the time and effort spent on software testing in real-time practice. During software testing, software firms need techniques to finish the testing in a stipulated time while uncompromising on quality. The motto is to select a subset of test cases rather than take up all available test cases to uncover most bugs. Our proposed model in the research study effort is termed SCARF-RT, which stands for Similarity coefficient (SC), Creating Acronyms, Regression test (RT), and Fuzzy set (FS) with Dataset (DS). Clustering of test cases using ranking and also based on similarity coefficients is to be implemented. This research considered eleven different features for clustering the test cases. Two techniques have been used. Firstly, each cluster will, to a certain extent, encompass a collection of distinct traits. Depending on the coverage of the feature, a cluster of test cases might be chosen. The ranking approach was used to create these groupings. The second methodology finds similarity among test cases based on eleven features. Then, the maxmin composition is used to find fuzzy equivalences upon which clusters are formed. Most similar test cases are clustered. Test cases of every cluster are selected as a test suite. The outcomes of this research show that the selected test cases based on the proposed approaches are better than existing methodologies in selecting test cases with less duration and at the same time not compromising on quality. Both fuzzy rank-based clustering and similarity coefficient-based clustering test case selection approaches have been developed and implemented. With the help of these methods, testers may quickly choose test cases based on the suggested characteristics and complete regression testing more quickly. [ABSTRACT FROM AUTHOR]

Managing physical objects in the network's periphery is made possible by the Internet of Things (IoT), revolutionizing human life. Open attacks and unauthorized access are possible with these IoT devices, which exchange data to enable remote access. These attacks are often detected using intrusion detection methodologies, although these systems' effectiveness and accuracy are subpar. This paper proposes a new voting classifier composed of an ensemble of machine learning models trained and optimized using metaheuristic optimization. The employed metaheuristic optimizer is a new version of the whale optimization algorithm (WOA), which is guided by the dipper throated optimizer (DTO) to improve the exploration process of the traditionalWOA optimizer. The proposed voting classifier categorizes the network intrusions robustly and efficiently. To assess the proposed approach, a dataset created from IoT devices is employed to record the efficiency of the proposed algorithm for binary attack categorization. The dataset records are balanced using the locality-sensitive hashing (LSH) and Synthetic Minority Oversampling Technique (SMOTE). The evaluation of the achieved results is performed in terms of statistical analysis and visual plots to prove the proposed approach's effectiveness, stability, and significance. The achieved results confirmed the superiority of the proposed algorithm for the task of network intrusion detection. [ABSTRACT FROM AUTHOR]