Bulk polycrystalline samples have been prepared by the two-step solid state reaction process. It has been observed that as grown Tl2-xHgxSr2Ca2Cu3O10+δ (with x = 0, 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.8, 1) corresponds to the 2223 phase. It has been found that Tc varies with Hg content .The optimum Tc is about 120K for the composition Tl1.6Hg0.4Sr2Ca2Cu3O10+δ.The microstructure for Tl1.6Hg0.4Sr2Ca2Cu3O10+δ observed to be most dense and this phase exhibits the highest stability.

This book includes three main chapters: 1. Functions & Their Derivatives. 2. Minimum, Maximum and Inflection points. 3. Partial Derivative. In addition to many examples and exercises for the purpose of acquiring the student's ability to think correctly in solving mathematical questions.

The absorption spectrum for three types of metal ions in different concentrations has been studying experimentally and theoretically. The examination model is by Gaius model in order to find the best fitting curve and the equation controlled with this behavior. The three metal ions are (Copper chloride Cu⁺², Iron chloride Fe^+3, and Cobalt chloride Co⁺²) with different concentrations (10^-4, 10^-5, 10^-6, 10^-7) gm/m³. The spectroscopic study included UV-visible and fluorescence spectrum for all different concentrations sample. The results refer to several peaks that appear from the absorption spectrum in the high concentration of all metal ions solution.

 In this paper, we introduce and discuss an algorithm for the numerical solution of some kinds of fractional integral and fractional integrodifferential equations. The algorithm for the numerical solution of these equations is based on iterative approach. The stability and convergence of the fractional order numerical method are described. Finally, some numerical examples are provided to show that the numerical method for solving the fractional integral and fractional integrodifferential equations is an effective solution method.

This paper is concerned with the numerical blow-up solutions of semi-linear heat equations, where the nonlinear terms are of power type functions, with zero Dirichlet boundary conditions. We use explicit linear and implicit Euler finite difference schemes with a special time-steps formula to compute the blow-up solutions, and to estimate the blow-up times for three numerical experiments. Moreover, we calculate the error bounds and the numerical order of convergence arise from using these methods. Finally, we carry out the numerical simulations to the discrete graphs obtained from using these methods to support the numerical results and to confirm some known blow-up properties for the studied problems.

  In  this  paper, we  introduced   some  fact  in   2-Banach  space. Also, we define  asymptotically  non-expansive  mappings  in  the  setting  of  2-normed  spaces analogous  to  asymptotically non-expansive mappings  in  usual  normed spaces. And then prove the existence of fixed points for this type of mappings in 2-Banach spaces.

This work includes synthesis of sugar tetrazole derivative, D-ribose reacted with acetone in the presence of sulfuric acid H2SO4 to give 2, 3-O-isopropylidene-D-ribose (1). The Aldol condensation of (1) with formaldehyde in methanolic K2CO3 solution gave 2-hydroxymethyl (2, 3-O-isopropylidene-D-ribose)(2). Which was tosylated by Tosyl chloride in pyridine to yield compound (3), SN2 reaction of (3) with sodium cyanide in DMSO afforded compound (4). The [2+ 3] cycloaddition reaction of (4) with sodium azide gave the targeted compound (5). All prepared compounds have been characterized by: TLC, Specific rotation, Microelemental analysis and [FTIR and 1 H NMR spectroscopy]

 Finding a path solution in a dynamic environment represents a challenge for the robotics researchers, furthermore, it is the main issue for autonomous robots and manipulators since nowadays the world is looking forward to this challenge. The collision free path for robot in an environment with moving obstacles such as different objects, humans, animals or other robots is considered as an actual problem that needs to be solved.  In addition, the local minima and sharp edges are the most common problems in all path planning algorithms. The main objective of this work is to overcome these problems by demonstrating the robot path planning and obstacle avoidance using D star (D*) algorithm based on Particle Swarm Optimization (PSO)