OpenStreetMap (OSM), recognised for its current and readily accessible spatial database, frequently serves regions lacking precise data at the necessary granularity. Global collaboration among OSM contributors presents challenges to data quality and uniformity, exacerbated by the sheer volume of input and indistinct data annotation protocols. This study presents a methodological improvement in the spatial accuracy of OSM datasets centred over Baghdad, Iraq, utilising data derived from OSM services and satellite imagery. An analytical focus was placed on two geometric correction methods: a two-dimensional polynomial affine transformation and a two-dimensional polynomial conformal transformation. The former involves twelve coefficients for ad

Objective(s): This study was conducted to deal with the importance and effect of various variables which might
have influence in hydrocephaly occurrence.
Methodology: A retrospective design was performed and continued for 4 months. It included 89 nonrandomized
consecutive samples collected from the Early Detection of Childhood Disabilities Center (E.D.C.D.C.)
Duhok. The population involved was the entire cases of both sexes that attended the centre during the period from
1
st.Jan, 1998 to 30th. Dec. 2008 with final diagnosis of hydrocephaly. Patients’ records from the centre were used to
collect data.
Results: Hydrocephaly has been recognized as a public health problem in Duhok province, Iraqi Kurdistan region,<

    In this paper, we studied the scheduling of  jobs on a single machine.  Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completi

Given a matrix, the Consecutive Ones Submatrix (C1S) problem which aims to find the permutation of columns that maximizes the number of columns having together only one block of consecutive ones in each row is considered here. A heuristic approach will be suggested to solve the problem. Also, the Consecutive Blocks Minimization (CBM) problem which is related to the consecutive ones submatrix will be considered. The new procedure is proposed to improve the column insertion approach. Then real world and random matrices from the set covering problem will be evaluated and computational results will be highlighted.

The main objective of this research is to use the methods of calculus ???????? solving integral equations Altbataah When McCann slowdown is a function of time as the integral equation used in this research is a kind of Volterra

Survivin, a member of inhibitor of apoptosis family is increasingly used as a target for cancer therapy design because it has a key role in cell growth and inhibition of cell apoptosis. Also it can be used as a biomarker for targeting cancer because it is found in almost all cancer but not normal cells. Our strategy was to design (computationally) a molecule to be used as survivin inhibitor. This molecule was named lead10 and was used furthermore to find (virtually) existing drugs with a good survivin inhibition activity.

This research introduce a study with application on Principal Component Regression obtained from some of the explainatory variables to limitate Multicollinearity problem among these variables and gain staibilty in their estimations more than those which yield from Ordinary Least Squares. But the cost that we pay in the other hand losing a little power of the estimation of the predictive regression function in explaining the essential variations. A suggested numerical formula has been proposed and applied by the researchers as optimal solution, and vererifing the its efficiency by a program written by the researchers themselves for this porpuse through some creterions: Cumulative Percentage Variance, Coefficient of Determination, Variance

Neurolinguistics is a new science, which studies the close relationship between language and neuroscience, and this new interdisciplinary field confirms the functional integration between language and the nervous system, that is, the movement of linguistic information in the brain in receiving, acquiring and producing to achieve linguistic communication; Because language is in fact a mental process that takes place only through the nervous system, and this research shows the benefit of each of these two fields to the other, and this science includes important topics, including: language acquisition, the linguistic abilities of the two hemispheres of the brain, the linguistic responsibility of the brain centers, and the time limit for langua

In this study, dynamic encryption techniques are explored as an image cipher method to generate S-boxes similar to AES S-boxes with the help of a private key belonging to the user and enable images to be encrypted or decrypted using S-boxes. This study consists of two stages: the dynamic generation of the S-box method and the encryption-decryption method. S-boxes should have a non-linear structure, and for this reason, K/DSA (Knutt Durstenfeld Shuffle Algorithm), which is one of the pseudo-random techniques, is used to generate S-boxes dynamically. The biggest advantage of this approach is the production of the inverted S-box with the S-box. Compared to the methods in the literature, the need to store the S-box is eliminated. Also, the fabr

In this study, a chaotic method is proposed that generates S-boxes similar to AES S-boxes with the help of a private key belonging to

In this study, dynamic encryption techniques are explored as an image cipher method to generate S-boxes similar to AES S-boxes with the help of a private key belonging to the user and enable images to be encrypted or decrypted using S-boxes. This study consists of two stages: the dynamic generation of the S-box method and the encryption-decryption method. S-boxes should have a non-linear structure, and for this reason, K/DSA (Knutt Durstenfeld Shuffle Algorithm), which is one of the pseudo-random techniques, is used to generate S-boxes dynamically. The biggest advantage of this approach is the produ