Throughout this paper, a generic iteration algorithm for a finite family of total asymptotically quasi-nonexpansive maps in uniformly convex Banach space is suggested. As well as weak / strong convergence theorems of this algorithm to a common fixed point are established. Finally, illustrative numerical example by using Matlab is presented.

Abstract

In this work, diabetic glucose concentration level control under disturbing meal has been controlled using two set of advanced controllers. The first set is sliding mode controllers (classical and integral) and the second set is represented by optimal LQR controllers (classical and Min-, ax). Due to their characteristic features of disturbance rejection, both integral sliding mode controller and LQR Minmax controller are dedicated here for comparison. The Bergman minimal mathematical model was used to represent the dynamic behavior of a diabetic patient’s blood glucose concentration to the insulin injection. Simulations based on Matlab/Simulink, were performed to verify the performance of each controll

One of the most important methodologies in operations research (OR) is the linear programming problem (LPP). Many real-world problems can be turned into linear programming models (LPM), making this model an essential tool for today's financial, hotel, and industrial applications, among others. Fuzzy linear programming (FLP) issues are important in fuzzy modeling because they can express uncertainty in the real world. There are several ways to tackle fuzzy linear programming problems now available. An efficient method for FLP has been proposed in this research to find the best answer. This method is simple in structure and is based on crisp linear programming. To solve the fuzzy linear programming problem (FLPP), a new ranking function (R

 A mixture model is used to model data that come from more than one component. In recent years, it became an effective tool in drawing inferences about the complex data that we might come across in real life. Moreover, it can represent a tremendous confirmatory tool in classification observations based on similarities amongst them. In this paper, several mixture regression-based methods were conducted under the assumption that the data come from a finite number of components. A comparison of these methods has been made according to their results in estimating component parameters. Also, observation membership has been inferred and assessed for these methods. The results showed that the flexible mixture model outperformed the

 A mixture model is used to model data that come from more than one component. In recent years, it became an effective tool in drawing inferences about the complex data that we might come across in real life. Moreover, it can represent a tremendous confirmatory tool in classification observations based on similarities amongst them. In this paper, several mixture regression-based methods were conducted under the assumption that the data come from a finite number of components. A comparison of these methods has been made according to their results in estimating component parameters. Also, observation membership has been inferred and assessed for these methods. The results showed that the flexible mixture model outperformed the others

<p>In this paper, we prove there exists a coupled fixed point for a set- valued contraction mapping defined on X× X , where X is incomplete ordered G-metric. Also, we prove the existence of a unique fixed point for single valued mapping with respect to implicit condition defined on a complete G- metric.</p>

In this article, we propose a Bayesian Adaptive bridge regression for ordinal model. We developed a new hierarchical model for ordinal regression in the Bayesian adaptive bridge. We consider a fully Bayesian approach that yields a new algorithm with tractable full conditional posteriors. All of the results in real data and simulation application indicate that our method is effective and performs very good compared to other methods. We can also observe that the estimator parameters in our proposed method, compared with other methods, are very close to the true parameter values.

  In this paper, the concept of normalized duality mapping has introduced in real convex modular spaces. Then, some of its properties have shown which allow dealing with results related to the concept of uniformly smooth convex real modular spaces. For multivalued mappings defined on these spaces, the convergence of a two-step type iterative sequence to a fixed point is proved