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

The purpose of this work is to study the classification and construction of (k,3)-arcs in the projective plane PG(2,7). We found that there are two (5,3)-arcs, four (6,3)-arcs, six (7,3)arcs, six (8,3)-arcs, seven (9,3)-arcs, six (10,3)-arcs and six (11,3)-arcs. All of these arcs are incomplete. The number of distinct (12,3)-arcs are six, two of them are complete. There are four distinct (13,3)-arcs, two of them are complete and one (14,3)-arc which is incomplete. There exists one complete (15,3)-arc.

This work is devoted to study the properties of the ground states such as the root-mean square ( ) proton, charge, neutron and matter radii, nuclear density distributions and elastic electron scattering charge form factors for Carbon Isotopes (9C, 12C, 13C, 15C, 16C, 17C, 19C and 22C). The calculations are based on two approaches; the first is by applying the transformed harmonic-oscillator (THO) wavefunctions in local scale transformation (LST) to all nuclear subshells for only 9C, 12C, 13C and 22C. In the second approach, the 9C, 15C, 16C, 17C and 19C isotopes are studied by dividing the whole nuclear system into two parts; the first is the compact core part and the second is the halo part. The core and halo parts are studied using the

Abstract 

For sparse system identification,recent suggested algorithms are  -norm Least Mean Square (  -LMS), Zero-Attracting LMS (ZA-LMS), Reweighted Zero-Attracting LMS (RZA-LMS), and p-norm LMS (p-LMS) algorithms, that have modified the cost function of the conventional LMS algorithm by adding a constraint of coefficients sparsity. And so, the proposed algorithms are named  -ZA-LMS,