In this article, the nonlinear problem of Jeffery-Hamel flow has been solved analytically and numerically by using reliable iterative and numerical methods. The approximate solutions obtained by using the Daftardar-Jafari method namely (DJM), Temimi-Ansari method namely (TAM) and Banach contraction method namely (BCM). The obtained solutions are discussed numerically, in comparison with other numerical solutions obtained from the fourth order Runge-Kutta (RK4), Euler and previous analytic methods available in literature. In addition, the convergence of the proposed methods is given based on the Banach fixed point theorem. The results reveal that the presented methods are reliable, effective and applicable to solve other nonlinear problems.

The current research included palynological study for nine ornamental cultivated species of Asteraceae family. The study included measurement the dimensions of pollen grains and there shape in polar view and equatorial view, sculpturing,colpi length and width, spines length and number of spines rows between colpiand exine thickness, the study showed variations in pollen grains characters forthe studied taxa

Background: Pneumonia is the common lower respiratory tract infection among pediatrics, especially under five; it is a common cause of under-five children morbidity and mortality. Objectives of study: To identify nurses' perceptions toward therapeutic strategies for children with pneumonia and to find the association between their perceptions and their demographic variables. Methods: A Convenient sample of 46 nurses in Baghdad city from three hospitals) Kadhimiya Hospital for Children, Central Teaching Hospital of Pediatrics, and Child Welfare Teaching Hospital) included in the study to identify their perceptions regarding pneumonia in children. Results: The results of the study present that most of the nurses' participants in the a

Abstract: Data mining is become very important at the present time, especially with the increase in the area of information it's became huge, so it was necessary to use data mining to contain them and using them, one of the data mining techniques are association rules here using the Pattern Growth method kind enhancer for the apriori. The pattern growth method depends on fp-tree structure, this paper presents modify of fp-tree algorithm called HFMFFP-Growth by divided dataset and for each part take most frequent item in fp-tree so final nodes for conditional tree less than the original fp-tree. And less memory space and time.

Given the importance of increasing economic openness transport companies’ face various issues arising at present time, this required importing different types of goods with different means of transport. Therefore, these companies pay great attention to reducing total costs of transporting commodities by using numbers means of transport methods from their sources to the destinations. The majority of private companies do not acquire the knowledge of using operations research methods, especially transport models, through which the total costs can be reduced, resulting in the importance and need to solve such a problem. This research presents a proposed method for the sum of Total Costs (Tc) of rows and columns, in order to arrive at the init

Bacteriophages have the potential to eliminate both antibiotic-resistant and sensitive bacteria; as a result, they have become a major focus of such research. In contrast to antibiotics, which assault the entire bacterial population without discrimination, bacteriophages have a limited set of characteristics that allow them to target infectious microbes while avoiding friendly species (commensal microbiota). Nevertheless, large groups of naturally occurring bacteriophages that are well-differentiated and selective for the most clinically recognized pathogenic bacterial strains are required. Utilizing genetic engineering techniques that modify the target phage genome to synthesize phages with known characteristics in a brief period o

As s widely use of exchanging private information in various communication applications, the issue to secure it became top urgent. In this research, a new approach to encrypt text message based on genetic algorithm operators has been proposed. The proposed approach follows a new algorithm of generating 8 bit chromosome to encrypt plain text after selecting randomly crossover point. The resulted child code is flipped by one bit using mutation operation. Two simulations are conducted to evaluate the performance of the proposed approach including execution time of encryption/decryption and throughput computations. Simulations results prove the robustness of the proposed approach to produce better performance for all evaluation metrics with res