The cost of pile foundations is part of the super structure cost, and it became necessary to reduce this cost by studying the pile types then decision-making in the selection of the optimal pile type in terms of cost and time of production and quality .So The main objective of this study is to solve the time–cost–quality trade-off (TCQT) problem by finding an optimal pile type with the target of "minimizing" cost and time while "maximizing" quality. There are many types In the world of piles but  in this paper, the researcher proposed five pile types, one of them is not a traditional, and   developed a model for the problem and then employed particle swarm optimization (PSO) algorithm, as one of evolutionary algorithms with t

The objective of this research is to know the economic feasibility of hydroponics technology by estimating the expected demand for green forage for the years 2021-2031 as well as Identify and analyze project data and information in a way that helps the investor make the appropriate investment decision in addition to preparing a detailed technical preliminary study for the cultivar barley project focusing on the commercial and financing aspects and the criteria that take into account the risks and uncertainties . that indicating the economic feasibility of the project to produce green forage using hydroponics technology. Cultured barley as a product falls within the blue ocean strategy. Accordingly, the research recommends the necess

In the present paper, three reliable iterative methods are given and implemented to solve the 1D, 2D and 3D Fisher’s equation. Daftardar-Jafari method (DJM), Temimi-Ansari method (TAM) and Banach contraction method (BCM) are applied to get the exact and numerical solutions for Fisher's equations. The reliable iterative methods are characterized by many advantages, such as being free of derivatives, overcoming the difficulty arising when calculating the Adomian polynomial boundaries to deal with nonlinear terms in the Adomian decomposition method (ADM), does not request to calculate Lagrange multiplier as in the Variational iteration method (VIM) and there is no need to create a homotopy like in the Homotopy perturbation method (H

This research aims to know the essence of the correlative relationship between tactical thinking and solving mathematical problems. The researchers followed the descriptive research method to analyze relations, as all students from the mathematics department in the morning study were part of the research group. The research sample of (100) male and female students has been chosen based on the arbitrators' views. The tools for studying the sample of research composed of (12) items of the multiple-choice test in its final form to measure tactical thinking and require establish-ing a test of (6) test-type paragraphs to solve mathematical problems. The findings showed that sample students' tactical thinking and their capacity to overcome mathem

Abstract

 A surface fitting model is developed based on calorimeter data for two famous brands of household compressors. Correlation equations of ten coefficient polynomials were found as a function of refrigerant saturating and evaporating temperatures in range of (-35℃ to -10℃) using Matlab software for cooling capacity, power consumption, and refrigerant mass flow rate.

Additional correlations equations for these variables as a quick choice selection for a proper compressor use at ASHRAE standard that cover a range of swept volume range (2.24-11.15) cm³.

The result indicated that these surface fitting models are accurate with in ± 15% for 72 compressors model of cooling cap

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 .