In this research, a new application has been developed for games by using the generalization of the separation axioms in topology, in particular regular, Sg-regular and SSg- regular spaces. The games under study consist of two players and the victory of the second player depends on the strategy and choice of the first player. Many regularity, Sg, SSg regularity theorems have been proven using this type of game, and many results and illustrative examples have been presented

In recent years, social media has been increasing widely and obviously as a media for users expressing their emotions and feelings through thousands of posts and comments related to tourism companies. As a consequence, it became difficult for tourists to read all the comments to determine whether these opinions are positive or negative to assess the success of a tourism company. In this paper, a modest model is proposed to assess e-tourism companies using Iraqi dialect reviews collected from Facebook. The reviews are analyzed using text mining techniques for sentiment classification. The generated sentiment words are classified into positive, negative and neutral comments by utilizing Rough Set Theory, Naïve Bayes and K-Nearest Neighbor

In this paper we recall the definition of fuzzy length space on a fuzzy set after that we recall basic definitions and properties of fuzzy length. We define fuzzy bounded operator as an introduction to defined fuzzy length of an operator then we proved that the fuzzy length space FB ̃ ̃ consisting of all fuzzy bounded linear operators from a fuzzy length space ̃ into a fuzzy length space ̃ is fuzzy complete if ̃ is fuzzy complete. Also we proved that every finite dimensional fuzzy length space is fuzzy complete.

    The concepts of nonlinear mixed summable families and maps for the spaces that only non-void sets are developed. Several characterizations of the corresponding concepts are achieved and the proof for a general Pietsch Domination-type theorem is established. Furthermore, this work has presented plenty of composition and inclusion results between different classes of mappings in the abstract settings. Finally, a generalized notation of mixing maps and their characteristics are extended to a more general setting.

The calculations of the shell model, based on the large basis, were carried out for studying the nuclear ^29-34Mg structure. Binding energy, single neutron separation energy, neutron shell gap, two neutron separation energy, and reduced transition probability, are explained with the consideration of the contributions of the high-energy configurations beyond the model space of sd-shell. The wave functions for these nuclei are used from the model of the shell with the use of the USDA 2-body effective interaction. The OBDM elements are computed with the use of NuShellX@MSU shell model code that utilizes the formalism of proton-neutron.

        The elastic transverse electron scattering form factors have been studied for the ¹¹Li   nucleus using the Two- Frequency Shell Model (TFSM) approach. The single-particle wave functions of harmonic-oscillator (HO) potential are used with two different oscillator parameters b_core and b_halo. According to this model, the core nucleons of ⁹Li nucleus are assumed to move in the model space of spsdpf. The outer halo (2-neutron) in ¹¹Li is assumed to move in the pure 1p_1/2, 1d_5/2, 2s_1/2 orbit. The shell model calculations are carried ou

In this research، a comparison has been made between the robust estimators of (M) for the Cubic Smoothing Splines technique، to avoid the problem of abnormality in data or contamination of error، and the traditional estimation method of Cubic Smoothing Splines technique by using two criteria of differentiation which are (MADE، WASE) for different sample sizes and disparity levels to estimate the chronologically different coefficients functions for the balanced longitudinal data which are characterized by observations obtained through (n) from the independent subjects، each one of them is measured repeatedly by group of  specific time points (m)،since the frequent measurements within the subjects are almost connected an

Data compression offers an attractive approach to reducing communication costs using available bandwidth effectively. It makes sense to pursue research on developing algorithms that can most effectively use available network. It is also important to consider the security aspect of the data being transmitted is vulnerable to attacks. The basic aim of this work is to develop a module for combining the operation of compression and encryption on the same set of data to perform these two operations simultaneously. This is achieved through embedding encryption into compression algorithms since both cryptographic ciphers and entropy coders bear certain resemblance in the sense of secrecy. First in the secure compression module, the given text is p

Let be a ring. Given two positive integers and , an module is said to be -presented, if there is an exact sequence of -modules with is -generated. A submodule of a right -module is said to be -pure in , if for every -Presented left -module the canonical map is a monomorphism. An -module has the -pure intersection property if the intersection of any two -pure submodules is again -pure. In this paper we give some characterizations, theorems and properties of modules with the -pure intersection property.

Let be a ring. Given two positive integers and , an module is said to be -presented, if there is an exact sequence of -modules with is -generated. A submodule of a right -module is said to be -pure in , if for every -Presented left -module the canonical map is a monomorphism. An -module has the -pure intersection property if the intersection of any two -pure submodules is again -pure. In this paper we give some characterizations, theorems and properties of modules with the -pure intersection property.