With the development of high-speed network technologies, there has been a recent rise in the transfer of significant amounts of sensitive data across the Internet and other open channels. The data will be encrypted using the same key for both Triple Data Encryption Standard (TDES) and Advanced Encryption Standard (AES), with block cipher modes called cipher Block Chaining (CBC) and Electronic CodeBook (ECB). Block ciphers are often used for secure data storage in fixed hard drives, portable devices, and safe network data transport. Therefore, to assess the security of the encryption method, it is necessary to become familiar with and evaluate the algorithms of cryptographic systems. Block cipher users need to be sure that the ciphers the

Human posture estimation is a crucial topic in the computer vision field and has become a hotspot for research in many human behaviors related work. Human pose estimation can be understood as the human key point recognition and connection problem. The paper presents an optimized symmetric spatial transformation network designed to connect with single-person pose estimation network to propose high-quality human target frames from inaccurate human bounding boxes, and introduces parametric pose non-maximal suppression to eliminate redundant pose estimation, and applies an elimination rule to eliminate similar pose to obtain unique human pose estimation results. The exploratory outcomes demonstrate the way that the proposed technique can pre

Let  be a module over a commutative ring  with identity. Before studying the concept of the Strongly Pseudo Nearly Semi-2-Absorbing submodule, we need to mention the ideal  and the basics that you need to study the  concept of the Strongly Pseudo Nearly Semi-2-Absorbing submodule. Also, we introduce several characteristics of the Strongly Pseudo Nearly Semi-2-Absorbing submodule in classes of multiplication modules and other types of modules. We also had no luck because the ideal  is not a Strongly Pseudo Nearly Semi-2-Absorbing ideal. Also, it is noted that  is the Strongly Pseudo Nearly Semi-2-Absorbing ideal under several conditions, which is this faithful module, projective module, Z-regular module and content module and non-si

An R-module M is called rationally extending if each submodule of M is rational in a direct summand of M. In this paper we study this class of modules which is contained in the class of extending modules, Also we consider the class of strongly quasi-monoform modules, an R-module M is called strongly quasi-monoform if every nonzero proper submodule of M is quasi-invertible relative to some direct summand of M. Conditions are investigated to identify between these classes. Several properties are considered for such modules

Let  be a module over a commutative ring  with identity. In this paper we intoduce the concept of Strongly Pseudo Nearly Semi-2-Absorbing submodule, where a  proper submodule  of an -module  is said to be Strongly Pseudo Nearly Semi-2-Absorbing submodule of   if whenever , for implies that either  or , this concept is a generalization of 2_Absorbing submodule, semi 2-Absorbing submodule, and strong form of (Nearly–2–Absorbing, Pseudo_2_Absorbing, and Nearly Semi–2–Absorbing) submodules. Several properties characterizations, and examples concerning this new notion are given. We study the relation between Strongly Pseudo Nearly Semei-2-Absorbing submodule and (2_Absorbing, Nearly_2_Absorbing, Pseudo_2_Absorbing, and Nearly S

     A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C

This paper is devoted to the discussion the relationships of connectedness between some types of graphs (resp. digraph) and Gm-closure spaces by using graph closure operators.

F index is a connected graph, sum of the cubes of the vertex degrees. The forgotten topological index has been designed to be employed in the examination of drug molecular structures, which is extremely useful for pharmaceutical and medical experts in understanding the biological activities. Among all the topological indices, the forgotten index is based on degree connectivity on bonds. This paper characterized the forgotten index of union of graphs, join graphs, limits on trees and its complements, and accuracy is measured. Co-index values are analyzed for the various molecular structure of chemical compounds