The regressor-based adaptive control is useful for controlling robotic systems with uncertain parameters but with known structure of robot dynamics. Unmodeled dynamics could lead to instability problems unless modification of control law is used. In addition, exact calculation of regressor for robots with more than 6 degrees of freedom is hard to be calculated, and the task could be more complex for robots. Whereas the adaptive approximation control is a powerful tool for controlling robotic systems with unmodeled dynamics. The local (partitioned) approximation-based adaptive control includes representation of the uncertain matrices and vectors in the robot model as finite combinations of basis functions. Update laws for the weighting matrices are obtained by the Lyapunov-like design. Therefore, this work is focused function approximation-based control algorithms considering centralized and decentralized approaches. In this work, the following control algorithms are designed: (1) Adaptive hybrid regressor-approximation control. This work attempts to combine the features of both the regressor and the approximation techniques in adaptive control. The regressor technique is a powerful tool for adaptive control of the known structure of modeling while the approximation is useful for estimation of time-varying uncertainty. Therefore, this work proposes adaptive hybrid regressor and approximation control for robots in both free and constrained spaces. The control law consists of three terms: (i) regressor term for initial estimation of the known structure of the robot dynamics, e.g. inertia matrix, Coriolis and centripetal matrix and gravity vector, and (ii) approximation term for estimation of internal and external disturbances resulted from the inexact calculation of regressor matrix and unknown modeling of friction, etc, and (iii) robust term consists of switching sgn(.) function. The control law is designed based on updating the uncertain parameters and the weighting coefficients corresponding to regressor and approximation respectively with position/force tracking purposes. The proposed controller is stable in the sense of Lyapunov stability. (2) Decentralized adaptive partitioned approximation control. Partitioned approximation control is avoided in most decentralized control algorithms; however, it is essential to design feedforward control with improved tracking accuracy. As a result, this work is focused on decentralized adaptive partitioned approximation control for complex robotic systems using the orthogonal basis functions as strong approximators. In essence, the partitioned approximation technique is intrinsically decentralized with some modifications. The proposed decentralized control law consists of three terms: the partitioned approximation-based feedforward term that is necessary for precise tracking, the high gain-based feedback term, and the adaptive sliding gain-based term for compensation of modeling error. The passivity property is essential to prove the stability of local stability of the individual subsystem with guaranteed global stability. Simulation experiments on 2-link robot and 6-link biped robot are performed to prove the effectiveness of the proposed algorithms.
: The need for means of transmitting data in a confidential and secure manner has become one of the most important subjects in the world of communications. Therefore, the search began for what would achieve not only the confidentiality of information sent through means of communication, but also high speed of transmission and minimal energy consumption, Thus, the encryption technology using DNA was developed which fulfills all these requirements [1]. The system proposes to achieve high protection of data sent over the Internet by applying the following objectives: 1. The message is encrypted using one of the DNA methods with a key generated by the Diffie-Hellman Ephemeral algorithm, part of this key is secret and this makes the pro
... Show MoreThis paper proposes a new encryption method. It combines two cipher algorithms, i.e., DES and AES, to generate hybrid keys. This combination strengthens the proposed W-method by generating high randomized keys. Two points can represent the reliability of any encryption technique. Firstly, is the key generation; therefore, our approach merges 64 bits of DES with 64 bits of AES to produce 128 bits as a root key for all remaining keys that are 15. This complexity increases the level of the ciphering process. Moreover, it shifts the operation one bit only to the right. Secondly is the nature of the encryption process. It includes two keys and mixes one round of DES with one round of AES to reduce the performance time. The W-method deals with
... Show MoreBiomedical signal such as ECG is extremely important in the diagnosis of patients and is commonly recorded with a noise. Many different kinds of noise exist in biomedical environment such as Power Line Interference Noise (PLIN). Adaptive filtering is selected to contend with these defects, the adaptive filters can adjust the filter coefficient with the given filter order. The objectives of this paper are: first an application of the Least Mean Square (LMS) algorithm, Second is an application of the Recursive Least Square (RLS) algorithm to remove the PLIN. The LMS and RLS algorithms of the adaptive filter were proposed to adapt the filter order and the filter coefficients simultaneously, the performance of existing LMS
... Show MoreCryptography algorithms play a critical role in information technology against various attacks witnessed in the digital era. Many studies and algorithms are done to achieve security issues for information systems. The high complexity of computational operations characterizes the traditional cryptography algorithms. On the other hand, lightweight algorithms are the way to solve most of the security issues that encounter applying traditional cryptography in constrained devices. However, a symmetric cipher is widely applied for ensuring the security of data communication in constraint devices. In this study, we proposed a hybrid algorithm based on two cryptography algorithms PRESENT and Salsa20. Also, a 2D logistic map of a chaotic system is a
... Show More
In this work, the modified Lyapunov-Schmidt reduction is used to find a nonlinear Ritz approximation of Fredholm functional defined by the nonhomogeneous Camassa-Holm equation and Benjamin-Bona-Mahony. We introduced the modified Lyapunov-Schmidt reduction for nonhomogeneous problems when the dimension of the null space is equal to two. The nonlinear Ritz approximation for the nonhomogeneous Camassa-Holm equation has been found as a function of codimension twenty-four.
The great importance of training made it as an investment for the organization, and assert the Quality of performance which support it by prepare the employee to the Current and future Jobs . The Research problem a rounded about How to measure the impact of training based on (ISO 10015) and its effect on the Quality of performance , How to evaluation the results of training to attained the training goals . The Research aims to find out the effects of application of international standard guidelines (ISO 10015) to attained the quality of audit work achieved in the Federal Board of Supreme Audit. The Research sought to achieve a number of objectives cognitive and applied on the basis of four key assumptions, and other su
... Show MoreTexture synthesis using genetic algorithms is one way; proposed in the previous research, to synthesis texture in a fast and easy way. In genetic texture synthesis algorithms ,the chromosome consist of random blocks selected manually by the user .However ,this method of selection is highly dependent on the experience of user .Hence, wrong selection of blocks will greatly affect the synthesized texture result. In this paper a new method is suggested for selecting the blocks automatically without the participation of user .The results show that this method of selection eliminates some blending caused from the previous manual method of selection.
With the revolutionized expansion of the Internet, worldwide information increases the application of communication technology, and the rapid growth of significant data volume boosts the requirement to accomplish secure, robust, and confident techniques using various effective algorithms. Lots of algorithms and techniques are available for data security. This paper presents a cryptosystem that combines several Substitution Cipher Algorithms along with the Circular queue data structure. The two different substitution techniques are; Homophonic Substitution Cipher and Polyalphabetic Substitution Cipher in which they merged in a single circular queue with four different keys for each of them, which produces eight different outputs for
... Show MoreIn this paper, a new hybrid algorithm for linear programming model based on Aggregate production planning problems is proposed. The new hybrid algorithm of a simulated annealing (SA) and particle swarm optimization (PSO) algorithms. PSO algorithm employed for a good balance between exploration and exploitation in SA in order to be effective and efficient (speed and quality) for solving linear programming model. Finding results show that the proposed approach is achieving within a reasonable computational time comparing with PSO and SA algorithms.