Crow Search Algorithm (CSA) can be defined as one of the new swarm intelligence algorithms that has been developed lately, simulating the behavior of a crow in a storage place and the retrieval of the additional food when required. In the theory of the optimization, a crow represents a searcher, the surrounding environment represents the search space, and the random storage of food location represents a feasible solution. Amongst all the food locations, the one where the maximum amount of the food is stored is considered as the global optimum solution, and objective function represents the food amount. Through the simulation of crows’ intelligent behavior, the CSA attempts to find the optimum solutions to a variety of the problems that are related to the optimization. This study presents a new adaptive distributed algorithm of routing on CSA. Because the search space may be modified according to the size and kind of the network, the algorithm can be easily customized to the issue space. In contrast to population-based algorithms that have a broad and time-consuming search space. For ten networks of various sizes, the technique was used to solve the shortest path issue. And its capability for solving the problem of the routing in the switched networks is examined: detecting the shortest path in the process of a data packet transfer amongst the networks. The suggested method was compared with four common metaheuristic algorithms (which are: ACO, AHA, PSO and GA) on 10 datasets (integer, weighted, and not negative graphs) with a variety of the node sizes (10 - 297 nodes). The results have proven that the efficiency of the suggested methods is promising as well as competing with other approaches.
This paper deals with testing a numerical solution for the discrete classical optimal control problem governed by a linear hyperbolic boundary value problem with variable coefficients. When the discrete classical control is fixed, the proof of the existence and uniqueness theorem for the discrete solution of the discrete weak form is achieved. The existence theorem for the discrete classical optimal control and the necessary conditions for optimality of the problem are proved under suitable assumptions. The discrete classical optimal control problem (DCOCP) is solved by using the mixed Galerkin finite element method to find the solution of the discrete weak form (discrete state). Also, it is used to find the solution for the discrete adj
... Show MoreThis paper presents a proposed neural network algorithm to solve the shortest path problem (SPP) for communication routing. The solution extends the traditional recurrent Hopfield architecture introducing the optimal routing for any request by choosing single and multi link path node-to-node traffic to minimize the loss. This suggested neural network algorithm implemented by using 20-nodes network example. The result shows that a clear convergence can be achieved by 95% valid convergence (about 361 optimal routes from 380-pairs). Additionally computation performance is also mentioned at the expense of slightly worse results.
Cloud computing describes computer services provided through the internet and includes a wide range of virtualization resources. Because cloud computing is made up of a sizable number of heterogeneous autonomous systems with an adaptable computational architecture, it has been widely adopted by many businesses. The scheduling and management of resource utilization, however, have become more difficult as a result of cloud computing. Task scheduling is crucial, and this procedure must schedule tasks on the virtual machine while using the least amount of time possible. Utilizing an effective scheduling strategy enhances and expedites cloud computing services. Optimization techniques are used to resolve cloud scheduling problems.
... Show MoreIn this paper a decoder of binary BCH code is implemented using a PIC microcontroller for code length n=127 bits with multiple error correction capability, the results are presented for correcting errors up to 13 errors. The Berkelam-Massey decoding algorithm was chosen for its efficiency. The microcontroller PIC18f45k22 was chosen for the implementation and programmed using assembly language to achieve highest performance. This makes the BCH decoder implementable as a low cost module that can be used as a part of larger systems. The performance evaluation is presented in terms of total number of instructions and the bit rate.
During the educational practices in the Spanish department at the Faculty of Languages , University of Baghdad , we noticed that the personal pronouns in effect replaced by the direct and indirect characterized hardly be expressed , and the difficulty of her education.
Rationale: I chose this topic because the personal pronouns differ between the Spanish language and the Arabic language. We believe that this study may be useful not only for language teachers, but also for students, because it can contribute to a greater awareness of and correct weaknesses.
Objectives: To apply the model from which to address the problems in the use of personal pronouns Spanish , and the difference between effect of direct and indire
... Show MoreIn this paper, we devoted to use circular shape sliding block, in image edge determination. The circular blocks have symmetrical properties in all directions for the mask points around the central mask point. Therefore, the introduced method is efficient to be use in detecting image edges, in all directions curved edges, and lines. The results exhibit a very good performance in detecting image edges, comparing with other edge detectors results.
Malaria is a curative disease, with therapeutics available for patients, such as drugs that can prevent future malaria infections in countries vulnerable to malaria. Though, there is no effective malaria vaccine until now, although it is an interesting research area in medicine. Local descriptors of blood smear image are exploited in this paper to solve parasitized malaria infection detection problem. Swarm intelligence is used to separate the red blood cells from the background of the blood slide image in adaptive manner. After that, the effective corner points are detected and localized using Harris corner detection method. Two types of local descriptors are generated from the local regions of the effective corners which are Gabor based f
... Show MoreThis paper presents a hybrid approach for solving null values problem; it hybridizes rough set theory with intelligent swarm algorithm. The proposed approach is a supervised learning model. A large set of complete data called learning data is used to find the decision rule sets that then have been used in solving the incomplete data problem. The intelligent swarm algorithm is used for feature selection which represents bees algorithm as heuristic search algorithm combined with rough set theory as evaluation function. Also another feature selection algorithm called ID3 is presented, it works as statistical algorithm instead of intelligent algorithm. A comparison between those two approaches is made in their performance for null values estima
... Show MoreImage 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 More