This  article  co;nsiders a shrunken  estimator  Â·Of  Al-Hermyari·   and

AI Gobuii (.1) to estimate  the mean (8) of a normal clistributicm N (8 cr4)  with  known variance  (cr+),  when  <:I    guess value (So) av11il ble about the mean (B) as· an initial estrmate. This estimator is shown to be

more efficient tl1an the class-ical estimators  especially when 8 is close to 8•. General expressions .for bias and MSE -of considered  estitnator are gi 'en, witeh  some examples.  Nut.nerical cresdlts, comparisons  and

conclusions ate reported.

Sansevieriatrifasciata was studied as a potential biosorbent for chromium, copper and nickel removal in batch process from electroplating and tannery effluents. Different parameters influencing the biosorption process such as pH, contact time, and amount of biosorbent were optimized while using the 80 mm sized particles of the biosorbent. As high as 91.3 % Ni and 92.7 % Cu were removed at pH of 6 and 4.5 respectively, while optimum Cr removal of 91.34 % from electroplating and 94.6 % from tannery effluents was found at pH 6.0 and 4.0 respectively. Pseudo second order model was found to best fit the kinetic data for all the metals as evidenced by their greater R2 values. FTIR characterization of biosorbent revealed the presence of carboxyl a

In recent years, the migration of the computational workload to computational clouds has attracted intruders to target and exploit cloud networks internally and externally. The investigation of such hazardous network attacks in the cloud network requires comprehensive network forensics methods (NFM) to identify the source of the attack. However, cloud computing lacks NFM to identify the network attacks that affect various cloud resources by disseminating through cloud networks. In this paper, the study is motivated by the need to find the applicability of current (C-NFMs) for cloud networks of the cloud computing. The applicability is evaluated based on strengths, weaknesses, opportunities, and threats (SWOT) to outlook the cloud network. T

An analytical model in the form of a hyperbolic function has been suggested for the axial potential distribution of an electrostatic einzel lens. With the aid of this hyperbolic model the relative optical parameters have been computed and investigated in detail as a function of the electrodes voltage ratio for various trajectories of an accelerated charged-particles beam. The electrodes voltage ratio covered a wide range where the lens may be operated at accelerating and decelerating modes. The results have shown that the proposed hyperbolic field has the advantages of producing low aberrations under various magnification conditions and operational modes. The electrodes profile and their three-dimensional diagram have been determined whi

The world is currently facing a medical crisis. The epidemic has affected millions of people around the world since its appearance. This situation needs an urgent solution. Most countries have used different solutions to stop the spread of the epidemic. The World Health Organization has imposed some rules that people should adhere. The rules are such, wearing masks, quarantining infected people and social distancing. Social distancing is one of the most important solutions that have given good results to confront the emerging virus. Several systems have been developed that use artificial intelligence and deep learning to track social distancing. In this study, a system based on deep learning has been proposed. The system includes monitor

     In this paper, we study some cases of a common fixed point theorem for classes of firmly nonexpansive and generalized nonexpansive maps. In addition, we establish that the Picard-Mann iteration is faster than Noor iteration and we used Noor iteration to find the solution of delay differential equation.

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord