Scheduling considered being one of the most fundamental and essential bases of the project management. Several methods are used for project scheduling such as CPM, PERT and GERT. Since too many uncertainties are involved in methods for estimating the duration and cost of activities, these methods lack the capability of modeling practical projects. Although schedules can be developed for construction projects at early stage, there is always a possibility for unexpected material or technical shortages during construction stage. The objective of this research is to build a fuzzy mathematical model including time cost tradeoff and resource constraints analysis to be applied concurrently. The proposed model has been formulated using fuzzy the

The research aims to evaluate the suppliers at Diyala general electric industries company conducted in an environment of uncertainty and fuzzy where there is no particular system followed by the company, and also aims to use the problem of traveling salesman problem in the process of transporting raw materials from suppliers to the company in a fuzzy environment. Therefore, a system based on mathematical methods and quantity was developed to evaluate the suppliers. Fuzzy inference system (FIS) and fuzzy set theory were used to solve this problem through (Matlab) and the problem of the traveling salesman in two stages was also solved by the first stage of eliminating the fuzzing of the environment using the rank function method, w

   The main focus of this research is to examine the Travelling Salesman Problem (TSP) and the methods used to solve this problem where this problem is considered as one of the combinatorial optimization problems which met wide publicity and attention from the researches for to it's simple formulation and important applications and engagement to the rest of combinatorial problems , which is based on finding the optimal path through known number of cities where the salesman visits each city only once before returning to the city of departure n this research , the benefits  of( FMOLP)   algorithm is employed as one of the best methods to solve the (TSP) problem and the application of the algorithm in conjun

 
      The process of soil classification in Iraq for industrial purposes is important topics that need to be extensive and specialized studies. In order for the advancement of reality service and industrial in our dear country, that a lot of scientific research touched upon the soil classification in the agricultural, commercial and other fields. No source and research can be found that touched upon the classification of land for industrial purposes directly. In this research specialized programs have been used such as geographic information system software The geographical information system permits the study of local distribution of phenomena, activities and the aims that can be determined in the loca

The Internet of Things (IoT) has significantly transformed modern systems through extensive connectivity but has also concurrently introduced considerable cybersecurity risks. Traditional rule-based methods are becoming increasingly insufficient in the face of evolving cyber threats.  This study proposes an enhanced methodology utilizing a hybrid machine-learning framework for IoT cyber-attack detection. The framework integrates a Grey Wolf Optimizer (GWO) for optimal feature selection, a customized synthetic minority oversampling technique (SMOTE) for data balancing, and a systematic approach to hyperparameter tuning of ensemble algorithms: Random Forest (RF), XGBoost, and CatBoost. Evaluations on the RT-IoT2022 dataset demonstrat

Background: Odontogenic tumors are a diverse group of lesions with a variety of clinical behavior and histopathologic subtypes, from hamartomatous and benign to malignant. The study aimed to examine the clinical and pathological features of odontogenic tumors in Baghdad over the last 11 years (2011–2021). Materials and Methods: The present retrospective study analyzed all formalin-fixed, paraffin-embedded tissue blocks of patients diagnosed with an odontogenic tumor that were retrieved from archives at a teaching hospital/College of Dentistry in Baghdad University, Iraq, between 2011 and 2021. The diagnosis of each case was confirmed by examining the hematoxylin and eosin stained sections by two expert pathologists. Data from pati

The support vector machine, also known as SVM, is a type of supervised learning model that can be used for classification or regression depending on the datasets. SVM is used to classify data points by determining the best hyperplane between two or more groups. Working with enormous datasets, on the other hand, might result in a variety of issues, including inefficient accuracy and time-consuming. SVM was updated in this research by applying some non-linear kernel transformations, which are: linear, polynomial, radial basis, and multi-layer kernels. The non-linear SVM classification model was illustrated and summarized in an algorithm using kernel tricks. The proposed method was examined using three simulation datasets with different sample

Early diagnosis and clinical decision-making depend on accurate brain tumor classification using magnetic resonance imaging (MRI). However, traditional deep learning methods usually rely on centralized medical data, which raises privacy concerns and limits the use of distributed clinical data. This research proposes a privacy-preserving federated learning framework for MRI image-based binary brain tumor classification using a decentralized ResNet-18 architecture that enables collaborative training without sharing raw patient data. To reflect realistic clinical conditions, the framework integrates heterogeneous multi-source datasets in different image formats (PNG and JPG) and evaluates performance under both IID and non-IID settings

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.