Explore the vast range of titles available.

The increase of productivity and decrease of production loss is an important goal for modern industry to stay economically competitive. For that, efficient fault management and quick amendment of faults in production lines are needed. The prioritization of faults accelerates the fault amendment process but depends on preceding fault detection and classification. Data-driven methods can support fault management. The increasing usage of sensors to monitor machine health status in production lines leads to large amounts of data and high complexity. Machine Learning methods exploit this data to support fault management. This paper reviews literature that presents methods for several steps of fault management and provides an overview of requirements for fault handling and methods for fault detection, fault classification, and fault prioritization, as well as their prerequisites. The paper shows that fault prioritization lacks research about available learning methods and underlines that expert opinions are needed.

Artificial intelligence (AI) systems are increasingly used in corporate security measures to predict the status of assets and suggest appropriate procedures. These programs are also designed to reduce repair time. One way to create an efficient system is to integrate physical repair agents with a computerized management system to develop an intelligent system. To address this, there is a need for a new technique to assist operators in interacting with a predictive system using natural language. The system also uses double neural network convolutional models to analyze device data. For fault prioritization, a technique utilizing fuzzy logic is presented. This strategy ranks the flaws based on the harm or expense they produce. However, the method’s success relies on ongoing improvement in spoken language comprehension through language modification and query processing. To carry out this technique, a conversation-driven design is necessary. This type of learning relies on actual experiences with the assistants to provide efficient learning data for language and interaction models. These models can be trained to have more natural conversations. To improve accuracy, academics should construct and maintain publicly usable training sets to update word vectors. We proposed the model dataset (DS) with the Adam (AD) optimizer, Ridge Regression (RR) and Feature Mapping (FP). Our proposed algorithm has been coined with an appropriate acronym DSADRRFP. The same proposed approach aims to leverage each component’s benefits to enhance the predictive model’s overall performance and precision. This ensures the model is up-to-date and accurate. In conclusion, an AI system integrated with physical repair agents is a useful tool in corporate security measures. However, it needs to be refined to extract data from the operating system and to interact with users in a natural language. The system also needs to be constantly updated to improve accuracy.

This study investigates switching sequences in AC-AC converters for conveyor systems. The research explores commutation techniques, power quality concerns, and system performance. It aims to understand control strategies that impact power factor and stability. Safe commutation is crucial for industrial applications to ensure efficient operations. Various converter technologies are analyzed to optimize energy efficiency and reliability. The study focuses on minimizing harmonic distortion through effective switching approaches. Fault scenarios are evaluated to assess the converter response under fluctuating conditions. Protection mechanisms are also discussed for improving system safety and voltage stability. The findings contribute to enhancing the performance of industrial conveyor applications. Harmonic disturbances significantly affect power quality in AC-AC conversion systems. Proper switching techniques must be implemented to reduce electrical interference issues. The research highlights the importance of reliable commutation for operational continuity. Industrial systems require optimized control to maintain efficiency under variable loads. Fault conditions influence power stability and overall system functionality. Robust switching schemes are essential to minimizing operational risks and failures. The study findings provide insights into future advancements in AC-AC converters. It supports engineers in developing more effective industrial power management solutions. The research emphasizes innovative strategies for improving safety and efficiency. Ensuring stable power transmission is critical for the reliability of conveyor systems. The study provides contribution to advancing industrial power electronics and control methodologies.

Mutant selection refers to the problem of choosing, among a large number of mutants, the (few) ones that should be used by the testers. In view of this, we investigate the problem of selecting the fault revealing mutants, i.e., the mutants that are killable and lead to test cases that uncover unknown program faults. We formulate two variants of this problem: the fault revealing mutant selection and the fault revealing mutant prioritization. We argue and show that these problems can be tackled through a set of ‘static’ program features and propose a machine learning approach, named FaRM, that learns to select and rank killable and fault revealing mutants. Experimental results involving 1,692 real faults show the practical benefits of our approach in both examined problems. Our results show that FaRM achieves a good trade-off between application cost and effectiveness (measured in terms of faults revealed). We also show that FaRM outperforms all the existing mutant selection methods, i.e., the random mutant sampling, the selective mutation and defect prediction (mutating the code areas pointed by defect prediction). In particular, our results show that with respect to mutant selection, our approach reveals 23% to 34% more faults than any of the baseline methods, while, with respect to mutant prioritization, it achieves higher average percentage of revealed faults with a median difference between 4% and 9% (from the random mutant orderings).

Metamorphic testing is a valuable approach to verifying machine learning programs where traditional oracles are unavailable or difficult to apply. This paper proposes a technique to prioritize metamorphic relations (MRs) in metamorphic testing for machine learning and deep learning systems, aiming to enhance early fault detection. We introduce five metrics based on diversity in source and follow-up test cases to prioritize MRs. The effectiveness of our proposed prioritization methods is evaluated on three machine learning and one deep learning algorithm implementation. We compare our approach against random-based, fault-based, and neuron activation coverage-based MR ordering. The results show that our data diversity-based prioritization performs comparably to fault-based prioritization, reducing fault detection time by up to 62% compared to random MR execution. Our proposed metrics outperformed neuron activation coverage-based prioritization, providing 5–550% higher fault detection effectiveness. Overall, our approach to prioritizing metamorphic relations leads to increased fault detection effectiveness and reduced average fault detection time. This improvement in efficiency can result in significant time and cost savings when applying metamorphic testing to machine learning and deep learning systems.

