In projective plane over a finite field q F , a conic is the unique complete
(q 1) arc and any arcs on a conic are incomplete arc of degree less than q 1.
These arcs correspond to sets in the projective line over the same field. In this paper,
The number of inequivalent incomplete k  arcs; k  5,6, ,12, on the conic in
PG(2,23) and stabilizer group types are found. Also, the projective line
PG(1,23) has been splitting into two 12-sets and partitioned into six disjoint
tetrads.

: In this study, a linear synchronous machine is compared with a linear transverse flux machine. Both machines have been designed and built with the intention of being used as the power take off in a free piston engine. As both topologies are cylindrical, it is not possible to construct either using just flat laminations and so alternative methods are described and demonstrated. Despite the difference in topology and specification, the machines are compared on a common base in terms of rated force and suitability for use as a generator. Experience gained during the manufacture of two prototypes is described.

A (k,n)-arc A in a finite projective plane PG(2,q) over Galois field GF(q), q=pⁿ for same prime number p and some integer n≥2, is a set of k points, no n+1 of which are collinear.  A (k,n)-arc is complete if it is not contained in a(k+1,n)-arc.  In this paper, the maximum complete (k,n)-arcs, n=2,3 in PG(2,4) can be constructed from the equation of the conic.

            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

Background: Machine learning relies on a hybrid of analytics, including regression analyses. There have been no attempts to deploy a sinusoidal transformation of data to enhance linear regression models.
Objectives: We aim to optimize linear models by implementing sinusoidal transformation to minimize the sum of squared error.
Methods: We implemented non-Bayesian statistics using SPSS and MatLab. We used Excel to generate 30 trials of linear regression models, and each has 1,000 observations. We utilized SPSS linear regression, Wilcoxon signed-rank test, and Cronbach’s alpha statistics to evaluate the performance of the optimization model. Results: The sinusoidal

In this paper, we study the effect of group homomorphism on the chain of level subgroups of fuzzy groups. We prove a necessary and sufficient conditions under which the chains of level subgroups of homomorphic images of an a arbitrary fuzzy group can be obtained from that of the fuzzy groups . Also, we find the chains of level subgroups of homomorphic images and pre-images of arbitrary fuzzy groups