—This paper studies the control motion of a single link flexible joint robot by using a hierarchical non-singular terminal sliding mode controller (HNTSMC). In comparison to the conventional sliding mode controller (CSMC), the proposed algorithm (NTSMC) not only can conserve characteristics of the convention CSMC, such as easy implementation, guaranteed stability and good robustness against system uncertainties and external disturbances, but also can ensure a faster convergence rate of the systems states to zero in a finite time and singularity free. The flexible joint robot (FJR) is a two degree of freedom (2DOF) nonlinear and underactuated system. The system here is modeled as a fourth order system by using Lagrangian method. Based on t

The necessary optimality conditions with Lagrange multipliers  are studied and derived for a new class that includes the system of Caputo–Katugampola fractional derivatives to the optimal control problems with considering the end time free. The formula for the integral by parts has been proven for the left Caputo–Katugampola fractional derivative that contributes to the finding and deriving the necessary optimality conditions. Also, three special cases are obtained, including the study of the necessary optimality conditions when both the final time  and the final state  are fixed. According to convexity assumptions prove that necessary optimality conditions are sufficient optimality conditions.

Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of

A novel technique Sumudu transform Adomian decomposition method (STADM), is employed to handle some kinds of nonlinear time-fractional equations. We demonstrate that this method finds the solution without discretization or restrictive assumptions. This method is efficient, simple to implement, and produces good results. The fractional derivative is described in the Caputo sense. The solutions are obtained using STADM, and the results show that the suggested technique is valid and applicable and provides a more refined convergent series solution. The MATLAB software carried out all the computations and graphics. Moreover, a graphical representation was made for the solution of some examples. For integer and fractional order problems, solutio

This paper deals with the Magnetohydrodynyamic (Mill)) flow for a viscoclastic fluid of the generalized Oldroyd-B model. The fractional calculus approach is used to establish the constitutive relationship of the non-Newtonian fluid model. Exact analytic solutions for the velocity and shear stress fields in terms of the Fox H-function are obtained by using discrete Laplace transform. The effect of different parameter that controlled the motion and shear stress equations are studied through plotting using the MATHEMATICA-8 software.

Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of cove

Various theories have been proposed since in last century to predict the first sighting of a new crescent moon. None of them uses the concept of machine and deep learning to process, interpret and simulate patterns hidden in databases. Many of these theories use interpolation and extrapolation techniques to identify sighting regions through such data. In this study, a pattern recognizer artificial neural network was trained to distinguish between visibility regions. Essential parameters of crescent moon sighting were collected from moon sight datasets and used to build an intelligent system of pattern recognition to predict the crescent sight conditions. The proposed ANN learned the datasets with an accuracy of more than 72% in comp