Cryptography is the process of transforming message to avoid an unauthorized access of data. One of the main problems and an important part in cryptography with secret key algorithms is key. For higher level of secure communication key plays an important role. For increasing the level of security in any communication, both parties must have a copy of the secret key which, unfortunately, is not that easy to achieve. Triple Data Encryption Standard algorithm is weak due to its weak key generation, so that key must be reconfigured to make this algorithm more secure, effective, and strong. Encryption key enhances the Triple Data Encryption Standard algorithm securities. This paper proposed a combination of two efficient encryption algorithms to satisfy the purpose of information security by adding a new level of security to Triple Data Encryption Standard algorithm using Nth Degree Truncated Polynomial Ring Unit algorithm. This aim achieved by adding two new key functions, the first one is Enckey(), and the second one is Deckey() for encryption and decryption key of Triple Data Encryption Standard to make this algorithm more stronger. The obtained results of this paper also have good resistance against brute-force attack which makes the system more effective by applying Nth Degree Truncated Polynomial Ring Unit algorithm to encrypt and decrypt key of Triple Data Encryption Standard. Also, these modifications enhance the degree of complexity, increase key search space, and make the ciphered message difficult to be cracked by the attacker.
(3)
(3)
Among a variety of approaches introduced in the literature to establish duality theory, Fenchel duality was of great importance in convex analysis and optimization. In this paper we establish some conditions to obtain classical strong Fenchel duality for evenly convex optimization problems defined in infinite dimensional spaces. The objective function of the primal problem is a family of (possible) infinite even convex functions. The strong duality conditions we present are based on the consideration of the epigraphs of the c-conjugate of the dual objective functions and the ε-c-subdifferential of the primal objective functions.
(1)
In this paper, we introduce weak and strong forms of ω-perfect mappings, namely the ï±-ω-perfect, weakly ï±-ω-perfect and stronglyï±-ω-perfect mappings. Also, we investigate the fundamental properties of these mappings. Finally, we focused on studying the relationship between weakly ï±-ω-perfect and stronglyï± -ω-perfect mappings.
(3)
(3)
In this paper, we provide some types of - -spaces, namely, - ( )- (respectively, - ( )- , - ( )- and - ( )-) spaces for minimal structure spaces which are denoted by ( -spaces). Some properties and examples are given.
The relationships between a number of types of - -spaces and the other existing types of weaker and stronger forms of -spaces are investigated. Finally, new types of open (respectively, closed) functions of -spaces are introduced and some of their properties are studied.
(3)
(2)
Let R be a semiprime ring with center Z(R) and U be a nonzero ideal of R. An additive mappings are called right centralizer if ( ) ( ) and ( ) ( ) holds for all . In the present paper, we introduce the concepts of generalized strong commutativity centralizers preserving and generalized strong cocommutativity preserving centralizers and we prove that R contains a nonzero central ideal if any one of the following conditions holds: (i) ( ) ( ), (ii) [ ( ) ( )] , (iii) [ ( ) ( )] [ ], (iv) ( ) ( ) , (v) ( ) ( ) , (vi) [ ( ) ( )] , (vii) ( ) ( ) ( ), (viii) ( ) ( ) for all .
Abstract
Hexapod robot is a flexible mechanical robot with six legs. It has the ability to walk over terrain. The hexapod robot look likes the insect so it has the same gaits. These gaits are tripod, wave and ripple gaits. Hexapod robot needs to stay statically stable at all the times during each gait in order not to fall with three or more legs continuously contacts with the ground. The safety static stability walking is called (the stability margin). In this paper, the forward and inverse kinematics are derived for each hexapod’s leg in order to simulate the hexapod robot model walking using MATLAB R2010a for all gaits and the geometry in order to derive the equations of the sub-constraint workspaces for each
... Show MoreNurse scheduling problem is one of combinatorial optimization problems and it is one of NP-Hard problems which is difficult to be solved as optimal solution. In this paper, we had created an proposed algorithm which it is hybrid simulated annealing algorithm to solve nurse scheduling problem, developed the simulated annealing algorithm and Genetic algorithm. We can note that the proposed algorithm (Hybrid simulated Annealing Algorithm(GS-h)) is the best method among other methods which it is used in this paper because it satisfied minimum average of the total cost and maximum number of Solved , Best and Optimal problems. So we can note that the ratios of the optimal solution are 77% for the proposed algorithm(GS-h), 28.75% for Si
... Show More
In this research, an adaptive Canny algorithm using fast Otsu multithresholding method is presented, in which fast Otsu multithresholding method is used to calculate the optimum maximum and minimum hysteresis values and used as automatic thresholding for the fourth stage of the Canny algorithm. The new adaptive Canny algorithm and the standard Canny algorithm (manual hysteresis value) was tested on standard image (Lena) and satellite image. The results approved the validity and accuracy of the new algorithm to find the images edges for personal and satellite images as pre-step for image segmentation.
(1)