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.
Facing the Iraqi economy, a number of economic challenges that threaten the future of Iraq and the security of economic, political and social, such as poverty, unemployment, inflation and the dilapidated infrastructure and rising production costs and administrative and financial corruption, environmental pollution, water problems and the deterioration of agricultural and industrial production, etc., and over the seriousness of these challenges, they are intertwined and overlapping and growing worse, without the corresponding adoption of state strategies that will develop appropriate solutions and appropriate to resolve those challenges because of concern the subject of security and terrorism, which requires the development of an
... Show MoreTest method was developed radioimmunotherapy to appoint in two groups of patients infected with a uterine tumor Great conditions in tumor tissue benign and malignant Ddh teacher radioactive iodine isotope
The Concept of the Constitution and the most Important of Human Rights
With the wide developments of computer science and applications of networks, the security of information must be increased and make it more complex. The most important issues is how to control and prevent unauthorized access to secure information, therefore this paper presents a combination of two efficient encryption algorithms to satisfy the purpose of information security by adding a new level of encryption in Rijndael-AES algorithm. This paper presents a proposed Rijndael encryption and decryption process with NTRU algorithm, Rijndael algorithm is important because of its strong encryption. The proposed updates are represented by encryption and decryption Rijndael S-Box using NTRU algorithm. These modifications enhance the degree of
... Show MoreWith the wide developments of computer applications and networks, the security of information has high attention in our common fields of life. The most important issues is how to control and prevent unauthorized access to secure information, therefore this paper presents a combination of two efficient encryption algorithms to satisfy the purpose of information security by adding a new level of encryption in Rijndael-AES algorithm. This paper presents a proposed Rijndael encryption and decryption process with NTRU algorithm, Rijndael algorithm is widely accepted due to its strong encryption, and complex processing as well as its resistance to brute force attack. The proposed modifications are implemented by encryption and decryption Rijndael
... Show MoreBiped robots have gained much attention for decades. A variety of researches has been conducted to make them able to assist or even substitute for humans in performing special tasks. In addition, studying biped robots is important in order to understand the human locomotion and to develop and improve control strategies for prosthetic and orthotic limbs. Some challenges encountered in the design of biped robots are: (1) biped robots have unstable structures due to the passive joint located at the unilateral foot-ground contact. (2) They have different configuration when switching from walking phase to another. During the singlesupport phase, the robot is under-actuated, while turning into an over-actuated system during the double-support pha
... 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 MorePurpose: To identify the size of the food gap for the main agricultural products and crops in Iraq, which reflects to us the extent to which agricultural production in particular and the agricultural sector in general have declined.Theoretical framework: The theoretical side of the research dealt with the definition of self-sufficiency and the food gap, as well as identifying the reality of agricultural production in Iraq during the study period, as well as the reality of the food gap for the most important agricultural, plant and animal products.Design/methodology/approach: In reviewing the research problem, the researcher adopted the method of deductive and descriptive analysis based on the presentation and detail of official data
... Show More
