A (k,n)-arc is a set of k points of PG(2,q) for some n, but not n + 1 of them, are collinear. A (k,n)-arc is complete if it is not contained in a (k + 1,n)-arc. In this paper we construct complete (kn,n)-arcs in PG(2,5), n = 2,3,4,5, by geometric method, with the related blocking sets and projective codes.
This paper aims to improve the voltage profile using the Static Synchronous Compensator (STATCOM) in the power system in the Kurdistan Region for all weak buses. Power System Simulation studied it for Engineers (PSS\E) software version 33.0 to apply the Newton-Raphson (NR) method. All bus voltages were recorded and compared with the Kurdistan region grid index (0.95≤V ≤1.05), simulating the power system and finding the optimal size and suitable location of Static Synchronous Compensator (STATCOM)for bus voltage improvement at the weakest buses. It shows that Soran and New Koya substations are the best placement for adding STATCOM with the sizes 20 MVAR and 40 MVAR. After adding STATCOM with the sizes [20MVAR and 40MV
... Show MoreA novel technique Sumudu transform Adomian decomposition method (STADM), is employed to handle some kinds of nonlinear time-fractional equations. We demonstrate that this method finds the solution without discretization or restrictive assumptions. This method is efficient, simple to implement, and produces good results. The fractional derivative is described in the Caputo sense. The solutions are obtained using STADM, and the results show that the suggested technique is valid and applicable and provides a more refined convergent series solution. The MATLAB software carried out all the computations and graphics. Moreover, a graphical representation was made for the solution of some examples. For integer and fractional order problems, solutio
... Show MoreThis research presents a particular designing strategy for a free form of surfaces, constructed by the lofting design method. The regarded surfaces were created by sliding a B-spline curves (profile curves), in addition to describing an automatic procedure for selective identification of sampling points in reverse engineering applications using Coordinate Measurement Machine. Two models have been implemented from (Ureol material) to represent the different cases of B-spline types to clarify its scope of application. The interior data of the desired surfaces was designed by MATLAB software, which then were transformed to UG-NX9 software for connecting the sections that were designed in MATLAB program and obtaining G-code programs for the
... Show MoreThe research deals with financial and supplies support from the rulers and governors of the
Arab cities and Islamic regions to the poor of common people and the poor of their own . The
Islamic Arab community was characterized , since the prophet's era , with great humanistic
features that formed the cultural characteristic which organized individual's economic life .
The prophet , senior Muslims and the rich cared a lot about this side . There was a large
variation in the degrees of wealth and poverty in the Muslim Arab community as a heritage
from the pve – Islamic society where there is no concern about helping the needy and poor .
Thus , the research sheds light on the different forms of help offered by rulers a
In this work, we first construct Hermite wavelets on the interval [0,1) with it’s product, Operational matrix of integration 2^k M×2^k M is derived, and used it for solving nonlinear Variational problems with reduced it to a system of algebric equations and aid of direct method. Finally, some examples are given to illustrate the efficiency and performance of presented method.
The major aim of this work is to propose a novel method, the Variation Iteration Adomain Decomposition Method (VIADM), an iterative semi-analytical method to achieve an approximate analytical solution for nonlinear (Volterra / Fredholm) integral equations. This technique depends on applying the Adomain Decomposition Method (ADM) to a nonlinear term that can be solved using Adomain polynomials. The VIADM has been used to break down the Volterra integral equation solution into infinite components. Furthermore, some illustrative examples are given, and the results obtained indicate the proposed method’s accuracy, efficiency, and reliability.
Multiplicative 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