In this research we solved numerically Boltzmann transport equation in order to calculate the transport parameters, such as, drift velocity, W, D/? (ratio of diffusion coefficient to the mobility) and momentum transfer collision frequency ?m, for purpose of determination of magnetic drift velocity WM and magnetic deflection coefficient ? for low energy electrons, that moves in the electric field E, crossed with magnetic field B, i.e; E×B, in the nitrogen, Argon, Helium and it's gases mixtures as a function of: E/N (ratio of electric field strength to the number density of gas), E/P300 (ratio of electric field strength to the gas pressure) and D/? which covered a different ranges for E/P300 at temperatures 300°k (Kelvin). The results show

Model birefringence was measured for elliptical-core fibers with low ellipticities, note the birefringence depends strongly on the frequency, especially when fiber is being operated near the higher mode cutoff where ν  for circular fiber of the single-mode type that correspond to the birefringence maximum. When ν  this also correspond to the birefringence maximum that can be introduced in an elliptical core fiber while still operating in the single-mode regime near the higher mode cutoff. Also the birefringence is proportional to the fiber core ellipticity when core ellipticity is much less than unity, but this birefringence deviates from the linear for the large core ellipticities.

In this paper, we have derived Bayesian estimation for the parameters and reliability function of Perks distribution based on two different loss functions, Lindley’s approximation has been used to obtain those values. It is assumed that the parameter behaves as a random variable have a Gumbell Type P prior with non-informative is used. And after the derivation of mathematical formulas of those estimations, the simulation method was used for comparison depending on mean square error (MSE) values and integrated mean absolute percentage error (IMAPE) values respectively. Among of conclusion that have been reached, it is observed that, the LE-NR estimate introduced the best perform for estimating the parameter λ.

Abstract: The aim of this study was to identify the Distress Tolerance among the Employees in  Media and Communication in Baghdad.and to identify the significance of the differences between sex ,scientific specialization ,age,and marital status. and the researcher used the Distrees  Tolerance measure for Simon &Gahar 2005.  The sample of the study consisted of(37)Employees.The Scale of Distrees Tolerance were used as the study tools after being checked for their Validity and Reliability. The research results indicated that employees have high scores on the scale of stress tolerance and that there are statistically significant differences between the age groups and between married and unmarried people a

Achieving energy-efficient Wireless Sensor Network (WSN) that monitors all targets at
all times is an essential challenge facing many large-scale surveillance applications.Singleobjective
set cover problem (SCP) is a well-known NP-hard optimization problem used to
set a minimum set of active sensors that efficiently cover all the targeted area. Realizing
that designing energy-efficient WSN and providing reliable coverage are in conflict with
each other, a multi-objective optimization tool is a strong choice for providing a set of
approximate Pareto optimal solutions (i.e., Pareto Front) that come up with tradeoff
between these two objectives. Thus, in the context of WSNs design problem, our main
contribution is to

<p>Energy and memory limitations are considerable constraints of sensor nodes in wireless sensor networks (WSNs). The limited energy supplied to network nodes causes WSNs to face crucial functional limitations. Therefore, the problem of limited energy resource on sensor nodes can only be addressed by using them efficiently. In this research work, an energy-balancing routing scheme for in-network data aggregation is presented. This scheme is referred to as Energy-aware and load-Balancing Routing scheme for Data Aggregation (hereinafter referred to as EBR-DA). The EBRDA aims to provide an energy efficient multiple-hop routing to the destination on the basis of the quality of the links between the source and destination. In

Future generations of wireless networks are expected to heavily rely on unmanned aerial vehicles (UAVs). UAV networks have extraordinary features like high mobility, frequent topology change, tolerance to link failure, and extending the coverage area by adding external UAVs. UAV network provides several advantages for civilian, commercial, search and rescue applications. A realistic mobility model must be used to assess the dependability and effectiveness of UAV protocols and algorithms.  In this research paper, the performance of the Gauss Markov (GM) and Random Waypoint (RWP) mobility models in multi-UAV networks for a search and rescue scenario is analyzed and evaluated. Additionally, the two mobility models GM and RWP are descr

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed to d