Urban land uses of all kinds are the constituent elements of the urban spatial structure. Because of the influence of economic and social factors, cities in general are characterized by the dynamic state of their elements over time. Urban functions occur in a certain way with different spatial patterns. Hence, urban planners and the relevant urban management teams should understand the future spatial pattern of these changes by resorting to quantitative models in spatial planning. This is to ensure that future predictions are made with a high level of accuracy so that appropriate strategies can be used to address the problems arising from such changes. The Markov chain method is one of the quantitative models used in spatial planning to analyze time series based on current values to predict the series values in the future without relying on the past or historical values of the studied series. The research questions in this study are formulated thus: What are the trends in the patterns of urban land use functions in Al-Najaf, Iraq, between 2005 to 2015? How can the values of the changes be predicted for the year 2025? The hypothesis is based on the increasing spatial functional change of land use patterns in the city during the study period due to various economic and social factors. Making accurate predictions of the size of spatial changes motivates this study as a guide to urban management towards developing possible solutions to address the effects of this change, as well as the need to understand its causes and future upward trends. The contribution of this article is the presented outlook for spatial functions for the next 10 years. The computations using the Markov chain model will enable management to understand future relations and develop appropriate policies to reduce the hazards of unplanned changes in the city. Results show that residential posts, slums, and commercial activities are getting worse, while change values for industrial functions and other things are going down.
In this paper, a subspace identification method for bilinear systems is used . Wherein a " three-block " and " four-block " subspace algorithms are used. In this algorithms the input signal to the system does not have to be white . Simulation of these algorithms shows that the " four-block " gives fast convergence and the dimensions of the matrices involved are significantly smaller so that the computational complexity is lower as a comparison with " three-block " algorithm .
in this paper we adopted ways for detecting edges locally classical prewitt operators and modification it are adopted to perform the edge detection and comparing then with sobel opreators the study shows that using a prewitt opreators
In this paper we investigate the automatic recognition of emotion in text. We propose a new method for emotion recognition based on the PPM (PPM is short for Prediction by Partial Matching) character-based text compression scheme in order to recognize Ekman’s six basic emotions (Anger, Disgust, Fear, Happiness, Sadness, Surprise). Experimental results with three datasets show that the new method is very effective when compared with traditional word-based text classification methods. We have also found that our method works best if the sizes of text in all classes used for training are similar, and that performance significantly improves with increased data.
Due to the difficulties that Iraqi students face when writing in the English language, this preliminary study aimed to improve students' writing skills by using online platforms remotely. Sixty first-year students from Al-Furat Al–Awsat Technical University participated in this study. Through these platforms, the researchers relied on stimuli, such as images, icons, and short titles to allow for deeper and more accurate participations. Data were collected through corrections, observations, and feedback from the researchers and peers. In addition, two pre and post-tests were conducted. The quantitative data were analysed by SPSS statistical Editor, whereas the qualitative data were analyzed using the Piot table, an Excel sheet. The resu
... Show MoreDigital image is widely used in computer applications. This paper introduces a proposed method of image zooming based upon inverse slantlet transform and image scaling. Slantlet transform (SLT) is based on the principle of designing different filters for different scales.
First we apply SLT on color image, the idea of transform color image into slant, where large coefficients are mainly the signal and smaller one represent the noise. By suitably modifying these coefficients , using scaling up image by box and Bartlett filters so that the image scales up to 2X2 and then inverse slantlet transform from modifying coefficients using to the reconstructed image .
&nbs
... Show MoreA loS.sless (reversible) data hiding (embedding) method inside an image (translating medium) - presented in the present work using L_SB (least significant bit). technique which enables us to translate data using an image (host image), using a secret key, to be undetectable without losing any data or without changing the size and the external scene (visible properties) of the image, the hid-ing data is then can be extracted (without losing) by reversing &n
... Show More This paper introduces a relation between resultant and the Jacobian determinant
by generalizing Sakkalis theorem from two polynomials in two variables to the case of (n) polynomials in (n) variables. This leads us to study the results of the type: , and use this relation to attack the Jacobian problem. The last section shows our contribution to proving the conjecture.