An experiment was carried out in the vegetables field of Horticulture Department / College of Agriculture / Baghdad University , for the three seasons : spring and Autumn of 2005 , and spring of 2007 , to study the type of gene action in some traits of vegetative and flowery growth in summer squash crosses (4 x 3 = cross 1 , 3 x 7 = cross 2 , 3 x 4 = cross 3 , 3 x 5 = cross 4 , 5 x 1 = cross 5 , 5 x 2 = cross 6). The study followed generation mean analysis method which included to each cross (P1 , P2 , F1 , F2 , Bc1P1 , Bc1P2) , and those populations obtained by hybridization during the first and second seasons. Experimental comparison was performed in the second (Two crosses only) and third seasons , (four crosses) by using RCBD with three

A field experiment was carried out in the fields of the Field Crops Department - Faculty of Agricultural Engineering Sciences. The study included five inbred lines (ZM43W (ZE), ZM60, ZM49W3E, ZM19, CDCN5), given numbers 1, 2, 3, 4 and 5) to study the hybrid vigor and both general and special combing ability (GCA, SCA) of the half diallel mating method, for the spring and fall seasons (2016). The genetic analysis shows that all crosses gave a positive hybrid vigor for grain yield per unit area at the two population densities. the highest value is 116.20% for cross (3´5 )at low density, and 89.22% for cross( 1´4 )at high density. The hybrid vigor for all crosses is positive at two densities for dry matter yield, crop growth rate an

There is a great deal of systems dealing with image processing that are being used and developed on a daily basis. Those systems need the deployment of some basic operations such as detecting the Regions of Interest and matching those regions, in addition to the description of their properties. Those operations play a significant role in decision making which is necessary for the next operations depending on the assigned task. In order to accomplish those tasks, various algorithms have been introduced throughout years. One of the most popular algorithms is the Scale Invariant Feature Transform (SIFT). The efficiency of this algorithm is its performance in the process of detection and property description, and that is due to the fact that

This paper proposes a new method Object Detection in Skin Cancer Image, the minimum
spanning tree Detection descriptor (MST). This ObjectDetection descriptor builds on the
structure of the minimum spanning tree constructed on the targettraining set of Skin Cancer
Images only. The Skin Cancer Image Detection of test objects relies on their distances to the
closest edge of thattree. Our experimentsshow that the Minimum Spanning Tree (MST) performs
especially well in case of Fogginessimage problems and in highNoisespaces for Skin Cancer
Image.
The proposed method of Object Detection Skin Cancer Image wasimplemented and tested on
different Skin Cancer Images. We obtained very good results . The experiment showed that

Human posture estimation is a crucial topic in the computer vision field and has become a hotspot for research in many human behaviors related work. Human pose estimation can be understood as the human key point recognition and connection problem. The paper presents an optimized symmetric spatial transformation network designed to connect with single-person pose estimation network to propose high-quality human target frames from inaccurate human bounding boxes, and introduces parametric pose non-maximal suppression to eliminate redundant pose estimation, and applies an elimination rule to eliminate similar pose to obtain unique human pose estimation results. The exploratory outcomes demonstrate the way that the proposed technique can pre

Among the metaheuristic algorithms, population-based algorithms are an explorative search algorithm superior to the local search algorithm in terms of exploring the search space to find globally optimal solutions. However, the primary downside of such algorithms is their low exploitative capability, which prevents the expansion of the search space neighborhood for more optimal solutions. The firefly algorithm (FA) is a population-based algorithm that has been widely used in clustering problems. However, FA is limited in terms of its premature convergence when no neighborhood search strategies are employed to improve the quality of clustering solutions in the neighborhood region and exploring the global regions in the search space. On the