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.
In present project, new Schiff base of 4, 4'- (((1E, 1'E)-1,4-.phenylenebis- (methane-ylylidene))-bis-(azane-ylylidene)) bis-(5-(4-chlorophenyl) -4H -1,2,4-triazole-3-thione) (L3) has been synthesized by condensation of 4-amino-5-(4-chlorophenyl)-2,4-dihydro-3H-1,2,4-triazole-3-thione with benzene-1,4-dicarboxaldehyde. The new asymmetrical Schiff base (L3) used as a ligand to synthesize a new complex with Co(II), Ni(II), Cu(II), Pd(II), and Pt(IV) metal ions by 1:2 (Metal: ligand) ratio. New ligand and their complexes have been exanimated and Confirmed by Fourier-transform infrared (FT-IR), Ultraviolet-visible (UV-visible), Proton nuclear magnetic resonance (1HNMR), carbon13 nuclear magnetic resonance (13CNMR), carbon-hydrogen nitrogen sulf
... Show MoreTwo dwarf snakes were discovered, Eirenis thospitis Schmidtler & Lanza from Sereen mountain, north east of Arbil and E. rothii Jan from Saffin mountain North of Arbil city North of Iraqi Kurdistan. Supported by description and important notes on variation. In addition summarized list for 9 species of the genus Eirenis Jan in Iraq is also presented.

This article proposes a new strategy based on a hybrid method that combines the gravitational search algorithm (GSA) with the bat algorithm (BAT) to solve a single-objective optimization problem. It first runs GSA, followed by BAT as the second step. The proposed approach relies on a parameter between 0 and 1 to address the problem of falling into local research because the lack of a local search mechanism increases intensity search, whereas diversity remains high and easily falls into the local optimum. The improvement is equivalent to the speed of the original BAT. Access speed is increased for the best solution. All solutions in the population are updated before the end of the operation of the proposed algorithm. The diversification f
... Show MoreA new four series of 2,2′-([1,1′- phenyl or biphenyl]-4,4′-diylbis(azanediyl)) bis(N′-((E)-1-(4-alkoxyphenyl) ethylidene) acetohydrazide) [V-XI]a,b and 1,1′-(2,2′-([1,1′- phenyl or biphenyl]-4,4′-diyl bis(azanediyl)) bis- (acetyl)) bis(3-(4-ethoxyphenyl)-1H-pyrazole-4-carbalde hyde) [XII-XVIII]a,b have been synthesized by varying terminal lateral alkoxy chain length (n = 1–3, 5–8), central linkage group (phenyl or biphenyl) and induced pyrazole heterocyclic ring in the main chain. The last two series were synthesized by the cyclization of substituted acetophenone hydrazones with Vilsmeier–Haack reagent (DMF/POCl3) to produce 4-formylpyrazole derivatives. The chemical structures of the synthesized compounds were examine
... Show MoreKE Sharquie, AA Al-Nuaimy, FA Al-Shimary, Saudi medical journal, 2005 - Cited by 20
N, N′- bis[4-hydroxy phenyl] pyromillitdiimide [II] was prepared from the corresponding diamic acid , which was transfered to its new ester by the reaction with chloroethyl acetate [III ], [III] was used to prepare the novel hydrazide derivative [IV] , which was allowed to react with several aldehydes to yield the hydrazones [V – IX]. All the new compounds were synthesized , and characterized by their melting points .HNMR for some of them1FTIR,C,H,N analysis and ,
The convergence speed is the most important feature of Back-Propagation (BP) algorithm. A lot of improvements were proposed to this algorithm since its presentation, in order to speed up the convergence phase. In this paper, a new modified BP algorithm called Speeding up Back-Propagation Learning (SUBPL) algorithm is proposed and compared to the standard BP. Different data sets were implemented and experimented to verify the improvement in SUBPL.