Global stability of Clifford-valued Takagi-Sugeno fuzzy neural networks with time-varying delays and impulses

summary:In this study, we consider the Takagi-Sugeno (T-S) fuzzy model to examine the global asymptotic stability of Clifford-valued neural networks with time-varying delays and impulses. In order to achieve the global asymptotic stability criteria, we design a general network model that includes quaternion-, complex-, and real-valued networks as special cases. First, we decompose the $n$-dimensional Clifford-valued neural network into $2^mn$-dimensional real-valued counterparts in order to solve the noncommutativity of Clifford numbers multiplication. Then, we prove the new global asymptotic stability criteria by constructing an appropriate Lyapunov-Krasovskii functionals (LKFs) and employing Jensen's integral inequality together with the reciprocal convex combination method. All the results are proven using linear matrix inequalities (LMIs). Finally, a numerical example is provided to show the effectiveness of the achieved results

Protocol-Based Tobit Kalman Filter under Integral Measurements and Probabilistic Sensor Failures

This paper is concerned with the Tobit Kalman filtering problem for a class of discrete time-varying systems subject to censored observations, integral measurements and probabilistic sensor failures under the Round-Robin protocol (RRP). The censored observations are characterized by the Tobit observation model, the integral measurements are described as functions of system states over a certain time interval required for data acquisition, and the sensor failures are governed by a set of uncorrelated random variables. The RRP is employed to decide the transmission sequence of sensors in order to alleviate undesirable data collisions. By resorting to the augmentation technique and the orthogonality projection principle, a protocol-based Tobit Kalman filter (TKF) is developed with the coexistence of integral measurements and sensor failures that lead to a couple of augmentation-induced terms. Moreover, the performance of the proposed filter is analyzed through examining the statistical property of the error covariance of the state estimation. Further analysis shows the existence of self-propagating upper and lower bounds on the estimation error covariance. A case study on ballistic roll rate estimation is presented to illustrate the efficacy of the developed filter.10.13039/501100001809-National Natural Science Foundation of China (Grant Number: 61803074, 61703245, U2030205, 61903065, 61671109, U1830207 and U1830133); 10.13039/501100002858-China Postdoctoral Science Foundation (Grant Number: 2018T110702, 2018M643441, 2017M623005 and 2015M5825); Royal Society of the U.K.; Alexander von Humboldt Foundation of Germany

How accurate are the time delay estimates in gravitational lensing?

We present a novel approach to estimate the time delay between light curves of multiple images in a gravitationally lensed system, based on Kernel methods in the context of machine learning. We perform various experiments with artificially generated irregularly-sampled data sets to study the effect of the various levels of noise and the presence of gaps of various size in the monitoring data. We compare the performance of our method with various other popular methods of estimating the time delay and conclude, from experiments with artificial data, that our method is least vulnerable to missing data and irregular sampling, within reasonable bounds of Gaussian noise. Thereafter, we use our method to determine the time delays between the two images of quasar Q0957+561 from radio monitoring data at 4 cm and 6 cm, and conclude that if only the observations at epochs common to both wavelengths are used, the time delay gives consistent estimates, which can be combined to yield 408\pm 12 days. The full 6 cm dataset, which covers a longer monitoring period, yields a value which is 10% larger, but this can be attributed to differences in sampling and missing data.Comment: 14 pages, 12 figures; accepted for publication in Astronomy & Astrophysic

Design and analysis of three nonlinearly activated ZNN models for solving time-varying linear matrix inequalities in finite time

To obtain the superiority property of solving time-varying linear matrix inequalities (LMIs), three novel finite-time convergence zeroing neural network (FTCZNN) models are designed and analyzed in this paper. First, to make the Matlab toolbox calculation processing more conveniently, the matrix vectorization technique is used to transform matrix-valued FTCZNN models into vector-valued FTCZNN models. Then, considering the importance of nonlinear activation functions on the conventional zeroing neural network (ZNN), the sign-bi-power activation function (AF), the improved sign-bi-power AF and the tunable sign-bi-power AF are explored to establish the FTCZNN models. Theoretical analysis shows that the FTCZNN models not only can accelerate the convergence speed, but also can achieve finite-time convergence. Computer numerical results ulteriorly confirm the effectiveness and advantages of the FTCZNN models for finding the solution set of time-varying LMIs