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 work, there will be upgraded on the work of (Mahmood and Mahmood , 2018) by finding a general rule of the code for any text made from any number of words by using James e-Abacus Diagram in partition theory

In this paper we introduce two Algorithms, the first Algorithms when it is odd order and how we calculate magic square and rotation for it. The second Algorithms when it be even order and how to find magic square and rotation for it.

This paper deals with testing a numerical solution for the discrete classical optimal control problem governed by a linear hyperbolic boundary value problem with variable coefficients. When the discrete classical control is fixed, the proof of the existence and uniqueness theorem for the discrete solution of the discrete weak form is achieved. The existence theorem for the discrete classical optimal control and the necessary conditions for optimality of the problem are proved under suitable assumptions. The discrete classical optimal control problem (DCOCP) is solved by using the mixed Galerkin finite element method to find the solution of the discrete weak form (discrete state). Also, it is used to find the solution for the discrete adj

Los nombres propios nombran a un ser o a un objeto, distinguiéndolo de los demás seres de su misma clase, se escriben siempre con letra mayúscula a principio de palabra. Los lingüistas hacen mayor hincapié en las divergencias de referencia, entre nombres propios y nombres comunes. Así, suele decirse que el sustantivo propio no tiene como referente ningún concepto. El asunto de la traducción  de los nombres propios parecería una cuestión de gusto personal del traductor pero vemos también que en algunas épocas es más frecuente traducirlos, y en otras, por el contrario, se prefiere dejar esos nombres en su forma original, tal vez con algunas adaptaciones ortográficas. Parecería enton­ces cuestión de modas. Pero, eviden

       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