Implementation of Hybrid Particle Swarm Optimization for Optimized Regression Testing

Software test case optimization improves the efficiency of the software by proper structure and reduces the fault in the software.The existing research applies various optimization methods such as Genetic Algorithm,Crow Search Algorithm,Ant Colony Optimization,etc.,for test case optimization.The existing methods have limitations of lower efficiency in fault diagnosis,higher computa-tional time,and high memory requirement.The existing methods have lower effi-ciency in software test case optimization when the number of test cases is high.This research proposes the Tournament Winner Genetic Algorithm(TW-GA)method to improve the efficiency of software test case optimization.Hospital Information System(HIS)software was used to evaluate TW-GA model perfor-mance in test case optimization.The tournament Winner in the proposed method selects the instances with the best fitness values and increases the exploitation of the search to find the optimal solution.The TW-GA method has higher exploita-tion that helps to find the mutant and equivalent mutation that significantly increases fault diagnosis in the software.The TW-GA method discards the infor-mation with a lower fitness value that reduces the computational time and mem-ory requirement.The TW-GA method requires 5.47 s and the MOCSFO method requires 30 s for software test case optimization.

Managing Software Testing Technical Debt Using Evolutionary Algorithms

Technical debt(TD)happens when project teams carry out technical decisions in favor of a short-term goal(s)in their projects,whether deliberately or unknowingly.TD must be properly managed to guarantee that its negative implications do not outweigh its advantages.A lot of research has been conducted to show that TD has evolved into a common problem with considerable financial burden.Test technical debt is the technical debt aspect of testing(or test debt).Test debt is a relatively new concept that has piqued the curiosity of the software industry in recent years.In this article,we assume that the organization selects the testing artifacts at the start of every sprint.Implementing the latest features in consideration of expected business value and repaying technical debt are among candidate tasks in terms of the testing process(test cases increments).To gain the maximum benefit for the organization in terms of software testing optimization,there is a need to select the artifacts(i.e.,test cases)with maximum feature coverage within the available resources.The management of testing optimization for large projects is complicated and can also be treated as a multi-objective problem that entails a trade-off between the agile software’s short-term and long-term value.In this article,we implement a multi-objective indicatorbased evolutionary algorithm(IBEA)for fixing such optimization issues.The capability of the algorithm is evidenced by adding it to a real case study of a university registration process.

Accelerating Falcon Post-Quantum Digital Signature Algorithm on Graphic Processing Units

Since 2016,the National Institute of Standards and Technology(NIST)has been performing a competition to standardize post-quantum cryptography(PQC).Although Falcon has been selected in the competition as one of the standard PQC algorithms because of its advantages in short key and signature sizes,its performance overhead is larger than that of other lattice-based cryptosystems.This study presents multiple methodologies to accelerate the performance of Falcon using graphics processing units(GPUs)for server-side use.Direct GPU porting significantly degrades performance because the Falcon reference codes require recursive functions in its sampling process.Thus,an iterative sampling approach for efficient parallel processing is presented.In this study,the Falcon software applied a fine-grained execution model and reported the optimal number of threads in a thread block.Moreover,the polynomial multiplication performance was optimized by parallelizing the number-theoretic transform(NTT)-based polynomial multiplication and the fast Fourier transform(FFT)-based multiplication.Furthermore,dummy-based parallel execution methods have been introduced to handle the thread divergence effects.The presented Falcon software on RTX 3090 NVIDA GPU based on the proposed methods with Falcon-512 and Falcon-1024 parameters outperform at 35.14,28.84,and 34.64 times and 33.31,27.45,and 34.40 times,respectively,better than the central processing unit(CPU)reference implementation using Advanced Vector Extensions 2(AVX2)instructions on a Ryzen 95900X running at 3.7 GHz in key generation,signing,and verification,respectively.Therefore,the proposed Falcon software can be used in servers managing multiple concurrent clients for efficient certificate verification and be used as an outsourced key generation and signature generation server for Signature as a Service(SaS).

An Optimized Implementation of a Novel Nonlinear Filter for Color Image Restoration

Image processing is becoming more popular because images are being used increasingly in medical diagnosis,biometric monitoring,and character recognition.But these images are frequently contaminated with noise,which can corrupt subsequent image processing stages.Therefore,in this paper,we propose a novel nonlinear filter for removing“salt and pepper”impulsive noise from a complex color image.The new filter is called the Modified Vector Directional Filter(MVDF).The suggested method is based on the traditional Vector Directional Filter(VDF).However,before the candidate pixel is processed by the VDF,theMVDF employs a threshold and the neighboring pixels of the candidate pixel in a 3×3 filter window to determine whether it is noise-corrupted or noise-free.Several reference color images corrupted by impulsive noise with intensities ranging from 3%to 20%are used to assess theMVDF’s effectiveness.The results of the experiments show that theMVDF is better than the VDF and the Generalized VDF(GVDF)in terms of the PSNR(Peak Signal-to-Noise Ratio),NCD(Normalized Color Difference),and execution time for the denoised image.In fact,the PSNR is increased by 6.554%and 12.624%,the NCD is decreased by 20.273%and 44.147%,and the execution time is reduced by approximately a factor of 3 for the MVDF relative to the VDF and GVDF,respectively.These results prove the efficiency of the proposed filter.Furthermore,a hardware design is proposed for the MVDF using the High-Level Synthesis(HLS)flow in order to increase its performance.This design,which is implemented on the Xilinx ZynqXCZU9EG Field-ProgrammableGate Array(FPGA),allows the restoration of a 256×256-pixel image in 2 milliseconds(ms)only.