An Optimal Algorithm for HTML Page Building Process

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

For several applications, it is very important to have an edge detection technique matching human visual contour perception and less sensitive to noise. The edge detection algorithm describes in this paper based on the results obtained by Maximum a posteriori (MAP) and Maximum Entropy (ME) deblurring algorithms. The technique makes a trade-off between sharpening and smoothing the noisy image. One of the advantages of the described algorithm is less sensitive to noise than that given by Marr and Geuen techniques that considered to be the best edge detection algorithms in terms of matching human visual contour perception.

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

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

Two quantitative, environment-friendly and easily monitored assays for Ni (II) and Co (III) ions analysis in different lipstick samples collected from 500-Iraqi dinars stores located in Baghdad were introduced. The study was based on the reaction of nickel (II) ions with dimethylglyoxime (DMG) reagent and the reaction of cobalt (III) ions with 1-nitroso-2-naphthol (NN) reagent to produce colored products. The color change was measured by spectrophotometric method at 565 nm and 430 nm for Ni and Co, respectively, with linear calibration graphs in the concentration range 0.25-100 mg L^-1 (Ni) and 0.5-100 mg L^-1 (Co) and LOD and LOQ of 0.11 mg L^-1 and 0.36 mg L^-1 (Ni), and 0.15 mg L^-1 an

Optical burst switching (OBS) network is a new generation optical communication technology. In an OBS network, an edge node first sends a control packet, called burst header packet (BHP) which reserves the necessary resources for the upcoming data burst (DB). Once the reservation is complete, the DB starts travelling to its destination through the reserved path. A notable attack on OBS network is BHP flooding attack where an edge node sends BHPs to reserve resources, but never actually sends the associated DB. As a result the reserved resources are wasted and when this happen in sufficiently large scale, a denial of service (DoS) may take place. In this study, we propose a semi-supervised machine learning approach using k-means algorithm

Pectin is available in many plants and in this study, the peels of tomatoes and beet were used to be an economical source of pectin production instead of dumping it with waste or using it as animal feed. The pectin extracted from the peels using different solutions, namely citric acid (2 M), oxalic acid (2%) and hydrochloric acid (0.5 M) the outcome of the extraction methods, 7. 1%, 6% and 11% respectively for tomatoes peels, while the pectin of beet peels were 8%, 6.5%, and 8.3%, and the highest percentage obtained in the manner of hydrochloric acid adopted in the manufacture of yogurt.Yogurt was manufactured with four treatments, in the first treatment standard pectin was added and the second treatment in addition to the pectin extracted