Text based-image clustering (TBIC) is an insufficient approach for clustering related web images. It is a challenging task to abstract the visual features of images with the support of textual information in a database. In content-based image clustering (CBIC), image data are clustered on the foundation of specific features like texture, colors, boundaries, shapes. In this paper, an effective CBIC) technique is presented, which uses texture and statistical features of the images. The statistical features or moments of colors (mean, skewness, standard deviation, kurtosis, and variance) are extracted from the images. These features are collected in a one dimension array, and then genetic algorithm (GA) is applied for image clustering.

Let R be a commutative ring with identity 1 ¹ 0, and let M be a unitary left module over R. A submodule N of an R-module M is called essential, if whenever N ⋂ L = (0), then L = (0) for every submodule L of M. In this case, we write N ≤e M. An R-module M is called extending, if every submodule of M is an essential in a direct summand of M. A submodule N of an R-module M is called semi-essential (denoted by N ≤sem M), if N ∩ P ≠ (0) for each nonzero prime submodule P of M. The main purpose of this work is to determine and study two new concepts (up to our knowledge) which are St-closed submodules and semi-extending modules. St-closed submodules is contained properly in the class of closed submodules, where a submodule N of

      The definition of semi-preopen sets were first introduced by "Andrijevic" as were is defined by :Let (X ,  ) be a topological space, and let  A ⊆,    then A is called semi-preopen set if ⊆∘ .        In this paper, we study the properties of semi-preopen sets but by another  definition which is equivalent to the first definition and we also study the relationships among it and (open, α-open, preopen and semi-p-open )sets.

     In this paper, we study a new concept of fuzzy sub-module, called  fuzzy socle semi-prime sub-module that is a generalization the concept of semi-prime fuzzy sub-module and fuzzy of approximately semi-prime sub-module in the ordinary sense.  This leads us to introduce level property which studies the relation between the ordinary and fuzzy sense of approximately semi-prime sub-module. Also, some of its characteristics and notions such as the intersection, image and external direct sum of fuzzy socle semi-prime sub-modules are introduced. Furthermore, the relation between the fuzzy socle semi-prime sub-module and other types of fuzzy sub-module presented.

In this work the concept of semi-generalized regular topological space was introduced and studied via semi generalized open sets. Many properties and results was investigated and studied, also it was shown that the quotient space of semi-generalized regular topological space is not, in general semi-generalizedspace.

    The definition of semi-preopen sets were first introduced by "Andrijevic" as were is defined by :Let (X ,  ) be a topological space, and let  A ⊆,    then Ais called semi-preopen set if ⊆∘ .        In this paper, we study the properties of semi-preopen sets but by another  definition which is equivalent to the first definition and we also study the relationships among it and (open, α-open, preopen and semi-p-open )sets.

Dans la langue française, une forme d'auxiliarité, composée de deux éléments cohérents l'auxiliant et l'auxilié, fournit, en effet, à la phrase une diversité significative et structurale. L'auxiliarité, renvoie à l'unification de deux éléments grammaticaux afin de localiser l'énoncé sur l'axe du temps, d'aspect ou de mode. É. Benveniste définit l'auxiliarité en : « Il s'agit d'une forme linguistique unitaire qui se réalise, à travers des paradigmes entiers, en  deux éléments, dont chacun assume une partie des fonctions grammaticales, et qui sont à la fois liés et autonomes, distincts et complémentaires »[1]. Ces deux éléments d'auxiliarité possèden

The consensus algorithm is the core mechanism of blockchain and is used to ensure data consistency among blockchain nodes. The PBFT consensus algorithm is widely used in alliance chains because it is resistant to Byzantine errors. However, the present PBFT (Practical Byzantine Fault Tolerance) still has issues with master node selection that is random and complicated communication. The IBFT consensus technique, which is enhanced, is proposed in this study and is based on node trust value and BLS (Boneh-Lynn-Shacham) aggregate signature. In IBFT, multi-level indicators are used to calculate the trust value of each node, and some nodes are selected to take part in network consensus as a result of this calculation. The master node is chosen