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 matri

The aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).

In this paper, we focused on the investigated and studied the cold fusion reaction rate for D-D using the theory of Bose-Einstein condensation and depending on the quantum mechanics consideration. The quantum theory was based on the concept of single conventional of deuterons in Nickel-metal due to Bose-Einstein condensation, it has supplied a consistent description and explained of the experimental data. The analysis theory model has capable of explaining the physical behaviour of deuteron induced nuclear reactions in Nickel metals upon the five-star matter, it's the most expected for a quantitative predicted of the physical theory. Based on the Bose-Einstein condensation theorem formulation, we calculation the cold fusion reaction rate fo

In this work,  the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt

Assume that G ≅ HN the Harada–Norton group. In this paper, effective investment for the graph ΓRI HN standard features to acquire meaningful algebraic results for the graph ΓRI HN and its corresponding group HN. For instance, marketing a modern methods to understand the way of create a precise small subgroups in G. Furthermore, performing a full investigation for getting particular ΓRI HN parameters.

In this work, a deep computational study has been conducted to assign several qualities for the graph ⁠. Furthermore, determine the amount of the dihedral subgroups in the Held simple group He through utilizing the attributes of gamma.

In this paper, the using of Non-Homogenous Poisson Processes, with one of the scientific and practical means in the Operations Research had been carried out, which is the Queuing Theory, as those operations are affected by time in their conduct by one function which has a cyclic behavior, called the (Sinusoidal Function). (M_t / M / S) The model was chosen, and it is Single Queue Length with multiple service Channels, and using the estimating scales (QL_s, HOL, HOL_r) was carried out in considering the delay occurring to the customer before his entrance to the service, with the comparison of the best of them in the cases of the overload.

Through the experiments

The purpose of this paper is to introduce and prove some coupled coincidence fixed point theorems for self mappings satisfying -contractive condition with rational expressions on complete partially ordered metric spaces involving altering distance functions with mixed monotone property of the mapping. Our results improve and unify a multitude of coupled fixed point theorems and generalize some recent results in partially ordered metric space. An example is given to show the validity of our main result.