This  srudy   aimed  to   use  a   new  concentration   from   l\!J3T (Nitroblue tetrazolium) which using NADH   stain ( by used eight different concentrations from (0.2% to 0.06% ).

That stain is a mitochondrial and cytoplasmic histochemical stain which gi ves more infom1ation about the metabolic activity of muscle fiber, so it is valuable in determining the types of muscle fibers and good fiber differentiation type {T) and type (TT)  fibers), by reducing NBT in the location of enzyme and gives a blue color in different degrees according to the types of muscle fibers, and we noticed that the concentration 0.1% from NBT gives a good result and di

Thin films of CuPc of various thicknesses (150,300 and 450) nm have been deposited using pulsed laser deposition technique at room temperature. The study showed that the spectra of the optical absorption of the thin films of the CuPc  are two bands of absorption one in the visible region at about 635 nm, referred to as Q-band, and the second in ultra-violet region where B-band is located at 330 nm. CuPc thin films were found to have direct band gap with values around (1.81 and 3.14 (eV respectively. The vibrational studies were carried out using Fourier transform infrared spectroscopy (FT-IR). Finally, From open and closed aperture Z-scan data non-linear absorption coefficient and non-linear refractive index have been calculated res

 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)

Abstract: Stars whose initial masses are between (0.89 - 8.0) M☉ go through an Asymptotic Giant Branch (AGB) phase at the end of their life. Which have been evolved from the main sequence phase through Asymptotic Giant Branch (AGB). The calculations were done by adopted Synthetic Model showed the following results: 1- Mass loss on the AGB phase consists of two phases for period (P <500) days and for (P>500) days; 2- the mass loss rate exponentially increases with the pulsation periods; 3- The expansion velocity VAGB for our stars are calculated according to the three assumptions; 4- the terminal velocity depends on several factors likes metallicity and luminosity. The calculations indicated that a super wind phase (S.W) developed on the A

Abstract Planetary nebulae (PN) represents the short phase in the life of stars with masses (0.89-7) M☉. Several physical processes taking place during the red giant phase of low and intermediates-mass stars. These processes include :1) The regular (early ) wind and the envelope ejection, 2) The thermal pulses during Asymptotic Giant Branch (AGB ) phase. In this paper it is briefly discussed how such processes affect the mass range of Planetary Nebulae(PN) nuclei(core) and their evolution, and the PN life time, and fading time for the masses which adopted. The Synthetic model is adopted. The envelope mass of star (MeN ) and transition time (ttr) calculated respectively for the parameter (MeR =1.5,2, 3×10-3 M☉). Another time scale is o

In recent years, the number of applications utilizing mobile wireless sensor networks (WSNs) has increased, with the intent of localization for the purposes of monitoring and obtaining data from hazardous areas. Location of the event is very critical in WSN, as sensing data is almost meaningless without the location information. In this paper, two Monte Carlo based localization schemes termed MCL and MSL* are studied. MCL obtains its location through anchor nodes whereas MSL* uses both anchor nodes and normal nodes. The use of normal nodes would increase accuracy and reduce dependency on anchor nodes, but increases communication costs. For this reason, we introduce a new approach called low communication cost schemes to reduce communication

     The aim of this paper is to study the convergence of an iteration scheme for multi-valued mappings which defined on a subset of a complete convex real modular. There are two main results, in the first result, we show that the convergence with respect to a multi-valued contraction mapping to a fixed point. And, in the second result, we deal with two different schemes for two multivalued  mappings (one of them is a contraction and other has a fixed point) and then we show that the limit point of these two schemes is the same. Moreover, this limit will be the common fixed point the two mappings.

    Crow Search Algorithm (CSA) can be defined as one of the new swarm intelligence algorithms that has been developed lately, simulating the behavior of a crow in a storage place and the retrieval of the additional food when required. In the theory of the optimization, a crow represents a searcher, the surrounding environment represents the search space, and the random storage of food location represents a feasible solution. Amongst all the food locations, the one where the maximum amount of the food is stored is considered as the global optimum solution, and objective function represents the food amount. Through the simulation of crows’ intelligent behavior, the CSA attempts to find the optimum solutions to a variety of the proble