Background: Breast cancer is the most frequently diagnosed malignancy and the second leading cause of mortality among women in Iraq forming 23% of cancer related deaths. The low survival from the disease is a direct consequence to the advanced stages at diagnoses. Aim: To document the composite stage of breast cancer among Iraqi patients at the time of diagnosis; correlating the observed findings with other clinical and pathological parameters at presentation. Patients and Methods: A retrospective study enrolling the clinical and pathological characteristics of 603 Iraqi female patients diagnosed with breast cancer. The composite stage of breast cancer was determined according to UICC TNM Classification System of Breast Cancer and the Ameri

Live the present companies in a competitive business environment going on and try to achieve excellence in their industry through the marketing of their products and achieve greater market share as possible to ensure its continued existence, and perhaps the concept of time production, which confirms, in essence, on the need to reduce inventory to a minimum in the production process as well as the concept of the marketing information system which asserts, in essence, to document all the events that are related to the marketing of the product provided by the production process, together constitute the subject deserves research and investigation as they have raised well-known in the fields of production management and marketing management.

The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul

Two unsupervised classifiers for optimum multithreshold are presented; fast Otsu and k-means. The unparametric methods produce an efficient procedure to separate the regions (classes) by select optimum levels, either on the gray levels of image histogram (as Otsu classifier), or on the gray levels of image intensities(as k-mean classifier), which are represent threshold values of the classes. In order to compare between the experimental results of these classifiers, the computation time is recorded and the needed iterations for k-means classifier to converge with optimum classes centers. The variation in the recorded computation time for k-means classifier is discussed.