A total of 437 individuals of Turbellarin Platyhelminthes were sorted from benthic samples collected monthly for a period of seven months( April to November 2013 ) from AL-Dalmage lake, a part of middle section for main outfall drain south of Baghdad. They were identified as Gyratrix hermaphroditus, Stenostomum leucops ,Stenostomum unicolar and Stenostomum bryophilum ,The relative abundance of worms decreased during hot season which (May to September) ,where they start rising again. The species were studied alive , the identification criteria were illustrated by photos. G. hermaphroditus was the most abundant species among the four species.

A multidimensional systolic arrays realization of LMS algorithm by a method of mapping regular algorithm onto processor array, are designed. They are based on appropriately selected 1-D systolic array filter that depends on the inner product sum systolic implementation. Various arrays may be derived that exhibit a regular arrangement of the cells (processors) and local interconnection pattern, which are important for VLSI implementation. It reduces latency time and increases the throughput rate in comparison to classical 1-D systolic arrays. The 3-D multilayered array consists of 2-D layers, which are connected with each other only by edges. Such arrays for LMS-based adaptive (FIR) filter may be opposed the fundamental requirements of fa

Abstract

Objective(s): To evaluate the nurses` practices for children who diagnosed with febrile convulsion.

Methodology: A quantitative research, descriptive correlational design was used in this study, the study conducted on nurses who work in Al-Diwaniya Pediatrics Teaching Hospital-Iraq for Maternal and Children period from 12^th September 2021 to 10^th October 2022. A non- probability (convenience) sample has been applied to obtain the study goals. The study sample was (21) nurses who participate in the study. The study tool is composed of two parts: The first part is concerned with collection of nurses socio-demographic data obta

In this paper the definition of fuzzy normed space is recalled and its basic properties. Then the definition of fuzzy compact operator from fuzzy normed space into another fuzzy normed space is introduced after that the proof of an operator is fuzzy compact if and only if the image of any fuzzy bounded sequence contains a convergent subsequence is given. At this point the basic properties of the vector space FC(V,U)of all fuzzy compact linear operators are investigated such as when U is complete and the sequence ( ) of fuzzy compact operators converges to an operator T then T must be fuzzy compact. Furthermore we see that when T is a fuzzy compact operator and S is a fuzzy bounded operator then the composition TS and ST are fuzzy compact

This work bases on encouraging a generous and conceivable estimation for modified an algorithm for vehicle travel times on a highway from the eliminated traffic information using set aside camera image groupings. The strategy for the assessment of vehicle travel times relies upon the distinctive verification of traffic state. The particular vehicle velocities are gotten from acknowledged vehicle positions in two persistent images by working out the distance covered all through elapsed past time doing mollification between the removed traffic flow data and cultivating a plan to unequivocally predict vehicle travel times. Erbil road data base is used to recognize road locales around road segments which are projected into the commended camera

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall