The Sliding Mode Control (SMC) has been among powerful control techniques increasingly. Much attention is paid to both theoretical and practical aspects of disciplines due to their distinctive characteristics such as insensitivity to bounded matched uncertainties, reduction of the order of sliding equations of motion, decoupling mechanical systems design. In the current study, two-link robot performance in the Classical SMC is enhanced via Adaptive Sliding Mode Controller (ASMC) despite uncertainty, external disturbance, and coulomb friction. The key idea is abstracted as follows: switching gains are depressed to the low allowable values, resulting in decreased chattering motion and control's efforts of the two-link robo

We present the concept of maps Γ- periodi2 on Γ -near-ring S. Our main goal is to research and explore the presence and mapping traits such as h Γ –hom anti-Γ –hom, Γ –α-derivations of Γ -periodi2 on Γ- near-rings.

This paper aims to study the asymptotic stability of the equilibrium points of the index 2 and index 3 Hesenberg differential algebraic equations. The problem reformulated to an equivalent explicit differential algebraic equations system, so the asymptotic stability is easily investigated. The singular points such as impasse points and singularity induced bifurcation points are identified in this kind of differential algebraic equations by using conclusion of the explicit differential algebraic equations.

This paper aims to study the asymptotic stability of the equilibrium points of the index 2 and index 3 Hesenberg differential algebraic equations. The problem reformulated to an equivalent explicit differential algebraic equations system, so the asymptotic stability is easily investigated. The singular points such as impasse points and singularity induced bifurcation points are identified in this kind of differential algebraic equations by using conclusion of the explicit differential algebraic equations.

In this paper we introduce a new type of functions called the generalized regular
continuous functions .These functions are weaker than regular continuous functions and
stronger than regular generalized continuous functions. Also, we study some
characterizations and basic properties of generalized regular continuous functions .Moreover
we study another types of generalized regular continuous functions and study the relation
among them

 We use the idea of Grill, this study generalized a new sort of linked space like –connected –hyperconnected and investigated its features, as well as the relationship between it and previously described notation. It also developed new sorts of functions, such as hyperconnected space, and identifying their relationship, by offering numerous instance and attributes that belong to this set. This set will serve as a starting point for further research into the sets many future possibilities. Also, we use some of the theorems and observations previously studied and relate them to the grill and the Alpha group, and benefit from them in order to obtain new results in this research. We applied the concept of Connected to them and obtained

In this paper, a procedure to establish the different performance measures in terms of crisp value is proposed for two classes of arrivals and multiple channel queueing models, where both arrival and service rate are fuzzy numbers. The main idea is to convert the arrival rates and service rates under fuzzy queues into crisp queues by using graded mean integration approach, which can be represented as median rule number. Hence, we apply the crisp values obtained to establish the performance measure of conventional multiple queueing models. This procedure has shown its effectiveness when incorporated with many types of membership functions in solving queuing problems. Two numerical illustrations are presented to determine the validity of the

     Structure of network, which is known as community detection in networks, has received a great attention in diverse topics, including social sciences, biological studies, politics, etc. There are a large number of studies and practical approaches that were designed to solve the problem of finding the structure of the network. The definition of complex network model based on clustering is a non-deterministic polynomial-time hardness (NP-hard) problem. There are no ideal techniques to define the clustering. Here, we present a statistical approach based on using the likelihood function of a Stochastic Block Model (SBM). The objective is to define the general model and select the best model with high quality. Therefor