In this paper two ranking functions are employed to treat the fuzzy multiple objective (FMO) programming model, then using two kinds of membership function, the first one is trapezoidal fuzzy (TF) ordinary membership function, the second one is trapezoidal fuzzy weighted membership function. When the objective function is fuzzy, then should transform and shrinkage the fuzzy model to traditional model, finally solving these models to know which one is better
Urban land price is the primary indicator of land development in urban areas. Land prices in holly cities have rapidly increased due to tourism and religious activities. Public agencies are usually facing challenges in managing land prices in religious areas. Therefore, they require developed models or tools to understand land prices within religious cities. Predicting land prices can efficiently retain future management and develop urban lands within religious cities. This study proposed a new methodology to predict urban land prices within holy cities. The methodology is based on two models, Linear Regression (LR) and Support Vector Regression (SVR), and nine variables (land price, land area,
... Show MoreNecessary and sufficient conditions for the operator equation I AXAX n*, to have a real positive definite solution X are given. Based on these conditions, some properties of the operator A as well as relation between the solutions X andAare given.
Were arranged this study on two sections, which included first section comparison between markets proposed through the use of transport models and the use of the program QSB for less costs , dependant the optimal solution to chose the suggested market to locate new market that achieve lower costs in the transport of goods from factories (ALRasheed ,ALAmeen , AlMaamun ) to points of sale, but the second part has included comparison of all methods of transport (The least cost method ,Vogels method , Results Approximations method , Total method) depending on the agenda of transport, which includes the market proposed selected from the first section and choose the way in which check the solution first best suited in terms
... Show MoreA new algorithm is proposed to compress speech signals using wavelet transform and linear predictive coding. Signal compression based on the concept of selecting a small number of approximation coefficients after they are compressed by the wavelet decomposition (Haar and db4) at a suitable chosen level and ignored details coefficients, and then approximation coefficients are windowed by a rectangular window and fed to the linear predictor. Levinson Durbin algorithm is used to compute LP coefficients, reflection coefficients and predictor error. The compress files contain LP coefficients and previous sample. These files are very small in size compared to the size of the original signals. Compression ratio is calculated from the size of th
... Show MoreA flexible pavement structure usually comprises more than one asphalt layer, with varying thicknesses and properties, in order to carry the traffic smoothly and safely. It is easy to characterize each asphalt layer with different tests to give a full description of that layer; however, the performance of the whole; asphalt structure needs to be properly understood. Typically, pavement analysis is carried out using multi-layer linear elastic assumptions, via equations and computer programs such as KENPAVE, BISAR, etc. These types of analysis give the response parameters including stress, strain, and deflection at any point under the wheel load. This paper aims to estimate the equivalent Resilient Modulus (MR) of the asphalt concrete
... Show MoreIn this paper, certain types of regularity of topological spaces have been highlighted, which fall within the study of generalizations of separation axioms. One of the important axioms of separation is what is called regularity, and the spaces that have this property are not few, and the most important of these spaces are Euclidean spaces. Therefore, limiting this important concept to topology is within a narrow framework, which necessitates the use of generalized open sets to obtain more good characteristics and preserve the properties achieved in general topology. Perhaps the reader will realize through the research that our generalization preserved most of the characteristics, the most important of which is the hereditary property. Two t
... Show MoreAbstract This research sheds lights on one of the important rhetorical linguistics methods, which is the idioms phrase and its use in the Israeli political article. By the studying of its most prominent types and different grammatical structures, and its deliberative function. The application of this study was the articles of the Israeli journalist Ben-Dror Yemini. Which were published on the website of Israeli newspaper " Maariv" in (2011-2012). This research is divided into two devotions: theoretically and practically. The theoretical side included an introduction to identify the article generally, and the political article. Practically with a review of the most important definitions concerned with the idioms phrase and showing i
... Show MoreEnergy Loss Function (ELF) of 2 5 Ta O derived from optical limit
and extended to the total part of momentum and their energy
excitation region ELF plays an important function in calculating
energy loss of electron in materials. The parameter Inelastic Mean
Free Path (IMFP) is most important in quantitative surface sensitive
electron spectroscopies, defined as the average distance that an
electron with a given energy travels between successive inelastic
collisions. The stopping cross section and single differential crosssection
SDCS are also calculated and gives good agreement with
previous work.
Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph Kn, Complete bipartite graph Km,n and Complete tripartite graph Kl,m,n. It has also been studied how the lucky number changes whi
... Show MoreIn this paper mildly-regular topological space was introduced via the concept of mildly g-open sets. Many properties of mildly - regular space are investigated and the interactions between mildly-regular space and certain types of topological spaces are considered. Also the concept of strong mildly-regular space was introduced and a main theorem on this space was proved.