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 present study dealt with the removal of methylene blue from wastewater by using peanut hulls (PNH) as adsorbent. Two modes of operation were used in the present work, batch mode and inverse fluidized bed mode. In batch experiment, the effect of peanut hulls doses 2, 4, 8, 12 and 16 g, with constant initial pH =5.6, concentration 20 mg/L and particle size 2-3.35 mm were studied. The results showed that the percent removal of methylene blue increased with the increase of peanut hulls dose. Batch kinetics experiments showed that equilibrium time was about 3 hours, isotherm models (Langmuir and Freundlich) were used to correlate these results. The results showed that the (Freundlich) model gave the best fitting for adsorption capacity. D
... Show MoreVariation orders are an on-going phenomenon in construction and industry projects worldwide, particularly in the province of Sulaimani, where the project's damage from cost and schedule overrun because of variation orders. However, the effect on project costs and time overrun of variation order has yet to be identified. This study evaluates the impact of variation orders on the cost and time off in the Sulaimani governorate. Two hundred twenty-eight projects from various construction sectors built between 2007-2012 were adopted to calculate the contract cost and schedule overruns due to variation orders. Data analysis was applied in the study were descriptive statistics. One-way ANOVA was also applied to determine w
... Show MoreIn this paper, customers’ expectations are continually shifting due to the business environment’s growing competition and substantial changes. As a result, organisations no longer viewed it as a static objective but as an ever-evolving aim. From this vantage point, the research has explored the accounting literature in search of novel approaches to addressing the strategic dimensions of quality, cost and time. Getting them to respond positively to the customer’s requests also requires recognising their needs and controlling their impact on these dimensions. With the removal of operations that do not contribute any value to the product’s value chain and a reduction in manufacturing costs through continuous improvement, the ou
... Show MoreMost recognition system of human facial emotions are assessed solely on accuracy, even if other performance criteria are also thought to be important in the evaluation process such as sensitivity, precision, F-measure, and G-mean. Moreover, the most common problem that must be resolved in face emotion recognition systems is the feature extraction methods, which is comparable to traditional manual feature extraction methods. This traditional method is not able to extract features efficiently. In other words, there are redundant amount of features which are considered not significant, which affect the classification performance. In this work, a new system to recognize human facial emotions from images is proposed. The HOG (Histograms of Or
... Show Moreconventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation.
Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are
LK Abood, RA Ali, M Maliki, International Journal of Science and Research, 2015 - Cited by 2
Recently, a new secure steganography algorithm has been proposed, namely, the secure Block Permutation Image Steganography (BPIS) algorithm. The new algorithm consists of five main steps, these are: convert the secret message to a binary sequence, divide the binary sequence into blocks, permute each block using a key-based randomly generated permutation, concatenate the permuted blocks forming a permuted binary sequence, and then utilize a plane-based Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image file format. The performance of algorithm was given a preliminary evaluation through estimating the PSNR (Peak Signal-to-Noise Ratio) of the stego image for limited number of experiments comprised hiding
... Show More