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.

This study thoroughly investigates the potential of niobium oxide (Nb2O5) thin films as UV-A photodetectors. The films were precisely fabricated using dc reactive magnetron sputtering on Si(100) and quartz substrates, maintaining a consistent power output of 50W while varying substrate temperatures. The dominant presence of hexagonal crystal structure Nb2O5 in the films was confirmed. An increased particle diameter at 150°C substrate temperature and a reduced Nb content at higher substrate temperatures were revealed. A distinct band gap with high UV sensitivity at 350 nm was determined. Remarkably, films sputtered using 50W displayed the highest photosensitivity at 514.89%. These outstanding optoelectronic properties highlight Nb2O5 thin f

In this paper, we introduce and study new types of soft open sets and soft closed
sets in soft bitopological spaces (X,~ ,~ ,E) 1 2   , namely, (1,2)*-maximal soft open
sets, (1,2)*-maximal soft (1,2)*-pre-open sets, semi (1,2)*-maximal soft (1,2)*-preopen
sets, (1,2)*-maximal soft closed sets, (1,2)*-maximal soft (1,2)*-pre-closed
sets, (1,2)*-minimal soft open sets, (1,2)*-minimal soft (1,2)*-pre-open sets, (1,2)*-
minimal soft closed sets, (1,2)*-minimal soft (1,2)*-pre-closed sets, and semi (1,2)*-
minimal soft (1,2)*-pre-closed sets. Also, properties and the relation among these
concepts have been studied.

Multiplicative inverse in GF (2 m ) is a complex step in some important application such as Elliptic Curve Cryptography (ECC) and other applications. It operates by multiplying and squaring operation depending on the number of bits (m) in the field GF (2 m ). In this paper, a fast method is suggested to find inversion in GF (2 m ) using FPGA by reducing the number of multiplication operations in the Fermat's Theorem and transferring the squaring into a fast method to find exponentiation to (2 k ). In the proposed algorithm, the multiplicative inverse in GF(2 m ) is achieved by number of multiplications depending on log 2 (m) and each exponentiation is operates in a single clock cycle by generating a reduction matrix for high power of two ex

    In this paper, we introduce the concept of s.p-semisimple module. Let S be a semiradical property, we say that a module M is s.p - semisimple if for every submodule N of M, there exists a direct summand K of M such that K ≤ N and N / K has S. we prove that a module M is s.p - semisimple module if and only if for every submodule A of M, there exists a direct summand B of M such that A = B + C and C has S. Also, we prove that for a module M is s.p - semisimple if and only if for every submodule A of M, there exists an idempotent e ∊ End(M) such that e(M) ≤ A and (1- e)(A) has S. 

In thisipaper, we introduce the concepts of the modified tupledicoincidence points and the  mixed finiteimonotone property. Also the existenceiand uniquenessiof modified tupled coincidenceipoint is discusses without continuous condition for mappings having imixed finite monotoneiproperty in generalizedimetric spaces.

       The present article discusses innovative word-formation processes in Internet texts, the emergence of new derivative words, new affixes, word-formation models, and word-formation methods. Using several neologisms as an example, the article shows both the possibilities of Internet word-making process and the possibilities of studying a newly established work through Internet communication. The words selected for analysis can be attributed to the keywords of the current time. (In particular, the words included in the list of "Words of 2019") there are number of words formed by the suffix method, which is the traditional method of the Russian word formation. A negation of these words is usually made thro