The virtual decomposition control (VDC) is an efficient tool suitable to deal with the full-dynamics-based control problem of complex robots. However, the regressor-based adaptive control used by VDC to control every subsystem and to estimate the unknown parameters demands specific knowledge about the system physics. Therefore, in this paper, we focus on reorganizing the equation of the VDC for a serial chain manipulator using the adaptive function approximation technique (FAT) without needing specific system physics. The dynamic matrices of the dynamic equation of every subsystem (e.g. link and joint) are approximated by orthogonal functions due to the minimum approximation errors produced. The control, the virtual stability of every subsystem and the stability of the entire robotic system are proved in this work. Then the computational complexity of the FAT is compared with the regressor-based approach. Despite the apparent advantage of the FAT in avoiding the regressor matrix, its computational complexity can result in difficulties in the implementation because of the representation of the dynamic matrices of the link subsystem by two large sparse matrices. In effect, the FAT-based adaptive VDC requires further work for improving the representation of the dynamic matrices of the target subsystem. Two case studies are simulated by Matlab/Simulink: a 2-R manipulator and a 6-DOF planar biped robot for verification purposes.
The research seeks to identify the comprehensive electronic banking system and the role of the auditor in light of the customer's application of electronic systems that depend on the Internet in providing its services, as a proposed audit program has been prepared in accordance with international auditing controls and standards based on the study of the customer's environment and the analysis of external and internal risks in the light of financial and non-financial indicators, the research reached a set of conclusions, most notably, increasing the dependence of banks on the comprehensive banking system for its ability to provide new and diverse banking services, The researcher suggested several recommendations, the most important of whi
... Show MoreThis paper deals with founding an estimation of best approximation of unbounded functions which satisfied weighted Lipschitz condition with respect to the convex polynomials by means of weighted moduli of smoothness of fractional order , ( , ) p f t . In addition we prove some properties of weighted moduli of smoothness of fractional order.
In this paper, a simple fast lossless image compression method is introduced for compressing medical images, it is based on integrates multiresolution coding along with polynomial approximation of linear based to decompose image signal followed by efficient coding. The test results indicate that the suggested method can lead to promising performance due to flexibility in overcoming the limitations or restrictions of the model order length and extra overhead information required compared to traditional predictive coding techniques.
This paper is concerned with introducing and studying the o-space by using out degree system (resp. i-space by using in degree system) which are the core concept in this paper. In addition, the m-lower approximations, the m-upper approximations and ospace and i-space. Furthermore, we introduce near supraopen (near supraclosed) d. g.'s. Finally, the supra-lower approximation, supraupper approximation, supra-accuracy are defined and some of its properties are investigated.
This paper presents results about the existence of best approximations via nonexpansive type maps defined on modular spaces.
In this paper we show that the function , () p fLI α ∈ ,0<p<1 where I=[-1,1] can be approximated by an algebraic polynomial with an error not exceeding , 1 ( , , ) kp ft n ϕ αω where
,
1 ( , , ) kp ft n ϕ αω is the Ditizian–Totik modules of smoothness of unbounded function in , () p LI
I n this paper ,we 'viii consider the density questions associC;lted with the single hidden layer feed forward model. We proved that a FFNN with one hidden layer can uniformly approximate any continuous function in C(k)(where k is a compact set in R11 ) to any required accuracy.
However, if the set of basis function is dense then the ANN's can has al most one hidden layer. But if the set of basis function non-dense, then we need more hidden layers. Also, we have shown that there exist localized functions and that there is no t
... Show MoreThe current study introduces a novel technique to handle electrochemical localized corrosion in certain limited regions rather than applying comprehensive cathodic protection (CP) treatment. An impressed current cathodic protection cell (ICCPC) was fabricated and firmly installed on the middle of a steel structure surface to deter localized corrosion in fixed or mobile steel structures. The designed ICCPC comprises three essential parts: an anode, a cathode, and an artificial electrolyte. The latter was developed to mimic the function of the natural electrolyte in CP. A proportional-integrated-derivative (PID) controller was designed to stabilize this potential below the ICCPC at a cathodic potential of −850 mV, which is crucial for prote
... Show MoreIn light of the developments and intense competition that the world has witnessed, the need to search for a sustainable and continuous competitive advantage for economic units has emerged, as the economic units must not lose sight of their interest in the activities they perform to achieve that advantage, and it can be said that the goal of the research is to identify the theoretical dimensions of the green value chain represented by: (Green research and development, green design, green manufacturing, green marketing, green services) and the dimensions of the sustainable competitive advantage represented by (quality, creativity, innovation, cost, response to the customer), as well as identifyi
... Show More