In this work, we construct and classify the projectively distinct (k,3)-arcs in PG(2,9), where k ≥ 5, and prove that the complete (k,3)-arcs do not exist, where 5 ≤ k ≤ 13. We found that the maximum complete (k,3)-arc in PG(2,q) is the (16,3)-arc and the minimum complete (k,3)-arc in PG(2,q) is the (14,3)-arc. Moreover, we found the complete (k,3)-arcs between them.
In this study , the effect of an organic compound prepared as derivative of oxazepine tested on the activities of aspartate amino trasferase (AST) and alanin amino transferase (ALT). The kinetic study of such enzymes is in the presence of oxazepine derivative. The results revealed that the organic compound is a non competitive inhibitor for both enzymes. The Km value for AST is 1.3 × 10-3 M and Vmax for the uninhibited is 200 U/mL and for the inhibited is 111.1 U/mL while Km value for ALT is 2.5 × 10-3 M and Vmax are 89.66 U/mL and 56.77 U/mL for the uninhibited and inhibited enzyme respectively.
The aim of this paper is to construct cyclic subgroups of the projective general linear group over from the companion matrix, and then form caps of various degrees in . Geometric properties of these caps as secant distributions and index distributions are given and determined if they are complete. Also, partitioned of into disjoint lines is discussed.
Number theorists believe that primes play a central role in Number theory and that solving problems related to primes could lead to the resolution of many other unsolved conjectures, including the prime k-tuples conjecture. This paper aims to demonstrate the existence of this conjecture for admissible k-tuples in a positive proportion. The authors achieved this by refining the methods of “Goldston, Pintz and Yildirim” and “James Maynard” for studying bounded gaps between primes and prime k-tuples. These refinements enabled to overcome the previous limitations and restrictions and to show that for a positive proportion of admissible k-tuples, there is the existence of the prime k-tuples conjecture holding for each “k”. The sig
... Show MoreIn this article, we introduced a new concept of mappings called δZA - Quasi contractive mapping and we study the K*- iteration process for approximation of fixed points, and we proved that this iteration process is faster than the existing leading iteration processes like Noor iteration process, CR -iteration process, SP and Karahan Two- step iteration process for 𝛿𝒵𝒜 − quasi contraction mappings. We supported our analytic proof by a numerical example.
Single crystals of pure and Cu+2,Fe+2 doped potassium sulfate were grown from aqueous solutions by the slow evaporation technique at room temperature. with dimension of (11x9 x4)mm3 and ( 10x 8x 5)mm3 for crystal doping with Cu &Fe respectively. The influence of doping on crystal growth and its structure revealed a change in their lattice parameters(a=7.479 Ã… ,b=10.079 Ã… ,c=5.772 Ã…)for pure and doping (a=9.687 Ã…, b=14.926 Ã… ,c= 9.125 Ã…) & (a=9.638 Ã… , b= 8.045 Ã… ,c=3.271 Ã…) for Cu & Fe respectively. Structure analysis of the grown crystals were obtained by X-Ray powder diffraction measurements. The diffraction patterns were analyzed by the Rietveld refinement method. Rietveld refinement plo
... Show MoreMultiplicative inverse in GF (2 m ) is a complex step in some important application such as Elliptic Curve Cryptography (ECC) and other applications. It operates by multiplying and squaring operation depending on the number of bits (m) in the field GF (2 m ). In this paper, a fast method is suggested to find inversion in GF (2 m ) using FPGA by reducing the number of multiplication operations in the Fermat's Theorem and transferring the squaring into a fast method to find exponentiation to (2 k ). In the proposed algorithm, the multiplicative inverse in GF(2 m ) is achieved by number of multiplications depending on log 2 (m) and each exponentiation is operates in a single clock cycle by generating a reduction matrix for high power of two ex
... Show More<em>The aim of the research is to set a set of BioKinematic variables for the step of crossing barriers (3–6–9) in a 110-meter barrier for young runners. The researchers concluded the study by interpreting and discussing the results that the most important variables must be relied upon when training and selecting runners that got the best saturation on their factors: 1-The first factor which refers to the total distance of the plan to pass the third barrier + the total distance of the plan to pass the ninth barrier + the total distance Plan to cross the sixth barrier. 2-The second factor which refers to the total vertical speed before passing the third barrier + the total vertical speed before the sixth barrier + the total vertica
... Show MoreSince the introduction of the HTTP/3, research has focused on evaluating its influences on the existing adaptive streaming over HTTP (HAS). Among these research, due to irrelevant transport protocols, the cross-protocol unfairness between the HAS over HTTP/3 (HAS/3) and HAS over HTTP/2 (HAS/2) has caught considerable attention. It has been found that the HAS/3 clients tend to request higher bitrates than the HAS/2 clients because the transport QUIC obtains higher bandwidth for its HAS/3 clients than the TCP for its HAS/2 clients. As the problem originates from the transport layer, it is likely that the server-based unfairness solutions can help the clients overcome such a problem. Therefore, in this paper, an experimental study of the se
... Show More