Abstract:The optimum design of the magnetic deflector with the lowest values of the radial and spiral distortion aberration coefficients was computed. The optimized calculations were made using three models, Glaser bell-shaped, Grivet-lenz and exponential models. By using the optimum axial field distribution, the pole pieces shape which gave rise to those field distributions was found by using the reconstruction method. The calculations show that the results of the three models coincide at the lower values of the excitation parameter. In general the Glaser- bell shaped model gives the optimum results at the whole range of the excitation parameter under investigation.The negative values of the spiral distortion aberration coefficient appears

             It is the regression analysis is the foundation stone of knowledge of statistics , which mostly depends on the ordinary least square method , but as is well known that the way the above mentioned her several conditions to operate accurately and the results can be unreliable , add to that the lack of certain conditions make it impossible to complete the work and analysis method and among those conditions are the multi-co linearity problem , and we are in the process of detected that problem between the independent variables using farrar –glauber test , in addition to the requirement linearity data and the lack of the condition last has been resorting to the

The concept of Cech fuzzy soft bi-closure space ( ˇ Cfs bi-csp) ( ˇ U, L1, L2, S) is initiated and studied by the authors in [6]. The notion of pairwise fuzzy soft separated sets in Cfs bi-csp is defined in this study, and various features of ˇ this notion are proved. Then, we introduce and investigate the concept of connectedness in both Cfs bi-csps and its ˇ associated fuzzy soft bitopological spaces utilizing the concept of pairwise fuzzy soft separated sets. Furthermore, the concept of pairwise feebly connected is introduced, and the relationship between pairwise connected and pairwise feebly connected is discussed. Finally, we provide various instances to further explain our findings.

Several attempts have been made to modify the quasi-Newton condition in order to obtain rapid convergence with complete properties (symmetric and positive definite) of the inverse of  Hessian matrix (second derivative of the objective function). There are many unconstrained optimization methods that do not generate positive definiteness of the inverse of Hessian matrix. One of those methods is the symmetric rank 1( H-version) update (SR1 update), where this update satisfies the quasi-Newton condition and the symmetric property of inverse of Hessian matrix, but does not preserve the positive definite property of the inverse of Hessian matrix where the initial inverse of Hessian matrix is positive definiteness. The positive definite prope

The biometric-based keys generation represents the utilization of the extracted features from the human anatomical (physiological) traits like a fingerprint, retina, etc. or behavioral traits like a signature. The retina biometric has inherent robustness, therefore, it is capable of generating random keys with a higher security level compared to the other biometric traits. In this paper, an effective system to generate secure, robust and unique random keys based on retina features has been proposed for cryptographic applications. The retina features are extracted by using the algorithm of glowworm swarm optimization (GSO) that provides promising results through the experiments using the standard retina databases. Additionally, in order t

Big data analysis has important applications in many areas such as sensor networks and connected healthcare. High volume and velocity of big data bring many challenges to data analysis. One possible solution is to summarize the data and provides a manageable data structure to hold a scalable summarization of data for efficient and effective analysis. This research extends our previous work on developing an effective technique to create, organize, access, and maintain summarization of big data and develops algorithms for Bayes classification and entropy discretization of large data sets using the multi-resolution data summarization structure. Bayes classification and data discretization play essential roles in many learning algorithms such a

Big data analysis is essential for modern applications in areas such as healthcare, assistive technology, intelligent transportation, environment and climate monitoring. Traditional algorithms in data mining and machine learning do not scale well with data size. Mining and learning from big data need time and memory efficient techniques, albeit the cost of possible loss in accuracy. We have developed a data aggregation structure to summarize data with large number of instances and data generated from multiple data sources. Data are aggregated at multiple resolutions and resolution provides a trade-off between efficiency and accuracy. The structure is built once, updated incrementally, and serves as a common data input for multiple mining an

The History of Multi Parties and its Effect on Political System in India