A substantial portion of today’s multimedia data exists in the form of unstructured text. However, the unstructured nature of text poses a significant task in meeting users’ information requirements. Text classification (TC) has been extensively employed in text mining to facilitate multimedia data processing. However, accurately categorizing texts becomes challenging due to the increasing presence of non-informative features within the corpus. Several reviews on TC, encompassing various feature selection (FS) approaches to eliminate non-informative features, have been previously published. However, these reviews do not adequately cover the recently explored approaches to TC problem-solving utilizing FS, such as optimization techniques.

      In this study, we prove that let N be a fixed positive integer and R be a semiprime -ring with extended centroid . Suppose that additive maps  such that  is onto,  satisfy one of the following conditions  belong to Г-N- generalized strong commutativity preserving for short; (Γ-N-GSCP) on R   belong to Г-N-anti-generalized strong commutativity preserving for short; (Γ-N-AGSCP)  Then there exists an element  and  additive maps  such that  is of the form  and   when condition (i) is satisfied, and     when condition (ii) is satisfied   

      In many areas, such as simulation, numerical analysis, computer programming, decision-making, entertainment, and coding, a random number input is required. The pseudo-random number uses its seed value. In this paper, a hybrid method for pseudo number generation is proposed using Linear Feedback Shift Registers (LFSR) and Linear Congruential Generator (LCG). The hybrid method for generating keys is proposed by merging technologies. In each method, a new large in key-space group of numbers were generated separately. Also, a higher level of secrecy is gained such that the internal numbers generated from LFSR are combined with LCG (The adoption of roots in non-linear iteration loops). LCG and LFSR are linear structures and outputs

    The Mawat Ophiolite Complex located in north-eastern Iraq represents part of the Iraqi Zagros Suture Zone, located at the border between the Arabian-Iranian plates. It consists of peridotite, gabbro, subvolcanic sheeted dykes and volcanic pillow lava. The geochemical signatures of the gabbro show a significant variation in major elements concentration, low concentrations of TiO₂ (0.06-0.36 wt.%), Na₂O (0.44-0.98 wt.%), K₂O (0.024-0.48 wt.%), P₂O₅ (0.002-0.009 wt.%) and moderate variations in SiO₂ (46.13-53.77 wt.%) with wide ranges and high concentration of Al₂O₃ (13.87-22.18 wt.%), Fe₂O₃ (0.04-2.95 wt.%), FeO (2.68-8.76 w

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.

Homomorphic encryption became popular and powerful cryptographic primitive for various cloud computing applications. In the recent decades several developments has been made. Few schemes based on coding theory have been proposed but none of them support unlimited operations with security.   We propose a modified Reed-Muller Code based symmetric key fully homomorphic encryption to improve its security by using message expansion technique. Message expansion with prepended random fixed length string provides one-to-many mapping between message and codeword, thus one-to many mapping between plaintext and ciphertext. The proposed scheme supports both (MOD 2) additive and multiplication operations unlimitedly.   We make an effort to prove

The traditional shortest path problem is mainly concerned with identifying the associated paths in the transportation network that represent the shortest distance between the source and the destination in the transportation network by finding either cost or distance. As for the problem of research under study it is to find the shortest optimal path of multi-objective (cost, distance and time) at the same time has been clarified through the application of a proposed practical model of the problem of multi-objective shortest path to solve the problem of the most important 25 commercial US cities by travel in the car or plane. The proposed model was also solved using the lexicographic method through package program Win-QSB 2.0 for operation