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.

  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

            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

MDS code is a linear code that achieves equality in the Singleton bound, and projective MDS (PG-MDS) is MDS code with independents property of any two columns of its generator matrix.   In this paper, elementary methods for modifying a PG-MDS code of dimensions 2, 3, as extending and lengthening, in order to find new incomplete PG-MDS codes have been used over . Also, two complete PG-MDS codes over  of length  and 28 have been found.

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 purpose of this work is to determine the points and planes of 3-dimensional projective space PG(3,2) over Galois field GF(q), q=2,3 and 5 by designing a computer program.

Philosophy of Abstraction and Construction of Space in Contemporary Iraqi Theater Abstract The aesthetic and stylistic features in the theatrical play develop according to the changes of the age and its developments. Stylistic forms different from the prevailing and familiar in the visions of contemporary theatre directors emerged which adopt the removal of traditional awareness in the creation of the visual space of theatrical discourse, through adopting contemporary formats and structures which depend on the abstraction representations in the aesthetic construction of the contemporary theatre show which is one of the prerequisites of the postmodern theater, that produces aesthetic data based on abstract metaphors in the formation of th

The avoidance of failure in construction projects is not an easy task, which makes the failure of the construction project to achieve its objectives a major problem experienced by all countries in the world, especially Iraq. Where nearly two-thirds of the construction projects in the world have been suffered by significant problems as an increase in the cost of the project, delay in the specified duration for execution, and stopping the project. Therefore it is required to study and apply new methods for managing the construction project to ensure its success and achieve its objectives. The aim of this study is to study the Agile project management method and its impact on the construction project. In addition, to identi

              In this paper, the packing problem for complete (  4)-arcs in  is partially solved. The minimum and the maximum sizes of complete (  4)-arcs in  are obtained. The idea that has been used to do this classification is based on using the algorithm introduced in Section 3 in this paper. Also, this paper establishes the connection between the projective geometry in terms of a complete ( , 4)-arc in  and the algebraic characteristics of a plane quartic curve over the field  represented by the number of its rational points and inflexion points. In addition, some sizes of complete (  6)-arcs in the projective plane of order thirteen are established, namely for  = 53, 54, 55, 56.

The research aims to shed light on the amount of proceeds annual tax for each of the way the contract total and percentage of completion method - see which is better - as well as the current problems arising from the application method of the contract in full in settling accounts tax - to identify problems - related to postpone settling accounts tax in accordance with the way the contract fully and determine the advantages and disadvantages of each of the methods through practical application , and then use the results as inputs to help in the decision to confirm the continuation of the GCT using a full decade in settling accounts tax for long-term construction contracts or forgo them.

Were the result of research the existence of