Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of

The goal of this paper is to expose a new numerical method for solving initial value time-lag of delay differential equations by employing a high order improving formula of Euler method known as third order Euler method. Stability condition is discussed in detail for the proposed technique. Finally some examples are illustrated to verify the validity, efficiency and accuracy of the method.

Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of cove

            The article describes a certain computation method of -arcs to construct the number of distinct -arcs in  for . In this method, a new approach employed to compute the number of -arcs and the number of distinct arcs respectively. This approach is based on choosing the number of inequivalent classes } of -secant distributions that is the number of 4-secant, 3-secant, 2-secant, 1-secant and 0-secant in each process. The maximum size of -arc that has been constructed by this method is . The new method is a new tool to deal with the programming difficulties that sometimes may lead to programming problems represented by the increasing number of arcs. It is essential to reduce the established number of -arcs in each cons

  In this work, some of numerical methods for solving first order linear Volterra IntegroDifferential Equations are presented.      The numerical solution of these equations is obtained by using Open Newton Cotes formula.      The Open Newton Cotes formula is applied to find the optimum solution for this equation.      The computer program is written in (MATLAB) language (version 6)

In this paper, we established a mathematical model of an SI1I2R epidemic disease with saturated incidence and general recovery functions of the first disease I1. Considering the basic reproduction number, we obtained conditions for both disease-free and co-existing cases. The equilibrium points local stability is verified by using the Routh-Hurwitz criterion, while for the global stability, we used a suitable Lyapunov function to analyze the endemic spread of the positive equilibrium point. Moreover, we carried out the local bifurcation around both equilibrium points (disease-free and co-existing), where we obtained that the disease-free equilibrium point undergoes a transcritical bifurcation. We conduct numerical simulations that suppo

In this research، a comparison has been made between the robust estimators of (M) for the Cubic Smoothing Splines technique، to avoid the problem of abnormality in data or contamination of error، and the traditional estimation method of Cubic Smoothing Splines technique by using two criteria of differentiation which are (MADE، WASE) for different sample sizes and disparity levels to estimate the chronologically different coefficients functions for the balanced longitudinal data which are characterized by observations obtained through (n) from the independent subjects، each one of them is measured repeatedly by group of  specific time points (m)،since the frequent measurements within the subjects are almost connected an