Regression testing of large-scale, data-intensive software systems demands efficient test-case prioritization strategies to detect faults early while minimizing computational cost. Conventional prioritization methods, such as coverage-based and risk-based approaches, lack adaptability to evolving project dynamics and fail to leverage the rich test-execution data accumulated over continuous integration cycles. This study presents a Data-Driven Test-Case Prioritization (DD-TCP) Framework that incorporates statistical and machine-learning techniques to model the relationship between test-case features and historical fault detection outcomes. The framework extracts multidimensional attributes including code-change frequency, dependency metrics, execution duration, and past failure density, which are normalized and embedded into a predictive ranking model based on gradient-boosted decision trees. Test cases are then dynamically reordered using a probabilistic gain function that maximizes early fault detection probability. Comprehensive simulations on representative open-source project datasets and synthetically generated large-scale test suites reveal that the proposed Data-Driven Test-Case Prioritization (DD-TCP) framework consistently achieves superior performance, yielding a 32.4% improvement in Average Percentage of Faults Detected (APFD) and a 27.1% reduction in execution overhead relative to baseline methods. The results demonstrate the feasibility of data-centric intelligence for scalable regression testing and provide an analytical foundation for integrating machine learning into next-generation Software Quality Assurance pipelines.

Test Case Prioritization (TCP) techniques perform better than other regression test optimization techniques including Test Suite Reduction (TSR) and Test Case Selection (TCS). Many TCP techniques are available, and their performance is usually measured through a metric Average Percentage of Fault Detection (APFD). This metric is value-neutral because it only works well when all test cases have the same cost, and all faults have the same severity. Using APFD for performance evaluation of test case orders where test cases cost or faults severity varies is prone to produce false results. Therefore, using the right metric for performance evaluation of TCP techniques is very important to get reliable and correct results. In this paper, two value-based TCP techniques have been introduced using Genetic Algorithm (GA) including Value-Cognizant Fault Detection-Based TCP (VCFDB-TCP) and Value-Cognizant Requirements Coverage-Based TCP (VCRCB-TCP). Two novel value-based performance evaluation metrics are also introduced for value-based TCP including Average Percentage of Fault Detection per value (APFDv) and Average Percentage of Requirements Coverage per value (APRCv). Two case studies are performed to validate proposed techniques and performance evaluation metrics. The proposed GA-based techniques outperformed the existing state-of-the-art TCP techniques including Original Order (OO), Reverse Order (REV-O), Random Order (RO), and Greedy algorithm.

Regression testing is an expensive, but important, process. Unfortunately, there may be insufficient resources to allow for the reexecution of all test cases during regression testing. In this situation, test case prioritization techniques aim to improve the effectiveness of regression testing by ordering the test cases so that the most beneficial are executed first. Previous work on regression test case prioritization has focused on greedy algorithms. However, it is known that these algorithms may produce suboptimal results because they may construct results that denote only local minima within the search space. By contrast, metaheuristic and evolutionary search algorithms aim to avoid such problems. This paper presents results from an empirical study of the application of several greedy, metaheuristic, and evolutionary search algorithms to six programs, ranging from 374 to 11,148 lines of code for three choices of fitness metric. The paper addresses the problems of choice of fitness metric, characterization of landscape modality, and determination of the most suitable search technique to apply. The empirical results replicate previous results concerning greedy algorithms. They shed light on the nature of the regression testing search space, indicating that it is multimodal. The results also show that genetic algorithms perform well, although greedy approaches are surprisingly effective, given the multimodal nature of the landscape

A software product line comprises a family of software products that share a common set of features. Testing an entire product-line product-by-product is infeasible due to the potentially exponential number of products in the number of features. Accordingly, several sampling approaches have been proposed to select a presumably minimal, yet sufficient number of products to be tested. Since the time budget for testing is limited or even a priori unknown, the order in which products are tested is crucial for effective product-line testing. Prioritizing products is required to increase the probability of detecting faults faster. In this article, we propose similarity-based prioritization, which can be efficiently applied on product samples. In our approach, we incrementally select the most diverse product in terms of features to be tested next in order to increase feature interaction coverage as fast as possible during product-by-product testing. We evaluate the gain in the effectiveness of similarity-based prioritization on three product lines with real faults. Furthermore, we compare similarity-based prioritization to random orders, an interaction-based approach, and the default orders produced by existing sampling algorithms considering feature models of various sizes. The results show that our approach potentially increases effectiveness in terms of fault detection ratio concerning faults within real-world product-line implementations as well as synthetically seeded faults. Moreover, we show that the default orders of recent sampling algorithms already show promising results, which, however, can still be improved in many cases using similarity-based prioritization.

Regression testing is a type of software testing that is performed during software maintenance in order to validate any additional modifications made to the functionality of the software. The objective of test case prioritization in regression is to establish a ranking for the test cases, giving priority to those that effectively cover a substantial portion of code or faults, while also minimizing the required execution time. Managing the prioritization of test cases in accordance with the tester's requirements can be a challenging task, given the significant number of test cases generated during development and maintenance. Different algorithms, including Greedy approaches, meta-heuristic techniques, and other optimization methods, are utilized to prioritize test cases, taking into account the constraints specified by the software tester. This paper employs a ranking-based NSGA-2 algorithm for the purpose of test case ordering and prioritization. The focus is on test cases that are responsive to faults, specifically those that result from modifications or the introduction of new software functionality. The proposed methodology entails the prioritization of test cases by leveraging their historical data. In addition to the Sensitive Index, other primary objectives of test prioritization include considering the execution cost and APFD (average percentage of faults detected). The proposed model has undergone testing on a total of eight applications, consisting of five handcrafted and three benchmark Java-based applications. Additionally, it has been subjected to comparison against several state-of-the-art algorithms commonly employed in the field of test case prioritization.