The proton momentum distributions (PMD) and the elastic
electron scattering form factors F(q) of the ground state for some
even mass nuclei in the 2p-1f shell for 70Ge, 72Ge, 74Ge and 76Ge are
calculated by using the Coherent Density Fluctuation Model (CDFM)
and expressed in terms of the fluctuation function (weight function)
|F(x)|2. The fluctuation function has been related to the charge
density distribution (CDD) of the nuclei and determined from the
theory and experiment. The property of the long-tail behavior at high
momentum region of the proton momentum distribution has been
obtained by both the theoretical and experimental fluctuation
functions. The calculated form factors F (q) of all nuclei under s

    In this paper, we derive some subordination and superordination results for certain subclasses of p− valent analytic functions that defined by generalized Fox-wright functions using the principle of differential subordination, ----------producing best dominant univalent solutions. We have also derived inclusion relations and solved majorization problem.

Due to the lack of vehicle-to-infrastructure (V2I) communication in the existing transportation systems, traffic light detection and recognition is essential for advanced driver assistant systems (ADAS) and road infrastructure surveys. Additionally, autonomous vehicles have the potential to change urban transportation by making it safe, economical, sustainable, congestion-free, and transportable in other ways. Because of their limitations, traditional traffic light detection and recognition algorithms are not able to recognize traffic lights as effectively as deep learning-based techniques, which take a lot of time and effort to develop. The main aim of this research is to propose a traffic light detection and recognition model based on

      In many areas, such as simulation, numerical analysis, computer programming, decision-making, entertainment, and coding, a random number input is required. The pseudo-random number uses its seed value. In this paper, a hybrid method for pseudo number generation is proposed using Linear Feedback Shift Registers (LFSR) and Linear Congruential Generator (LCG). The hybrid method for generating keys is proposed by merging technologies. In each method, a new large in key-space group of numbers were generated separately. Also, a higher level of secrecy is gained such that the internal numbers generated from LFSR are combined with LCG (The adoption of roots in non-linear iteration loops). LCG and LFSR are linear structures and outputs

With the increasing prevalence of breast cancer among female internationally, occupies about 25% of all cases of cancer, with a measured 1.57 million up to date cases in 2012. Breast cancer has turn a most warning to health of female in Iraq, where it is the major cause of death among women after cardiovascular diseases, with a mortality rate of 23% related cancer. Recently there is a crucial requirement to include community pharmacists in health elevation activities to support awareness and early diagnosis of cancer, specially breast cancer. The aim of this study is to assess knowledge, attitude and perceived barriers amongst Iraqi community pharmacists towards health promotion of breast cancer. This study is cross sectional research. A

Let R be a commutative ring with unity. Let W be an R-module, for K≤F, where F is a submodule of W and K is said to be R-annihilator coessential submodule of F in W (briefly R-a-coessential) if  (denoted by K  F in W). An R-module W is called strongly hollow -R-annihilator -lifting module (briefly, strongly hollow-R-a-lifting), if for every submodule F of W with  hollow, there exists a fully invariant direct summand K of W such that K  F in W. An R - module W is called strongly R - annihilator - ( hollow - lifting ) module ( briefly strongly R - a - ( hollow - lifting ) module ), if for every submodule F of W with   R - a - hollow, there exists a fully invariant direct summand K o

This paper investigates some exact and local search methods to solve the traveling salesman problem. The Branch and Bound technique (BABT) is proposed, as an exact method, with two models. In addition, the classical Genetic Algorithm (GA) and Simulated Annealing (SA) are discussed and applied as local search methods. To improve the performance of GA we propose two kinds of improvements for GA; the first is called improved GA (IGA) and the second is Hybrid GA (HGA).

The IGA gives best results than GA and SA, while the HGA is the best local search method for all within a reasonable time for 5 ≤ n ≤ 2000, where n is the number of visited cities. An effective method of reducing the size of the TSP matrix was proposed with