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.
Pathology reports are necessary for specialists to make an appropriate diagnosis of diseases in general and blood diseases in particular. Therefore, specialists check blood cells and other blood details. Thus, to diagnose a disease, specialists must analyze the factors of the patient’s blood and medical history. Generally, doctors have tended to use intelligent agents to help them with CBC analysis. However, these agents need analytical tools to extract the parameters (CBC parameters) employed in the prediction of the development of life-threatening bacteremia and offer prognostic data. Therefore, this paper proposes an enhancement to the Rabin–Karp algorithm and then mixes it with the fuzzy ratio to make this algorithm suitable
... Show MoreIn networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f
... Show MoreThis work aimed to estimate the frequency of mitochondrial inborn errors of metabolism (MIEMs) in patients presenting with family history and IEM-picture who referred for advance IEM assay in Mosul province and Kurdistan region. This study was observational study conducted on 364 cases referred from different general /or private pediatric clinics with unexplained sign and symptoms and suspension of mitochondrial dysfunction. The study included 364 children with an age ranging from 1 month to 1 year. Started from January 2018 to January 2020. All patients referred with their full history review, notes about their clinical examination, and laboratory investigations including blood ammonia, serum lactate/ pyruvate, arterial blood gases. In
... Show MoreThe paper presents an overview of theoretical aspects of small radio telescope antenna parameters. The basic parameters include antenna beamwidth, antenna gain, aperture efficiency, and antenna temperature. These parameters should be carefully studied since they have vital effects on astronomical radio observations. The simulations of antenna parameters were carried out to assess the capability and the efficiency of small radio telescopes to observe a point source at a specific frequency. Two-dimensional numerical simulations of a uniform circular aperture antenna are implemented at different radii. The small diameter values are chosen to be varied between (1-10) m. This study focuses on a small radio telescope with a diameter of 3 m sin
... Show MoreLet A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with is the same for all . Here is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i
... Show More