This paper  deals  to how to estimate points non measured spatial data when the number of its terms (sample spatial) a few, that are not preferred for the estimation process, because we also know that whenever if the data is large, the estimation results of the points non measured to be better and thus the variance estimate less, so the idea of this paper is how to take advantage of the data other secondary (auxiliary), which have a strong correlation with the primary data (basic) to be estimated single points of non-measured, as well as measuring the variance estimate, has been the use of technique Co-kriging in this field to build predictions spatial estimation process, and then we applied this idea to real data in th

       In this paper, a fixed point theorem of nonexpansive mapping is established to study the existence and sufficient conditions for the controllability of nonlinear fractional control systems in reflexive Banach spaces. The result so obtained have been modified and developed in arbitrary space having Opial’s condition by using fixed point theorem deals with nonexpansive mapping defined on a set has normal structure. An application is provided to show the effectiveness of the obtained result.

Abstract

Although the rapid development in reverse engineering techniques, 3D laser scanners can be considered the modern technology used to digitize the 3D objects, but some troubles may be associate this process due to the environmental noises and limitation of the used scanners. So, in the present paper a data pre-processing algorithm has been proposed to obtain the necessary geometric features and mathematical representation of scanned object from its point cloud which obtained using 3D laser scanner (Matter and Form) through isolating the noised points. The proposed algorithm based on continuous calculations of chord angle between each adjacent pair of points in point cloud. A MATLAB program has been built t

The main purpose of this paper is to introduce and prove some fixed point theorems for two maps that

satisfy -contractive conditions with rational expression in partially ordered metric spaces, our results improve and unify a multitude of fixed point theorems and generalize some recent results in ordered partially metric space.

The linear segment with parabolic blend (LSPB) trajectory deviates from the specified waypoints. It is restricted to that the acceleration must be sufficiently high. In this work, it is proposed to engage modified LSPB trajectory with particle swarm optimization (PSO) so as to create through points on the trajectory. The assumption of normal LSPB method that parabolic part is centered in time around waypoints is replaced by proposed coefficients for calculating the time duration of the linear part. These coefficients are functions of velocities between through points. The velocities are obtained by PSO so as to force the LSPB trajectory passing exactly through the specified path points. Also, relations for velocity correction and exact v

     In this paper, we study some cases of a common fixed point theorem for classes of firmly nonexpansive and generalized nonexpansive maps. In addition, we establish that the Picard-Mann iteration is faster than Noor iteration and we used Noor iteration to find the solution of delay differential equation.

   In this paper we prove a theorem about the existence and uniqueness common fixed point for two uncommenting self-mappings which defined on orbitally complete G-metric space. Where we use a general contraction condition.
 

    In this work, we introduce Fibonacci– Halpern iterative scheme ( FH scheme) in partial ordered Banach space (POB space) for monotone total asymptotically non-expansive mapping (, MTAN mapping) that defined on weakly compact convex subset.  We also  discuss the results of weak and strong convergence for this scheme.

 Throughout  this work, compactness condition of m-th iterate  of the mapping for some natural m is necessary to ensure strong convergence, while Opial's condition has been employed to show weak convergence. Stability of FH scheme is also  studied. A numerical comparison is provided by an example to show that FH scheme is faster than Mann and Halpern iterative