Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh

The aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).

A standard theoretical neutron energy flux distribution is achieved for the triton-triton nuclear fusion reaction in the range of triton energy about ≤10 MeV. This distribution give raises an evidence to provide the global calculations including the characteristics fusion parameters governing the T-T fusion reaction.

In this paper, the process for finding an approximate solution of nonlinear three-dimensional (3D) Volterra type integral operator equation (N3D-VIOE) in R³ is introduced. The modelling of the majorant function (MF) with the modified Newton method (MNM) is employed to convert N3D-VIOE to the linear 3D Volterra type integral operator equation (L3D-VIOE). The method of trapezoidal rule (TR) and collocation points are utilized to determine the approximate solution of L3D-VIOE by dealing with the linear form of the algebraic system. The existence of the approximate solution and its uniqueness are proved, and illustrative examples are provided to show the accuracy and efficiency of the model.

Mathematical Subject Classificat

The penalized least square method is a popular method to deal with high dimensional data ,where  the number of explanatory variables is large than the sample size . The properties of  penalized least square method are given high prediction accuracy and making estimation and variables selection

 At once. The penalized least square method gives a sparse model ,that meaning a model with small variables so that can be interpreted easily .The penalized least square is not robust ,that means very sensitive to the presence of outlying observation , to deal with this problem, we can used a robust loss function to get the robust penalized least square method ,and get robust penalized estimator and

The aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).

The paper aims at initiating and exploring the concept of extended metric known as the Strong Altering JS-metric, a stronger version of the Altering JS-metric. The interrelation of Strong Altering JS-metric with the b-metric and dislocated metric has been analyzed and some examples have been provided. Certain theorems on fixed points for expansive self-mappings in the setting of complete Strong Altering JS-metric space have also been discussed.

Most of the known cases of strong gravitational lensing involve multiple imaging of an active galactic nucleus. The properties of lensed active galactic nuclei make them promising systems for astrophysical applications of gravitational lensing. So we present a simple model for strong lensing in the gravitational lensed systems to calculate the age of four lensed galaxies, in the present work we take the freedman models with (k curvature index =0) Euclidian case, and the result show a good agreement with the other models.