In this paper, we will show that the Modified SP iteration can be used to approximate fixed point of contraction mappings under certain condition. Also, we show that this iteration method is faster than Mann, Ishikawa, Noor, SP, CR, Karahan iteration methods. Furthermore, by using the same condition, we shown that the Picard S- iteration method converges faster than Modified SP iteration and hence also faster than all Mann, Ishikawa, Noor, SP, CR, Karahan iteration methods. Finally, a data dependence result is proven for fixed point of contraction mappings with the help of the Modified SP iteration process.
With the fast progress of information technology and the computer networks, it becomes very easy to reproduce and share the geospatial data due to its digital styles. Therefore, the usage of geospatial data suffers from various problems such as data authentication, ownership proffering, and illegal copying ,etc. These problems can represent the big challenge to future uses of the geospatial data. This paper introduces a new watermarking scheme to ensure the copyright protection of the digital vector map. The main idea of proposed scheme is based on transforming the digital map to frequently domain using the Singular Value Decomposition (SVD) in order to determine suitable areas to insert the watermark data.
... Show MoreIn this paper, we apply a new technique combined by a Sumudu transform and iterative method called the Sumudu iterative method for resolving non-linear partial differential equations to compute analytic solutions. The aim of this paper is to construct the efficacious frequent relation to resolve these problems. The suggested technique is tested on four problems. So the results of this study are debated to show how useful this method is in terms of being a powerful, accurate and fast tool with a little effort compared to other iterative methods.
The aim of this paper is to propose an efficient three steps iterative method for finding the zeros of the nonlinear equation f(x)=0 . Starting with a suitably chosen , the method generates a sequence of iterates converging to the root. The convergence analysis is proved to establish its five order of convergence. Several examples are given to illustrate the efficiency of the proposed new method and its comparison with other methods.
In this work, we present the notion of sp[γ,γ^(* ) ]-open set, sp[γ,γ^(* ) ]-closed, and sp[γ,γ^(* ) ]-closure such that several properties are obtained. By using this concept, we define a new type of spaces named sp[γ,γ^(* ) ]-compact space.
In current article an easy and selective method is proposed for spectrophotometric estimation of metoclopramide (MCP) in pharmaceutical preparations using cloud point extraction (CPE) procedure. The method involved reaction between MCP with 1-Naphthol in alkali conditions using Triton X-114 to form a stable dark purple dye. The Beer’s law limit in the range 0.34-9 μg mL-1 of MCP with r =0.9959 (n=3) after optimization. The relative standard deviation (RSD) and percentage recoveries were 0.89 %, and (96.99–104.11%) respectively. As well, using surfactant cloud point extraction as a method to extract MCP was reinforced the extinction coefficient(ε) to 1.7333×105L/mol.cm in surfactant-rich phase. The small volume of organi
... Show MoreProduction sites suffer from idle in marketing of their products because of the lack in the efficient systems that analyze and track the evaluation of customers to products; therefore some products remain untargeted despite their good quality. This research aims to build a modest model intended to take two aspects into considerations. The first aspect is diagnosing dependable users on the site depending on the number of products evaluated and the user's positive impact on rating. The second aspect is diagnosing products with low weights (unknown) to be generated and recommended to users depending on logarithm equation and the number of co-rated users. Collaborative filtering is one of the most knowledge discovery techniques used positive
... Show More