Image segmentation is a basic image processing technique that is primarily used for finding segments that form the entire image. These segments can be then utilized in discriminative feature extraction, image retrieval, and pattern recognition. Clustering and region growing techniques are the commonly used image segmentation methods. K-Means is a heavily used clustering technique due to its simplicity and low computational cost. However, K-Means results depend on the initial centres’ values which are selected randomly, which leads to inconsistency in the image segmentation results. In addition, the quality of the isolated regions depends on the homogeneity of the resulted segments. In this paper, an improved K-Means
... Show MoreMulti-carrier direct sequence code division multiple access (MC-DS-CDMA) has emerged recently as a promising candidate for the next generation broadband mobile networks. Multipath fading channels have a severe effect on the performance of wireless communication systems even those systems that exhibit efficient bandwidth, like orthogonal frequency division multiplexing (OFDM) and MC-DS-CDMA; there is always a need for developments in the realisation of these systems as well as efficient channel estimation and equalisation methods to enable these systems to reach their maximum performance. A novel MC-DS-CDMA transceiver based on the Radon-based OFDM, which was recently proposed as a new technique in the realisation of OFDM systems, will be us
... Show MoreIn this paper, the bi-criteria machine scheduling problems (BMSP) are solved, where the discussed problem is represented by the sum of completion and the sum of late work times simultaneously. In order to solve the suggested BMSP, some metaheurisitc methods are suggested which produce good results. The suggested local search methods are simulated annulling and bees algorithm. The results of the new metaheurisitc methods are compared with the complete enumeration method, which is considered an exact method, then compared results of the heuristics with each other to obtain the most efficient method.
In this paper, our purpose is to study the classical continuous optimal control (CCOC) for quaternary nonlinear parabolic boundary value problems (QNLPBVPs). The existence and uniqueness theorem (EUTh) for the quaternary state vector solution (QSVS) of the weak form (WF) for the QNLPBVPs with a given quaternary classical continuous control vector (QCCCV) is stated and proved via the Galerkin Method (GM) and the first compactness theorem under suitable assumptions(ASSUMS). Furthermore, the continuity operator for the existence theorem of a QCCCV dominated by the QNLPBVPs is stated and proved under suitable conditions.
Triticale is being evaluated as a substitute for corn in animal feed and as a forage crop for Florida. Storage of triticale seed is difficult in Florida's hot and humid climate, and more information about the relationships between equilibrium moisture content (EMC) and equilibrium relative humidity (ERH) at constant temperature (sorption isotherms) of triticale is needed to develop improved storage methods. Therefore, the primary research objective was to measure the EMC for triticale seed at different ERH values at three different constant temperatures (5°C, 23°C, and 35°C) using six desiccation jars containing different saturated salt concentrations. The secondary objective was to determine the best fit equation describing these relati
... Show MoreIn this paper, we introduce and discuss an algorithm for the numerical solution of two- dimensional fractional dispersion equation. The algorithm for the numerical solution of this equation is based on explicit finite difference approximation. Consistency, conditional stability, and convergence of this numerical method are described. Finally, numerical example is presented to show the dispersion behavior according to the order of the fractional derivative and we demonstrate that our explicit finite difference approximation is a computationally efficient method for solving two-dimensional fractional dispersion equation
Optimization is the task of minimizing or maximizing an objective function f(x) parameterized by x. A series of effective numerical optimization methods have become popular for improving the performance and efficiency of other methods characterized by high-quality solutions and high convergence speed. In recent years, there are a lot of interest in hybrid metaheuristics, where more than one method is ideally combined into one new method that has the ability to solve many problems rapidly and efficiently. The basic concept of the proposed method is based on the addition of the acceleration part of the Gravity Search Algorithm (GSA) model in the Firefly Algorithm (FA) model and creating new individuals. Some stan
... Show MoreBuilding Information Modeling (BIM) and Lean Construction (LC) are two quickly growing applied research areas in construction management. This study focuses on identifying the most essential benefits and analyzing the most affecting constraints on the construction sector that construction players face as they attempt to combine BIM-LC in Iraqi construction. Experts assessed 30 benefits and 28 constraints from examining the previous literature, and a two-round Delphi survey formed the responses. Expert consensus analysis was utilized to elaborate and validate responses after descriptive statistical checks had been used for data processing.
According to the study's findings, the benefits include ensuring the most ef
... Show MoreMultipole mixing ratios for gamma transition populated in from reaction have been studied by least square fitting method also transition strength ] for pure gamma transitions have been calculated taking into account the mean life time for these levels .
The traditional shortest path problem is mainly concerned with identifying the associated paths in the transportation network that represent the shortest distance between the source and the destination in the transportation network by finding either cost or distance. As for the problem of research under study it is to find the shortest optimal path of multi-objective (cost, distance and time) at the same time has been clarified through the application of a proposed practical model of the problem of multi-objective shortest path to solve the problem of the most important 25 commercial US cities by travel in the car or plane. The proposed model was also solved using the lexicographic method through package program Win-QSB 2.0 for operation
... Show More