When an electron moves from one atom or molecule to another, a charge-transfer complex is formed. The other objects must be able to accept these electrons, and one entity must have free electrons or a tendency to donate them. This resembles an internal oxidation-reduction reaction more. This research aims to shed light on charge transfer complexes formed by polyenes and carotenes, which act as electron-donating molecules due to their alternating double and single bonds. This allows them to create such complexes when interacting with organic molecules that lack electrons. These complexes exhibited distinctive optical and physicochemical properties, enabling them to be adapted for a wide range of applications. In addition, th

0

Let be a ring. Given two positive integers and , an module is said to be -presented, if there is an exact sequence of -modules with is -generated. A submodule of a right -module is said to be -pure in , if for every -Presented left -module the canonical map is a monomorphism. An -module has the -pure intersection property if the intersection of any two -pure submodules is again -pure. In this paper we give some characterizations, theorems and properties of modules with the -pure intersection property.

In this study, dynamic encryption techniques are explored as an image cipher method to generate S-boxes similar to AES S-boxes with the help of a private key belonging to the user and enable images to be encrypted or decrypted using S-boxes. This study consists of two stages: the dynamic generation of the S-box method and the encryption-decryption method. S-boxes should have a non-linear structure, and for this reason, K/DSA (Knutt Durstenfeld Shuffle Algorithm), which is one of the pseudo-random techniques, is used to generate S-boxes dynamically. The biggest advantage of this approach is the production of the inverted S-box with the S-box. Compared to the methods in the literature, the need to store the S-box is eliminated. Also, the fabr

Remote surveying of unknown bound geometries, such as the mapping of underground water supplies and tunnels, remains a challenging task. The obstacles and absorption in media make the long-distance telecommunication and localization process inefficient due to mobile sensors’ power limitations. This work develops a new short-range sequential localization approach to reduce the required amount of signal transmission power. The developed algorithm is based on a sequential localization process that can utilize a multitude of randomly distributed wireless sensors while only employing several anchors in the process. Time delay elliptic and frequency range techniques are employed in developing the proposed algebraic closed-form solution.

The Diffie-Hellman is a key exchange protocol to provide a way to transfer shared secret keys between two parties, although those parties might never have communicated together. This paper suggested a new way to transfer keys through public or non-secure channels depending on the sent video files over the channel and then extract keys. The proposed method of key generation depends on the video file content by using the entropy value of the video frames. The proposed system solves the weaknesses in the Diffie-Hellman key exchange algorithm, which is MIMA (Man-in-the-Middle attack) and DLA( Discrete logarithm attack). When the method used high definition videos with a vast amount of data, the keys generated with a large number up to 5

For a nonempty subset X of a group G and a positive integer m , the product of X , denoted by Xm ,is the set Xm = That is , Xm is the subset of G formed by considering all possible ordered products of m elements form X. In the symmetric group Sn, the class Cn (n odd positive integer) split into two conjugacy classes in An denoted Cn+ and Cn- . C+ and C- were used for these two parts of Cn. This work we prove that for some odd n ,the class C of 5- cycle in Sn has the property that = An n 7 and C+ has the property that each element of C+ is conjugate to its inverse, the square of each element of it is the element of C-, these results were used to prove that C+ C- = An exceptio

This paper proposes a new strategy to enhance the performance and accuracy of the Spiral dynamic algorithm (SDA) for use in solving real-world problems by hybridizing the SDA with the Bacterial Foraging optimization algorithm (BFA). The dynamic step size of SDA makes it a useful exploitation approach. However, it has limited exploration throughout the diversification phase, which results in getting trapped at local optima. The optimal initialization position for the SDA algorithm has been determined with the help of the chemotactic strategy of the BFA optimization algorithm, which has been utilized to improve the exploration approach of the SDA. The proposed Hybrid Adaptive Spiral Dynamic Bacterial Foraging (HASDBF)