In this work, we construct projectively distinct (k,3)-arcs in the projective plane PG(2,9) by applying a geometrical method. The cubic curves have been been constructed by using the general equation of the cubic. We found that there are complete (13,3)-arcs, complete (15,3)-arcs and we found that the only (16,3)-arcs lead to maximum completeness
In this work, we construct complete (K, n)-arcs in the projective plane over Galois field GF (11), where 12 2 ≤ ≤ n ,by using geometrical method (using the union of some maximum(k,2)- Arcs , we found (12,2)-arc, (19,3)-arc , (29,4)-arc, (38,5)-arc , (47,6)-arc, (58,7)-arc, (68,6)-arc, (81,9)-arc, (96,10)-arc, (109,11)-arc, (133,12)-arc, all of them are complete arc in PG(2, 11) over GF(11).
A (b,t)-blocking set B in PG(2,q) is set of b points such that every line of PG(2,q) intersects B in at least t points and there is a line intersecting B in exactly t points. In this paper we construct a minimal (b,t)-blocking sets, t = 1,2,3,4,5 in PG(2,5) by using conics to obtain complete arcs and projective codes related with them.
A -set in the projective line is a set of projectively distinct points. From the fundamental theorem over the projective line, all -sets are projectively equivalent. In this research, the inequivalent -sets in have been computed and each -set classified to its -sets where Also, the has been splitting into two distinct -sets, equivalent and inequivalent.
The goal of this paper is to construct the linear code, and its dual which corresponding to classification of projective line PG(1,31), we will present Some important results of coding theory, the generator matrix of every linear code in PG(1,31) is found, A parity check matrix is also found . The mathematical programming language GAP was a main computing tool .
The purpose of this article is to partition PG(3,11) into orbits. These orbits are studied from the view of caps using the subgroups of PGL(4,11) which are determined by nontrivial positive divisors of the order of PG(3,11). The τ_i-distribution and c_i-distribution are also founded for each cap.
In this paper, the -caps are created by action of groups on the three-dimensional projective space over the Galois field of order eight. The types of -caps are also studied and determined either they form complete caps or not.
The 2D imaging survey was conducted across an unknown K- 3 cavity that is located in Haditha area-Western Iraq.2D measurements are collected along two intercrossing traverses above the cavity with 105m length of each one. Dipole-dipole array is performed with n-factor of 6 and a-spacing equals to 5m. The inverse models of 2D imaging technique showed clearly that the resistivity contrast between the anomalous part of cavity and background resistivity of rocks is about 800:100 Ωm .In addition, the invers models showed that the depth from ground surface to the upper roof of cavity approximately equals to 11m near the cavity operator. So, the K-3 cavity is well defined from 2D imaging with Dipole –dipole array in comparison with the actua
... Show MoreA cap of size and degree in a projective space, (briefly; (k,r)-cap) is a set of points with the property that each line in the space meet it in at most points. The aim of this research is to extend the size and degree of complete caps and incomplete caps, (k, r)-caps of degree r<12 in the finite projective space of dimension three over the finite field of order eleven, which already exist and founded by the action of subgroups of the general linear group over the finite field of order eleven and degree four, to (k+i,r+1) -complete caps. These caps have been classified by giving the t_i-distribution and -distribution. The Gap programming has been used to execute the designed algorit
... Show MoreThe problem statement discussed in this paper is a new technique for the presentation of painterly rendering that uses a K-mean segmentation to divide the input image into a set of regions (depending on the grayscale of the regions). Segmenting the input image helps users use different brush strokes and easily change the strokes' shape, size, or orientation for different regions. Every region is painted using different brush kinds. The properties of the brush strokes are chosen depending on the region's details. The brush stroke properties, such as size, color, shape, location, and orientation, are extracted from the source image using statistical tools. The number of regions is set up manually and depends on the input image. This
... Show More