This article will introduce a new iteration method called the zenali iteration method for the approximation of fixed points. We show that our iteration process is faster than the current leading iterations like Mann, Ishikawa, oor, D- iterations, and *- iteration for new contraction mappings called quasi contraction mappings. And we proved that all these iterations (Mann, Ishikawa, oor, D- iterations and *- iteration) equivalent to approximate fixed points of quasi contraction. We support our analytic proof by a numerical example, data dependence result for contraction mappings type by employing zenali iteration also discussed.
Merging biometrics with cryptography has become more familiar and a great scientific field was born for researchers. Biometrics adds distinctive property to the security systems, due biometrics is unique and individual features for every person. In this study, a new method is presented for ciphering data based on fingerprint features. This research is done by addressing plaintext message based on positions of extracted minutiae from fingerprint into a generated random text file regardless the size of data. The proposed method can be explained in three scenarios. In the first scenario the message was used inside random text directly at positions of minutiae in the second scenario the message was encrypted with a choosen word before ciphering
... Show MoreThe researcher [1-10] proposed a method for computing the numerical solution to quasi-linear parabolic p.d.e.s using a Chebyshev method. The purpose of this paper is to extend the method to problems with mixed boundary conditions. An error analysis for the linear problem is given and a global element Chebyshev method is described. A comparison of various chebyshev methods is made by applying them to two-point eigenproblems. It is shown by analysis and numerical examples that the approach used to derive the generalized Chebyshev method is comparable, in terms of the accuracy obtained, with existing Chebyshev methods.
The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.
Design of experiments (DOE) was made by Minitab software for the study of three factors used in the precipitation process of the Sodium Aluminate solution prepared from digestion of α-Al2O3 to determine the optimum conditions to a produce Boehmite which is used in production of ɤ-Al2O3 during drying and calcination processes, the factors are; the temperature of the sodium aluminate solution, concentration of HCl acid added for the precipitation and the pH of the solution at which the precipitation was ended. The design of the experiments leads to 18 experiments.
The results show that the optimum conditions for the precipitation of the sodium aluminate solution which
... Show MoreIn this work , an effective procedure of Box-Behnken based-ANN (Artificial Neural Network) and GA (Genetic Algorithm) has been utilized for finding the optimum conditions of wt.% of doping elements (Ce,Y, and Ge) doped-aluminizing-chromizing of Incoloy 800H . ANN and Box-Behnken design method have been implanted for minimizing hot corrosion rate kp (10-12g2.cm-4.s-1) in Incoloy 800H at 900oC . ANN was used for estimating the predicted values of hot corrosion rate kp (10-12g2.cm-4.s-1) . The optimal wt.% of doping elements combination to obtain minimum hot corrosion rate was calculated using genetic alg
... Show MoreIt is axiomatical that the narrative prospective is profoundly significant to the writer who intends to commence his sketch of projected novel. It is the pillar of comprehensive absorbing as the writer should commit himself to circular his own concepts to the reader of his narrative characters.
The dilemma of plot-perception is a twofold aspect; partly offers the question: what is the authors stand in regard to his characters? And: what is the aim of this theme? These correlative questions are inseparable since the reader who wishes
... Show MoreA coin has two sides. Steganography although conceals the existence of a message but is not completely secure. It is not meant to supersede cryptography but to supplement it. The main goal of this method is to minimize the number of LSBs that are changed when substituting them with the bits of characters in the secret message. This will lead to decrease the distortion (noise) that is occurred in the pixels of the stego-image and as a result increase the immunity of the stego-image against the visual attack. The experiment shows that the proposed method gives good enhancement to the steganoraphy technique and there is no difference between the cover-image and the stego-image that can be seen by the human vision system (HVS), so this method c
... Show MoreInterval methods for verified integration of initial value problems (IVPs) for ODEs have been used for more than 40 years. For many classes of IVPs, these methods have the ability to compute guaranteed error bounds for the flow of an ODE, where traditional methods provide only approximations to a solution. Overestimation, however, is a potential drawback of verified methods. For some problems, the computed error bounds become overly pessimistic, or integration even breaks down. The dependency problem and the wrapping effect are particular sources of overestimations in interval computations. Berz (see [1]) and his co-workers have developed Taylor model methods, which extend interval arithmetic with symbolic computations. The latter is an ef
... Show More