The swarm intelligence and evolutionary methods are commonly utilized by researchers in solving the difficult combinatorial and Non-Deterministic Polynomial (NP) problems. The N-Queen problem can be defined as a combinatorial problem that became intractable for the large ‘n’ values and, thereby, it is placed in the NP class of problems. In the present study, a solution is suggested for the N-Queen problem, on the basis of the Meerkat Clan Algorithm (MCA). The problem of n-Queen can be mainly defined as one of the generalized 8-Queen problem forms, for which the aim is placing 8 queens in a way that none of the queens has the ability of killing the others with the use of the standard moves of the chess queen. The Meerkat Clan environm

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally th

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

The cloud-users are getting impatient by experiencing the delays in loading the content of the web applications over the internet, which is usually caused by the complex latency while accessing the cloud datacenters distant from the cloud-users. It is becoming a catastrophic situation in availing the services and applications over the cloud-centric network. In cloud, workload is distributed across the multiple layers which also increases the latency. Time-sensitive Internet of Things (IoT) applications and services, usually in a cloud platform, are running over various virtual machines (VM’s) and possess high complexities while interacting. They face difficulties in the consolidations of the various applications containing heterog

Abstract

This Research aims for harnessing critical and innovative thinking approaches besides innovative problem solving tools in pursuing continual quality improvement initiatives for the benefit of achieving operations results effectively in water treatment plants in Baghdad Water Authority. Case study has been used in fulfilling this research in the sadr city water treatment plant, which was chosen as a study sample as it facilitates describing and analyzing its current operational situation, collecting and analyzing its own data, in order to get its own desired improvement opportunity be done. Many statistical means and visual thinking promoting methods has been used to fulfill research task.

Abstract

      Objective (s): To evaluate reasons for partial compliance and non-compliance to the

                              routine childhood vaccination schedule in Al-Karkh district 

Methodology: Descriptive study , using the evaluation approach, is carried throughout the present study to determine the reasons for the Routine Childhood Vaccination at  health care sectors and primary health care centers at  Al-Karkh District in Baghdad City, Convenient, non-probability, sample of (90) mother who are recruited from health care sectors at Al-Karkh District in Baghdad City. All mothers, who ha

Let be a Banach space, be a nonempty closed convex subset of , and be self
nonexpansive map. The sequence generated by the iterative method
, where be a contractive mapping
and is a sequence in We generalize the mapping to non-sel -Strongly
Pseudocontractive .