2020 (vol. 30) - Number 4

*A.B. Malinowska, R. Kamocki, R. Almeida, T. Odzijewicz:*

On the existence of optimal consensus control for the fractional Cucker--Smale model

*R. Grymin, W. Bożejko, J. Pempera, M. Wodecki, Z. Chaczko:*

Algorithm for solving the Discrete-Continuous Inspection Problem

*T. Kaczorek, A. Ruszewski:*

Global stability of discrete-time nonlinear systems with descriptor standard and fractional positive linear parts and scalar feedbacks

*R. Arora, K. Gupta:*

Fuzzy goal programming technique for multi-objective indefinite quadratic bilevel programming problem

*P. Nowak, J. Czeczot, P. Grelewicz:*

Tuning rules for industrial use of the second-order Reduced Active Disturbance Rejection Controller

*M.I. Gomoyunov:*

Optimal control problems with a fixed terminal time in linear fractional-order systems

*Muhafzan, A. Nazra, L. Yulianti, Zulakmal, R. Revina:*

On LQ optimization problem subject to fractional order irregular singular systems

*M. Blizorukova, V. Maksimov:*

On one algorithm for reconstruction of an disturbance in a linear system of ordinary differential equations

ACS Abstract:

**2000 (Volume 10)**

Number 3/4

**On the asymptotic stability of nonlinear discrete systems**

M.Rachik, M.Lhous and A.Tridane(Facult? des Sciences Ben M'sik, Marocco) |

**keywords:** asymptotic stability, delayed systems, discrete time-varying systems, nonlinear discrete systems, state-space technique.

**Robust Possibilistic Clustering**

Jacek Łęski(Silesian University of Technology, Poland) |

*C*-Means (FCM) method is one of the most popular clustering methods based on minimization of a criterion function. However, one of the greatest disadvantage of this method is its sensitivity to presence of noise and outliers in data. The FCM applies the constraint that the memberships of each datum across groups sum to 1. Due to this constraint and L

_{2}norm as dissimilarity measure, the FCM has considerable trouble in noise environment. In possibilistic

*C*-means (PCM) the above constraint is not used. In this case membership values may be interpreted as degrees of possibility that the datum belongs to the groups. In possibilistic approach still L

_{2}norm is usually used and the second reason of sensitivity for outliers and noise remains. This paper introduces a new ε -insensitive Possibilistic

*C*-Means (εPCM) clustering algorithm. Performance of the new clustering algorithm is experimentally compared with the PCM method using simple two-dimensional synthetic data with outliers and real-world Iris database.

**keywords:** fuzzy clustering, possibilistic c-means, eps-insensitivity, robust methods.

**Two projection-type algorithms for pseudo-monotone variational inequalities**

Gui-Hua Lin, Zun-Quan Xia(Dalian University of Technology, China) |

**keywords:** variational inequality, pseudo-monotone function, projection-type algorithm, error bound.

**Identification and suboptimal control of heat exchanger using generalized back propagation through time**

Krzysztof Fujarewicz(Silesian University of Technology, Poland) |

**keywords:** identification, nonlinear systems, distributed-parameter systems, artificial neural network.

**Statistical and deterministic aspects of treatment decision making in patients with multivessel coronary artery disease**

Piotr Walichiewicz(Silesian School of Medicine, Poland) | Adam Mrózek and Grzegorz Drwal(Silesian University of Technology, Poland) |

**keywords:** decision making, rough sets, multivessel coronary artery disease.

**On the bounds on the solution of the algebraic Lyapunov and Riccati equations**

Adam Czornik and Aleksander Nawrat(Silesian University of Technology, Poland) |

**keywords:** Riccati equations, Lyapunov equations, eigenvalues bounds.

<< Back