This paper presents new modification of HPM to solve system of 3 rd order PDEs with initial condition, for finding suitable accurate solutions in a wider domain.

               An update of our research is the first to develop and reform the agricultural sector . and promoting production and productivity of this sector multi-sources , which is the management and beekeeping one source . Been applied to the style of beekeeping mobile promiscuous includes twentieth cell in the Iraqe project of mussiab . in which there exist a variety of crops and trees .

Experiment had proved successful and led to raise the level of npoduction of single Dell of the honey to 49 kg over the previous year and surpassed the average production percell in the province of Babylon , which the amount of 13.945 kg , another

The Skyrme–Hartree–Fock (SHF) method with the Skyrme
parameters; SKxtb, SGII, SKO, SKxs15, SKxs20 and SKxs25 have
been used to investigate the ground state properties of some 2s-1d
shell nuclei with Z=N (namely; 20Ne, 24Mg, 28Si and 32S) such as, the
charge, proton and matter densities, the corresponding root mean
square (rms) radii, neutron skin thickness, elastic electron scattering
form factors and the binding energy per nucleon. The calculated
results have been discussed and compared with the available
experimental data.

This paper aims to investigate the flexural behavior of reinforced concrete beams considering fire resistance by adding Lightweight Expanded Clay Aggregates (LECA) to the concrete mix as partial coarse aggregate replacement. LECA is a type of porous clay with a uniform pore structure with fine, closed cells and hard, tightly sintered skin. The experimental work comprised four reinforced self-compacted concrete beams. All the specimens were identical in their geometrical layout of 1600×240×200 mm, reinforcement details, and support condition (simply supported). For all the beams, the main reinforcement was provided by two bars, each having a diameter of 12 mm, while a bar of 6 mm diameter was employed for the top and shear reinforc

      In this research, carbon nanotubes (CNTs) is prepared  through the Hummers method with a slight change in some of the work steps, thus, a new method has been created for preparing carbon nanotubes which is similar to the original Hummers method that is used to prepare graphene oxide. Then, the suspension carbon nanotubes is transferred to a simple electrode position platform consisting of two electrodes and the cell body for the coating and reduction of the carbon nanotubes on ITO glass which represents the cathode electrode while platinum represents the anode electrode. The deposited layer of carbon nanotubes is examined through the scanning electron microscope technique (SEM), and the images throughout the research show the

With the aim of developing potential antimicrobials, a series of new 5-fluoroisatin derivatives incorporated with different secondary amines (piperidine, morpholine, pyrrolidine, dimethylamine, and diphenylamine) for monomer, and (piperazine) in case of dimer Mannich bases, separately in presence of formaldehyde to obtain Mannich bases of 5-fluoroisatin derivatives, which then each Mannich derivatives reacts with phenylhydrazine to form Schiff bases as final products. The resulting compounds were characterized by two spectroscopic analyses; (Fourier- transform infrared) FT-IR and proton nuclear magnetic resonance spectroscopy (¹H-NMR). In addition, the in vitro antibacterial and antifungal activities were tested against some human pathogen

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