Hiding technique for dynamic encryption text using encoding table and symmetric encryption method (AES algorithm) is presented in this paper. The encoding table is generated dynamically from MSB of the cover image points that used as the first phase of encryption. The Harris corner point algorithm is applied on cover image to generate the corner points which are used to generate dynamic AES key to second phase of text encryption. The embedded process in the LSB for the image pixels except the Harris corner points for more robust. Experimental results have demonstrated that the proposed scheme have embedding quality, error-free text recovery, and high value in PSNR.

Routing protocols are responsible for providing reliable communication between the source and destination nodes. The performance of these protocols in the ad hoc network family is influenced by several factors such as mobility model, traffic load, transmission range, and the number of mobile nodes which represents a great issue. Several simulation studies have explored routing protocol with performance parameters, but few relate to various protocols concerning routing and Quality of Service (QoS) metrics. This paper presents a simulation-based comparison of proactive, reactive, and multipath routing protocols in mobile ad hoc networks (MANETs). Specifically, the performance of AODV, DSDV, and AOMDV protocols are evaluated and analyz

ABSTRACT Background: One of the challenges to use chlorhexidine is its effect on the amount of microleakage after restoration; however, use of the materials with antibacterial properties after tooth preparation and before restoration has been widespread. The objective of this, in-vitro, study was to evaluate the influence of consepsis (chlorhexidine gloconate disinfectant) application on microleakage in class II cavities restored with light cured composite using universal adhesive system; etch and rinse technique –self etch technique. Materials and Methods: Forty class II cavities were prepared on mesial and distal surfaces of 20 non-carious mandibular third molars. The cavities were divided into four groups; (n =10 for each group).

Background: Polycystic ovarian syndrome is a common endocrine disorder affecting 6-10% of women of reproductive age and the most common cause of anovulatory infertility.

Objective: The aim of the study was to compare the effectiveness, side effects and outcomes of step-up gonadotrophin protocol versus laparoscopic ovarian diathermy (LOD) in infertile patients with clomiphene citrate resistant polycystic ovary syndrome.

Methods:  The sample included women who attended our infertility clinic at Al-Elwiya Maternity Teaching Hospital and Kamal Al-Samarraee for Infertility and IVF Hospital in Baghdad/ Iraq from November 2013 to November 2014.    Eighty case

Background: Polycystic ovarian syndrome is a common endocrine disorder affecting 6-10% of women of reproductive age and the most common cause of anovulatory infertility. Objective: The aim of the study was to compare the effectiveness, side effects and outcomes of step-up gonadotrophin protocol versus laparoscopic ovarian diathermy (LOD) in infertile patients with clomiphene citrate resistant polycystic ovary syndrome. Methods:  The sample included women who attended our infertility clinic at Al-Elwiya Maternity Teaching Hospital and Kamal Al-Samarraee for Infertility and IVF Hospital in Baghdad/ Iraq from November 2013 to November 2014.    Eighty cases of infertile women with polycystic ovarian syndrome who failed t

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

Solid waste is a major issue in today's world. Which can be a contributing factor to pollution and the spread of vector-borne diseases. Because of its complicated nonlinear processes, this problem is difficult to model and optimize using traditional methods. In this study, a mathematical model was developed to optimize the cost of solid waste recycling and management. In the optimization phase, the salp swarm algorithm (SSA) is utilized to determine the level of discarded solid waste and reclaimed solid waste. An optimization technique SSA is a new method of finding the ideal solution for a mathematical relationship based on leaders and followers. It takes a lot of random solutions, as well as their outward or inward fluctuations, t

This paper focuses on the optimization of drilling parameters by utilizing “Taguchi method” to obtain the minimum surface roughness. Nine drilling experiments were performed on Al 5050 alloy using high speed steel twist drills. Three drilling parameters (feed rates, cutting speeds, and cutting tools) were used as control factors, and L9 (3³) “orthogonal array” was specified for the experimental trials. Signal to Noise (S/N) Ratio and “Analysis of Variance” (ANOVA) were utilized to set the optimum control factors which minimized the surface roughness. The results were tested with the aid of statistical software package MINITAB-17. After the experimental trails, the tool diameter was found as the most important facto

The aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).

Face recognition is required in various applications, and major progress has been witnessed in this area. Many face recognition algorithms have been proposed thus far; however, achieving high recognition accuracy and low execution time remains a challenge. In this work, a new scheme for face recognition is presented using hybrid orthogonal polynomials to extract features. The embedded image kernel technique is used to decrease the complexity of feature extraction, then a support vector machine is adopted to classify these features. Moreover, a fast-overlapping block processing algorithm for feature extraction is used to reduce the computation time. Extensive evaluation of the proposed method was carried out on two different face ima