Throughout this paper, a generic iteration algorithm for a finite family of total asymptotically quasi-nonexpansive maps in uniformly convex Banach space is suggested. As well as weak / strong convergence theorems of this algorithm to a common fixed point are established. Finally, illustrative numerical example by using Matlab is presented.
Abstract The present research aims to know the range of Knowledge and the using of teachers of aerography department in colleges of Education to Applicant electronic Learning , So the Sample of the research reached (129) teacher, of the university of Boghdad and Al mustansiria who were chosen by using Randomly sample , and applauding questioner for these perpos that prepared by muhamed bn Ghazi Al Judi – and by using the T-test for one sample and person correlation formula as a statistical means. The research reached to the results which indicate that weakness knowledge and using the theachers of geographe department to the application electronic learning. And according this the researcher put some Recommendation and suggestions.
... Show MoreWith the rapid development of smart devices, people's lives have become easier, especially for visually disabled or special-needs people. The new achievements in the fields of machine learning and deep learning let people identify and recognise the surrounding environment. In this study, the efficiency and high performance of deep learning architecture are used to build an image classification system in both indoor and outdoor environments. The proposed methodology starts with collecting two datasets (indoor and outdoor) from different separate datasets. In the second step, the collected dataset is split into training, validation, and test sets. The pre-trained GoogleNet and MobileNet-V2 models are trained using the indoor and outdoor se
... Show MoreIn this paper, a compact genetic algorithm (CGA) is enhanced by integrating its selection strategy with a steepest descent algorithm (SDA) as a local search method to give I-CGA-SDA. This system is an attempt to avoid the large CPU time and computational complexity of the standard genetic algorithm. Here, CGA dramatically reduces the number of bits required to store the population and has a faster convergence. Consequently, this integrated system is used to optimize the maximum likelihood function lnL(φ1, θ1) of the mixed model. Simulation results based on MSE were compared with those obtained from the SDA and showed that the hybrid genetic algorithm (HGA) and I-CGA-SDA can give a good estimator of (φ1, θ1) for the ARMA(1,1) model. Anot
... Show MoreImproving" Jackknife Instrumental Variable Estimation method" using A class of immun algorithm with practical application
Background: The purpose of this study is to compare the color changes between the bonded middle third and the unbonded gingival and incisal thirds, fallowing fixed orthodontic treatment Material and method: The color parameter l, a, b has been recorded for each thirds in upper anterior teeth by mean of easy shad device. The has been calculated for gingival, middle and incisal thirds for the upper anterior teeth in 34 patient, 17 males and 17femals, those subject undergone fixed orthodontic treatment Results: The in middle bonded third is highly significant higher than that in incise and gingival thirds p<0.01 because the middle third isn’t expose to oral fluid and dental brushing since it covered by the bracket. Also there
... Show MoreBackground: The aim of this study is to evaluate the color change ∆E of the dental enamel following treatment with 2 kinds of protector (icon infiltrant, clinpro varnish) before fixed orthodontic treatment to avoid the possible white spot lesions. Materials and Methods: Fifty four subjects treated with fixed appliances were divided into 3 groups: the 1st group was control, while the 2nd and 3rd groups were treated with icon infiltrant and clinpro varnish before bonding procedure, respectively. Color parameters (L,a,b) were recorded for the middle and gingival thirds before and after bonding procedure to get the ∆E of each group. Results: One-way ANOVA test showed a non-significant difference in ∆E between the 3 groups a
... Show MoreThis research was carried out to study the effect of plants on the wetted area for two soil types in Iraq and predict an equation to determine the wetted radius and depth for two different soil types cultivated with different types of plants, the wetting patterns for the soils were predicted at every thirty minute for a total irrigation time equal to 3 hr. Five defferent discharges of emitter and five initial volumetric soil moisture contents were used ranged between field capacity and wilting point were utilized to simulate the wetting patterns. The simulation of the water flow from a single point emitter was completed by utilized HYDRUS-2D/3D software, version 2.05. Two methods were used in developing equations to predict the domains o
... Show MoreA fuzzy logic approach (FLA) application in the process of stud arc welding environment was implemented under the condition of fuzziness input data. This paper is composed of the background of FLA, related research work review and points for developing in stud welding manufacturing. Then, it investigates thecase of developingstud arc welding process on the controversial certaintyof available equipment and human skills.Five parameters (welding time, sheet thickness, type of coating, welding current and stud shape) were studied.A pair of parameter was selected asiteration whichis welding current and welding time and used fo
... Show MoreImage compression is a serious issue in computer storage and transmission, that simply makes efficient use of redundancy embedded within an image itself; in addition, it may exploit human vision or perception limitations to reduce the imperceivable information Polynomial coding is a modern image compression technique based on modelling concept to remove the spatial redundancy embedded within the image effectively that composed of two parts, the mathematical model and the residual. In this paper, two stages proposed technqies adopted, that starts by utilizing the lossy predictor model along with multiresolution base and thresholding techniques corresponding to first stage. Latter by incorporating the near lossless com
... Show MoreThere are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com
... Show More